Fun with Time Consensus position reached at a pre-meeting yesterday evening (So slides are rough:-) Scott, Dan (Brown), Kevin, Stephen, Will, Brenton,

Slides:



Advertisements
Similar presentations
1 Internet Protocol Version 6 (IPv6) What the caterpillar calls the end of the world, nature calls a butterfly. - Anonymous.
Advertisements

IP Version 6 Next generation IP Prof. P Venkataram ECE Dept. IISc.
1 Chapter 3 TCP and IP. Chapter 3 TCP and IP 2 Introduction Transmission Control Protocol (TCP) Transmission Control Protocol (TCP) User Datagram Protocol.
Chapter 20 Network Layer: Internet Protocol Stephen Kim 20.1.
Internet Control Message Protocol (ICMP)
1 TDC TDC 365 Network Interconnections Technologies Lecture #4 Notes Spring, 2009.
1 Link Layer & Network Layer Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
1 Internet Networking Spring 2005 Tutorial 2 IP Checksum, Fragmentation.
1 Internet Networking Spring 2004 Tutorial 2 IP Checksum, Fragmentation.
1 CCNA 2 v3.1 Module 8. 2 TCP/IP Suite Error and Control Messages CCNA 2 Module 8.
Internet Command Message Protocol (ICMP) CS-431 Dick Steflik.
1 LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging)
1Group 07 IPv6 2 1.ET/06/ ET/06/ ET/06/ EE/06/ EE/06/ EE/06/6473 Group 07 IPv6.
Internet Control Message Protocol (ICMP)
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
Dynamic Routing Protocols  Function(s) of Dynamic Routing Protocols: – Dynamically share information between routers (Discover remote networks). – Automatically.
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
1 CS 4396 Computer Networks Lab LAN Switching and Bridges.
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks Authors : Mingliang Jiang Jinyang Li Y.C. Tay Presented by: Hiren Shah.
Institut für Betriebssysteme und Rechnerverbund Technische Universität Braunschweig Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur.
IETF SFC: Service Chain Header draft-zhang-sfc-sch-01
RFC 3561 AODV Routing Protocol Mobile Ad Hoc Networking Working Group Charles E. Perkins INTERNET DRAFT Nokia Research Center 19 June 2002 Elizabeth M.
Rfc7180bis: Further TRILL Clarifications, Corrections, and Updates Donald Eastlake Mingui Zhang, Radia Perlman, Ayan Banerjee, Anoop Ghanwani, Sujay Gupta.
1 Internet Control Message Protocol (ICMP) Used to send error and control messages. It is a necessary part of the TCP/IP suite. It is above the IP module.
CS4550 Computer Networks II IP : internet protocol, part 2 : packet formats, routing, routing tables, ICMP read feit chapter 6.
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429 Introduction to Computer Networks Scaling Broadcast Ethernet Some slides used with.
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
West Virginia University Slide 1 Copyright © K.Goseva 2010 CS 736 Software Performance Engineering Comments on Homework #1  Please revise the solution.
CSC 600 Internetworking with TCP/IP Unit 5: IP, IP Routing, and ICMP (ch. 7, ch. 8, ch. 9, ch. 10) Dr. Cheer-Sun Yang Spring 2001.
1 © NOKIA FILENAMs.PPT/ DATE / NN Requirements for Firewall Configuration Protocol March 10 th, 2005 Gabor Bajko Franck Le Michael Paddon Trevor Plestid.
SIP PUBLISH Method Jonathan Rosenberg dynamicsoft.
1 OSPF WG meeting, IETF61 OSPF Wireless Design Team update November 8, 2004 Tom Henderson
6LoWPAN Ad Hoc On-Demand Distance Vector Routing Introduction Speaker: Wang Song-Ferng Advisor: Dr. Ho-Ting Wu Date: 2014/03/31.
SIP Events: Changes and Open Issues IETF 50 / SIP Working Group Adam Roach
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Doc.:IEEE /1503r1 November 2011 Short Beacon Slide 1 Authors:
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
1 LAN switching and Bridges Relates to Lab Outline Interconnection devices Bridges/LAN switches vs. Routers Bridges Learning Bridges Transparent.
Server2nve Kompella, Rekhter, Morin, Black IETF 85, NVO3 WG.
COMPUTER NETWORKS CS610 Lecture-30 Hammad Khalid Khan.
Doc.:IEEE /0129r1 January 2012 S.Abraham, Qualcomm Inc Short Beacon Slide 1 Authors:
Multiprotocol Label Switching
Internet Protocol Version 6 Specifications
FILS Reduced Neighbor Report
Dynamic Routing Protocols II OSPF
Residence Time Measurement draft-mirsky-mpls-residence-time-02
Generic Opportunistic Routing Framework
Updated SBSP draft-birrane-dtn-sbsp-01.txt Edward Birrane
Bundle Protocol Specification
COS 561: Advanced Computer Networks
Sanjay Wadhwa Juniper Networks
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks
Internet Control Message Protocol (ICMP)
ECE 544 Protocol Design Project 2016
Dynamic Routing Protocols II OSPF
Internet Control Message Protocol (ICMP)
IP : Internet Protocol Surasak Sanguanpong
Internetworking Outline Best Effort Service Model
A Unified Approach to IP Segment Routing
Intradomain Routing Outline Introduction to Routing
FILS Reduced Neighbor Report
1 Multi-Protocol Label Switching (MPLS). 2 MPLS Overview A forwarding scheme designed to speed up IP packet forwarding (RFC 3031) Idea: use a fixed length.
BGP Instability Jennifer Rexford
Segregated Data Services in
Consideration of IPv6 Encapsulation for Path Services draft-li-6man-ipv6-sfc-ifit-00 Zhenbin Li, Shuping Peng.
Dynamic Routing Protocols part3 B
An MPLS-Based Forwarding Plane for Service Function Chaining
Editors: Bala’zs Varga, Jouni Korhonen
TRILL Header Extension Improvements
IETF105 IS-IS V6/MT Deployment Considerations draft-chunduri-lsr-isis-mt-deployment-cons-02 Uma Chunduri [Futurewei] Jeff Tantsura [Apstra] Shraddha Hegde.
Presentation transcript:

