TICTOC -Topology-Discovery and Clock-Discovery

Slides:



Advertisements
Similar presentations
IETF TICTOC Considerations about IEEE1588 version 2 for Telecom usage.
Advertisements

IEEE-1588 TM Profiles. [Page 1] Synchronization Categories Frequency synchronization (or syntonization) –Clocks are aligned in frequency Phase synchronization.
1588V2 Telecom Profile Framework
New Timing Distribution Mechanism TICTOC WG, IETF 71th Philadelphia, USA draft-ji-tictoc-new-timing-distribution-mechanism-00.txt Kuiwen Ji
HIERARCHY REFERENCING TIME SYNCHRONIZATION PROTOCOL Prepared by : Sunny Kr. Lohani, Roll – 16 Sem – 7, Dept. of Comp. Sc. & Engg.
Dynamic Routing Scalable Infrastructure Workshop, AfNOG2008.
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public 1 Version 4.0 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts – Chapter.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
1 An Overlay Scheme for Streaming Media Distribution Using Minimum Spanning Tree Properties Journal of Internet Technology Volume 5(2004) No.4 Reporter.
ROUTING PROTOCOL IGRP. REVIEW 4 Purpose of Router –determine best path to destination –pass the frames to the destination 4 Protocols –routed - used by.
Delivery, Forwarding, and Routing
1 Secure Zero Configuration in a Ubiquitous Computing Environment Shenglan Hu and Chris J. Mitchell Information Security Group Royal Holloway, University.
Draft-li-rtgwg-cc-igp-arch-00IETF 88 RTGWG1 An Architecture of Central Controlled Interior Gateway Protocol (IGP) draft-li-rtgwg-cc-igp-arch-00 Zhenbin.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
TICTOC -Topology-Discovery and Clock-Discovery TICTOC BOF IETF70 Stewart Bryant
Enhanced NTP IETF – TicToc BOF Greg Dowd – Jeremy Bennington –
Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.
1 © 2004, Cisco Systems, Inc. All rights reserved. CCNA 2 v3.1 Module 6 Routing and Routing Protocols.
Introduction to Dynamic Routing Protocol
TICTOC Problem Statement TICTOC BOF IETF68 Stewart Bryant Yaakov (J) Stein )
Technical Refresher Session 3. Overview Difference between communication between devices on a single logical network and communication between different.
10/8/2015CST Computer Networks1 IP Routing CST 415.
Precision Time Protocol (aka IEEE1588)
© 2007 Cisco Systems, Inc. All rights reserved.Cisco Public ITE PC v4.0 Chapter 1 1 Introduction to Dynamic Routing Protocol Routing Protocols and Concepts.
HELSINKI UNIVERSITY OF TECHNOLOGY Visa Holopainen 1/18.
Precise measurement of physical link delay 802.1as, IEEE 802 plenary Lu Huang
Instrument Control System Seminar, 20 th -24 th October 2014 Time Synchronisation via Ethernet An introduction to IEEE 1588 Andreas Jost.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
The Application of the Path Computation Element Architecture to the Determination of a Sequence of Domains in MPLS & GMPLS draft-king-pce-hierarchy-fwk-01.txt.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
Mobile IP THE 12 TH MEETING. Mobile IP  Incorporation of mobile users in the network.  Cellular system (e.g., GSM) started with mobility in mind. 
IEEE-1588 IEEE-1588 – Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems Defines a Precision Time Protocol.
Time Sync Network Limits: Status, Challenges
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Advanced Network Tap application for
PTP version 3 in FTI? Øyvind Holmeide/Markus Schmitz by 01/13/2016.
ROUTING.
Kapitel 19: Routing. Kapitel 21: Routing Protocols
Lec4: Introduction to Dynamic Routing Protocol
Introduction to Dynamic Routing Protocol
Working at a Small-to-Medium Business or ISP – Chapter 6
Authors: Jiang Xie, Ian F. Akyildiz
Confluent vs. Splittable Flows
Pertemuan 23 IP Routing Protocols
Architecture and Algorithms for an IEEE 802
Zhenbin Li, Kai Lu Huawei Technologies IETF 98, Chicago, USA
Network layer Jarkom Dasar – Week 6 Aisyatul Karima, 2012.
Constraint-Based Routing
PTPv1 and PTPv2 translation IN FTI Systems
Daniel King, Old Dog Consulting Adrian Farrel, Old Dog Consulting
A Study of Group-Tree Matching in Large Scale Group Communications
Network Layer Goals: Overview:
CIS, University of Delaware
How Packet Based Methods are addressed by Q13
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
NET323 D: Network Protocols
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Introduction to Dynamic Routing Protocol
Precision Time Protocol
Chapter 5: Dynamic Routing
CHAPTER 10.
ESS Mesh Deployment Usage Model
Introduction to Dynamic Routing Protocol
NET323 D: Network Protocols
After 3.2 Revised
Data and Computer Communications
EIGRP.
Network Architecture for Cyberspace
PTP SOLUTIONS: Using PTP as a backup to GPS
Working at a Small-to-Medium Business or ISP – Chapter 6
Presentation transcript:

