The field of the invention relates to clock distribution. More specifically, it relates to clock distribution in a large service provider network.
Clock distribution helps nodes in the network latch on to the nearest available clock source. The clock source provides the nodes with clocking information. Nodes represent switching points, such as switches or routers, within a network. The clock information of individual nodes is propagated into the network through a network clock distribution protocol (NCDP). On receiving NCDP topology messages, each node computes the spanning tree to find the appropriate root for the clock source. The introduction of private network-node interface (PNNI) increases the number of nodes in the network exchanging clock information. When NCDP is run on all the nodes, the topology information to be processed on a single node is huge. The system also frequently exchanges topology clock information with other peer nodes causing performance degradation and clock degradation.
The NCDP is represented graphically by a NCDP spanning tree. One embodiment of a typical NCDP spanning tree is illustrated by the network of
A system and method are disclosed for dividing a network into clock partitions to limit the overhead created by transmitting clock sources. A clock partition can be implemented through several methods. A first method turns off the clock topology exchange on ports connected to the nodes outside the partition. A second method appends a four-byte partition identifier to network clock distribution protocol (NCDP) messages. A third method uses private network-network interface (PNNI) peer group identification to determine the clock partition group.
Other features and advantages of the present invention will be apparent from the accompanying drawings and from the detailed description that follows below.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicated similar elements and in which:
A system and method are disclosed for dividing a network into clock partitions to limit the overhead created by transmitting clock sources. A clock partition can be implemented through several methods. A first method turns off the clock topology exchange on ports connected to the nodes outside the partition. A second method appends a four-byte partition identifier to network clock distribution protocol (NCDP) messages. A third method uses private network-network interface (PNNI) peer group identification to determine the clock partition group.
In order to enable the system to run NCDP based dynamic clock distribution in large networks, the network participating in NCDP exchange is divided into subsets of nodes. These subsets of nodes are referred to as clock partition. One or more clock sources are available within a clock partition. The nodes within a clock partition do not exchange clock topology information with nodes outside the clock partition. The clock partition can be implemented using a number of methods.
A network divided into clock partitions is illustrated in
In one embodiment, each node within a clock partition is capable of receiving the clock information from a variety of sources, as illustrated in
Several methods exist for determining whether two nodes are part of the same clock partition or separate clock partitions, though other methods not described below are available as well. One method of implementing a clock partition is to administratively turn off clock topology exchanges on some of the ports in the network, creating the clock partition. A group of nodes within the clock partition will exchange NCDP clock information. The nodes outside the clock partition will not receive any NCDP clock information. This separation of clock partitions is illustrated in
A second method of implementing a clock partition is to add a partition identifier to the NCDP messages. In one embodiment the identifier is 4 bytes long. Each of the nodes will send NCDP configuration protocol data unit (PDU) messages to the peer nodes. The NCDP configuration PDU message contains a partition identifier. If the peer node has a partition identifier that matches the originating node's partition identifier, then the nodes exchange the NCDP topology information.
The second method of implementing a clock partition is illustrated by the flow chart of
A third method of implementing a clock partition is to use the PNNI peer group identification (PPGI), if the network uses the PNNI protocol. The peer group identification of the lowest level peer group will be used as the clock partition identifier.
The third method of implementing a clock partition is illustrated by the flow chart of
The method described above can be stored in the memory of a computer system as a set of instructions to be executed. The instructions to perform the method described above could alternatively be stored on other forms of machine-readable media, including magnetic and optical disks. For example, the method of the present invention could be stored on machine-readable media, such as magnetic disks or optical disks, which are accessible via a disk drive (or computer-readable medium drive). Further, the instructions can be downloaded into a computing device over a data network in a form of compiled and linked version.
Alternatively, the logic to perform the methods as discussed above, could be implemented by additional computer and/or machine readable media, such as discrete hardware components as large-scale integrated circuits (LSI's), application-specific integrated circuits (ASIC's), firmware such as electrically erasable programmable read-only memory (EEPROM's); and electrical, optical, acoustical and other forms of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
Although the present invention has been described with reference to specific exemplary embodiments, it will be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
The present application claims priority from and is a divisional application of U.S. patent application Ser. No. 10/059,555 filed Jan. 28, 2002 (issued as U.S. Pat. No. 6,957,358).
Number | Name | Date | Kind |
---|---|---|---|
3783254 | Eichelberger | Jan 1974 | A |
3908084 | Wiley | Sep 1975 | A |
4009343 | Markey et al. | Feb 1977 | A |
4009344 | Flemming et al. | Feb 1977 | A |
4009345 | Flemming et al. | Feb 1977 | A |
4009346 | Parker et al. | Feb 1977 | A |
4009347 | Flemming et al. | Feb 1977 | A |
4063291 | Gennetten | Dec 1977 | A |
4092895 | Zabel | Jun 1978 | A |
4663769 | Krinock | May 1987 | A |
4912555 | Van Gestel | Mar 1990 | A |
5151904 | Reiner et al. | Sep 1992 | A |
5163068 | El-Amawy | Nov 1992 | A |
5442475 | Bausman et al. | Aug 1995 | A |
5452239 | Dai et al. | Sep 1995 | A |
5473271 | Little et al. | Dec 1995 | A |
5475830 | Chen et al. | Dec 1995 | A |
5537498 | Bausman et al. | Jul 1996 | A |
5570045 | Erdal et al. | Oct 1996 | A |
5649167 | Chen et al. | Jul 1997 | A |
5684808 | Valind | Nov 1997 | A |
5686845 | Erdal et al. | Nov 1997 | A |
5719862 | Lee et al. | Feb 1998 | A |
5835751 | Chen et al. | Nov 1998 | A |
5873053 | Pricer et al. | Feb 1999 | A |
5963728 | Hathaway et al. | Oct 1999 | A |
6028837 | Miller | Feb 2000 | A |
6209106 | Kubata et al. | Mar 2001 | B1 |
6226755 | Reeves | May 2001 | B1 |
6240000 | Sywyk et al. | May 2001 | B1 |
6414959 | Asano | Jul 2002 | B1 |
6556936 | Gooding et al. | Apr 2003 | B2 |
6591370 | Lovett et al. | Jul 2003 | B1 |
6654917 | Floyd et al. | Nov 2003 | B1 |
6957358 | Sundaresan et al. | Oct 2005 | B1 |
7124071 | Rich et al. | Oct 2006 | B2 |
20030208736 | Teng et al. | Nov 2003 | A1 |
20040057411 | Straub et al. | Mar 2004 | A1 |
20040064799 | Reyes | Apr 2004 | A1 |
20040068599 | Blumrich et al. | Apr 2004 | A1 |
20040098241 | Guettaf | May 2004 | A1 |
20050229123 | Wang et al. | Oct 2005 | A1 |
Number | Date | Country | |
---|---|---|---|
Parent | 10059555 | Jan 2002 | US |
Child | 11221257 | US |