Fun with Time Consensus position reached at a pre-meeting yesterday evening (So slides are rough:-) Scott, Dan (Brown), Kevin, Stephen, Will, Brenton, Calvin

Drafts A bunch of overlapping drafts draft-farrell-dtnrg-alt-time draft-ellard-dtnrg-reltime-htl draft-fall-dtnrg-schl Some interested folks met yesterday:...and reaced a consensus on how to go forward!

Consensus Outline New drafts: Hop count based on Kevin's draft (just done) Time - Mix of authors of current drafts (TBD) Time based on extension blocks... Consider/favour migrating those to, e.g. a new primary block format in a 5050bis if/when that happens (later) Note: subsequent slides on this are preliminary

Problem How do we enable time-based bundle expiration when not all nodes in the network have accurate (synchronized) clocks?

Solution Sketch (1 of 5) 1.Carry bundle AGE in an extension block, in addition to bundle creation time (as available) in the primary block. –Extension block I-D can be written and advanced to RFC- hood fairly quickly. –Favor migrating this field into the primary header when RFC 5050 is eventually updated/obsoleted.

Solution Sketch (2 of 5) At bundle creation time: Optionally, bundle age extension block is added. The block contains the bundle’s age in (say) msec. If source node has an accurate clock, bundle creation time is set and sequence number can roll over once per second. Otherwise:  Bundle creation time is zero (indicating creation time unknown).  Sequence number is incremented for each bundle and never rolls over.  If node understands bundle age extension block: Node notes current time to enable age update.

Solution Sketch (3 of 5)

Solution Sketch (4 of 5) When bundle is received: If bundle’s creation time is zero:  If bundle age extension block is present: If node understands bundle age extension block:  Node notes current time to enable age update.  If time in transit is provided, node adds that time to age.

Solution Sketch (5 of 5) While bundle is enqueued at node: If bundle’s creation time is zero:  If bundle age extension block is present: If node understands bundle age extension block:  Node deletes bundle if age (as incremented) exceeds TTL. Else (non-zero bundle creation time)  If node has an accurate clock: Node deletes bundle if current time (as incremented) less bundle creation time exceeds TTL.

After that... Issue raised: what about revising the bundle protocol (i.e. a 5050bis) When, who, where, why... And that caused us to think: Where should we try focus DTNRG effort for the next year or so  5050bis, routing, experiments...