TICTOC -Topology-Discovery and Clock-Discovery TICTOC BOF IETF70 Stewart Bryant (stbryant@cisco.com)

Agenda What problems do these discovery mechanisms solve? Why should they be specified in the IETF?

Time Transfer in a Packet Network To acquire time a client (slave) needs to receive time-stamped packets from a time server, AND it needs to know how old the packet is when it arrives. All systems assume that the path is symmetric, and therefore age is half the round trip time. Link delay is often (but not always) constant, but switch/router delay is load dependent. There are three approaches to switch/router delay: Find the lucky packets that experienced minimum delay. Boundary Clocks. Each switch/router becomes a client to its parent router closer to the time server and time server its child routers. Transparent Clocks. Measure the queuing time at each switch/router and either Correct the timestamp in packet or Report the delay to the client.

Network Topology Network topology is usually formed dynamically It is usually the set of paths with the lowest routing metric. The best metric path is usually chosen for highest bandwidth, but policy may be a factor. The best data path may not be the best path for time and frequency transfer.

Lucky Packet Path Best data path from master to slave is M-A-B-C-S At each router there is a probability that the timing pkt will be queued - O(phops) Best time path may be M-D-S Best timing path may not be available through the existing IGP Best data path may not be reciprocal. 1 A 2 1 B D 1 C 3 1 Slave

Boundary Clock Path Optimum data path is M-A-B-C-S Master Optimum data path is M-A-B-C-S Data path A to D is via B and C, but B does not support boundary clock IEEE1588 uses link local addressing/forwarding, application layer hellos, and application layer routing. Is this the best approach in the IETF environment? 1 A 10 1 B D 1 2 C 3 1 Slave Note that the cascading of the clock servos causes degradation of time quality. The extent is implementation dependent. This was why IEEE1588 introduced transparent clocks.

Transparent Clock Mechanisms t1 = t2-t1 R2 t3 t4 t2 = t4-t3 T T=T+ t1 T=T+ t1 + t2 One Step Transparent Clock T T T R1 t1 t2 t1 = t2-t1 R2 t3 t4 t2 = t4-t3 t0 t0+ t1 t0+ t1 + t2 T’ = T + t0+ t1 + t2 Two Step Transparent Clock

Transparent Clock Path Master Optimum data path is M-A-B-C-S Data path A to D is via B and C, but B does not support transparent clock Sync packet is an ordinary packet, and so cannot be forced using application layer routing. 1 TC A 10 1 B D TC 1 2 TC C 3 1 Slave

Diverse Path Master If the path to the master is lost the slave needs to go into holdover. Precision of clock and duration of holdover have a direct effect on the cost of the slave. Delivering clock over diverse paths can lead to a reduction in slave cost. Diverse path can also be used to good effect in lucky packet clock algorithms, because the probability of delay is statistically reduced. 1 A 3 1 B D 1 C 3 1 Slave

Topology - conclusion The quality of time transfer is improved if the network topology is optimized for the application. The optimum time transfer topology may not be congruent with the optimum data topology. Topology is controlled by routing, thus routing support is needed to optimize time transfer. The IETF is the design authority for routing protocols. Therefore to design the highest quality time transfer protocol for IP networks the IETF has to engage with the problem. The proposal is NOT for TICTOC to design a new routing protocol. The proposal is for TICTOC to produce a time distribution architecture, to identify the time support routing requirements, and then to work with the existing routing groups to define the required protocol extensions.

Clock Discovery As time usage becomes more ubiquitous more nodes need to be accurately synchronized to high quality network clock. Clock needs to be of adequate quality, have the resources available to support the client and be accessible via a time suitable network path. When the clock fails the slave needs to find a new clock Initially clock-slave pairing will be statically configured. As the number of slaves increases and the demands on time quality/availability increase static configuration does not scale.

Network Environment Service Provider and enterprise network environments are different Routing protocols are different (e.g. BGP in SP networks, but less likely in Enterprise networks) SP networks have sophisticated provisioning systems

Clock Discovery Protocol Given the symbiosis between routing and clock distribution a clock discovery protocol based on routing seems likely. Extension of an IGP seems most likely to be applicable to SP and Enterprise environments BGP is the “traditional” method used for discovery in SP networks.

Clock Discovery - Conclusion It is likely that as high quality time distribution becomes an important element of the network infrastructure a discovery mechanism will be needed. Given that a slave needs both a suitable clock and a suitable path, there is some symbiosis with routing. This is an area that can only be effectively addressed in the IETF.

Questions?