New Timing Distribution Mechanism TICTOC WG, IETF 71th Philadelphia, USA draft-ji-tictoc-new-timing-distribution-mechanism-00.txt Kuiwen Ji

Slides:



Advertisements
Similar presentations
OSPF 1.
Advertisements

IEEE-1588 TM Profiles. [Page 1] Synchronization Categories Frequency synchronization (or syntonization) –Clocks are aligned in frequency Phase synchronization.
1588V2 Telecom Profile Framework
1 1588v2 modules of time synchronization with frequency layer support draft-su-tictoc-1588v2-time-sync-modules-00 IETF 75 th, Stockholm TICTOC WG
G : DCM Signaling Mechanism Using GMPLS RSVP-TE ITU-T Workshop on IP-Optical, Chitose, Japan 7/11/2002 Dimitrios Pendarakis, Tellium, Inc. ITU-T.
Network Protection and Restoration Session 5 - Optical/IP Network OAM & Protection and Restoration Presented by: Malcolm Betts Date:
Data Communications and Networking
Generalized Multiprotocol Label Switching: An Overview of Signaling Enhancements and Recovery Techniques IEEE Communications Magazine July 2001.
Computer Network Topologies
IP Fast Reroute Using Tunnel-AT draft-xu-ipfrr-tunnelat-00 Mingwei Xu, Lingtao Pan, Qing Li Tsinghua University, China 75 th IETF Meeting, Stockholm July.
HIERARCHY REFERENCING TIME SYNCHRONIZATION PROTOCOL Prepared by : Sunny Kr. Lohani, Roll – 16 Sem – 7, Dept. of Comp. Sc. & Engg.
Multi-homed network in EVPN draft-hao-evpn-mhn-00 July 20131MHN in EVPN Weiguo Hao(Huawei) Yizhou Li(Huawei) Pei Xu(Huawei)
Requirement and protocol for WSON and non-WSON interoperability CCAMP WG, IETF 81th, Quebec City, Canada draft-shimazaki-ccamp-wson-interoperability-00.
TX- 1 Faculty ALTTC, Ghaziabad Survivability Of SDH Network By: TX-I Faculty ALTTC, Ghaziabad.
Draft-chen-i2rs-mpls-ldp-usecases-00/ draft-huang-i2rs-mpls-te-usecase-00 IETF 88 I2RS1 Use Cases for an Interface to MPLS Protocol draft-chen-i2rs-mpls-ldp-usecases-00/
Channel Access Methods When several devices are connected to a single channel, there must be some rules to govern these devices as they access, transmit,
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
draft-kompella-mpls-rmr Kireeti Kompella IETF 91
MULTICASTING Network Security.
Introduction to Computer Networks 09/23 Presenter: Fatemah Panahi.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
COMPUTER NETWORKS.
TICTOC -Topology-Discovery and Clock-Discovery TICTOC BOF IETF70 Stewart Bryant
Network Topologies.
NTNU Protection switching TTM1: Optical transport and access networks By Steinar Bjørnstad 2014.
Multiple Links Failover Mechanism for RPR Interconnected Rings IEEE WG Orlando, Florida USA March 11~16, 2007.
Example STP runs on bridges and switches that are 802.1D-compliant. There are different flavors of STP, but 802.1D is the most popular and widely implemented.
1 Protection Mechanisms for Optical WDM Networks based on Wavelength Converter Multiplexing and Backup Path Relocation Techniques Sunil Gowda and Krishna.
SMUCSE 8344 Protection & Restoration of Optical Networks.
NETWORKS NEED HISTORY HARDWARE REQD. SOFTWARE REQD. TOPOLOGIES.
What is Bandwidth on Demand ? Bandwidth on Demand (BoD) is based on a technology that employs a new way of managing and controlling SONET-based equipment.
OSPF Topology-Transparent Zone Huaimo Chen, Renwei Li (Huawei) Gregory Cauchie (France Telecom) Ning So (Verizon)
Hierarchies Ethernet Switches Must be Arranged in a Hierarchy –Root is the top-level Ethernet Switch Root.
Chapter 17 SONET/SDH Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
SONET is used as a WAN. ANSI standard – SONET ITU-T standard – SDH Both are fundamentally similar and compatible.
1 Data Link Layer Lecture 23 Imran Ahmed University of Management & Technology.
CCAMP WG, IETF 76th, Hiroshima, Japan draft-zhang-ccamp-gmpls-g709-lmp-discovery-02.txt LMP extensions for G.709 Optical Transport Networks Fatai Zhang.
NETWORKS.
RSVP-TE Extensions to Notification for Shared Mesh Protection CCAMP WG, IETF 81th draft-he-ccamp-notification-shared-mesh-protection-00 Wenjuan He
CCNP 3: Chapter 3 Implementing Spanning Tree. Overview Basics of implementing STP Election of Root Bridge and Backup Enhancing STP RSTP MSTP EtherChannels.
(Slide set by Norvald Stol/Steinar Bjørnstad
1 Why Optical Layer Protection? Optical layer provides lightpath services to its client layers (e.g., SONET, IP, ATM) Protection mechanisms exist in the.
WEEK 11 – TOPOLOGIES, TCP/IP, SHARING & SECURITY IT1001- Personal Computer Hardware System & Operations.
Data Communications and Networks Chapter 1 - Classification of network topologies Data Communications and Network.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing Protocols.
Chapter 1 : Computer Networks.
Free Powerpoint Templates Page 1 Free Powerpoint Templates Network topology.
1 Protection in SONET Path layer protection scheme: operate on individual connections Line layer protection scheme: operate on the entire set of connections.
3 rd December 0770 th IETF Meeting ospf-lite draft-thomas-hunter-reed-ospf-lite-00.txt Matthew Ramon Thomas
82 nd Taipei Protection Mechanisms for LDP P2MP/MP2MP LSP draft-zhao-mpls-mldp-protections-00.txt Quintin Zhao, Emily Chen, Huawei.
Single Area OSPF Module 2, Review How routing information is maintained Link-state routers apply the Dijkstra shortest path first algorithm against.
Requirements for the Resilience of Control Plane in GMPLS (draft-kim-ccamp-cpr-reqts-00.txt) Young Hwa Kim CCAMP WG (59 th IETF) Apr.04,
TICTOC -Topology-Discovery and Clock-Discovery
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 8: Single-Area OSPF Routing & Switching.
Synchronisation of Network Parameters draft-bryant-rtgwg-param-sync-00
Computer Network Topologies
Prof.Veeraraghavan Prof.Karri Haobo Wang:
73rd IETF – Minneapolis, MN, November 2008
Distributed Control Plane
FAR: A Fault-avoidance Routing Method for Data Center Networks with Regular Topology Please send.
Precision Time Protocol
Network Survivability
Dynamic Routing and OSPF
Chapter 8: Single-Area OSPF
COS 561: Advanced Computer Networks
Optical Layer Protection Schemes
Types of topology. Bus topology Bus topology is a network type in which every computer and network device is connected to single cable. When it has exactly.
Eusebi Calle, Jose L Marzo, Anna Urra. L. Fabrega
Dynamic Routing Protocols part3 B
IPFRR WITH FAST NOTIFICATION
Presentation transcript:

New Timing Distribution Mechanism TICTOC WG, IETF 71th Philadelphia, USA draft-ji-tictoc-new-timing-distribution-mechanism-00.txt Kuiwen Ji

Background Route Technique using for timing distribution Agenda

Background Synchronization is typically distributed from one central office to another using the SONET/SDH signal for optical networks. Each node has two synchronization sources - a primary and secondary source. this provides a degree of protection for the synchronization network As a last line of defense, clock hold-over provides minimum service quality for a given time period.

Typical Master-Slave Synchronization Example

Todays Network Synchronization planning and distribution is administered manually base on SSM (G.781) usually. SONET/SDH networks are primarily implemented in linear and rings architectures. Now with the introduction of the network controlled by GMPLS and synchronous Ethernet, it is probable that the transport architecture will shift from linear/ring to mesh architecture. Mesh networks will provide more paths/combinations for synchronization distribution.

Using of SSM The SSM (G.781) has been used for a long time in Sync network. A synchronization coordinator usually determines how best to implement synchronization to each piece of equipment in the network and configure the priority of reference sources to each. We are careful to avoid timing-loops when planning there synchronization networks. Not every bi- directional link can be used even if they are available in the ring.

Limitation of SSM Source Source Source Source Source Source 2 : Nodes : Main timing tracing path : Backup timing tracing path # # : priority of reference sources A(×) B() C()

Another simple example Source Source : Nodes : Main timing tracing path : Backup timing tracing path # # : priority of reference sources Clock source 1 is assumed to be a higher priority clock than clock source 2 for this example. Probably we can plan the synchronization like this.

Multiple failures Source Source : Nodes : Main timing tracing path : Backup timing tracing path # # : priority of reference sources If the source 1 fails and a failure occurs between node 1 and 2, node 1 will go to holdover. Node 1 can get the synchronization from blue link but it cant use it now. We can change the priority of each node to make another configuration of course. But for preventing timing- loop we still cant use every link bi- direction even if it would be possible to use them. The point is that no one configuration is best for every type of possible failure condition. There is still limitation. X X Holdover

Normal mesh network How could the synchronization be setup? Whats the best configuration? We need to be very careful to avoid timing-loop. Thus, we have to give up many of the bi-directional links. : Nodes : Main timing tracing path : Backup timing tracing path Source 1 Source 3 Source 2

Background Route Technique using for timing distribution Agenda

Information distribution # : Node Source 1 Source With the GMPLS control plane, its possible to know the network topology and the state and condition of links. And the reference source attribution, like priority, quality can be distributed through route protocol OSPF. So all nodes know the network topology and which source output to be used and traced as the primary timing source.

Calculating the traceability paths : Node Source 1 Source : Timing tracing path # Each node calculates the timing tracing path to the master clock source based on the topology and the primary source. From the root of the primary reference, simple calculating algorithm like Dijkstra can be used to establish a shortest path tree. The synchronization distribution algorithm would be like a tree structure to prevent timing loop.

Building a timing tree : Node Source 1 Source : Timing tracing path # A ready message is sent when timing traceability path is setup and operational. Each node will not switch to a new synchronization source until it knows the new synchronization source is ready. After a node traces to a new timing source successfully, the node will send a message to the next to show it is ready. M M M

Building a timing tree : Node Source 1 Source : Timing tracing path # A ready message is sent when timing traceability path is setup and operational. Each node will not switch to a new synchronization source until it knows the new synchronization source is ready. After a node traces to a new timing source successfully, the node will send a message to the next to show it is ready. M M M

Building a timing tree : Node Source 1 Source : Timing tracing path # A ready message is sent when timing traceability path is setup and operational. Each node will not switch to a new synchronization source until it knows the new synchronization source is ready. After a node traces to a new timing source successfully, the node will send a message to the next to show it is ready. M M

Building a timing tree : Node Source 1 Source : Timing tracing path # A ready message is sent when timing traceability path is setup and operational. Each node will not switch to a new synchronization source until it knows the new synchronization source is ready. After a node traces to a new timing source successfully, the node will send a message to the next to show it is ready.

Failure occurs between nodes 3 and 7 disrupting the sync path : Node Source 1 Source : Timing tracing path X #

A second failure occurs between nodes 6 and 7 : Node Source 1 Source : Timing tracing path X # X

Source 1 Fails : Node Source 1 Source : Timing tracing path # X

SSM=PRC Interworking with existing networks BITS 1 : Node which doesnt use automatic techniques : Main timing tracing path : Node which use automatic techniques : Backup timing tracing path Source1 SSM=PRC PRC SSM=SSU PRC SSM=PRC PRC DNU PRC BITS 4 BITS 2 BITS PRC All blue nodes could be viewed as one node which use traditional SSM at the boundary to interwork with others.

Benefits Can be used in future network like Synchronous Ethernet, 1588 or any network with GMPLS. Provide survivability (sync traceability) for multiple failures. Possibly ease requirements on clock holdover mode by providing traceability in event of multiple failures (i.e., maintain service quality). Easy planning and maintenance. People dont need to do complex work in Synchronization scheme and configuration. More…

Next Step Timing distribution is very important for synchronization. Comments from the group are always appreciated Working with CCAMP with respect to the GMPLS extensions, which supports this feature.