1. Field of the Invention
The present invention generally relates to telecommunications networks and more particularly to methods and associated apparatus for transporting network management information between network elements.
2. Description of the Related Art
Network elements (also known as nodes) in a telecommunications network exchange network management information with one another using a common protocol. Common Management Information Service Element (CMISE) and Common Management Information Protocol (CMIP), for example, are known protocols for transporting and processing network management information in Synchronous Optical Network (SONET) and SONET-derived networks such as Synchronous Digital Hierarchy (SDH). CMISE and CMIP are based on Open System Interconnection (OSI) standards. Various manufacturers of SONET equipment have also implemented proprietary network management protocols.
The use of network elements utilizing different network management protocols in the same network can lead to interoperability problems. Network management information exchanged between two network elements that use incompatible protocols can be misinterpreted, yielding unpredictable results. One way of solving the interoperability problem is to use a dedicated gateway or translation device between incompatible network elements. Using a gateway, however, increases the cost and complexity of the network. Thus, a simple and cost-effective technique for transporting network management information between incompatible network elements is highly desirable.
The present invention relates to a method and associated apparatus for transporting network management information through incompatible network-elements (NEs) in a telecommunications network. In accordance with the invention, a first NE transports frames of information to a second NE, which is not compatible with the first NE. The second NE relocates the network management information contained in a first set of byte locations of the frames received from the first NE to a second set of byte locations of frames destined for a third NE, which is compatible with the second NE. The third NE then relocates the network management information contained in the second set of byte locations of the frames received from the second NE to a first set of byte locations of the frames destined for a fourth NE, which is compatible with the first NE. The second set of byte locations of frames from the second NE and third NE can be thought of as a virtual tunnel which allows network management information to be transparently transported from the first NE to the fourth NE. The tunnel can be setup using a single NE or multiple compatible NEs.
In one example, the frames transported between NEs are SONET frames; the first set and second set of byte locations are data communication channels in a SONET section overhead and a SONET line overhead, respectively.
The use of the same reference numeral in different figures indicates the same or similar element.
SONET networks, in general, are well known and are described in the American National Standards Institute (“ANSI”) documents ANSI T1.105, ANSI T1.105.01, ANSI T1.105.02, ANSI T1.105.03, ANSI T1.105.04, ANSI T1.105.05, ANSI T1.105.06, ANSI T1.105.07, ANSI T1.105.08, and ANSI T1.105.09, all of which are available from ANSI (Internet web site “www.ansi.org”); see also, W. J. Goralski, “SONET: A guide to Synchronous Optical Networks,” McGraw-Hill 1997. All of the aforementioned SONET documents are incorporated herein by reference in their entirety.
In
The byte locations composing section overhead 20 are in rows 1 to 3, columns 1 to 3 (i.e., bytes A1, A2, C1, B1, . . . D2, and D3) of SONET frame 10. Byte locations D1, D2, and D3 of section overhead 20, collectively denoted in
In the present invention, a virtual tunnel is created through compatible network elements to allow network management information from an incompatible network element to transparently pass through the tunnel.
An algorithm for the above described tunneling technique can be summarized as follows:
In one embodiment, the tunnel is configured manually by a human operator who, by inspection, knows the topology of the network and which network elements are not compatible. In provisioning communications lines (also known as “circuits”) in SONET network 200, for example, the operator can indicate in the provisioning software that:
The tunneling technique of the present invention can be used in a variety of network topologies.
Tunnel Between NE 240 and NE 241
Tunnel Between NE 241 and NE 242
Tunnel Between NE 242 and NE 243
Tunnel Between NE 243 and NE 240
In one example, SDCC 21, LDCC 31, LDCC 32, and LDCC 33 are mapped in logical BUS0 of SCL bus 370 as follows:
Mapping in Logical BUS0
TS16—Contains Byte D1 of SDCC 21
TS20—Contains Byte D2 of SDCC 21
TS24—Contains Byte D3 of SDCC 21
TS28—Contains Byte D4 of LDCC 31
TS32—Contains Byte D5 of LDCC 31
TS36—Contains Byte D6 of LDCC 31
TS40—Contains Byte D7 of LDCC 32
TS44—Contains Byte D8 of LDCC 32
TS48—Contains Byte D9 of LDCC 32
TS52—Contains Byte D10 of LDCC 33
TS56—Contains Byte D11 of LDCC 33
TS60—Contains Byte D12 of LDCC 33
Other time slots in logical buses BUS0, BUS1, BUS2, and BUS3 carry other types of information such as messages between cards (e.g., card status), alarms, and other bytes of a SONET frame.
Referring back to
In one example, CtlVec RAM 341 is implemented using a 16K×16 RAM. The addresses of CtlVec RAM 341 contain vectors for selecting a specific port, logical bus, and time slot written on any of the input buffers. A vector points to the input buffer address which contains a selected time slot of a logical bus of a particular port. Table 1 shows the contents of CtlVec RAM 341 in one example.
In Table 1, port 0 refers to a port in port cards 320 whose SCL bus is connected to terminal TDM IN 380A (similarly, port 1 refers to a port in port cards 320 whose SCL bus is connected to terminal TDM IN 381A etc.). The format of the 16-bit contents of CtlVec RAM 341 in one example is shown in Table 2.
As shown in Table 2, when bit 14 of CtlVec RAM 341 is a “0,” bits 13-8, 7-6, and 5-0 indicate the selected port, selected logical bus, and selected time slot, respectively, to be read out of an input buffer. When bit 14 is a “1,” the bits of CtlVec RAM 341 do not represent a vector for reading a time slot from an input buffer. Rather, bits 7-6 contain a transmit data byte which will be inserted into a next outgoing time slot. Thus, besides the capability to cross-connect time slots, TDMXConn 340 can also insert a programmed byte into an outgoing time slot. Bit 15 of CtlVec RAM 341 is not used in this particular example.
CtlVec RAM 341 and counter 354 (cntl6354) form a microprogrammed algorithmic state machine. Cntl6354 sequences the reading of vectors from CtlVec RAM 341 and provides control information for writing a time slot on any of the input buffers. Vectors from CtlVec RAM 341 and control information from cntl6354 are presented at the input buffers through an address multiplexer 352 (A-MUX 352). A vector presented at an input buffer is also used, at the same time, to select an input on D-MUX 343 such that the time slot read from the input buffer is sent to the appropriate outgoing time slot. Note that because the time slots are time division multiplexed on a synchronous bus, the contents of an incoming time slot can be relocated to an outgoing time slot by using the vectors from CtlVec RAM 341 to read the incoming time slot out of an input buffer and through D-MUX 343 at the appropriate time. For example, the contents of an incoming time slot TS16 of logical bus 0 of the port connected to terminal TDM IN 380A can be relocated to an outgoing time slot TS28 of logical BUS0 of the port connected to terminal TDM OUT 381C by reading the incoming time slot TS16 out of input buffer 342A at the time outgoing time slot TS28 is next available for output on terminal TDM OUT 381C.
Vectors are conventionally downloaded to CtlVec RAM 341 after a provisioning change to reflect the cross-connections of the time slots. For example, the vectors can be downloaded after the user has provisioned to relocate the SDCCs 21 of a port connected to terminal TDM IN 380A to LDCCs 31 of another port connected to terminal TDM OUT 381C to create a tunnel. Of course, the vectors can also be changed and downloaded to CtlVec RAM 341 to reflect SONET protection switching.
While the invention is described using SDCC 21 and LDCC 31 as an example, the invention is not so limited and may use other byte locations in a SONET frame. Further, the invention is not limited to SONET networks as any telecommunications network may benefit from the disclosed tunneling technique. The invention is set forth in the following claims.
This application is a divisional of U.S. patent application Ser. No. 09/727,905 entitled “Method and Apparatus For Transporting Network Management Information In A Telecommunications Network,” filed Nov. 30, 2000, now U.S. Pat. No. 7,573,915, which claims priority on U.S. Provisional Patent Application No. 60/199,591, “METHOD AND APPARATUS FOR TRANSPORTING NETWORK MANAGEMENT INFORMATION IN A TELECOMMUNICATIONS NETWORK”, filed on Apr. 25, 2000, by Chip Roberson, Paul Elliot, and Phu Le. This application is related to the following commonly-assigned U.S. patent applications: U.S. patent application Ser. No. 09/478,287, “AUTOMATIC PROPAGATION OF CIRCUIT INFORMATION IN A COMMUNICATION NETWORK,” filed on Jan. 5, 2000; U.S. patent application Ser. No. 09/343,122, “GENERATION OF DATA USED FOR NETWORK OPERATION,” filed on Jun. 29, 1999; and U.S. patent application Ser. No. 09/274,078, “FLEXIBLE CROSS-CONNECT WITH DATA PLANE,” filed on Mar. 22, 1999. All of the aforementioned patent applications are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4644532 | George et al. | Feb 1987 | A |
4660141 | Ceccon et al. | Apr 1987 | A |
4747100 | Roach et al. | May 1988 | A |
4858232 | Diaz et al. | Aug 1989 | A |
4920529 | Sasaki et al. | Apr 1990 | A |
4965790 | Nishino et al. | Oct 1990 | A |
5042062 | Lee et al. | Aug 1991 | A |
5093824 | Coan et al. | Mar 1992 | A |
5167035 | Mann et al. | Nov 1992 | A |
5235599 | Nishimura et al. | Aug 1993 | A |
5278824 | Kremer | Jan 1994 | A |
5341364 | Marra et al. | Aug 1994 | A |
5369653 | Kuroda | Nov 1994 | A |
5390164 | Kremer | Feb 1995 | A |
5406401 | Kremer | Apr 1995 | A |
5408618 | Aho et al. | Apr 1995 | A |
5412652 | Lu | May 1995 | A |
5432789 | Armstrong et al. | Jul 1995 | A |
5442620 | Kremer | Aug 1995 | A |
5493689 | Waclawsky et al. | Feb 1996 | A |
5495484 | Self et al. | Feb 1996 | A |
5583991 | Chatwani et al. | Dec 1996 | A |
5586267 | Chatwani et al. | Dec 1996 | A |
5606664 | Brown et al. | Feb 1997 | A |
5621721 | Vatuone | Apr 1997 | A |
5664107 | Chatwani et al. | Sep 1997 | A |
5715396 | Chatwani et al. | Feb 1998 | A |
5732071 | Saito et al. | Mar 1998 | A |
5742760 | Picazo et al. | Apr 1998 | A |
5781547 | Wilson | Jul 1998 | A |
5796736 | Suzuki | Aug 1998 | A |
5805568 | Shinbashi | Sep 1998 | A |
5812779 | Ciscon et al. | Sep 1998 | A |
5835696 | Hess | Nov 1998 | A |
5898686 | Virgile | Apr 1999 | A |
5928328 | Komori et al. | Jul 1999 | A |
5940376 | Yanacek et al. | Aug 1999 | A |
5949755 | Uphadya et al. | Sep 1999 | A |
5963943 | Cummins et al. | Oct 1999 | A |
5968130 | Okanoue et al. | Oct 1999 | A |
5987026 | Holland | Nov 1999 | A |
5999536 | Kawafuji et al. | Dec 1999 | A |
6009075 | Roberts et al. | Dec 1999 | A |
6026086 | Lancelot et al. | Feb 2000 | A |
6094687 | Drake et al. | Jul 2000 | A |
6122250 | Taniguchi | Sep 2000 | A |
6130887 | Dutta | Oct 2000 | A |
6260062 | Davis et al. | Jul 2001 | B1 |
6285192 | Bley et al. | Sep 2001 | B1 |
6301254 | Chan et al. | Oct 2001 | B1 |
6347336 | Song et al. | Feb 2002 | B1 |
6349096 | Liu et al. | Feb 2002 | B1 |
6366556 | Ballintine et al. | Apr 2002 | B1 |
6385179 | Malcolm et al. | May 2002 | B1 |
6389036 | Stewart et al. | May 2002 | B1 |
6389119 | McBride | May 2002 | B1 |
6393472 | Anerousis et al. | May 2002 | B1 |
6418476 | Luciani | Jul 2002 | B1 |
6434140 | Barany et al. | Aug 2002 | B1 |
6463040 | Dutta | Oct 2002 | B1 |
6535489 | Merchant et al. | Mar 2003 | B1 |
6535529 | Ichihashi | Mar 2003 | B1 |
6587470 | Elliot et al. | Jul 2003 | B1 |
6614785 | Huai et al. | Sep 2003 | B1 |
6631134 | Zadikian et al. | Oct 2003 | B1 |
6657969 | Neuendorff et al. | Dec 2003 | B1 |
6674771 | Taniguchi | Jan 2004 | B1 |
6731654 | Champion et al. | May 2004 | B1 |
6788681 | Hurren et al. | Sep 2004 | B1 |
6795917 | Ylonen | Sep 2004 | B1 |
6847644 | Jha | Jan 2005 | B1 |
6870813 | Raza et al. | Mar 2005 | B1 |
7292568 | Boily | Nov 2007 | B2 |
7304988 | Bansal | Dec 2007 | B2 |
7327752 | Mitra et al. | Feb 2008 | B1 |
7609729 | Elias | Oct 2009 | B2 |
7623445 | Daniel et al. | Nov 2009 | B1 |
20020004828 | Davis et al. | Jan 2002 | A1 |
20080285550 | Garbanati et al. | Nov 2008 | A1 |
Number | Date | Country | |
---|---|---|---|
20090154501 A1 | Jun 2009 | US |
Number | Date | Country | |
---|---|---|---|
60199591 | Apr 2000 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 09727905 | Nov 2000 | US |
Child | 12370455 | US |