US6430150B1 - Communication node, restoration method and communication network - Google Patents
Communication node, restoration method and communication network Download PDFInfo
- Publication number
- US6430150B1 US6430150B1 US08/643,761 US64376196A US6430150B1 US 6430150 B1 US6430150 B1 US 6430150B1 US 64376196 A US64376196 A US 64376196A US 6430150 B1 US6430150 B1 US 6430150B1
- Authority
- US
- United States
- Prior art keywords
- failure
- node
- telecommunication
- information relating
- topology information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime, expires
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q3/00—Selecting arrangements
- H04Q3/0016—Arrangements providing connection between exchanges
- H04Q3/0062—Provisions for network management
- H04Q3/0075—Fault management techniques
- H04Q3/0079—Fault management techniques involving restoration of networks, e.g. disaster recovery, self-healing networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0663—Performing the actions predefined by failover planning, e.g. switching to standby network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/22—Arrangements for supervision, monitoring or testing
- H04M3/2254—Arrangements for supervision, monitoring or testing in networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/08—Indicating faults in circuits or apparatus
- H04M3/10—Providing fault- or trouble-signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/08—Indicating faults in circuits or apparatus
- H04M3/12—Marking faulty circuits "busy"; Enabling equipment to disengage itself from faulty circuits ; Using redundant circuits; Response of a circuit, apparatus or system to an error
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13141—Hunting for free outlet, circuit or channel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13167—Redundant apparatus
Definitions
- the present invention generally relates to networks using cross-connect units at telecommunication nodes, and more particularly to an automatic restoration method in a mesh network.
- a synchronous transfer mode (STM) network and an asynchronous transfer mode (ATM) network capable of transmitting audio and visual data at a high speed have been in use in recent years to provide various services.
- STM synchronous transfer mode
- ATM asynchronous transfer mode
- One example of such a network is a mesh network in which telecommunication nodes provided with cross-connect units and telecommunication links are arranged in a mesh configuration.
- Such a network should be configured so as to be capable of continuing to serve the user in the event of a failure. Continuation of services requires that a failure occurring in the network be automatically detected and telecommunication paths that enable bypassing of the failure be established.
- An automatic restoration method is an essential algorithm specifying a procedure for establishing the paths.
- the pre-planned restoration method There are generally two types of automatic restoration methods proposed for mesh networks: the pre-planned restoration method and the dynamic restoration method.
- the pre-planned restoration method a configuration map specifying alternate paths is stored at each cross-connect unit.
- each node is not provided with the above-described configuration map.
- nodes adjacent to the point of failure exchange restoration-related messages several times so as to find alternate paths.
- the above-described conventional technology has the following problems.
- the process executed by the central Operation Systems to distribute the information relating to alternate paths to the nodes may be complex and lengthy. Further, when an additional failure (i.e., a secondary failure) occurs during the computation for finding alternate paths or during the distribution of the information, an updating computation and a distribution of the updated information to the nodes are required. Hence, the process required for the restoration becomes complex. Further, since each node is required to store the information in a memory, restoration capabilities for various failure scenarios are limited.
- restoration messages are exchanged between the nodes to search for alternate paths. Hence, a prompt restoration cannot be hoped for in comparison with the pre-planned restoration method.
- an object of the present invention is to provide a telecommunication node, a restoration method and a telecommunication network, wherein the aforementioned problems are eliminated.
- Another and more specific object of the present invention is to provide a telecommunication node, a restoration method and a telecommunication network, wherein a prompt restoration is possible using a simple process.
- a restoration method in a telecommunication network in which each node is provided with physical topology information relating to a physical construction of telecommunication paths included in the telecommunication network and logical topology information relating to routing of telecommunication paths, said restoration method comprising the steps of:
- step (c) switching services to the alternate paths determined in step (b).
- a telecommunication node provided with physical topology information relating to a physical construction of telecommunication paths included in the telecommunication network and logical topology information relating to routing of telecommunication paths, said telecommunication node comprising:
- second means determining alternate paths for bypassing the failure using said information relating to the failure, said physical topology information, and said logical topology information;
- third means switching services to the alternate paths determined by said second means.
- a telecommunication network including telecommunication nodes each provided with physical topology information relating to a physical construction of telecommunication paths included in the telecommunication network and logical topology information relating to routing of telecommunication paths, wherein each node comprises:
- second means determining alternate paths for bypassing the failure using said information relating to the failure, said physical topology information, and said logical topology information;
- third means switching services to the alternate paths determined by said second means.
- the telecommunication node and the telecommunication network of the present invention restoration from failure is attained by using topology tables relating to the entirety of the network. Only information (message) relating to a failure needs to be exchanged for restoration. Therefore, the present invention realizes a high-speed restoration from failure with smaller volume of messages exchanged as compared with the conventional dynamic restoration method.
- reception of information relating to a failure is properly controlled so that cross-connection in a node is prevented from being executed in a transient state in which latest information relating to a failure has not arrived yet. Accordingly, it is possible to restore from failure using the latest topology information.
- topology information is automatically updated so that the nodes in a network are provided with latest topology information relating to the entirety of the network which information is necessary for cross-connecting process executed in the event of a failure.
- restoration from failure can take place only by switching from a failed path to an alternate virtual path.
- a high-speed restoration is realized.
- alternate path selection most suitable for a failure type is employed so that a high-speed restoration is realized.
- FIG. 1A shows a telecommunication network and associated physical topology information
- FIG. 1B shows logical paths set and logical topology information in the telecommunication network shown in FIG. 1A;
- FIG. 2A shows a telecommunication network having three nodes A, B and C;
- FIG. 2B is a timing chart for the restoration algorithm of the present invention.
- FIG. 3A is a timing chart explaining a guard time introduced in the restoration method of the present invention.
- FIG. 3B is a timing chart explaining a guard time introduced in the restoration method of the present invention.
- FIG. 4A shows a part of a process of updating topology information
- FIG. 4B shows another part of the process of updating topology information
- FIG. 5A shows a line restoration method and a node restoration method
- FIG. 5B shows a 2-hop restoration method
- FIG. 6 is a block diagram showing the construction of a telecommunication node according to an embodiment of the present invention.
- FIG. 7 is a flowchart (1) showing the operation of the telecommunication node shown in FIG. 6;
- FIG. 8 is a flowchart (2) showing the operation of the telecommunication node shown in FIG. 6;
- FIG. 9 is a block diagram showing the construction of a node in an ATM network, according to the present invention.
- the basic algorithm for the restoration process is as follows.
- Each node in the network retains physical topology information relating to the physical construction of the telecommunication links included in the network and logical topology information relating to routing of paths formed in the links.
- the node adjacent to the location of the failure broadcasts a message to the other nodes in the network to indicate where the failure has occurred.
- each node uses the received message, each node performs computation for finding alternate paths so as to restore the telecommunication path for itself. By switching to the alternate paths determined as a result of the computation, a high-speed restoration based on a simple procedure is attained.
- the aforementioned basic algorithm for the restoration process is composed of a broadcast phase, a computation phase and a cross-connection phase.
- FIG. 1A shows a telecommunication network and associated physical topology information.
- the telecommunication network shown has three nodes 1 - 3 and three telecommunication links L 1 , L 2 and L 3 connecting the nodes.
- the physical topology information indicates the physical construction of the links L 1 -L 3 , that is, the number of working (W) channels and the number of spare (S) channels formed on the links.
- L 1 ( 6 , 5 ) indicates that link 1 (L 1 ) contains six working channels and five spare channels.
- Each of the nodes 1 - 3 keeps a table (physical topology table) as shown storing the physical topology information.
- Each of the nodes always keeps the physical topology information identical to each other.
- FIG. 1B shows logical paths set and logical topology information in the telecommunication network shown in FIG. 1 A.
- the logical topology information is routing information for the paths formed between the nodes.
- the logical topology information may indicate a path formed between the node 1 and the node 2 via the node 3 .
- the logical topology information also indicate the number of channels (capacity) to be restored in the path.
- Each of the nodes keeps a table (logical topology table) as shown storing the logical topology information.
- nodes adjacent to the location of the failure detect the failure.
- a node in the downstream of a failed location may receive an L-AIS (line-alarm indication signal) or an LOF (loss of frame) signal.
- L-AIS line-alarm indication signal
- LOF loss of frame
- a node in the upstream of the failed location may receive a FERF (far end receive failure) signal so as to recognize that a failure has occurred.
- the node that detected the failure prepares an alarm message and broadcasts the same in order to notify all the nodes in the network of the failure.
- the node that receives the alarm message executes computation (topology computation) for finding alternate paths using the topology information common to the nodes and stored in the physical topology table and the logical topology table. Consistent computation results (alternate paths) are obtained at each node, because common topology information of the network and a common computation algorithm for finding alternate paths are available and used in each mode.
- a known algorithm such as Dijkstra's algorithm may be used in the computation.
- a node which has completed the topology computation starts the cross-connection depending on the result of topology computation so that services are switched from the failed path to the alternate path. Some nodes might not require cross-connection depending on the result of topology computation.
- Dynamic restoration protocols generally execute the cross-connection process synchronously in the final phase of the restoration. However, in the algorithm of the present invention, each node is able to asynchronously execute the cross-connection process. When cross-connection is completed by all nodes in the network, telecommunication along the restored path becomes possible.
- FIG. 2A shows a telecommunication network provided with three nodes A, B and C
- FIG. 2B is a timing chart applicable to the restoration executed according to the above described scheme composed of three phases.
- a failure has occurred on the link between node A and node C.
- Node A and node C at the respective ends of the failed link detect the failure and enter a failure processing mode.
- Nodes A and C broadcast an alarm message for notifying the other nodes that a failure has occurred. The process executed so far concerns the broadcast phase.
- Nodes A and C enter the computation phase after broadcasting the alarm message.
- Node B receives the alarm message broadcast from node A and node C. After recording the content of the message, node B broadcasts the alarm message. Thereupon, node B enters the computation phase.
- the topology computation is performed using the common topology information stored in the physical topology table and the logical topology table kept in each node. Consistent computation results (alternate paths) are obtained at each node, because common topology information of the network and a common computation algorithm for finding alternate paths are available and used in each mode.
- each node enters the cross-connection phase.
- Nodes A-C switch services to the alternate path asynchronously according to the result obtained. Illustration of the alternate path thus determined is omitted in FIG. 2 .
- each node enters the computation phase after receiving the broadcast alarm message. Once the computation result is obtained, each node immediately enters the cross-connection phase.
- a node may receive a plurality of broadcast alarm messages in the event of a failure. If the plurality of alarm messages received relate to the same failure, no problem is created because the computation results obtained in accordance with the alarm messages are identical to each other. In the example shown in FIG. 2A, nodes A and C generate alarm messages which produce the same result in the topology computation.
- the plurality of alarm messages received successively by a node have different contents. In this case, the computation result obtained in accordance with the first alarm message received does not reflect the secondary failure, for example, that is, does not indicate the most up-to-date alternate path.
- the old computation process that has been executed in the node to find the alternate path is initialized. Thereupon, the computation for finding the alternate path is restarted using the old alarm message that the node received. In this way, it is possible to search for the most up-to-date alternate path.
- FIGS. 3A and 3B are timing charts showing the above-described process.
- a node enters the computation phase after receiving an alarm message # 1 . Even if the computation is completed, the node does not execute a cross-connection until a guard time for the alarm message # 1 expires.
- a node enters the computation phase after receiving the alarm message # 1 , whereupon a guard time # 1 is started. If another alarm message # 2 is received in the process of computation, the computation is discontinued. A new computation allowing for the alarm message # 2 is started. A new guard time # 2 is started at the beginning of the new computation. When the guard time # 2 expires, the node enters the cross-connection phase.
- the physical topology table and the logical topology table maintained by the nodes must have the common content. It is also necessary for the tables to reflect a secondary failure promptly.
- the physical topology is updated when the system is changed or a failure has occurred. This means that the physical topology is updated relatively infrequently. In contrast, the frequency that the logical topology is updated is higher than that of the physical topology. For instance, the logical topology must be updated whenever the path establishments are changed as requested by customers.
- Each node executes the process for updating the physical topology and the logical topology autonomously.
- the physical topology table and the logical topology table relating to the network maintained in each node are communicated from a node to all the other nodes in the network either periodically or at random intervals. In this way, the nodes can update the respective topology tables autonomously even when the OS issues an instruction that forces a change in the path establishments.
- FIGS. 4A and 4B show the process for updating the logical topology.
- the original working path goes from node A to node C through node B.
- the OS sends control messages to corresponding nodes A-D to notify them of the change.
- network nodes communicate with each other as shown in FIG. 4B.
- a similar process occurs in updating the physical topology table. The OS is not participating in the updating process.
- the information passed in the network amounts to an extraordinary volume. Accordingly, only the checksum (for example, the CRC checksum) of the physical topology table and the logical topology is transmitted instead of the whole table. Thereupon, nodes A-D make comparisons of the checksum transmitted. If the checksums are different from those received by other nodes, the node will then have to communicate with other nodes so that the same topology tables are maintained in the nodes.
- the checksum for example, the CRC checksum
- the topology computation is executed in the computation phase using a known algorithm adopted to search for the shortest path.
- Each node executes the computation using the physical topology table, the logical topology table and the alarm message received, according to the same algorithm.
- each node executes topology computation adapted for different typical failure scenarios such as those involving a single link failure and a single node failure, before an actual failure occurs, using the physical topology table and the logical topology table maintained in each node.
- This computation is done autonomously and the result thereof is stored in a predetermined part of the node. In this way, it is possible to restore services in the event of a typical failure without executing the computation. It is advisable to provide a guard time in this case, too. However, the guard time in this case may be shorter than when the pre-computation is not carried out.
- Three types of alternate path selection may be employed: the line restoration method; the path restoration method; and the 2-hop restoration method. It is preferable that a restoration method most suitable for the condition of the failure be selected.
- FIG. 5A shows the line restoration method and the path restoration method
- FIG. 5B shows the 2-hop restoration method
- a failure occurs between nodes 5 and 6
- the same failure as above is processed according to the path restoration such that an alternate path connecting nodes 1 , 2 , 3 and 4 is set in place of the path on the failed link, that is, the path connecting nodes 1 , 6 , and 4
- a failure indicated by X and occurring in node 3 is processed by the 2-hop restoration method such that an alternate path is set between nodes 2 and 4 adjacent to node 3 .
- the line restoration method provides a faster restoration from a link failure than the path restoration.
- the line restoration cannot handle node failures.
- the path restoration method can handle node failures, it takes longer to restore with the path restoration method than with the line restoration method.
- the 2-hop restoration method is a high-speed restoration method that includes features of these restoration methods and can handle node failures.
- the 2-hop restoration method cannot handle a plurality of successive failures.
- One of the above-described restoration schemes is used depending on the type of failure that has occurred.
- FIG. 6 shows a node having the construction that realizes the restoration schemes described above.
- the node shown is connected to an STM or ATM network for transporting audio and image data, and to a maintenance message transmission line 34 for transmitting control messages and alarm messages from the OS.
- the node shown in FIG. 6 comprises an alarm message detecting part 10 , a failure type determining part 12 , an alternate path computing part 14 , an alternate path cross-connecting part 16 , a cross-connection confirming part 18 , a topology updating message detecting part 20 , a physical topology maintaining part 22 , a logical topology maintaining part 24 and a restoration preparing part 26 .
- the restoration preparing part 26 includes an alternate path automatic computing part 28 and an alternate path storing part 30 and/or an alternate virtual path (VP) setting part 32 .
- the alarm message detecting part 10 detects an alarm message transmitted via the maintenance message transmission line 34 and passes the same to the failure type determining part 12 .
- the failure type determining part 12 determines the location and type of the failure by referring to the information included in the alarm message, the physical topology information and the logical topology information. For example, the failure type determining part 12 determines whether or not the failure is a node failure or a link failure.
- a plurality of alarm messages are generated by nodes adjacent to the location of the failure. For example, in case of a link failure, two nodes generate the alarm message. In case of a node failure, as many as three nodes may generate the alarm message.
- the location and type of failure are determined. Of course, it is possible to obtain information relating to the failure from a single alarm message. The number of messages involved in the determination depends on the construction of the network.
- the alternate path computing part 14 computes topology information to find alternate paths by referring to the physical topology information and the logical topology information. The computation is done using an algorithm such as Dijkstra's algorithm.
- the alternate path cross-connecting part 16 issues an instruction for cross-connection to a cross-connect switch SW in the node so as to execute the actual cross-connection.
- the cross-connection confirming parts 18 in the nodes work in cooperation so as to confirm whether or not the alternate paths set can operate properly.
- the topology updating message detecting part 20 detects a control message from the OS and a topology updating message (for example, a message including a checksum) exchanged between nodes to update the topology information.
- the physical topology maintaining part 22 maintains the physical topology table as shown in FIG. 1A relating to the entirety of the network.
- the logical topology maintaining part 24 maintains the logical topology table as shown in FIG. 1B relating to the entirety of the network.
- the alternate path automatic computing part 28 of the restoration preparing part 26 pre-computes to find alternate paths adapted to typical failure scenarios involving a single link failure, a single node failure or the like, by referring to the physical topology table and the logical topology table.
- the alternate path automatic computing part 28 stores the computation result in an internal memory. There is no need to execute pre-computation adapted for all possible cases of single link failures and single node failures.
- the volume of pre-computation may depend on the storage capacity of the alternate path storing part 30 or the alternate
- the failure type identifying part 12 Upon detecting that the failure is a single node failure or a single link failure, the failure type identifying part 12 reads the computation result associated with the failure type from the alternate path storing part 30 or the alternate VP setting part 32 via the alternate path automatic computing part 28 . The failure type identifying part 12 outputs the read result to the alternate path cross-connecting part 16 .
- VPs with zero capacity can be preallocated as backups of working VPs on the basis of the result of the topology pre-computation.
- a failure is detected and an alarm message is received by nodes adjacent to the location of the failure, a high-speed service restoration is realized by switching from the working path to the preset alternate virtual path.
- the aforementioned alternate VP setting part 32 stores the topology pre-computation result relating to zero-capacity alternate virtual paths adapted for typical failures.
- the alternate path storing part 30 only stores the result of the topology pre-computation.
- the information relating to the alternate paths adapted for the failure type identified by the failure type identifying part 12 is read from the alternate path storing part 30 under the control of the alternate path automatic computing part 28 .
- the read result is output to the alternate path cross-connecting part 16 .
- the pre-computation is executed by the alternate path automatic computing part 28 immediately after a restoration from a failure or at regular intervals. Only when there is a difference from the old pre-computation result, the updated pre-computation result is reflected in the alternate path storing part 30 or the alternate VP setting part 32 .
- FIG. 7 is a flowchart of the process of restoration from a failure
- FIG. 8 is a flowchart of the process of restoration from a failure, wherein the topology pre-computation is executed.
- Two types of messages may be received: an alarm message for warning of a failure on a transmission path; and a topology updating message that does not directly relate to a failure in the network. The type of the message received is determined and its content is passed to an associated message process. In case an alarm message is received, the control is turned over to an alarm message process described later. In case a topology updating message is received, the control is turned over to a topology updating process described later.
- step (3) If a failure is detected or an alarm message is received from an adjacent node while step (3) is being executed, the alarm message that has been sent continues to be sent.
- the alarm message is sent to adjacent links other than the failed link and the link from which an alarm message is passed. No message that derives from the same factor is sent from a given node.
- step (4) the location of the failure is identified by referring to the alarm message received, and to the physical topology information and the logical topology information maintained in the node.
- the link failure nodes at the ends of the failed link send the alarm message.
- the location of failure is identified by receiving the alarm message from nodes adjacent to the failed node.
- a guard timer is started. During the guard time, an additional alarm that may be received during the topology computation is monitored. The time set is longer than the maximum time required for the topology computation so as to provide sufficient time for an alarm message indicating a failure to be transmitted throughout the network irrespective of the location of the failure in the network.
- step (6) topology computation is executed.
- the computation is executed based on the alarm message received, using an algorithm such as Dijkstra's algorithm or the like.
- the physical topology table and the logical topology table are used.
- step (7) a determination is made as to whether or not an additional alarm message is received during the computation. If an additional alarm message is received, the control is returned to the process for identifying the failure type. If no additional alarm message is received, the control is turned over to a step (8) for determining whether or not a guard time has expired.
- step (8) If it is found in step (8) that the guard time set in a guard timer has not expired, the control is returned to step (7). If the guard time has expired, the control is turned over to a step (9).
- step (9) a cross-connecting process for switching to alternate paths is executed in each node, in accordance with the result of the topology computation.
- step (10) a confirmation is made after the cross-connecting process as to whether or not the alternate paths are properly set.
- step (11) the topology updating message received from an adjacent node is passed to adjacent nodes.
- step (12) the physical topology table is updated on the basis of the content of the topology updating message received.
- step (13) the logical topology table is updated on the basis of the content of the topology updating message received.
- FIG. 8 A description will now be given, with reference to FIG. 8, of a process of restoration from a failure, wherein the topology pre-computation is executed.
- steps that are the same as the steps of FIG. 7 are designated by the same numerals.
- the alarm message process in FIG. 8 lacks he alternate path computation process of step (6) shown in FIG. 7 . That is, the determination of step (7) is made after the guard timer is started in step (5).
- the topology computation process shown in FIG. 7 is not necessary in the alarm message process of FIG. 8 since the topology pre-computation has been executed.
- steps (11)-(13) are the same as the corresponding steps shown in FIG. 7 .
- step (13) is executed, the topology computation is executed in step (18). That is, the computation of alternate paths adapted for typical failures such as those involving a path failure or a node failure is executed on the basis of the alarm message received, using an algorithm such as Dijkstra's algorithm. In this computation, the physical topology table and the logical topology table are used.
- step (14) the type of the path to be restored is identified.
- the control is then turned over to step (15).
- the control is turned over to step (16).
- step (15) the alternate path patterns are stored. That is, the patterns of path establishments that concern a given node are selected from the entire body of information obtained through the topology computation and stored in that node.
- step (16) the alternate VPI is set. It will be noted that the alternate VP has a zero capacity.
- step (17) the alternate VP set in step (16) is confirmed.
- FIG. 9 is a diagram showing the construction of an ATM node to which the construction shown in FIG. 6 is applied.
- the components 10 through 32 (except for the alternate path storing part 30 ) that concerns the STM network in the construction shown in FIG. 6 correspond to a CPU 40 shown in FIG. 9 .
- the maintenance message transmission line 34 shown in FIG. 6 corresponds to an internal local area network (LAN) 42 shown in FIG. 9 .
- the switch SW shown in FIG. 6 corresponds to a VP-switch 44 shown in FIG. 9 .
- the VP-switch 44 switch ATM cell according to VPI table 46 .
- the VPI table 46 is constructed in an assumption that the zero-capacity alternate virtual path is set by the alternate VP setting part 32 shown in FIG. 6 .
- MUX denotes a multiplexor
- DMUX demultiplexor
Abstract
Description
Claims (16)
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP02712696A JP3432664B2 (en) | 1996-02-14 | 1996-02-14 | Communication node, failure recovery method, and communication network |
JP8-027126 | 1996-02-14 |
Publications (1)
Publication Number | Publication Date |
---|---|
US6430150B1 true US6430150B1 (en) | 2002-08-06 |
Family
ID=12212376
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US08/643,761 Expired - Lifetime US6430150B1 (en) | 1996-02-14 | 1996-05-06 | Communication node, restoration method and communication network |
Country Status (2)
Country | Link |
---|---|
US (1) | US6430150B1 (en) |
JP (1) | JP3432664B2 (en) |
Cited By (74)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20010007550A1 (en) * | 2000-01-06 | 2001-07-12 | Phan Cao Thanh | Management method for maintaining communications options within a private communications network |
US20010033548A1 (en) * | 1999-01-15 | 2001-10-25 | Saleh Ali Najib | Protocol for the determination of network topology |
US20020073355A1 (en) * | 2000-08-01 | 2002-06-13 | Qwest Communications International, Inc. | Proactive repair process in the xDSL network (with a VDSL focus) |
US20020138645A1 (en) * | 2001-03-21 | 2002-09-26 | Norihiko Shinomiya | Protecting route design method in a communication network |
US20020167900A1 (en) * | 2001-05-14 | 2002-11-14 | Mark Barry Ding Ken | Packet network providing fast distribution of node related information and a method therefor |
US20030002114A1 (en) * | 2000-12-15 | 2003-01-02 | Michiya Takemoto | Optical multi-branch communication system |
US20030016809A1 (en) * | 2001-07-19 | 2003-01-23 | Sycamore Networks, Inc. | Restoration scheme for mesh-based switching networks |
US20030031127A1 (en) * | 1999-01-15 | 2003-02-13 | Cisco Technology, Inc. | Best effort technique for virtual path restoration |
US6530032B1 (en) * | 1999-09-23 | 2003-03-04 | Nortel Networks Limited | Network fault recovery method and apparatus |
EP0954197A3 (en) * | 1998-04-27 | 2003-04-02 | Lucent Technologies Inc. | Optical transmission system including optical restoration |
US20030072430A1 (en) * | 2001-09-06 | 2003-04-17 | Jean-Alexis Berranger | Exchange node |
US6600719B1 (en) * | 1997-09-24 | 2003-07-29 | At&T Corp. | Method and apparatus for restoring a network |
US20030179701A1 (en) * | 2001-05-16 | 2003-09-25 | Cisco Technology, Inc. | Method for restoring a virtual path in an optical network using dynamic unicast |
US20030193923A1 (en) * | 1999-04-23 | 2003-10-16 | Abdelgany Mohyeldeen Fouad | Shared functional block multi-mode multi-band communication transceivers |
US20030206516A1 (en) * | 2002-05-03 | 2003-11-06 | Wen Chen | Calculating physical routes in a communication network |
US6661738B1 (en) * | 2002-06-19 | 2003-12-09 | Halliburton Energy Services, Inc. | Orientation and calibration of acoustic vector sensor arrays |
US6671819B1 (en) * | 2000-04-06 | 2003-12-30 | Bbnt Solutions Llc | System and methods routing packets on alterate paths |
US20040042402A1 (en) * | 1997-02-11 | 2004-03-04 | Claude Galand | Method and system for a local and fast non-disruptive path switching in high speed packet switching networks |
US6711409B1 (en) * | 1999-12-15 | 2004-03-23 | Bbnt Solutions Llc | Node belonging to multiple clusters in an ad hoc wireless network |
US20040073700A1 (en) * | 2000-01-04 | 2004-04-15 | Sid Chaudhuri | Method and apparatus for restoring a network |
US6728205B1 (en) * | 1997-02-19 | 2004-04-27 | Massachusetts Institute Of Technology | Method and apparatus for automatic protection switching |
US6766482B1 (en) | 2001-10-31 | 2004-07-20 | Extreme Networks | Ethernet automatic protection switching |
US20040156633A1 (en) * | 2001-11-20 | 2004-08-12 | Idan Kaspit | High speed dissemination of failure information in mesh networks |
US6798749B1 (en) * | 1998-06-04 | 2004-09-28 | Nokia Corporation | Method and system for the management of an interface in a telecommunication system |
US6801496B1 (en) | 1999-01-15 | 2004-10-05 | Cisco Technology, Inc. | Network addressing scheme for reducing protocol overhead in an optical network |
US20040196838A1 (en) * | 1999-01-15 | 2004-10-07 | Zadikian Haig Michael | Configurable network router |
US20050010681A1 (en) * | 2003-06-03 | 2005-01-13 | Cisco Technology, Inc. A California Corporation | Computing a path for an open ended uni-directional path protected switched ring |
US20050036442A1 (en) * | 2001-05-16 | 2005-02-17 | Saleh Ali Najib | Method for restoring a virtual path in an optical network using 1:N protection |
US20050188108A1 (en) * | 2002-10-31 | 2005-08-25 | Volera, Inc. | Enriched tree for a content distribution network |
US20050185576A1 (en) * | 1999-06-09 | 2005-08-25 | Toshiki Sugawara | Communication apparatus and communication system |
US6973053B1 (en) | 2000-09-12 | 2005-12-06 | Bbnt Solutions Llc | Using direct cluster member to cluster member links to improve performance in mobile communication systems |
US6975588B1 (en) | 2001-06-01 | 2005-12-13 | Cisco Technology, Inc. | Method and apparatus for computing a path through a bidirectional line switched |
US6977889B1 (en) * | 1998-12-24 | 2005-12-20 | Fujitsu Limited | Cross-connect method and cross-connect apparatus |
WO2005125056A1 (en) * | 2004-06-22 | 2005-12-29 | Zte Corporation | A method for service connection setup and service resume protection in optical network |
US6990063B1 (en) * | 2000-03-07 | 2006-01-24 | Cisco Technology, Inc. | Distributing fault indications and maintaining and using a data structure indicating faults to route traffic in a packet switching system |
US6990068B1 (en) | 1999-01-15 | 2006-01-24 | Cisco Technology, Inc. | Virtual path restoration scheme using fast dynamic mesh restoration in an optical network |
US7012889B1 (en) | 2000-11-02 | 2006-03-14 | Cisco Technology, Inc. | Method and apparatus for controlling input rates within a packet switching system |
US7027397B1 (en) | 2001-02-15 | 2006-04-11 | Cisco Technology, Inc. | Method and apparatus for accumulating and distributing traffic and flow control information in a packet switching system |
US7031253B1 (en) | 2001-06-01 | 2006-04-18 | Cisco Technology, Inc. | Method and apparatus for computing a path through specified elements in a network |
US20060104199A1 (en) * | 2004-11-12 | 2006-05-18 | Cisco Technology, Inc. | Minimizing single points of failure in paths with mixed protection schemes |
US7051113B1 (en) | 2001-06-01 | 2006-05-23 | Cisco Technology, Inc. | Method and apparatus for computing a primary path while allowing for computing an alternate path by using a blocked list |
US7054942B1 (en) * | 1997-10-10 | 2006-05-30 | De La Bretoniere Ralph Rogier | Method and device for protecting data communication |
US7058707B1 (en) | 2000-08-01 | 2006-06-06 | Qwest Communications International, Inc. | Performance modeling in a VDSL network |
WO2006058458A1 (en) * | 2004-12-01 | 2006-06-08 | Zte Corporation | Recovering method in a complex optical network |
US20060153064A1 (en) * | 2005-01-07 | 2006-07-13 | Cisco Technology, Inc. | System and method for storing and restoring communication dialog |
US7082124B1 (en) | 2001-07-10 | 2006-07-25 | Cisco Technology, Inc. | Method and apparatus for computing primary and alternate paths in mixed protection domain networks |
US7092504B1 (en) * | 2003-03-18 | 2006-08-15 | Sprint Communications Company L.P. | Method and system for presenting data stored within a network component |
US7106693B1 (en) | 2000-11-02 | 2006-09-12 | Cisco Technology, Inc. | Method and apparatus for pacing the flow of information sent from a device |
US20060223493A1 (en) * | 2005-03-29 | 2006-10-05 | Freund John F | Method and apparatus for enhancing the survivability of wireless communication systems in response to catastrophic events |
US7120456B1 (en) | 2001-11-07 | 2006-10-10 | Bbn Technologies Corp. | Wireless terminals with multiple transceivers |
US7155120B1 (en) * | 2001-07-30 | 2006-12-26 | Atrica Israel Ltd. | Link level network protection path calculation mechanism for use in optical networks |
US20070115810A1 (en) * | 1997-07-11 | 2007-05-24 | Telecommunications Research Laboratories | Distributed preconfiguration of spare capacity in closed paths for network restoration |
US20070206583A1 (en) * | 2006-02-17 | 2007-09-06 | Christopher James Nason | Method of accelerating control link loss detection |
US7274869B1 (en) * | 1999-11-29 | 2007-09-25 | Nokia Networks Oy | System and method for providing destination-to-source protection switch setup in optical network topologies |
FR2899412A1 (en) * | 2006-03-31 | 2007-10-05 | Infovista Sa Sa | Topology change detecting method for computer network, involves comparing value of checksum with new value of checksum calculated with new sensitive data, and updating data of topology relating to corresponding element in database |
US7352692B1 (en) | 1999-01-15 | 2008-04-01 | Cisco Technology, Inc. | Resource reservation scheme for path restoration in an optical network |
US7457233B1 (en) * | 1999-07-15 | 2008-11-25 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US7490165B1 (en) * | 2001-07-18 | 2009-02-10 | Cisco Technology, Inc. | Method and apparatus for computing a path in a system with nodal and link diverse constraints |
US7603481B2 (en) | 2002-10-31 | 2009-10-13 | Novell, Inc. | Dynamic routing through a content distribution network |
US20100074101A1 (en) * | 2007-06-01 | 2010-03-25 | Nortel Networks Limited | Distributed Connection Establishment and Restoration |
CN1780190B (en) * | 2004-11-20 | 2010-09-08 | 中兴通讯股份有限公司 | Optical network service processing method |
US7817570B1 (en) | 2006-12-31 | 2010-10-19 | At&T Intellectual Property Ii, L.P. | Method and apparatus for providing automated diagnostics of networks using multiple virtual circuits |
US20100271936A1 (en) * | 2009-04-28 | 2010-10-28 | Nortel Networks Limited | Pre-Computing Alternate Forwarding State in a Routed Ethernet Mesh Network |
US7940648B1 (en) * | 2004-03-02 | 2011-05-10 | Cisco Technology, Inc. | Hierarchical protection switching framework |
US7995485B1 (en) * | 2006-12-31 | 2011-08-09 | At&T Intellectual Property Ii, L.P. | Method and apparatus for providing automated diagnostics of networks |
US8406121B2 (en) * | 2004-10-20 | 2013-03-26 | Nokia Siemens Networks Gmbh & Co. Kg | Method for error detection in a packet-based message distribution system |
US8427962B1 (en) | 2001-07-06 | 2013-04-23 | Cisco Technology, Inc. | Control of inter-zone/intra-zone recovery using in-band communications |
US8489721B1 (en) * | 2008-12-30 | 2013-07-16 | Symantec Corporation | Method and apparatus for providing high availabilty to service groups within a datacenter |
US20150281011A1 (en) * | 2014-04-01 | 2015-10-01 | Ca, Inc. | Graph database with links to underlying data |
EP2945314A1 (en) * | 2013-12-31 | 2015-11-18 | Huawei Technologies Co., Ltd. | Distributed flow processing system fault tolerance method, nodes and system |
US20160028609A1 (en) * | 2013-08-06 | 2016-01-28 | Cisco Technology, Inc. | Multiple topology routing architecture in computer networks |
US9559750B2 (en) | 2013-08-06 | 2017-01-31 | Cisco Technology, Inc. | Interleaving low transmission power and medium transmission power channels in computer networks |
US9590896B2 (en) | 2013-08-06 | 2017-03-07 | Cisco Technology, Inc. | On-demand medium to low transmission power channel switching in computer networks |
CN117454315A (en) * | 2023-12-21 | 2024-01-26 | 国网浙江省电力有限公司宁波供电公司 | Man-machine terminal picture data interaction method and system |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3700596B2 (en) | 2001-03-14 | 2005-09-28 | 日本電気株式会社 | Communication network, path setting method, and path setting program |
US7355981B2 (en) * | 2001-11-23 | 2008-04-08 | Apparent Networks, Inc. | Signature matching methods and apparatus for performing network diagnostics |
JP4020753B2 (en) | 2002-10-25 | 2007-12-12 | 富士通株式会社 | Ring switching method |
JP4714081B2 (en) * | 2006-06-01 | 2011-06-29 | アラクサラネットワークス株式会社 | Network connection device |
JP4850781B2 (en) * | 2007-05-21 | 2012-01-11 | 日本電信電話株式会社 | Optical cross-connect device, optical cross-connect control method, wavelength division multiplexing transmission system, and optical amplifier control method |
Citations (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4679189A (en) * | 1985-11-27 | 1987-07-07 | American Telephone And Telegraph Company | Alternate routing arrangement |
US4679186A (en) * | 1984-09-26 | 1987-07-07 | American Telephone And Telegraph Company, At&T Bell Laboratories | Alternate self-routing packet switching node having fault detection capabilities |
JPS645246A (en) | 1987-06-15 | 1989-01-10 | Ibm | Method of maintaining topology information |
US4884263A (en) * | 1986-01-09 | 1989-11-28 | Nec Corporation | Packet-switched communications network with parallel virtual circuits for re-routing message packets |
US4933936A (en) * | 1987-08-17 | 1990-06-12 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Distributed computing system with dual independent communications paths between computers and employing split tokens |
US5084816A (en) * | 1987-11-25 | 1992-01-28 | Bell Communications Research, Inc. | Real time fault tolerant transaction processing system |
US5093824A (en) * | 1990-03-27 | 1992-03-03 | Bell Communications Research, Inc. | Distributed protocol for improving the survivability of telecommunications trunk networks |
JPH0488738A (en) | 1990-07-31 | 1992-03-23 | Nec Corp | System and apparatus for network fault recovery |
JPH04154242A (en) | 1990-10-17 | 1992-05-27 | Nec Corp | Network failure recovery system |
JPH04257143A (en) | 1991-02-08 | 1992-09-11 | Nippon Telegr & Teleph Corp <Ntt> | Virtual path switching device |
US5235599A (en) | 1989-07-26 | 1993-08-10 | Nec Corporation | Self-healing network with distributed failure restoration capabilities |
JPH0637783A (en) | 1992-07-14 | 1994-02-10 | Fujitsu Ltd | Bypass route setting system in atm network |
JPH07327048A (en) | 1994-06-02 | 1995-12-12 | Nec Corp | Store and forward exchange system |
US5627822A (en) * | 1994-05-11 | 1997-05-06 | Siemens Aktiengesellschaft | Method and circuit arrangement for disturbance-free redirection of a message cell stream onto an alternate route |
US5646936A (en) * | 1995-06-22 | 1997-07-08 | Mci Corporation | Knowledge based path set up and spare capacity assignment for distributed network restoration |
US5732072A (en) * | 1994-08-31 | 1998-03-24 | Siemens Aktiengesellschaft | Method for adaptive routing in a communication network |
US5742820A (en) * | 1995-07-06 | 1998-04-21 | Novell, Inc. | Mechanism for efficiently synchronizing information over a network |
US5805593A (en) * | 1995-09-26 | 1998-09-08 | At&T Corp | Routing method for setting up a service between an origination node and a destination node in a connection-communications network |
US5883881A (en) * | 1996-12-30 | 1999-03-16 | Mci Communications Corporation | Method for selecting preferred nodes for distributed network restoration |
US6026077A (en) * | 1996-11-08 | 2000-02-15 | Nec Corporation | Failure restoration system suitable for a large-scale network |
US6038212A (en) * | 1996-12-13 | 2000-03-14 | International Business Machines Corporation | Method and system for optimizing the connection set up time in high speed communication networks for recovering from network failure |
US6069894A (en) * | 1995-06-12 | 2000-05-30 | Telefonaktiebolaget Lm Ericsson | Enhancement of network operation and performance |
US6075766A (en) * | 1996-11-26 | 2000-06-13 | Mci Communications Corporation | Method and apparatus for identifying restoral routes in a network |
-
1996
- 1996-02-14 JP JP02712696A patent/JP3432664B2/en not_active Expired - Fee Related
- 1996-05-06 US US08/643,761 patent/US6430150B1/en not_active Expired - Lifetime
Patent Citations (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4679186A (en) * | 1984-09-26 | 1987-07-07 | American Telephone And Telegraph Company, At&T Bell Laboratories | Alternate self-routing packet switching node having fault detection capabilities |
US4679189A (en) * | 1985-11-27 | 1987-07-07 | American Telephone And Telegraph Company | Alternate routing arrangement |
US4884263A (en) * | 1986-01-09 | 1989-11-28 | Nec Corporation | Packet-switched communications network with parallel virtual circuits for re-routing message packets |
JPS645246A (en) | 1987-06-15 | 1989-01-10 | Ibm | Method of maintaining topology information |
US4933936A (en) * | 1987-08-17 | 1990-06-12 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Distributed computing system with dual independent communications paths between computers and employing split tokens |
US5084816A (en) * | 1987-11-25 | 1992-01-28 | Bell Communications Research, Inc. | Real time fault tolerant transaction processing system |
US5235599A (en) | 1989-07-26 | 1993-08-10 | Nec Corporation | Self-healing network with distributed failure restoration capabilities |
US5093824A (en) * | 1990-03-27 | 1992-03-03 | Bell Communications Research, Inc. | Distributed protocol for improving the survivability of telecommunications trunk networks |
JPH0488738A (en) | 1990-07-31 | 1992-03-23 | Nec Corp | System and apparatus for network fault recovery |
JPH04154242A (en) | 1990-10-17 | 1992-05-27 | Nec Corp | Network failure recovery system |
JPH04257143A (en) | 1991-02-08 | 1992-09-11 | Nippon Telegr & Teleph Corp <Ntt> | Virtual path switching device |
JPH0637783A (en) | 1992-07-14 | 1994-02-10 | Fujitsu Ltd | Bypass route setting system in atm network |
US5627822A (en) * | 1994-05-11 | 1997-05-06 | Siemens Aktiengesellschaft | Method and circuit arrangement for disturbance-free redirection of a message cell stream onto an alternate route |
JPH07327048A (en) | 1994-06-02 | 1995-12-12 | Nec Corp | Store and forward exchange system |
US5732072A (en) * | 1994-08-31 | 1998-03-24 | Siemens Aktiengesellschaft | Method for adaptive routing in a communication network |
US6069894A (en) * | 1995-06-12 | 2000-05-30 | Telefonaktiebolaget Lm Ericsson | Enhancement of network operation and performance |
US5646936A (en) * | 1995-06-22 | 1997-07-08 | Mci Corporation | Knowledge based path set up and spare capacity assignment for distributed network restoration |
US5742820A (en) * | 1995-07-06 | 1998-04-21 | Novell, Inc. | Mechanism for efficiently synchronizing information over a network |
US5805593A (en) * | 1995-09-26 | 1998-09-08 | At&T Corp | Routing method for setting up a service between an origination node and a destination node in a connection-communications network |
US6026077A (en) * | 1996-11-08 | 2000-02-15 | Nec Corporation | Failure restoration system suitable for a large-scale network |
US6075766A (en) * | 1996-11-26 | 2000-06-13 | Mci Communications Corporation | Method and apparatus for identifying restoral routes in a network |
US6038212A (en) * | 1996-12-13 | 2000-03-14 | International Business Machines Corporation | Method and system for optimizing the connection set up time in high speed communication networks for recovering from network failure |
US5883881A (en) * | 1996-12-30 | 1999-03-16 | Mci Communications Corporation | Method for selecting preferred nodes for distributed network restoration |
Cited By (154)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7593321B2 (en) * | 1997-02-11 | 2009-09-22 | Cisco Technology, Inc. | Method and system for a local and fast non-disruptive path switching in high speed packet switching networks |
US20040042402A1 (en) * | 1997-02-11 | 2004-03-04 | Claude Galand | Method and system for a local and fast non-disruptive path switching in high speed packet switching networks |
US6728205B1 (en) * | 1997-02-19 | 2004-04-27 | Massachusetts Institute Of Technology | Method and apparatus for automatic protection switching |
US20150188754A1 (en) * | 1997-07-11 | 2015-07-02 | Telecommunications Research Laboratories | Distributed preconfiguration of spare capacity in closed paths for network restoration |
US8988990B2 (en) * | 1997-07-11 | 2015-03-24 | Telecommunications Research Laboratories | Distributed preconfiguration of spare capacity in closed paths for network restoration |
US20070115810A1 (en) * | 1997-07-11 | 2007-05-24 | Telecommunications Research Laboratories | Distributed preconfiguration of spare capacity in closed paths for network restoration |
US6600719B1 (en) * | 1997-09-24 | 2003-07-29 | At&T Corp. | Method and apparatus for restoring a network |
US7054942B1 (en) * | 1997-10-10 | 2006-05-30 | De La Bretoniere Ralph Rogier | Method and device for protecting data communication |
EP0954197A3 (en) * | 1998-04-27 | 2003-04-02 | Lucent Technologies Inc. | Optical transmission system including optical restoration |
US6798749B1 (en) * | 1998-06-04 | 2004-09-28 | Nokia Corporation | Method and system for the management of an interface in a telecommunication system |
US6977889B1 (en) * | 1998-12-24 | 2005-12-20 | Fujitsu Limited | Cross-connect method and cross-connect apparatus |
US6801496B1 (en) | 1999-01-15 | 2004-10-05 | Cisco Technology, Inc. | Network addressing scheme for reducing protocol overhead in an optical network |
US7301895B2 (en) | 1999-01-15 | 2007-11-27 | Cisco Technology, Inc. | Virtual path restoration scheme using fast dynamic mesh restoration in an optical network |
US7729337B2 (en) * | 1999-01-15 | 2010-06-01 | Cisco Technology, Inc. | Protocol for the determination of network topology |
US20030031127A1 (en) * | 1999-01-15 | 2003-02-13 | Cisco Technology, Inc. | Best effort technique for virtual path restoration |
US20010033548A1 (en) * | 1999-01-15 | 2001-10-25 | Saleh Ali Najib | Protocol for the determination of network topology |
US7002917B1 (en) | 1999-01-15 | 2006-02-21 | Cisco Technology, Inc. | Method for path selection in a network |
US20010048660A1 (en) * | 1999-01-15 | 2001-12-06 | Saleh Ali N. | Virtual path restoration scheme using fast dynamic mesh restoration in an optical network. |
US20060153066A1 (en) * | 1999-01-15 | 2006-07-13 | Saleh Ali N | Virtual path restoration scheme using fast dynamic mesh restoration in an optical network |
US7502313B2 (en) | 1999-01-15 | 2009-03-10 | Cisco Technology, Inc. | Virtual path restoration scheme using fast dynamic mesh restoration in an optical network |
US20030179700A1 (en) * | 1999-01-15 | 2003-09-25 | Saleh Ali Najib | Method for restoring a virtual path in an optical network using 1‘protection |
US20050135234A1 (en) * | 1999-01-15 | 2005-06-23 | Saleh Ali N. | Method for routing information over a network |
US6856627B2 (en) * | 1999-01-15 | 2005-02-15 | Cisco Technology, Inc. | Method for routing information over a network |
US6850486B2 (en) | 1999-01-15 | 2005-02-01 | Cisco Technology, Inc. | Method of reducing traffic during path restoration |
US7428212B2 (en) | 1999-01-15 | 2008-09-23 | Cisco Technology, Inc. | Best effort technique for virtual path restoration |
US7352692B1 (en) | 1999-01-15 | 2008-04-01 | Cisco Technology, Inc. | Resource reservation scheme for path restoration in an optical network |
US7933266B2 (en) * | 1999-01-15 | 2011-04-26 | Cisco Technology, Inc. | Configurable network router |
US7200104B2 (en) | 1999-01-15 | 2007-04-03 | Cisco Technology, Inc. | Method for restoring a virtual path in an optical network using 1+1 protection |
US7633854B2 (en) * | 1999-01-15 | 2009-12-15 | Cisco Technology, Inc. | Method for routing information over a network |
US20040196838A1 (en) * | 1999-01-15 | 2004-10-07 | Zadikian Haig Michael | Configurable network router |
US6990068B1 (en) | 1999-01-15 | 2006-01-24 | Cisco Technology, Inc. | Virtual path restoration scheme using fast dynamic mesh restoration in an optical network |
US7092676B2 (en) | 1999-04-23 | 2006-08-15 | Skyworks Solutions, Inc. | Shared functional block multi-mode multi-band communication transceivers |
US20030193923A1 (en) * | 1999-04-23 | 2003-10-16 | Abdelgany Mohyeldeen Fouad | Shared functional block multi-mode multi-band communication transceivers |
US7518985B2 (en) * | 1999-06-09 | 2009-04-14 | Hitachi Communication Technologies, Ltd. | Communication apparatus and communication system |
US20050185576A1 (en) * | 1999-06-09 | 2005-08-25 | Toshiki Sugawara | Communication apparatus and communication system |
US7054265B1 (en) * | 1999-06-09 | 2006-05-30 | Hitachi, Ltd. | Communication apparatus and communication system |
US20090040921A1 (en) * | 1999-07-15 | 2009-02-12 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US8873372B2 (en) | 1999-07-15 | 2014-10-28 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US7457233B1 (en) * | 1999-07-15 | 2008-11-25 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US20110090784A1 (en) * | 1999-07-15 | 2011-04-21 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US8526298B2 (en) * | 1999-07-15 | 2013-09-03 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US9112776B2 (en) | 1999-07-15 | 2015-08-18 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US7843808B2 (en) | 1999-07-15 | 2010-11-30 | Juniper Networks, Inc. | Method and apparatus for fast reroute in a connection-oriented network |
US6530032B1 (en) * | 1999-09-23 | 2003-03-04 | Nortel Networks Limited | Network fault recovery method and apparatus |
US7274869B1 (en) * | 1999-11-29 | 2007-09-25 | Nokia Networks Oy | System and method for providing destination-to-source protection switch setup in optical network topologies |
US6711409B1 (en) * | 1999-12-15 | 2004-03-23 | Bbnt Solutions Llc | Node belonging to multiple clusters in an ad hoc wireless network |
US20070041316A1 (en) * | 2000-01-04 | 2007-02-22 | Sid Chaudhuri | Method and apparatus for restoring a network |
US20040073700A1 (en) * | 2000-01-04 | 2004-04-15 | Sid Chaudhuri | Method and apparatus for restoring a network |
US7142505B2 (en) * | 2000-01-04 | 2006-11-28 | At&T Corp. | Method and apparatus for restoring a network |
US7551553B2 (en) * | 2000-01-04 | 2009-06-23 | At&T Intellectual Property, Ii, L.P. | Method and apparatus for restoring a network |
US20010007550A1 (en) * | 2000-01-06 | 2001-07-12 | Phan Cao Thanh | Management method for maintaining communications options within a private communications network |
US7079484B2 (en) * | 2000-01-06 | 2006-07-18 | Alcatel | Management method for maintaining communications options within a private communications network |
US6990063B1 (en) * | 2000-03-07 | 2006-01-24 | Cisco Technology, Inc. | Distributing fault indications and maintaining and using a data structure indicating faults to route traffic in a packet switching system |
US6671819B1 (en) * | 2000-04-06 | 2003-12-30 | Bbnt Solutions Llc | System and methods routing packets on alterate paths |
US7134135B2 (en) | 2000-08-01 | 2006-11-07 | Qwest Communications International Inc. | Fault management in a VDSL network |
US7464164B2 (en) | 2000-08-01 | 2008-12-09 | Qwest Communications International, Inc. | Linking order entry process to realtime network inventories and capacities |
US7219124B2 (en) | 2000-08-01 | 2007-05-15 | Qwest Communications International Inc. | Provisioning system and method for auto-discovering customer premises equipment in activating xDSL |
US20020071440A1 (en) * | 2000-08-01 | 2002-06-13 | Richard Cerami | Provisioning system and method for auto-discovering customer premises equipment in activating xDSL |
US20020073062A1 (en) * | 2000-08-01 | 2002-06-13 | Qwest Communications International, Inc. | Fault management in a VDSL network |
US7032016B2 (en) | 2000-08-01 | 2006-04-18 | Qwest Communications International, Inc. | Proactive service request management and measurement |
US6981039B2 (en) * | 2000-08-01 | 2005-12-27 | Qwest Communications International, Inc. | Fault management in a VDSL network |
US20020078017A1 (en) * | 2000-08-01 | 2002-06-20 | Richard Cerami | Fault management in a VDSL network |
US7058707B1 (en) | 2000-08-01 | 2006-06-06 | Qwest Communications International, Inc. | Performance modeling in a VDSL network |
US20020111883A1 (en) * | 2000-08-01 | 2002-08-15 | Cerami Richard S. | Linking order entry process to realtime network inventories and capacities |
US20050183129A1 (en) * | 2000-08-01 | 2005-08-18 | Qwest Communications International, Inc. | Proactive repair process in the xDSL network (with a VDSL focus) |
US20020087680A1 (en) * | 2000-08-01 | 2002-07-04 | Cerami Richard S. | Proactive service request management and measurement |
US20020073355A1 (en) * | 2000-08-01 | 2002-06-13 | Qwest Communications International, Inc. | Proactive repair process in the xDSL network (with a VDSL focus) |
US7693079B2 (en) | 2000-08-01 | 2010-04-06 | Qwest Communications International, Inc. | Proactive repair process in the xDSL network (with a VDSL focus) |
US20090164619A1 (en) * | 2000-08-01 | 2009-06-25 | Qwest Communications International Inc. | Management of virtual and physical network inventories |
US7467193B2 (en) | 2000-08-01 | 2008-12-16 | Qwest Communications International Inc | Management of virtual and physical network inventories |
US20020099841A1 (en) * | 2000-08-01 | 2002-07-25 | Richard Cerami | Management of virtual and physical network inventories |
US8364801B2 (en) | 2000-08-01 | 2013-01-29 | Qwest Communications International Inc. | Management of virtual and physical network inventories |
US6973053B1 (en) | 2000-09-12 | 2005-12-06 | Bbnt Solutions Llc | Using direct cluster member to cluster member links to improve performance in mobile communication systems |
US7106693B1 (en) | 2000-11-02 | 2006-09-12 | Cisco Technology, Inc. | Method and apparatus for pacing the flow of information sent from a device |
US7012889B1 (en) | 2000-11-02 | 2006-03-14 | Cisco Technology, Inc. | Method and apparatus for controlling input rates within a packet switching system |
US7496294B2 (en) * | 2000-12-15 | 2009-02-24 | Mitsubishi Denki Kabushiki Kaisha | Optical multi-branch communication system |
US20030002114A1 (en) * | 2000-12-15 | 2003-01-02 | Michiya Takemoto | Optical multi-branch communication system |
US7027397B1 (en) | 2001-02-15 | 2006-04-11 | Cisco Technology, Inc. | Method and apparatus for accumulating and distributing traffic and flow control information in a packet switching system |
US7046627B1 (en) | 2001-02-15 | 2006-05-16 | Cisco Technology, Inc. | Method and apparatus for accumulating and distributing traffic and flow control information in a packet switching system |
US7188280B2 (en) * | 2001-03-21 | 2007-03-06 | Fujitsu Limited | Protecting route design method in a communication network |
US20020138645A1 (en) * | 2001-03-21 | 2002-09-26 | Norihiko Shinomiya | Protecting route design method in a communication network |
US7126921B2 (en) * | 2001-05-14 | 2006-10-24 | Tropic Networks Inc. | Packet network providing fast distribution of node related information and a method therefor |
US20020167900A1 (en) * | 2001-05-14 | 2002-11-14 | Mark Barry Ding Ken | Packet network providing fast distribution of node related information and a method therefor |
US20050036442A1 (en) * | 2001-05-16 | 2005-02-17 | Saleh Ali Najib | Method for restoring a virtual path in an optical network using 1:N protection |
US7764596B2 (en) * | 2001-05-16 | 2010-07-27 | Cisco Technology, Inc. | Method for restoring a virtual path in an optical network using dynamic unicast |
US20030179701A1 (en) * | 2001-05-16 | 2003-09-25 | Cisco Technology, Inc. | Method for restoring a virtual path in an optical network using dynamic unicast |
US7477594B2 (en) | 2001-05-16 | 2009-01-13 | Cisco Technology, Inc. | Method for restoring a virtual path in an optical network using 1:N protection |
US7051113B1 (en) | 2001-06-01 | 2006-05-23 | Cisco Technology, Inc. | Method and apparatus for computing a primary path while allowing for computing an alternate path by using a blocked list |
US7031253B1 (en) | 2001-06-01 | 2006-04-18 | Cisco Technology, Inc. | Method and apparatus for computing a path through specified elements in a network |
US6975588B1 (en) | 2001-06-01 | 2005-12-13 | Cisco Technology, Inc. | Method and apparatus for computing a path through a bidirectional line switched |
US8427962B1 (en) | 2001-07-06 | 2013-04-23 | Cisco Technology, Inc. | Control of inter-zone/intra-zone recovery using in-band communications |
US8762568B1 (en) | 2001-07-06 | 2014-06-24 | Cisco Technology, Inc. | Method and apparatus for inter-zone restoration |
US7082124B1 (en) | 2001-07-10 | 2006-07-25 | Cisco Technology, Inc. | Method and apparatus for computing primary and alternate paths in mixed protection domain networks |
US7490165B1 (en) * | 2001-07-18 | 2009-02-10 | Cisco Technology, Inc. | Method and apparatus for computing a path in a system with nodal and link diverse constraints |
US7853715B1 (en) | 2001-07-18 | 2010-12-14 | Cisco Technology, Inc. | Method and apparatus for computing a path in a system with nodal and link diverse constraints |
US7050561B2 (en) * | 2001-07-19 | 2006-05-23 | Sycamore Networks, Inc. | Restoration scheme for mesh-based switching networks |
US20030016809A1 (en) * | 2001-07-19 | 2003-01-23 | Sycamore Networks, Inc. | Restoration scheme for mesh-based switching networks |
US7155120B1 (en) * | 2001-07-30 | 2006-12-26 | Atrica Israel Ltd. | Link level network protection path calculation mechanism for use in optical networks |
US20030072430A1 (en) * | 2001-09-06 | 2003-04-17 | Jean-Alexis Berranger | Exchange node |
US7292686B2 (en) * | 2001-09-06 | 2007-11-06 | Hewlett-Packard Company | Exchange node |
US7003705B1 (en) | 2001-10-31 | 2006-02-21 | Extreme Networks, Inc. | Ethernet automatic protection switching |
US6766482B1 (en) | 2001-10-31 | 2004-07-20 | Extreme Networks | Ethernet automatic protection switching |
US7120456B1 (en) | 2001-11-07 | 2006-10-10 | Bbn Technologies Corp. | Wireless terminals with multiple transceivers |
US20040156633A1 (en) * | 2001-11-20 | 2004-08-12 | Idan Kaspit | High speed dissemination of failure information in mesh networks |
US7388827B2 (en) * | 2001-11-20 | 2008-06-17 | Eci Telecom Ltd. | High speed dissemination of failure information in mesh networks |
US20030206516A1 (en) * | 2002-05-03 | 2003-11-06 | Wen Chen | Calculating physical routes in a communication network |
US7206281B2 (en) * | 2002-05-03 | 2007-04-17 | Ciena Corporation | Calculating physical routes in a communication network |
US20030235113A1 (en) * | 2002-06-19 | 2003-12-25 | Halliburton Energy Services, Inc. | Orientation and calibration of acoustic vector sensor arrays |
US6661738B1 (en) * | 2002-06-19 | 2003-12-09 | Halliburton Energy Services, Inc. | Orientation and calibration of acoustic vector sensor arrays |
US7603481B2 (en) | 2002-10-31 | 2009-10-13 | Novell, Inc. | Dynamic routing through a content distribution network |
US20050188108A1 (en) * | 2002-10-31 | 2005-08-25 | Volera, Inc. | Enriched tree for a content distribution network |
US7092504B1 (en) * | 2003-03-18 | 2006-08-15 | Sprint Communications Company L.P. | Method and system for presenting data stored within a network component |
US8078756B2 (en) | 2003-06-03 | 2011-12-13 | Cisco Technology, Inc. | Computing a path for an open ended uni-directional path protected switched ring |
US20050010681A1 (en) * | 2003-06-03 | 2005-01-13 | Cisco Technology, Inc. A California Corporation | Computing a path for an open ended uni-directional path protected switched ring |
US8432790B2 (en) | 2004-03-02 | 2013-04-30 | Cisco Technology, Inc. | Hierarchical protection switching framework |
US20110141880A1 (en) * | 2004-03-02 | 2011-06-16 | Cisco Technology, Inc., A Corporation Of California | Hierarchical Protection Switching Framework |
US7940648B1 (en) * | 2004-03-02 | 2011-05-10 | Cisco Technology, Inc. | Hierarchical protection switching framework |
EP1768281A4 (en) * | 2004-06-22 | 2013-04-17 | Zte Corp | A method for service connection setup and service resume protection in optical network |
CN1981463B (en) * | 2004-06-22 | 2011-11-16 | 中兴通讯股份有限公司 | Business connection set-up and business recovering protection method in optical network |
EP1768281A1 (en) * | 2004-06-22 | 2007-03-28 | ZTE Corporation | A method for service connection setup and service resume protection in optical network |
WO2005125056A1 (en) * | 2004-06-22 | 2005-12-29 | Zte Corporation | A method for service connection setup and service resume protection in optical network |
US8406121B2 (en) * | 2004-10-20 | 2013-03-26 | Nokia Siemens Networks Gmbh & Co. Kg | Method for error detection in a packet-based message distribution system |
US7616584B2 (en) | 2004-11-12 | 2009-11-10 | Cisco Technology, Inc. | Minimizing single points of failure in paths with mixed protection schemes |
US20060104199A1 (en) * | 2004-11-12 | 2006-05-18 | Cisco Technology, Inc. | Minimizing single points of failure in paths with mixed protection schemes |
CN1780190B (en) * | 2004-11-20 | 2010-09-08 | 中兴通讯股份有限公司 | Optical network service processing method |
EP1830492A4 (en) * | 2004-12-01 | 2010-01-20 | Zte Corp | Recovering method in a complex optical network |
WO2006058458A1 (en) * | 2004-12-01 | 2006-06-08 | Zte Corporation | Recovering method in a complex optical network |
EP1830492A1 (en) * | 2004-12-01 | 2007-09-05 | ZTE Corporation | Recovering method in a complex optical network |
US7916855B2 (en) | 2005-01-07 | 2011-03-29 | Cisco Technology, Inc. | System and method for storing and restoring communication dialog |
US20060153064A1 (en) * | 2005-01-07 | 2006-07-13 | Cisco Technology, Inc. | System and method for storing and restoring communication dialog |
US20060223493A1 (en) * | 2005-03-29 | 2006-10-05 | Freund John F | Method and apparatus for enhancing the survivability of wireless communication systems in response to catastrophic events |
US20070206583A1 (en) * | 2006-02-17 | 2007-09-06 | Christopher James Nason | Method of accelerating control link loss detection |
US9906426B2 (en) * | 2006-02-17 | 2018-02-27 | Mitel Networks Corporation | Method of accelerating control link loss detection |
WO2007118957A3 (en) * | 2006-03-31 | 2008-03-27 | Infovista Sa | Method and system for updating topology changes of a computer network |
US20090177953A1 (en) * | 2006-03-31 | 2009-07-09 | Cau Stephane | Method and system for updating topology changes of a computer network |
US8136012B2 (en) | 2006-03-31 | 2012-03-13 | Infovista Sa | Method and system for updating topology changes of a computer network |
FR2899412A1 (en) * | 2006-03-31 | 2007-10-05 | Infovista Sa Sa | Topology change detecting method for computer network, involves comparing value of checksum with new value of checksum calculated with new sensitive data, and updating data of topology relating to corresponding element in database |
WO2007118957A2 (en) | 2006-03-31 | 2007-10-25 | Infovista Sa | Method and system for updating topology changes of a computer network |
US7817570B1 (en) | 2006-12-31 | 2010-10-19 | At&T Intellectual Property Ii, L.P. | Method and apparatus for providing automated diagnostics of networks using multiple virtual circuits |
US7995485B1 (en) * | 2006-12-31 | 2011-08-09 | At&T Intellectual Property Ii, L.P. | Method and apparatus for providing automated diagnostics of networks |
US20100074101A1 (en) * | 2007-06-01 | 2010-03-25 | Nortel Networks Limited | Distributed Connection Establishment and Restoration |
US8750141B2 (en) * | 2007-06-01 | 2014-06-10 | Rockstar Consortium Us Lp | Distributed connection establishment and restoration |
US8489721B1 (en) * | 2008-12-30 | 2013-07-16 | Symantec Corporation | Method and apparatus for providing high availabilty to service groups within a datacenter |
US8619785B2 (en) * | 2009-04-28 | 2013-12-31 | Ciena Corporation | Pre-computing alternate forwarding state in a routed ethernet mesh network |
US20100271936A1 (en) * | 2009-04-28 | 2010-10-28 | Nortel Networks Limited | Pre-Computing Alternate Forwarding State in a Routed Ethernet Mesh Network |
US20160028609A1 (en) * | 2013-08-06 | 2016-01-28 | Cisco Technology, Inc. | Multiple topology routing architecture in computer networks |
US9559750B2 (en) | 2013-08-06 | 2017-01-31 | Cisco Technology, Inc. | Interleaving low transmission power and medium transmission power channels in computer networks |
US9590896B2 (en) | 2013-08-06 | 2017-03-07 | Cisco Technology, Inc. | On-demand medium to low transmission power channel switching in computer networks |
US9722909B2 (en) * | 2013-08-06 | 2017-08-01 | Cisco Technology, Inc. | Multiple topology routing architecture in computer networks |
EP2945314A1 (en) * | 2013-12-31 | 2015-11-18 | Huawei Technologies Co., Ltd. | Distributed flow processing system fault tolerance method, nodes and system |
EP2945314A4 (en) * | 2013-12-31 | 2016-04-20 | Huawei Tech Co Ltd | Distributed flow processing system fault tolerance method, nodes and system |
US10205630B2 (en) | 2013-12-31 | 2019-02-12 | Huawei Technologies Co., Ltd. | Fault tolerance method for distributed stream processing system |
US20150281011A1 (en) * | 2014-04-01 | 2015-10-01 | Ca, Inc. | Graph database with links to underlying data |
CN117454315A (en) * | 2023-12-21 | 2024-01-26 | 国网浙江省电力有限公司宁波供电公司 | Man-machine terminal picture data interaction method and system |
Also Published As
Publication number | Publication date |
---|---|
JP3432664B2 (en) | 2003-08-04 |
JPH09224026A (en) | 1997-08-26 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6430150B1 (en) | Communication node, restoration method and communication network | |
US6034961A (en) | Active/standby routing system on ATM network | |
US5548639A (en) | Distributed control of telecommunication network for setting up an alternative communication path | |
US5550805A (en) | Failure restoration method in a mesh network | |
CA2220469C (en) | Failure restoration system suitable for a large-scale network | |
RU2157058C2 (en) | Method and device for route selection for dynamic routing in communication network | |
US6324162B1 (en) | Path-based restoration mesh networks | |
JP2993444B2 (en) | Connection setting and recovery method in ATM network | |
EP0740441A2 (en) | A method for distribution of utilization data in ATM networks and a communication network therefor | |
FI91689C (en) | Hierarchical synchronization method and communication system using message-based synchronization | |
JPH11511618A (en) | Deterministic selection of optimal restoration routes in telecommunication networks | |
NZ315056A (en) | Determining an additional route in a fully or partly meshed communications network of nodes, comprising sending a route-finder signature from a node to a neighbouring node | |
US7650426B2 (en) | Method of and apparatus for communication, and computer product | |
US6414959B1 (en) | ATM network system | |
US5475696A (en) | Remote alarm transfer method and system | |
JP3837696B2 (en) | Transmission apparatus and data transmission method | |
JPH11112657A (en) | Exchanging device | |
JP2000134247A (en) | Method for serving management channel, channel terminator realizing the method, first network termination card, second network termination card and access network | |
EP0349099B1 (en) | Transparent load sharing for parallel networks | |
JP2001186159A (en) | Ring transmission system and its squelch method | |
US20050025046A1 (en) | Resiliency of control channels in a communications network | |
US20070217345A1 (en) | Ring type network system | |
KR100226433B1 (en) | Method for automatic recovery of transmission network obstacles | |
JP2000278309A (en) | Point-to-point communication network system and communication control method | |
JP2002152218A (en) | Vp changeover system and vp changeover method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: FUJITSU LIMITED, JAPAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AZUMA, MITSUHIRO;KOBRINSKI, HAIM;WU, TSONG HO;REEL/FRAME:008075/0778;SIGNING DATES FROM 19960705 TO 19960801 Owner name: BELL COMMUNICATIONS RESEARCH, INC., NEW JERSEY Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:AZUMA, MITSUHIRO;KOBRINSKI, HAIM;WU, TSONG HO;REEL/FRAME:008075/0778;SIGNING DATES FROM 19960705 TO 19960801 |
|
AS | Assignment |
Owner name: TELCORDIA TECHNOLOGIES, INC., A CORP. OF DELAWARE, Free format text: CHANGE OF NAME;ASSIGNOR:BELL COMMUNICATIONS RESEARCH, INC.;REEL/FRAME:010256/0461 Effective date: 19990316 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: TELECORDIA TECHNOLOGIES, INC., NEW JERSEY Free format text: CHANGE OF NAME;ASSIGNOR:BELL COMMUNICATION RESEARCH, INC.;REEL/FRAME:013011/0673 Effective date: 19990316 |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
AS | Assignment |
Owner name: TELECORDIA TECHNOLOGIES, INC., NEW JERSEY Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE ASSIGNOR'S NAME THAT WAS PREVIOUSLY RECORDED ON REEL 013011, FRAME 0673;ASSIGNOR:BELL COMMUNICATIONS RESEARCH, INC.;REEL/FRAME:013506/0112 Effective date: 19990316 |
|
CC | Certificate of correction | ||
AS | Assignment |
Owner name: TELCORDIA TECHNOLOGIES, INC., NEW JERSEY Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE NAME OF THE ASSIGNEE PREVIOUSLY RECORDED ON REEL 013506 FRAME 0112;ASSIGNOR:BELL COMMUNICATIONS RESEARCH, INC.;REEL/FRAME:013922/0434 Effective date: 19990316 |
|
CC | Certificate of correction | ||
AS | Assignment |
Owner name: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT Free format text: SECURITY AGREEMENT;ASSIGNOR:TELCORDIA TECHNOLOGIES, INC.;REEL/FRAME:015886/0001 Effective date: 20050315 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: TELCORDIA TECHNOLOGIES, INC., NEW JERSEY Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:019520/0174 Effective date: 20070629 Owner name: TELCORDIA TECHNOLOGIES, INC.,NEW JERSEY Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENT RIGHTS;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:019520/0174 Effective date: 20070629 |
|
AS | Assignment |
Owner name: WILMINGTON TRUST COMPANY, AS COLLATERAL AGENT, DEL Free format text: SECURITY AGREEMENT;ASSIGNOR:TELCORDIA TECHNOLOGIES, INC.;REEL/FRAME:019562/0309 Effective date: 20070629 Owner name: WILMINGTON TRUST COMPANY, AS COLLATERAL AGENT,DELA Free format text: SECURITY AGREEMENT;ASSIGNOR:TELCORDIA TECHNOLOGIES, INC.;REEL/FRAME:019562/0309 Effective date: 20070629 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
AS | Assignment |
Owner name: TELCORDIA TECHNOLOGIES, INC.,NEW JERSEY Free format text: RELEASE;ASSIGNOR:WILMINGTON TRUST COMPANY, AS COLLATERAL AGENT;REEL/FRAME:024515/0622 Effective date: 20100430 Owner name: TELCORDIA TECHNOLOGIES, INC., NEW JERSEY Free format text: RELEASE;ASSIGNOR:WILMINGTON TRUST COMPANY, AS COLLATERAL AGENT;REEL/FRAME:024515/0622 Effective date: 20100430 |
|
AS | Assignment |
Owner name: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT Free format text: SECURITY AGREEMENT;ASSIGNOR:TELCORDIA TECHNOLOGIES, INC.;REEL/FRAME:024523/0734 Effective date: 20100430 |
|
AS | Assignment |
Owner name: WILMINGTON TRUST COMPANY, AS SECOND LIEN AGENT,DEL Free format text: SECURITY AGREEMENT;ASSIGNOR:TELCORDIA TECHNOLOGIES, INC.;REEL/FRAME:024523/0756 Effective date: 20100430 |
|
AS | Assignment |
Owner name: TELCORDIA TECHNOLOGIES, INC., NEW JERSEY Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT;REEL/FRAME:027567/0060 Effective date: 20120111 |
|
AS | Assignment |
Owner name: TELCORDIA TECHNOLOGIES, INC., NEW JERSEY Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:WILMINGTON TRUST COMPANY, AS SECOND LIEN AGENT;REEL/FRAME:027585/0773 Effective date: 20120111 |
|
FPAY | Fee payment |
Year of fee payment: 12 |