US20080304494A1 - Communication device - Google Patents

Communication device Download PDF

Info

Publication number
US20080304494A1
US20080304494A1 US12/191,499 US19149908A US2008304494A1 US 20080304494 A1 US20080304494 A1 US 20080304494A1 US 19149908 A US19149908 A US 19149908A US 2008304494 A1 US2008304494 A1 US 2008304494A1
Authority
US
United States
Prior art keywords
communication path
node
path
communication
egress
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.)
Abandoned
Application number
US12/191,499
Inventor
Toshifumi Yokoyama
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority claimed from JP2007227525A external-priority patent/JP4342580B2/en
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to US12/191,499 priority Critical patent/US20080304494A1/en
Assigned to FUJITSU LIMITED reassignment FUJITSU LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: YOKOYAMA, TOSHIFUMI
Publication of US20080304494A1 publication Critical patent/US20080304494A1/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W48/00Access restriction; Network selection; Access point selection
    • H04W48/02Access restriction performed under specific conditions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W36/00Hand-off or reselection arrangements
    • H04W36/10Reselecting an access point controller
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W60/00Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration
    • H04W60/04Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration using triggered events
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W8/00Network data management
    • H04W8/02Processing of mobility data, e.g. registration information at HLR [Home Location Register] or VLR [Visitor Location Register]; Transfer of mobility data, e.g. between HLR, VLR or external networks
    • H04W8/06Registration at serving network Location Register, VLR or user mobility server
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10Small scale networks; Flat hierarchical networks
    • H04W84/105PBS [Private Base Station] network
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10Small scale networks; Flat hierarchical networks
    • H04W84/16WPBX [Wireless Private Branch Exchange]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W92/00Interfaces specially adapted for wireless communication networks
    • H04W92/04Interfaces between hierarchically different network devices
    • H04W92/12Interfaces between hierarchically different network devices between access points and access point controllers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W92/00Interfaces specially adapted for wireless communication networks
    • H04W92/04Interfaces between hierarchically different network devices
    • H04W92/14Interfaces between hierarchically different network devices between access point controllers and backbone network device

Definitions

  • the present invention relates generally to a communication device and a network system in an MPLS (Multi Protocol Label Switching) network.
  • the present invention relates more particularly to a communication device and a network system, which perform switching back based on a local Revertive system by setting up a communication path (LSP (Label Switched Path)) for an FRR (Fast ReRoute, which is a facility backup technique)) using RSVP-TE (Resource Reservation Protocol-Traffic Engineering).
  • LSP Label Switched Path
  • FRR Frest ReRoute, which is a facility backup technique
  • RSVP-TE Resource Reservation Protocol-Traffic Engineering
  • the MPLS is a packet forwarding technique using the label switching system.
  • the MPLS involves utilizing a piece of identifying information (label) having a short fixed length in place of an IP header as routing information when forwarding a packet received by a router from another router to a different router.
  • An MPLS-based routing method is exemplified by the FRR.
  • the FRR is a method of preparing a communication path employed as a standby path beforehand in the MPLS network, then switching over, if a fault occurs in an active communication path, the path to the standby path, and recovering the communications.
  • the FRR prepares the standby path beforehand and enables the communications to be quickly recovered from the fault.
  • FIG. 1 is a view showing an example of a network architecture in a normal state.
  • a Protected LSP an LSP (active system LSP) to be protected
  • a Backup LSP a detour route (standby system LSP) for occurrence of a fault in the Protected LSP
  • LSP# 1 the Protected LSP
  • the Backup LSP LSP# 2
  • the node A down to the node C via the node D is set up from the node A down to the node C via the node D.
  • the head-end node of the LSP (which is the node H in the case of the LSP# 1 and is the node A in the case of the LSP # 2 ) is referred to as an Ingress node, while the tail-end node of the LSP (which is the node T in the case of the LSP# 1 and is the node C in the case of the LSP # 2 ) is termed an Egress node.
  • the node corresponding to a branch point of the LSP (which is the node A in FIG. 1 ) is called a PLR (Point of Local Repair), while the node corresponding to a merge point (confluent point) of the LSP (which is the node C in FIG. 1 ) is called an MP (Merge Point).
  • the node A is configured as the PLR explicitly, and the node C is configured as the MP explicitly, and thereafter the respective LSPs are set up.
  • the Protected LSP is set up by assigning the node A serving as the Ingress node a piece of route information of a route extending from the node H down to the node T as the Egress node via the node A, the node B and the node C.
  • the Backup LSP is set up by assigning the node A serving as the Ingress node a piece of route information of a route extending from the node A down to the node C as the Egress node via the node D. Thereafter, the PLR (node A) generates an associative relation between the Protected LSP and the Backup LSP, i.e., a pair relation between the Protected LSP (LSP# 1 ) and the Backup LSP (LSP# 2 ).
  • a detour (bypass) route against occurrence of a link fault between the node A and the node B, a link fault between the node B and the node C or a node fault of the node B, is generated in a protection zone (between the node A, the node B and the node C) on the Protected LSP.
  • FIG. 27 is a diagram showing an outline of an FRR operation if a link fault occurs.
  • an assumption is that the link fault occurs in the protection zone between the node A and the node B.
  • the PLR node A
  • the MP node C
  • the MP transmits the incoming data traffic via the node D toward the node T.
  • the data traffic from the node H is carried to the node T via the Backup LSP defined as the detour route when the link fault occurs in the protection zone.
  • This switching operation can be executed fast and is therefore called FRR (Fast ReRoute).
  • FIG. 28 is a diagram showing an outline of an FRR operation when recovered from the link fault. It is assumed that the protection zone between the node A and the node B is recovered from the link fault (the link fault is obviated).
  • the PLR when recognizing the recovery from the link fault and that the zone between the node A and the node B reverts to the normal state owing to the signaling, the data traffic from the node H is switched back to the Protected LSP side from the Backup LSP side.
  • the data traffic from the node H is carried from the node H to the node T via the node A, the node B and the node C.
  • the Backup LSP might not be more optimal path than the Protected LSP (in terms of a delay and a bandwidth). Hence, in order to transmit the data traffic invariably along the optimal path (in terms of the delay and the bandwidth), the path is switched back to the Protected LSP from the Backup LSP.
  • FIG. 29 is a diagram showing an operational example when a new LSP is set up in the protection zone during the occurrence of the fault.
  • the link fault occurs between the node A and the node B.
  • the data traffic from the node H defined as the Ingress node of the Protected LSP is transmitted from the node H to the node T as the Egress node via the node A, the node D and the node C.
  • a resource between the node B and the node C is released, Thereafter, a node X is set as the Ingress node, and, when trying to set up an LSP# 3 extending from the node X down to a node Y as the Egress node via the node B and the node C, the LSP# 3 is normally set up because of the free resource between the node B and the node C.
  • FIG. 30 is a diagram showing an operational example if a resource conflict arises due to the setup of the new LSP during the occurrence of the fault in the protection zone.
  • the LSP# 3 is set up from the node A serving as the Ingress node down to the node Y as the Egress node via the node B and the node C.
  • the PLR node A
  • the PLR node A
  • the PLR node A
  • the PLR node A
  • the PLR node A
  • the node B receiving the Path Message notifies the node A by a Path Error Message that the Protected LSP can not be set up because of no resource between the node B and the node C.
  • the Protected LSP for the Local Revertive cannot be set up, and the detoured data traffic cannot be switched back. This is because when the fault occurs in the Protected LSP, a downlink resource (e.g., the resource between the node B and the node C) with no occurrence of the fault is released (Path Tear).
  • a downlink resource e.g., the resource between the node B and the node C
  • the present invention adopts the following means in order to solve the problems given above.
  • a first mode of the present invention is a communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located at the ingress of the second communication path, comprising:
  • a checking unit checking whether a bandwidth from the ingress of the first communication path down to the egress thereof and a bandwidth from the ingress of the second communication path down to the egress thereof as a standby of a partial zone of the first communication path, are established or not; a route information management unit generating, when the checking unit confirms that the bandwidth from the ingress of the first communication path down to the egress thereof and the bandwidth from the ingress of the second communication path down to the egress thereof as the standby of the partial zone of the first communication path are established, route maintaining information for maintaining the bandwidth of the partial zone of the first communication path; and a transmission unit transmitting the route maintaining information generated by the route information management unit to the neighboring communication device on the side of the egress of the first communication path.
  • a second mode of the present invention is a communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located on the first communication path between the ingress and the egress of the second communication path, comprising:
  • a reception unit receiving route maintaining information for maintaining a bandwidth in a partial zone of the first communication path from the neighboring communication device on the side of the ingress of the first communication path; a route information management unit stored with the route maintaining information; and a transmission unit transmitting the route maintaining information to the neighboring communication device on the side of the egress of the first communication path.
  • a third mode of the present invention is a communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located at the egress of the second communication path, comprising:
  • a reception unit receiving route maintaining information for maintaining a bandwidth in a partial zone of the first communication path from the neighboring communication device on the side of the ingress of the first communication path; and a route information management unit stored with the route maintaining information.
  • the communication device residing in the zone with the standby communication path established can be notified of this purport.
  • the communication device may further comprise a reception unit receiving, from the neighboring communication device on the side of the egress of the first communication path, route error information showing occurrence of a link fault on the egress side from the neighboring communication device on the side of the egress of the first communication path, wherein when the checking unit confirms that the bandwidth from the ingress of the first communication path down to the egress thereof and the bandwidth from the ingress of the second communication path down to the egress thereof as the standby of the partial zone of the first communication path are established and when the reception unit receives, from the neighboring communication device on the side of the egress of the first communication path, the route error information showing the occurrence of the link fault on the egress side from the neighboring communication device on the side of the egress of the first communication path, the transmission unit may transmit the route maintaining information to the neighboring communication device on the side of the egress of the first communication path.
  • the transmission unit may transmit the route maintaining information stored in the route information management unit to the neighboring communication device on the side of the egress of the first communication path.
  • the bandwidth on the first communication path can be maintained by continuing to transmit the route maintaining information.
  • the present invention it is feasible to provide a technology enabling switch-back to the middle zone from the second communication path in the network system including the first communication path and the second communication path generated so as to bypass the middle zone of the first communication path, the data sent from the ingress of the first communication path being forwarded to the egress of the first communication path via the second communication path in place of the middle zone during the fault in the middle zone.
  • FIG. 1 is a view showing an example of a network architecture in a normal state.
  • FIG. 2 is a diagram showing a method of setting up a Protected LSP.
  • FIG. 3 is a diagram showing a method of setting up a Backup LSP.
  • FIG. 4 is a diagram showing signaling of the Protected LSP after the Backup LSP has been set up.
  • FIG. 5 is a diagram showing an operation in a state where a fault occurs in a protection zone.
  • FIG. 6 is a diagram showing an operation in a state of being recovered from the link fault in the protection zone.
  • FIG. 7 is a diagram illustrating an example of a configuration of a node.
  • FIG. 8 is a diagram showing a configuration when generating the Protected LSP.
  • FIG. 9 is a diagram showing a transmission Path Msg and Path State of individual nodes when setting up the Protected LSP.
  • FIG. 10 is a diagram showing a transmission Resv Msg and Resv State of individual nodes when setting up the Protected LSP.
  • FIG. 11 is a diagram showing a configuration after generating the Backup LSP.
  • FIG. 12 is a diagram showing the transmission Path Msg and Path State of the individual nodes after setting up the Backup LSP.
  • FIG. 13 is a diagram showing the transmission Resv Msg and Resv State of the individual nodes after setting up the Backup LSP.
  • FIG. 14 is a diagram showing processing conditions for adding and deleting an LPAO.
  • FIG. 15 is a diagram showing an operation when the fault occurs on the Protected LSP.
  • FIG. 16 is a diagram showing an operation when the fault occurs on the Protected LSP.
  • FIG. 17 is a diagram showing the transmission Path Msg and Path State of the respective nodes during the occurrence of the fault.
  • FIG. 18 is a diagram showing the transmission Resv Msg and Resv State of the respective nodes during the occurrence of the fault.
  • FIG. 19 is a diagram showing conditions for determining an operation of Refreshing the Path Message.
  • FIG. 20 is a diagram illustrating an operational example when requested to set up a new LSP (other than LSP# 1 and LSP# 2 ).
  • FIG. 21 is a diagram showing an operation when requested to delete the LSP during the occurrence of the fault on the Protected LSP.
  • FIG. 22 is a diagram the transmission Path Msg and Path State of the respective nodes after receiving the Path Tear Message.
  • FIG. 23 is a diagram showing the transmission Resv Msg and Resv State of the individual nodes after receiving the Path Tear Message.
  • FIG. 24 is a diagram showing conditions for an MP to transmit a Resv Tear Msg.
  • FIG. 25 is a diagram showing an operational configuration when the link fault occurs between a node B and a node C.
  • FIG. 26 is a diagram showing conditions for Refreshing the Path Message of the Protected LSP in a PLR.
  • FIG. 27 is a diagram showing an outline of an FRR operation (a case in which the link fault occurs in a protection zone).
  • FIG. 28 is a diagram showing the outline of the FRR operation (a case of being recovered from the fault in the protection zone).
  • FIG. 29 is a diagram showing an operational example when setting up a new LSP during the occurrence of the fault in the protection zone.
  • FIG. 30 is a diagram showing an operational example when a resource conflict arises due to the setup of the new LSP during the occurrence of the fault in the protection zone.
  • FIG. 1 is a view showing an example of a network architecture in a normal state.
  • An MPLS network sets up Protected LSP and Backup LSP as LSPs for FRR using PSVP-TE (RSVP-TE) signaling.
  • RSVP-TE PSVP-TE
  • Protected LSP (LSP# 1 ) is set up from a node H up to a node T via a node A, a node B and a node C.
  • the Backup LSP (LSP# 2 ) is set up from the node A up to the node C via the node D.
  • the node A is defined as a PLR (Point of Local Repair), and the node C is defined as an MP (Merge Point).
  • PLR Point of Local Repair
  • MP Merge Point
  • the PLR corresponds to a branch point of the Protected LSP
  • the MP corresponds to a merge point of the LSP.
  • the Backup LSP detours (bypasses) the PLR and the MP based on the Protected LSP.
  • FIG. 2 is a diagram showing a setup method of the Protected LSP.
  • the LSP is setup based on the RSVP-TE signaling.
  • the signaling protocol is a protocol for distributing a label.
  • the signaling protocol requests a necessary bandwidth on an arbitrary route while transmitting a Path Message to an Egress node from an Ingress node, and also request a label needed for forwarding the data. Further, the signaling protocol transmits a Resv Message (Reserve Message) defined as a response to the Path Message to the Ingress node from the Egress node along a route reversed to the Path Message, and meanwhile notifies of the label while ensuring the necessary bandwidth.
  • Resv Message Reserve Message
  • the Object of the Path Message contains a Session Object (SO), a Fast Reroute Object (FRO), a Session Attribute Object (SAO), an Explicit Route Object (ERO), and an HOP Object.
  • SO Session Object
  • FRO Fast Reroute Object
  • SAO Session Attribute Object
  • ERO Explicit Route Object
  • the SO is an Object for identifying a session of the LSP.
  • the SO is stored with pieces of information (IP addresses etc) of the Ingress node and the Egress node of the LSP.
  • the FRO is an Object which requests the setup with the LSP serving as the Protected LSP.
  • the FRO is stored with a bandwidth needed in the LSP.
  • the FRO is invariably contained in the Path Message of the Protected LSP.
  • the SAO is an Object representing a session attribute.
  • the SAO is stored with information for requesting Local Protection.
  • the ERO is an Object for explicitly specifying a route of the LSP.
  • the ERO is stored with an IP address of an Interface for receiving the Message.
  • the HOP Object is an Object showing a sender of the Message.
  • the HOP Object is stored with an IP address of an Interface for transmitting the Message.
  • the Object of the Resv Message contains the Session Object (SO), a Record Route Object (RRO) and an HOP Object.
  • SO Session Object
  • RRO Record Route Object
  • the SO is the Object for identifying the session of the LSP.
  • the SO is stored with the information (IP addresses etc) for specifying the Ingress node and the Egress node of the LSP.
  • the RRO is an Object showing a sender of the Message.
  • the RRO is stored with an IP address of an Interface for transmitting the Message. Further, the RRO is stored with reserved label information. Still further, the RRO is stored with information showing whether the Local Protection can be utilized or not.
  • the HOP Object is an Object showing a sender of the Message.
  • the HOP Object is the same as the HOP Object of the Path Message.
  • the Path Message and the Resv Message can contain other Objects that are not shown above.
  • the Path Message and the Resv Message are route information for reserving a resource (bandwidth) of the communication path and also route information for updating the reservation of the resource (bandwidth) of the communication path.
  • the node A when the node A receives the Path Message sent from the Ingress node (node H), the node A deletes one ERO (A-IF 1 ) and transmits the Path Message toward the downlink node (node B) by changing the HOP Object (A-IF 2 ). The node B and the node C execute the same process, thereby transmitting the Path Messages toward the downlink nodes.
  • the Egress node (node T) sends the Resv Message back to the uplink node (node C) as a response to the received Path Message.
  • the node C adds one RRO (C-IF 1 , Label 200 ) to the received Resv Message, and sends the Message back to the uplink node (node B) by changing the HOP Object (C-IF 1 ).
  • the node B and the node A transmit the Resv Message toward the uplink node by executing the same process.
  • the same information is transmitted to the same node at a fixed cycle (e.g., 30 seconds).
  • the transmitting operation at this fixed cycle is called “Refresh”.
  • the Refresh maintains the LSP that has been set up.
  • FIG. 3 is a diagram showing a setup method of the Backup LSP.
  • the Message used in the Backup LSP is basically the same as the Message employed in the Protected LSP shown in FIG. 2 .
  • the Path Message used in the Backup LSP does not, however, contain the FRO.
  • the Path Message is transmitted to the node C serving as the Egress node of the Backup LSP via the node D from the node A as the Ingress node of the Backup LSP.
  • the Resv Message is transmitted to the node A as the Ingress node of the Backup LSP via the node D from the node C as the Egress node of the Backup LSP.
  • the Backup LSP is set up and maintained by conducting the Refresh.
  • the node A as a PLR can recognize from receiving the Resv Message that the Backup LSP has been set up.
  • FIG. 4 is a diagram showing the signaling of the Protected LSP after setting up the Backup LSP.
  • the Backup LSP for the Protected LSP is set up.
  • the node A as the PLR notifies the Ingress node (node H) of the Protected LSP of a purport that the Backup LSP has been set up in the form of Local Protection available (LP available) information of the RRO. Through this notification, the Ingress node (node H) of the Protected LSP can recognize that the downlink and the downlink node are protected (Protection). In FIG. 4 , the Path Message and the Resv Message of the Backup LSP are omitted.
  • LP available Local Protection available
  • FIG. 5 is a diagram showing an operation in a state where a fault occurs in a protection zone.
  • the PLR switches over, after recognizing the link fault, the Path Message sent to the node B to the Backup LSP side in the same way as the data traffic is.
  • This Path Message is transmitted via the Backup LSP to the node C (MP)
  • the node B determines from the recognition of the fault in the uplink that the Path Message is not Refreshed any more from the node A, and therefore transmits a Path Tear Message to the downlink node C.
  • the Path Tear Message is a Message that requests a reserved resource with the Path Message to release.
  • the node C receiving the Path Tear Message deletes the reserved-and-related reservation information. Note that in the node C, the Path Message is Refreshed from the Backup LSP side, and hence the Path Message is Refreshed to the node T from the node C.
  • FIG. 6 is a diagram showing an operation in a state where the link is recovered from the fault in the protection zone.
  • the PLR (node A) transmits, after recognizing the recovery from the link fault, the Path Message toward the node B.
  • the node B receiving the Path Message transmits afresh the Path Message to the node C.
  • the node C sends the Resv Message to the node B, and the node B sends the Resv Message to the node A.
  • the PLR (node A) receiving the Resv Message recognizes that the Protected LSP gets recovered normally, then switches back the data traffic, and stops transmitting the Path Message which has been sent so far to the Backup LSP side. With this operation, the Local Revertive is completed.
  • the already-set-up Backup LSP between the node A, the node D and the node C becomes an unnecessary LSP and therefore needs deleting. It is required that an administrator needs to execute these processes each time the fault occurs. It is, however, feasible to avoid these complicated processes by conducting the Local Revertive.
  • the nodes can function as the Ingress node, the Egress node, a Transit node (relay node), the PLR, the MP, etc, depending on their allocated positions and so on.
  • FIG. 7 is a diagram showing an example of a configuration of the node.
  • a node 200 includes an external input/output IF (InterFace) unit 206 , a reception packet processing unit 202 , a transmission packet processing unit 204 , a reception Path State management unit 212 , a transmission Path Message management unit 214 , a reception Resv State management unit 222 , a transmission Resv Message management unit 224 , a label/route information management unit 230 and a label table & forwarding processing unit 240 .
  • IF InterFace
  • the external I/O IF unit 206 is an interface for control of the self-node and collecting the information.
  • the reception packet processing unit 202 checks whether an abnormal state exists in the packet received from the input interface or not. The reception packet processing unit 202 , if the received packet is normal, transmits the received packet to a proper management unit.
  • the reception packet processing unit 202 if the received packet is the Path Message, sends this received packet to the reception Path State management unit 212 .
  • the reception packet processing unit 202 if the received packet is the Resv Message, sends this received packet to the reception Resv State management unit 222 .
  • the reception packet processing unit 202 if the received packet is of main signal traffic, transmits this received packet to the label table & forwarding processing unit 240 .
  • FIG. 7 illustrates the two reception packet processing units 202 , however, the single reception packet processing unit may execute the processes given above.
  • the transmission packet processing unit 204 transmits, to the output interface, the packets received from the transmission Path Message management unit 214 , the transmission Resv Message management unit 224 or the label table & forwarding processing unit 240 .
  • FIG. 7 illustrates the two transmission packet processing units 204 , however, the single transmission packet processing unit may execute the processes given above.
  • the reception Path State management unit 212 queries the label/route information management unit 230 about whether the route information of the received Path Message is proper or not. Further, the reception Path State management unit 212 manages each Object of the received Path Message, and checks whether the Path State is periodically Refreshed.
  • the transmission Path Message management unit 214 when functioning as the Ingress node, generates the Path Message on the basis of the route information and the bandwidth information inputted from the external I/O IF unit 206 in order to set up the LSP.
  • the transmission Path Message management unit 214 when functioning as the Egress node, does not transmit the Path Message.
  • the transmission Path Message management unit 214 when functioning neither as the Ingress node nor as the Egress node but as the relay node (Transit node), generates the transmission Path Message based on the received Path Message. At this time, the transmission Path Message management unit 214 queries the label/route information management unit 230 about the route information.
  • the transmission Path Message management unit 214 when functioning as the PLR and when receiving the notification that the Backup LSP has been set up from the reception Path State management unit 212 , allocates an LPAO (Local Protection Available Object) to the LSP having the FRO.
  • LPAO Local Protection Available Object
  • the transmission Path Message management unit 214 when functioning as the MP and when receiving the LPAO, deletes the LPAO. If not the MP and when receiving the LPAO, the transmission Path Message management unit 214 lets the LPAO pass through as it is.
  • the transmission Path Message management unit 214 when recognizing the uplink fault, transmits the Path Tear Message to the downlink node.
  • the transmission Path Message management unit 214 does not, however, transmit the Path Tear Message to the downlink node with respect to the LSP having the LPAO.
  • the transmission Path Message management unit 214 can be realized as a reservation unit for reserving (ensuring) the LSP resource and also as a reservation updating unit for updating (maintaining) a reserved status of the LSP resource.
  • the reception Resv State management unit 222 transmits the label information of the receive Resv Message to the label/route information management unit 230 from the downlink node, and manages the received Resv State. On this occasion, the reception Resv State management unit 222 checks whether the Resv State is Refreshed at fixed time. Further, the reception Resv State management unit 222 , when the Backup LSP is set up, notifies the transmission Resv Message management unit 224 of this purport.
  • the transmission Resv Message management unit 224 when functioning as the Ingress node, does not transmit the Resv Message.
  • the transmission Resv Message management unit 224 when functioning as the Egress node or the Transit node, generates the transmission Resv Message based on the received Resv Message. At this time, the transmission Resv Message management unit 224 queries the label/route information management unit 230 about the to-be-allocated label information and route information.
  • the label/route information management unit 230 manages the label information and the route information.
  • the label/route information management unit 230 responds to the queries given from the respective blocks (the reception Path State management unit 212 , the transmission Path Message management unit 214 , the reception Resv State management unit 222 , the transmission Resv Message management unit 224 , the label table & forwarding processing unit 240 , etc).
  • the label/route information management unit 230 sends the label-related information to the label table & forwarding processing unit 240 .
  • the reception Path State management unit 212 , the transmission Path Message management unit 214 , the reception Resv State management unit 222 , the transmission Resv Message management unit 224 and the label/route information management unit 230 may be realized as one route information management unit.
  • the node can confirm from receiving the Path Message and the Resv Message of the LSP that the LSP resource is ensured.
  • the label table & forwarding processing unit 240 receives the label-related information from the label/route information management unit 230 and retains the label information in a label table.
  • the label table & forwarding processing unit 240 when functioning as the Ingress node and when receiving the packet from the reception packet processing unit 202 , determines a forwarding destination, then, thereafter, attaches a label to the packet and transmits the label-attached packet to the transmission packet processing unit 204 .
  • the label table & forwarding processing unit 240 when functioning as the Transit node and when receiving the packet from the reception packet processing unit 202 , determines, based on the label attached to the received packet, the forwarding destination, then reattaches a label to the packet, and transmits the label-reattached packet to the transmission packet processing unit 204 .
  • the label table & forwarding processing unit 240 when functioning as the Egress node and when receiving the packet from the reception packet processing unit 202 , determines, based on the label attached to the received packet, the forwarding destination, then removes the label from the packet, and transmits the label-removed packet to the transmission packet processing unit 204 .
  • FIG. 8 is a diagram showing a configuration when generating the Protected LSP.
  • the Protected LSP (LSP# 1 ) is set up extending from the node H (Ingress node) down to the node T (Egress node).
  • the Backup LSP is not yet set up.
  • FIG. 9 is a diagram showing a transmission Path Msg and Path State of each node when setting up the Protected LSP.
  • FIG. 10 is a diagram showing a transmission Resv Msg and Resv State of each node when setting up the Protected LSP.
  • the Protected LSP (LSP# 1 ) is set up from the node H (Ingress node) toward the node T (Egress node).
  • the network administrator explicitly designates the PLR and the MP as roles of the nodes within the network.
  • An assumption in FIG. 8 is that the node A is designated as the PLR, and the node C is designated as the MP.
  • the network administrator supplies the node H with information for setting up the Protected LSP (LSP# 1 ).
  • the external I/O IF unit 206 receives the information (e.g., the route information and the bandwidth information) for setting up the Protected LSP (LSP# 1 ) from the outside.
  • the external I/O IF unit 206 transmits the received information to the transmission Path Message management unit 214 .
  • the transmission Path State management unit 214 generates, based on the received information, the Path Message for setting up the Protected LSP (LSP# 1 ). This Path Message corresponds to a transmission Path Msg (Message) T 102 of the node H in FIG. 9 .
  • the transmission Path State management unit 214 transmits the generated Path Message to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Path Message toward the node A according to the Path Message.
  • the transmission Path Msg T 102 of the node H is recorded with the information necessary for generating the Path Message.
  • these necessary pieces of information are LSP identifying information, Session management information (SO), a request (FRO) for the bandwidth with respect to Fast Reroute, a request (SAO) for the Local Protection, explicit route information (ERO) and transmission Interface information (HOP).
  • SO Session management information
  • FRO request for the bandwidth with respect to Fast Reroute
  • SAO request
  • ERO explicit route information
  • HOP transmission Interface information
  • the node H generates, based on these pieces of information, the Path Message at the fixed cycle and transmits the Path Message (Refresh).
  • the transmission packet processing unit 204 receives the Path Message from the node H.
  • the transmission packet processing unit 204 since the received packet is the Path Message, transmits the received packet to the reception Path State management unit 212 .
  • the reception Path State management unit 212 of the node A queries the label/route information management unit 230 about whether the route information of the received Path Message is proper or not.
  • the reception Path State management unit 212 retains intactly the information of each Object of the received Path Message as Path State T 154 .
  • the reception Path State management unit 212 of the node A updates the Path State T 154 when receiving the next Path Message.
  • the reception Path State management unit 212 if the Path Message is not received for a predetermined period of time (e.g., 150 seconds, which may also be the same as the fixed time described above) from the node H, clears the information of each Object of the Path State T 154 .
  • a predetermined period of time e.g. 150 seconds, which may also be the same as the fixed time described above
  • the reception Path State management unit 212 transmits the received Path Message to the transmission Path Message management unit 214 .
  • the transmission Path Message management unit 214 of the node A receives the Path Message from the reception Path State management unit 212 .
  • the transmission Path Message management unit 214 deletes the reception IF information (A-IF 1 ) of the self node A from the ERO of the Path Message. Further, the transmission Path State management unit 214 changes the HOP Object of the Path Message to the transmission IF information (A-IF 2 ) of the self node A.
  • the transmission Path Message management unit 214 of the node A transmits the Path Message with the updated information to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Path Message toward the node B according to the Path Message.
  • the Path Message is received and, after executing the predetermined processes, transmitted to the next node.
  • the Path State and the transmission Path Msg are recorded, and the pieces of information such as the ERO and the HOP Object are sequentially updated.
  • the transmission packet processing unit 204 receives the Path Message from the node C.
  • the transmission packet processing unit 204 transmits the packet to the reception Path State management unit 212 .
  • the reception Path State management unit 212 of the node T queries the label/route information management unit 230 as to whether the route information of the received Path Message is proper or not.
  • the reception Path State management unit 212 retains intactly the information of each Object of the received Path Message as a Path State T 160 .
  • the reception Path State management unit 212 of the node T when receiving the next Path Message, updates the Path State T 160 .
  • the reception Path State management unit 212 if the Path Message is not received from the node C for the predetermined time, clears the information of each Object of the Path State T 160 .
  • FIG. 10 is a diagram showing the information of each node with respect to the Resv Message on the occasion of setting up the Protected LSP (LSP# 1 ).
  • This information contains the following items of information needed for generating the Resv Message.
  • the information is exemplified by the LSP identifying information, the Session management information (SO), the route information, the label information, record information (RRO) containing the Local Protection information, and the transmission Interface information (HOP).
  • the transmission Resv Message management unit 224 of the node T (Egress node) generates (Refresh), based on a transmission Resv Msg T 260 , the Resv Message at the fixed cycle.
  • the transmission Resv Message management unit 224 transmits the generated Resv Message to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the Resv Message received from the transmission Resv Message management unit 224 toward the node C based on the Resv Message.
  • the transmission packet processing unit 204 receives the Resv Message from the node T.
  • the transmission packet processing unit 204 since the received packet is the Resv Message, transmits the packet to the reception Resv State management unit 222 .
  • the reception Resv State management unit 222 retains intactly the information of each Object of the received Resv Message as a Resv State T 208 .
  • the reception Resv State management unit 222 of the node C extracts the label information from the received Resv Message.
  • the extracted label information is transmitted to the label/route information management unit 230 .
  • the label/route information management unit 230 transmits the label information received from the reception Resv State management unit 222 to the label table & forwarding processing unit 240 .
  • the label table & forwarding processing unit 240 retains the received label information in the label table.
  • the reception Resv State management unit 222 of the node C updates, when receiving the next Resv Message, a Resv State T 208 .
  • the reception Resv State management unit 222 if the Resv Message is not received from the node T for the predetermined time (e.g., 150 seconds, which may be the same as the fixed time described above), clears the information of each Object of the Resv State T 208 .
  • the reception Resv State management unit 222 transmits the received Resv Message to the transmission Resv Message management unit 224 .
  • the transmission Resv Message management unit 224 receives the Resv Message from the reception Resv State management unit 222 .
  • the transmission Resv Message management unit 224 adds transmission IF information (C-IF 1 ) and the label information ( 200 ) of the self node C to the RRO of the Resv Message. Further, the transmission Resv Message management unit 224 changes the HOP Object of the Resv Message to the transmission IF information (C-IF 1 ) of the self node C.
  • the transmission Resv Message management unit 224 transmits the Resv Message with the updated information to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Resv Message to the node B according to the Resv Message.
  • the Resv Message is received and, after executing the predetermined processes, transmitted.
  • the Resv State and the transmission Resv Msg are recorded, and the pieces of information such as the RRO and the HOP Object are sequentially updated.
  • the transmission packet processing unit 204 receives the Resv Message from the node A.
  • the transmission packet processing unit 204 transmits the packet to the reception Resv State management unit 222 .
  • the reception Resv State management unit 222 of the node H extracts the label information from the received Resv Message, and sends the extracted label information to the label/route information management unit 230 .
  • the reception Resv State management unit 222 retains intactly the information of each Object of the received Resv Message as Resv State T 202 .
  • Each node receives the Path Message and the Resv Message of the LSP and is thereby enabled to recognize that the LSP is set up, i.e., the resource is ensured.
  • the reception Resv State management unit 222 of the node H when receiving the next Resv Message, updates the Resv State T 202 .
  • the reception Resv State management unit 222 if the Resv Message is not received from the node A for the predetermined time, clears the information of each Object of the Resv State T 202 .
  • the node H receives the Resv Message and is thereby enabled to recognize that the Protected LSP is set up, i.e., the resource is ensured.
  • the Backup LSP is set up in the same way as setting up the Backup LSP in the example of the standard operation illustrated in FIG. 3 .
  • FIG. 11 is a diagram showing an outline of signaling of the Protected LSP after setting up the Protected LSP and the Backup LSP.
  • the Backup LSP for the Protected LSP is set up.
  • the Backup LSP (LSP# 2 ) is set up toward the node C via the node D from the node A.
  • the node A as the PLR upon a trigger that the Protected LSP and the Backup LSP have been set up, adds an LPAO (Local Protection Available Object) to the Path Message and transmits the Path Message to the downlink node.
  • LPAO Local Protection Available Object
  • the LPAO (Local Protection Available Object) is an Object showing that the Backup LSP is set up for the Protected LSP.
  • the LPAO is the Object that does not exist in the standard signaling message.
  • the LPAO is the Object, which is newly added according to the present embodiment.
  • the LPAO is transmitted between the PLR and the MP.
  • FIG. 12 is a diagram showing the transmission Path Msg and the Path State of the respective nodes after setting up the Backup LSP.
  • FIG. 13 is a diagram showing the transmission Resv Msg and the Resv State of the respective nodes after setting up the Backup LSP.
  • the reception Path State management unit 212 of the node A notifies the transmission Path Message management unit 214 that the Backup LSP is set up.
  • a check as to whether the Protected LSP and the Backup LSP are set up may be realized by way of a check unit of the node.
  • the transmission Path Message management unit 214 newly adds the LPAO to the LSP# 1 having the FRO of the transmission Path Msg ( FIG. 12 : a transmission Path Msg T 304 of the node A).
  • the transmission Path Message management unit 214 transmits the LPAO-added Path Message to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Path Message toward the node B according to the Path Message.
  • the transmission packet processing unit 204 receives the Path Message from the node A.
  • the transmission packet processing unit 204 sends the packet to the reception Path State management unit 212 .
  • the reception Path State management unit 212 of the node B queries the label/route information management unit 230 about whether the route information of the received Path Message is proper or not.
  • the reception Path State management unit 212 retains the information of each Object (containing the LPAO) of the received Path Message as a Path State T 356 as it is.
  • the reception Path State management unit 212 of the node B when receiving the next Path Message, updates the Path State.
  • the reception Path State management unit 212 if the Path Message is not received from the node A for the predetermined time, clears the information of each Object of the Path State T 356 .
  • the reception Path State management unit 212 of the node B sends the received Path Message to the transmission Path Message management unit 214 .
  • the transmission Path Message management unit 214 of the node B receives the Path Message from the reception Path State management unit 212 .
  • the transmission Path Message management unit 214 deletes reception IF information (B-IF 1 ) of the self-node B from the ERO of the Path Message. Further, the transmission Path Message management unit 214 changes the HOP Object of the Path Message to transmission IF information (B-IF 2 ) of the self-node B.
  • the transmission Path Message management unit 214 of the node B transmits the Path Message (containing the LPAO) with the updated information to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Path Message to the node C according to the Path Message.
  • the reception packet processing unit 202 receives the Path Message from the node B.
  • the reception packet processing unit 202 since the received packet is the Path Message, transmits the packet to the reception Path State management unit 212 .
  • the reception Path State management unit 212 of the node C queries the label/route information management unit 230 as to whether the route information of the received Path Message is proper or not.
  • the reception Path State management unit 212 retains the information of each Object (containing the LPAO) of the received Path Message as a Path State T 358 as it is.
  • the reception Path State management unit 212 of the node C when receiving the next Path Message, updates the Path State.
  • the reception Path State management unit 212 if the Path Message is not received from the node B for the predetermined time, clears the information of each Object of the Path State T 358 .
  • the reception Path State management unit 212 of the node C transmits the received Path Message to the transmission Path Message management unit 214 .
  • the transmission Path Message management unit 214 of the node C receives the Path Message from the reception Path State management unit 212 .
  • the transmission Path Message management unit 214 deletes reception IF information (C-IF 1 ) of the self-node C from the ERO of the Path Message. Further, the transmission Path Message management unit 214 changes the HOP Object of the Path Message to transmission IF information (C-IF 2 ) of the self-node C.
  • the transmission Path Message management unit 214 deletes the LPAO from the received Path Message, and retains the Path Message as transmission Path Msg ( FIG. 12 : transmission Path Msg T 308 of the node C).
  • the transmission Path Message management unit 214 of the node C transmits the Path Message with the updated information to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Path Message to the node T according to the Path Message.
  • FIG. 14 is a diagram showing add/delete processing conditions of the LPAO.
  • the self-node is the PLR, the Path Message containing the FRO is received, and the Backup LSP is set up, in which case the LPAO is added to the Path Message toward the downlink.
  • the self-node is the MP, and the Path Message containing the FRO is received, in which case the LPAO is deleted.
  • the node A as the PLR when recognizing that the Backup LSP is set up, notifies the node H as the Ingress node that the Local Protection becomes available (LP available) as shown in the RRO of the Resv Msg T 454 of the node A in FIG. 13 .
  • FIG. 15 is a view showing an outline of an operation when the link fault occurs on the Protected LSP.
  • the link fault occurs between the node A and the node B.
  • the node B recognizes that the Path Message is not Refreshed due to the link fault on the uplink.
  • the node B as the Path Message of the LSP has the FRO and the LPAO, does not release the resource based on the Path Tear Message but continues the Refresh operation to the downlink node (node C).
  • node C the resource between the node B and the node C with respect to the Protected LSP (LSP# 1 ) is maintained without being released. Namely, the release of the resource between the node B and the node C with respect to the Protected LSP (LSP# 1 ) is inhibited.
  • FIG. 16 is a view showing a configuration when the link fault occurs on the Protected LSP.
  • FIG. 17 is a diagram showing the transmission Path Msg and the Path State of the respective nodes during the occurrence of the link fault.
  • FIG. 18 is a diagram showing the transmission Resv Msg and the Resv State of the individual nodes during the occurrence of the link fault.
  • the node A as the PLR when recognizing the fault between the node A and the node B, switches over the data traffic to the Backup LSP side.
  • the node A as the PLR upon recognizing the fault between the node A and the node B, switches back the data traffic to the Backup LSP side.
  • the reception Resv State management unit 222 does not receive the Resv Message from the node B, whereby the node A can recognize the fault between the node A and the node B.
  • the node A thus detects the fault.
  • the node A switches over the Path Message sent to the node B side to the Backup LSP side.
  • the transmission Path Message management unit 214 of the node A changes the [B-IF 1 ] and [C-IF 1 ] of the ERO of the transmission Path Msg of the node A to [C-IF 3 ] and changes [A-IF 2 ] of the HOP to [A-IF 3 ] ( FIG. 17 : transmission Path Msg T 504 of the node A).
  • the transmission Path Message management unit 214 transmits the element-changed Path Message to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Path Message to the node C from the Backup LSP side according to the Path Message.
  • the transmission packet processing unit 204 receives the Path Message from the node A on the side of the Backup LSP.
  • the transmission packet processing unit 204 as the received packet is the Path Message, sends the packet to the reception Path State management unit 212 .
  • the reception Path State management unit 212 of the node C queries the label/route information management unit 230 about whether the route information of the received path is proper or not.
  • the reception Path State management unit 212 adds LSP# 1 -BU (BackUp) to the Path State, and retains the information of each Object of the received Path Message ( FIG. 17 : Path State T 558 of the node C).
  • the reception Path State management unit 212 of the node C transmits the received Path Message to the transmission Path Message management unit 214 .
  • the transmission Path Message management unit 214 of the node C receives the Path Message from the reception Path State management unit 212 .
  • the transmission Path Message management unit 214 deletes the reception IF information (C-IF 3 ) of the self-node C from the ERO of the Path Message. Further, the transmission Path Message management unit 214 changes the HOP Object of the Path Message to the transmission IF information (C-IF 2 ) of the self-node C.
  • the node C is the MP, and hence the transmission Path Message management unit 214 deletes the LPAO from the received Path Message.
  • the transmission Path Message management unit 214 transmits the Path Message with the updated information to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the received Path Message to the node T according to the Path Message.
  • the node B as the Transit node, when recognizing the fault between the node A and the node B, clears the Path State of the node B ( FIG. 17 : Path State T 556 of the node B).
  • the node B none of the Path Message being received by the reception Path State management unit 212 from the node A, can therefore recognize the fault between the node A and the node B.
  • the transmission Path Message management unit 214 of the node B maintains the transmission Path Msg T 506 of the node B as it is. This is because the transmission Path Message T 506 of the node B contains the FRO and LPAO and the continuous Refresh is required. With this scheme, as illustrated in FIG.
  • the node B continuously transmits the Path Message toward the node C even during the occurrence of the fault between the node A and the node B. It is therefore feasible to maintain the resource for the Protected LSP (LSP# 1 ) between the node B and the node C.
  • LSP# 1 Protected LSP
  • the node C receives the Path Message (LSP# 1 -BU) from the node A and the Path Message (LSP# 1 -P) from the node B.
  • FIG. 19 is a diagram showing a condition for determining whether the Transit node (e.g., the node C) residing in the protection zone continues the Refresh operation of the Path Message or not.
  • the Transit node residing in the protection zone if the uplink is normal and the Path Message is Refreshed from the uplink, the node Refreshes also the Path Message to the downlink.
  • the Transit node residing in the protection zone if the Path Message to be transmitted even if the abnormal state occurs in the uplink contains the FRO and the LPAO, the node Refreshes also the Path Message to the downlink. In cases other than this, the Path Tear is set without Refreshing.
  • the node C receives the Path Message from the Protected LSP side and from the Backup LSP side as well. Hence, as shown in the transmission Resv Msg T 658 of the node C in FIG. 18 , the Resv Message is sent to both of the node A and the node B.
  • the node A receives the Resv Message from the Backup LSP side.
  • the reception Resv State management unit 222 of the node A changes [C-IF 1 ] of the RRO of the Resv State of the node A to [C-IF 3 ] and changes the HOP to [B-IF 1 ] ( FIG. 18 : Resv State T 604 of the node A).
  • the reception Resv State management unit 222 sends the received Resv Message to the transmission Resv Message management unit 224 .
  • the transmission Resv Message management unit 224 of the node A receives the Resv Message from the reception Resv State management unit 222 .
  • the transmission Resv Message management unit 224 updates the transmission Resv Msg.
  • the transmission Resv Message management unit 224 transmits the Resv Message to the transmission packet processing unit 204 .
  • the transmission packet processing unit 204 sends the Resv Message toward the node H according to the Resv Message.
  • the resource of the Protected LSP can be maintained by use of the LPAO showing that the Backup LSP is set up for the Protected LSP.
  • the LPAO can be realized by route maintaining information.
  • the node A as the PLR upon recognizing the recovery from the link fault, transmits the Path Message toward the node B.
  • the node B receiving the Path Message sends the Path Message to the node C.
  • the node C transmits the Resv Message to the node B, and the node B sends the Resv Message to the node A.
  • the PLR (node A) receiving the Resv Message recognizes that the Protected LSP is normally recovered, then switches back the data traffic, and stops transmitting the Path Message sent toward the Backup LSP side.
  • the resource on the Protected LSP can be maintained, and therefore the data traffic can be switched back on the occasion of the recovery from the link fault.
  • the detection of the link fault can be realized by way of a detection unit.
  • the switch-back of the data traffic can be actualized by way of a switch control unit.
  • the maintenance of the resource of the Protected LSP can be realized by way of an inhibiting unit which inhibits the resource from being released.
  • FIG. 20 is a view showing an operational example when requested to set up a new LSP (other than LSP# 1 and LSP# 2 ).
  • an assumption is that an LSP# 3 extending from the node X down to the node Y via the node B and the node C is requested to be set up.
  • the node B receiving the Path Message of the LSP# 3 as there is no resource between the node B and the node C, notifies the node X by a Path Error Message that the LSP can not be set up.
  • the resource conflict between the Protected LSP (LSP# 1 ) and the LSP# 3 can be avoided (the priority is given to the resource of the Protected LSP (LSP# 1 )), and hence the Local Revertive can be surely done when recovered from the fault between the node A and the node B.
  • FIG. 21 is a view showing a configuration when the delete request of the LSP is made on the Protected LSP during the occurrence of the fault.
  • FIG. 22 is a diagram showing the transmission Path Msg and the Resv State of the individual nodes after receiving the Path Tear Message.
  • FIG. 23 is a diagram showing the transmission Resv Msg and the Resv State of the individual nodes after receiving the Path Tear Message.
  • the node H when receiving the delete request of the LSP# 1 , sends the Path Tear Message to the node T from the node H via the node A, the node D and the node C. According to this configuration, the resource of the LSP# 1 via the Backup LSP is released.
  • the node B can not receive the Path Tear Message from the uplink (the node A) due to the occurrence of the fault between the node A and the node B. Consequently, the resource between the node B and the node C is not released.
  • the node C as the MP upon a trigger that the node C receives the Path Tear Message from the Backup LSP side, transmits the Resv Tear Message toward the uplink node B.
  • the node B when receiving the Resv Tear Message, releases the resource between the node B and the node C. According to this configuration, the resource between the node B and the node C is released.
  • FIG. 24 is a diagram showing conditions under which the MP transmits the Resv Tear Message to the uplink on the side of the Protected LSP.
  • the self-node is the MP
  • the MP has the Path States of the Protected LSP and of the Backup LSP with respect to the same LSP and receives the Path Tear Message from the Backup LSP side, under which conditions the MP transmits the Resv Tear Message to the uplink on the side of the Protected LSP.
  • FIGS. 22 and 23 show the results of clearing all items of information about the LSP# 1 after the Path Tear.
  • FIG. 25 is a diagram showing a configuration in the case of the occurrence of the link fault between the node B and the node C.
  • the node A as the PLR can directly detect the abnormal state of the nearest downlink.
  • the node A recognizing the link fault between the node A and the node B switches over the data traffic and the Path Message to the Backup LSP side.
  • the node B transmits the Path Error Message toward the uplink node A.
  • the Path Error Message is route error information for notifying of the downlink fault etc.
  • the node A as the PLR receiving the Path Error Message from the node B recognizes the occurrence of the link fault on the downlink.
  • the node A switches over the data traffic and the Path Message sent to the node B to the Backup LSP side.
  • the Path Message sent from the node A to the node B contains the FRO and the LPAO, it is required that the resource between the node A and the node B be maintained.
  • the node A continues to transmit the Path Message also to the node B.
  • This operation enables the avoidance of the resource conflict with the LSP of the route built up by, e.g., the node Z, the node A, the node B and the node X.
  • FIG. 26 is a diagram showing conditions for Refreshing the Path Message of the Protected LSP on the PLR.
  • the uplink is normal, the Path Message is Refreshed from the uplink, the nearest downlink is normal, and the Path Error Message is not received from the downlink, in which case the Path Message is Refreshed only on the side of the Protected LSP.
  • the uplink is normal, the Path Message is Refreshed from the uplink, and the nearest downlink is abnormal, in which case the Path Message is Refreshed (switched over) on the side of the Backup LSP.
  • the uplink is normal, the Path Message is Refreshed from the uplink, the Path Message to be transmitted contains the FRO and the LPAO, the nearest downlink is normal, and the Path Error Message is received from the downlink, in which case the Path Message is Refreshed on the side of the Protected LSP and on the side of the Backup LSP.
  • the uplink is normal, the Path Message is Refreshed from the uplink, the Path Message to be transmitted contains neither the FRO nor the LPAO, the nearest downlink is normal, and the Path Error Message is received from the downlink, in which case the Path Message is Refreshed (switched over) on the side of the Backup LSP.
  • the Path Tear Message is transmitted.
  • the node serving as the PLR changes the Refresh operation of the Path Message corresponding to the fault status of the downlink, whereby the resource conflict between the Protected LSP and another LSP can be avoided.

Abstract

A communication device comprising: a checking unit checking whether a bandwidth from the ingress of first path down to the egress thereof and a bandwidth from the ingress of second path down to the egress thereof as a standby of a partial zone of first path, are established or not; a route information management unit generating, when the checking unit confirms that the bandwidth from the ingress of first path down to the egress thereof and the bandwidth from the ingress of second path down to the egress thereof as the standby of the partial zone of first path are established, route maintaining information for maintaining the bandwidth of the partial zone of first path; and a transmission unit transmitting the route maintaining information generated by the route information management unit to the neighboring communication device on the side of the egress of first path.

Description

  • This application claims the benefit of Japanese Patent Application No. 2007-227525 filed on Sep. 3, 2007 in the Japanese Patent Office, the disclosure of which is herein incorporated in its entirety by reference.
  • BACKGROUND OF THE INVENTION
  • 1. Field of the INVENTION
  • The present invention relates generally to a communication device and a network system in an MPLS (Multi Protocol Label Switching) network. The present invention relates more particularly to a communication device and a network system, which perform switching back based on a local Revertive system by setting up a communication path (LSP (Label Switched Path)) for an FRR (Fast ReRoute, which is a facility backup technique)) using RSVP-TE (Resource Reservation Protocol-Traffic Engineering).
  • 2. Description of the Related Art
  • The MPLS is a packet forwarding technique using the label switching system. The MPLS involves utilizing a piece of identifying information (label) having a short fixed length in place of an IP header as routing information when forwarding a packet received by a router from another router to a different router. An MPLS-based routing method is exemplified by the FRR. The FRR is a method of preparing a communication path employed as a standby path beforehand in the MPLS network, then switching over, if a fault occurs in an active communication path, the path to the standby path, and recovering the communications. The FRR prepares the standby path beforehand and enables the communications to be quickly recovered from the fault.
  • FIG. 1 is a view showing an example of a network architecture in a normal state. In the MPLS network, a Protected LSP (an LSP (active system LSP) to be protected) and a Backup LSP (a detour route (standby system LSP) for occurrence of a fault in the Protected LSP) are set up as LSPs for the FRR using the PSVP-TE (RSVP-TE) signaling. In FIG. 1, the Protected LSP (LSP#1) is set up extending from a node H down to a node T via a node A, a node B and a node C. Further, the Backup LSP (LSP#2) is set up from the node A down to the node C via the node D.
  • Herein, the head-end node of the LSP (which is the node H in the case of the LSP# 1 and is the node A in the case of the LSP #2) is referred to as an Ingress node, while the tail-end node of the LSP (which is the node T in the case of the LSP# 1 and is the node C in the case of the LSP #2) is termed an Egress node. Further, the node corresponding to a branch point of the LSP (which is the node A in FIG. 1) is called a PLR (Point of Local Repair), while the node corresponding to a merge point (confluent point) of the LSP (which is the node C in FIG. 1) is called an MP (Merge Point).
  • The node A is configured as the PLR explicitly, and the node C is configured as the MP explicitly, and thereafter the respective LSPs are set up. The Protected LSP is set up by assigning the node A serving as the Ingress node a piece of route information of a route extending from the node H down to the node T as the Egress node via the node A, the node B and the node C.
  • Moreover, similarly, the Backup LSP is set up by assigning the node A serving as the Ingress node a piece of route information of a route extending from the node A down to the node C as the Egress node via the node D. Thereafter, the PLR (node A) generates an associative relation between the Protected LSP and the Backup LSP, i.e., a pair relation between the Protected LSP (LSP#1) and the Backup LSP (LSP#2).
  • As a result, a detour (bypass) route against occurrence of a link fault between the node A and the node B, a link fault between the node B and the node C or a node fault of the node B, is generated in a protection zone (between the node A, the node B and the node C) on the Protected LSP.
  • In a normal state, data traffic from the node H is carried via the Protected LSP to the node T.
  • FIG. 27 is a diagram showing an outline of an FRR operation if a link fault occurs. As illustrated in FIG. 27, an assumption is that the link fault occurs in the protection zone between the node A and the node B. The PLR (node A), upon recognizing this link fault, switches over (reroute) the data traffic from the node H to the Backup LSP side. The MP (node C) transmits the incoming data traffic via the node D toward the node T. Thus, the data traffic from the node H is carried to the node T via the Backup LSP defined as the detour route when the link fault occurs in the protection zone. This switching operation can be executed fast and is therefore called FRR (Fast ReRoute).
  • FIG. 28 is a diagram showing an outline of an FRR operation when recovered from the link fault. It is assumed that the protection zone between the node A and the node B is recovered from the link fault (the link fault is obviated). The PLR, when recognizing the recovery from the link fault and that the zone between the node A and the node B reverts to the normal state owing to the signaling, the data traffic from the node H is switched back to the Protected LSP side from the Backup LSP side. The data traffic from the node H is carried from the node H to the node T via the node A, the node B and the node C.
  • This switch-back is referred to as a Local Revertive method. The Backup LSP might not be more optimal path than the Protected LSP (in terms of a delay and a bandwidth). Hence, in order to transmit the data traffic invariably along the optimal path (in terms of the delay and the bandwidth), the path is switched back to the Protected LSP from the Backup LSP.
  • FIG. 29 is a diagram showing an operational example when a new LSP is set up in the protection zone during the occurrence of the fault. In FIG. 29, the link fault occurs between the node A and the node B. During the occurrence of the link fault, the data traffic from the node H defined as the Ingress node of the Protected LSP is transmitted from the node H to the node T as the Egress node via the node A, the node D and the node C. At this time, a resource between the node B and the node C is released, Thereafter, a node X is set as the Ingress node, and, when trying to set up an LSP# 3 extending from the node X down to a node Y as the Egress node via the node B and the node C, the LSP# 3 is normally set up because of the free resource between the node B and the node C.
    • [Patent document 1] Japanese Patent Laid-Open Publication No. 2005-39362
    SUMMARY OF THE INVENTION
  • FIG. 30 is a diagram showing an operational example if a resource conflict arises due to the setup of the new LSP during the occurrence of the fault in the protection zone. As illustrated in FIG. 29, the LSP# 3 is set up from the node A serving as the Ingress node down to the node Y as the Egress node via the node B and the node C.
  • When recovered from the link fault occurring between the node A and the node B in FIG. 30 (the link fault is obviated), the PLR (node A) recognizing the recovery sends a Path Message for the Protected LSP to the node B. The node B receiving the Path Message notifies the node A by a Path Error Message that the Protected LSP can not be set up because of no resource between the node B and the node C. As a result, the Protected LSP for the Local Revertive cannot be set up, and the detoured data traffic cannot be switched back. This is because when the fault occurs in the Protected LSP, a downlink resource (e.g., the resource between the node B and the node C) with no occurrence of the fault is released (Path Tear).
  • It is an object of the present invention to provide a technology enabling switch-back to a middle zone from a second communication path in a network system including a first communication path and a second communication path generated so as to bypass the middle zone of the first communication path, data sent from an ingress of the first communication path being forwarded to an egress of the first communication path via the second communication path in place of the middle zone during a fault in the middle zone.
  • The present invention adopts the following means in order to solve the problems given above.
  • Namely, a first mode of the present invention is a communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located at the ingress of the second communication path, comprising:
  • a checking unit checking whether a bandwidth from the ingress of the first communication path down to the egress thereof and a bandwidth from the ingress of the second communication path down to the egress thereof as a standby of a partial zone of the first communication path, are established or not;
    a route information management unit generating, when the checking unit confirms that the bandwidth from the ingress of the first communication path down to the egress thereof and the bandwidth from the ingress of the second communication path down to the egress thereof as the standby of the partial zone of the first communication path are established, route maintaining information for maintaining the bandwidth of the partial zone of the first communication path; and
    a transmission unit transmitting the route maintaining information generated by the route information management unit to the neighboring communication device on the side of the egress of the first communication path.
  • Further, a second mode of the present invention is a communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located on the first communication path between the ingress and the egress of the second communication path, comprising:
  • a reception unit receiving route maintaining information for maintaining a bandwidth in a partial zone of the first communication path from the neighboring communication device on the side of the ingress of the first communication path;
    a route information management unit stored with the route maintaining information; and
    a transmission unit transmitting the route maintaining information to the neighboring communication device on the side of the egress of the first communication path.
  • Still further, a third mode of the present invention is a communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located at the egress of the second communication path, comprising:
  • a reception unit receiving route maintaining information for maintaining a bandwidth in a partial zone of the first communication path from the neighboring communication device on the side of the ingress of the first communication path; and
    a route information management unit stored with the route maintaining information.
  • According to the modes of the present invention, when the standby communication path is established in the partial zone of the main communication path, the communication device residing in the zone with the standby communication path established can be notified of this purport.
  • Moreover, according to the first mode of the present invention, the communication device may further comprise a reception unit receiving, from the neighboring communication device on the side of the egress of the first communication path, route error information showing occurrence of a link fault on the egress side from the neighboring communication device on the side of the egress of the first communication path, wherein when the checking unit confirms that the bandwidth from the ingress of the first communication path down to the egress thereof and the bandwidth from the ingress of the second communication path down to the egress thereof as the standby of the partial zone of the first communication path are established and when the reception unit receives, from the neighboring communication device on the side of the egress of the first communication path, the route error information showing the occurrence of the link fault on the egress side from the neighboring communication device on the side of the egress of the first communication path, the transmission unit may transmit the route maintaining information to the neighboring communication device on the side of the egress of the first communication path.
  • Furthermore, according to the second mode of the present invention, if the link fault occurs between the self communication device and the neighboring communication device on the side of the ingress of the first communication path, the transmission unit may transmit the route maintaining information stored in the route information management unit to the neighboring communication device on the side of the egress of the first communication path.
  • According to the modes of the present invention, if the link fault occurs on the first communication path, the bandwidth on the first communication path can be maintained by continuing to transmit the route maintaining information.
  • According to the present invention, it is feasible to provide a technology enabling switch-back to the middle zone from the second communication path in the network system including the first communication path and the second communication path generated so as to bypass the middle zone of the first communication path, the data sent from the ingress of the first communication path being forwarded to the egress of the first communication path via the second communication path in place of the middle zone during the fault in the middle zone.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 is a view showing an example of a network architecture in a normal state.
  • FIG. 2 is a diagram showing a method of setting up a Protected LSP.
  • FIG. 3 is a diagram showing a method of setting up a Backup LSP.
  • FIG. 4 is a diagram showing signaling of the Protected LSP after the Backup LSP has been set up.
  • FIG. 5 is a diagram showing an operation in a state where a fault occurs in a protection zone.
  • FIG. 6 is a diagram showing an operation in a state of being recovered from the link fault in the protection zone.
  • FIG. 7 is a diagram illustrating an example of a configuration of a node.
  • FIG. 8 is a diagram showing a configuration when generating the Protected LSP.
  • FIG. 9 is a diagram showing a transmission Path Msg and Path State of individual nodes when setting up the Protected LSP.
  • FIG. 10 is a diagram showing a transmission Resv Msg and Resv State of individual nodes when setting up the Protected LSP.
  • FIG. 11 is a diagram showing a configuration after generating the Backup LSP.
  • FIG. 12 is a diagram showing the transmission Path Msg and Path State of the individual nodes after setting up the Backup LSP.
  • FIG. 13 is a diagram showing the transmission Resv Msg and Resv State of the individual nodes after setting up the Backup LSP.
  • FIG. 14 is a diagram showing processing conditions for adding and deleting an LPAO.
  • FIG. 15 is a diagram showing an operation when the fault occurs on the Protected LSP.
  • FIG. 16 is a diagram showing an operation when the fault occurs on the Protected LSP.
  • FIG. 17 is a diagram showing the transmission Path Msg and Path State of the respective nodes during the occurrence of the fault.
  • FIG. 18 is a diagram showing the transmission Resv Msg and Resv State of the respective nodes during the occurrence of the fault.
  • FIG. 19 is a diagram showing conditions for determining an operation of Refreshing the Path Message.
  • FIG. 20 is a diagram illustrating an operational example when requested to set up a new LSP (other than LSP# 1 and LSP#2).
  • FIG. 21 is a diagram showing an operation when requested to delete the LSP during the occurrence of the fault on the Protected LSP.
  • FIG. 22 is a diagram the transmission Path Msg and Path State of the respective nodes after receiving the Path Tear Message.
  • FIG. 23 is a diagram showing the transmission Resv Msg and Resv State of the individual nodes after receiving the Path Tear Message.
  • FIG. 24 is a diagram showing conditions for an MP to transmit a Resv Tear Msg.
  • FIG. 25 is a diagram showing an operational configuration when the link fault occurs between a node B and a node C.
  • FIG. 26 is a diagram showing conditions for Refreshing the Path Message of the Protected LSP in a PLR.
  • FIG. 27 is a diagram showing an outline of an FRR operation (a case in which the link fault occurs in a protection zone).
  • FIG. 28 is a diagram showing the outline of the FRR operation (a case of being recovered from the fault in the protection zone).
  • FIG. 29 is a diagram showing an operational example when setting up a new LSP during the occurrence of the fault in the protection zone.
  • FIG. 30 is a diagram showing an operational example when a resource conflict arises due to the setup of the new LSP during the occurrence of the fault in the protection zone.
  • DETAILED DESCRIPTION OF THE INVENTION
  • An embodiment of the present invention will hereinafter be described with reference to the drawings. A configuration in the embodiment is an exemplification, and the present invention is not limited to the configuration in the embodiment.
  • Embodiment
  • FIG. 1 is a view showing an example of a network architecture in a normal state. An MPLS network sets up Protected LSP and Backup LSP as LSPs for FRR using PSVP-TE (RSVP-TE) signaling. In FIG. 1, Protected LSP (LSP#1) is set up from a node H up to a node T via a node A, a node B and a node C. Further, the Backup LSP (LSP#2) is set up from the node A up to the node C via the node D. The node A is defined as a PLR (Point of Local Repair), and the node C is defined as an MP (Merge Point). The PLR corresponds to a branch point of the Protected LSP, and the MP corresponds to a merge point of the LSP. Moreover, the Backup LSP detours (bypasses) the PLR and the MP based on the Protected LSP.
  • Standard Operational Example
  • To begin with, a standard operational example of the communication network in FIG. 1 will be described.
  • <<Setup of Protected LSP>>
  • FIG. 2 is a diagram showing a setup method of the Protected LSP. The LSP is setup based on the RSVP-TE signaling. The signaling protocol is a protocol for distributing a label. The signaling protocol requests a necessary bandwidth on an arbitrary route while transmitting a Path Message to an Egress node from an Ingress node, and also request a label needed for forwarding the data. Further, the signaling protocol transmits a Resv Message (Reserve Message) defined as a response to the Path Message to the Ingress node from the Egress node along a route reversed to the Path Message, and meanwhile notifies of the label while ensuring the necessary bandwidth.
  • An Object of the Path Message will be explained. The Object of the Path Message contains a Session Object (SO), a Fast Reroute Object (FRO), a Session Attribute Object (SAO), an Explicit Route Object (ERO), and an HOP Object.
  • The SO is an Object for identifying a session of the LSP. The SO is stored with pieces of information (IP addresses etc) of the Ingress node and the Egress node of the LSP.
  • The FRO is an Object which requests the setup with the LSP serving as the Protected LSP. The FRO is stored with a bandwidth needed in the LSP. The FRO is invariably contained in the Path Message of the Protected LSP.
  • The SAO is an Object representing a session attribute. The SAO is stored with information for requesting Local Protection.
  • The ERO is an Object for explicitly specifying a route of the LSP. The ERO is stored with an IP address of an Interface for receiving the Message.
  • The HOP Object is an Object showing a sender of the Message. The HOP Object is stored with an IP address of an Interface for transmitting the Message.
  • An Object of the Resv Message will be described. The Object of the Resv Message contains the Session Object (SO), a Record Route Object (RRO) and an HOP Object.
  • The SO is the Object for identifying the session of the LSP. In the same way as the SO of the Path Message is, the SO is stored with the information (IP addresses etc) for specifying the Ingress node and the Egress node of the LSP.
  • The RRO is an Object showing a sender of the Message. The RRO is stored with an IP address of an Interface for transmitting the Message. Further, the RRO is stored with reserved label information. Still further, the RRO is stored with information showing whether the Local Protection can be utilized or not.
  • The HOP Object is an Object showing a sender of the Message. The HOP Object is the same as the HOP Object of the Path Message.
  • The Path Message and the Resv Message can contain other Objects that are not shown above.
  • The Path Message and the Resv Message are route information for reserving a resource (bandwidth) of the communication path and also route information for updating the reservation of the resource (bandwidth) of the communication path.
  • As illustrated in FIG. 2, when the node A receives the Path Message sent from the Ingress node (node H), the node A deletes one ERO (A-IF1) and transmits the Path Message toward the downlink node (node B) by changing the HOP Object (A-IF2). The node B and the node C execute the same process, thereby transmitting the Path Messages toward the downlink nodes.
  • The Egress node (node T) sends the Resv Message back to the uplink node (node C) as a response to the received Path Message. The node C adds one RRO (C-IF1, Label200) to the received Resv Message, and sends the Message back to the uplink node (node B) by changing the HOP Object (C-IF1). The node B and the node A transmit the Resv Message toward the uplink node by executing the same process.
  • Thereafter, as for the Path Message and the Resv Message, in principle the same information is transmitted to the same node at a fixed cycle (e.g., 30 seconds). The transmitting operation at this fixed cycle is called “Refresh”. The Refresh maintains the LSP that has been set up.
  • <<Setup of Backup LSP>>
  • FIG. 3 is a diagram showing a setup method of the Backup LSP. The Message used in the Backup LSP is basically the same as the Message employed in the Protected LSP shown in FIG. 2. The Path Message used in the Backup LSP does not, however, contain the FRO.
  • The Path Message is transmitted to the node C serving as the Egress node of the Backup LSP via the node D from the node A as the Ingress node of the Backup LSP. On the other hand, the Resv Message is transmitted to the node A as the Ingress node of the Backup LSP via the node D from the node C as the Egress node of the Backup LSP. Thus, the Backup LSP is set up and maintained by conducting the Refresh.
  • The node A as a PLR can recognize from receiving the Resv Message that the Backup LSP has been set up.
  • <<Signaling of Protected LSP after the Setup of the Backup LSP>>
  • FIG. 4 is a diagram showing the signaling of the Protected LSP after setting up the Backup LSP. In the node serving as the PLR, the Backup LSP for the Protected LSP is set up.
  • The node A as the PLR notifies the Ingress node (node H) of the Protected LSP of a purport that the Backup LSP has been set up in the form of Local Protection available (LP available) information of the RRO. Through this notification, the Ingress node (node H) of the Protected LSP can recognize that the downlink and the downlink node are protected (Protection). In FIG. 4, the Path Message and the Resv Message of the Backup LSP are omitted.
  • <<Operation at Occurrence of Fault in Link>>
  • FIG. 5 is a diagram showing an operation in a state where a fault occurs in a protection zone. When the fault occurs in the link between the node A and the node B through which the Protected LSP passes, the PLR switches over, after recognizing the link fault, the Path Message sent to the node B to the Backup LSP side in the same way as the data traffic is. This Path Message is transmitted via the Backup LSP to the node C (MP)
  • On the other hand, the node B determines from the recognition of the fault in the uplink that the Path Message is not Refreshed any more from the node A, and therefore transmits a Path Tear Message to the downlink node C. The Path Tear Message is a Message that requests a reserved resource with the Path Message to release. The node C receiving the Path Tear Message deletes the reserved-and-related reservation information. Note that in the node C, the Path Message is Refreshed from the Backup LSP side, and hence the Path Message is Refreshed to the node T from the node C.
  • <<Operation when Recovered from Link Fault>>
  • FIG. 6 is a diagram showing an operation in a state where the link is recovered from the fault in the protection zone. The PLR (node A) transmits, after recognizing the recovery from the link fault, the Path Message toward the node B. The node B receiving the Path Message transmits afresh the Path Message to the node C. The node C sends the Resv Message to the node B, and the node B sends the Resv Message to the node A. The PLR (node A) receiving the Resv Message recognizes that the Protected LSP gets recovered normally, then switches back the data traffic, and stops transmitting the Path Message which has been sent so far to the Backup LSP side. With this operation, the Local Revertive is completed.
  • Herein, a purpose for executing the Local Revertive will be explained. Supposing that a link is, if another route exists, established between, e.g., the node A and anode X, after being switched over to the Backup LSP during the occurrence of the link fault between the node A and the node B, another LSP can be again set up on a route established by the node H, the node A, the node X, the node B, the node C and the node T. Thereafter again, however, a new Backup LSP must be prepared for this LSP (the nodes H, A, X, B, C and T). The already-set-up Backup LSP between the node A, the node D and the node C becomes an unnecessary LSP and therefore needs deleting. It is required that an administrator needs to execute these processes each time the fault occurs. It is, however, feasible to avoid these complicated processes by conducting the Local Revertive.
  • <Device>
  • <<Node>>
  • Next, the nodes in the present embodiment will be described. The nodes can function as the Ingress node, the Egress node, a Transit node (relay node), the PLR, the MP, etc, depending on their allocated positions and so on.
  • FIG. 7 is a diagram showing an example of a configuration of the node. A node 200 includes an external input/output IF (InterFace) unit 206, a reception packet processing unit 202, a transmission packet processing unit 204, a reception Path State management unit 212, a transmission Path Message management unit 214, a reception Resv State management unit 222, a transmission Resv Message management unit 224, a label/route information management unit 230 and a label table & forwarding processing unit 240.
  • (External I/O IF Unit)
  • The external I/O IF unit 206 is an interface for control of the self-node and collecting the information.
  • (Reception Packet Processing Unit)
  • The reception packet processing unit 202 checks whether an abnormal state exists in the packet received from the input interface or not. The reception packet processing unit 202, if the received packet is normal, transmits the received packet to a proper management unit.
  • The reception packet processing unit 202, if the received packet is the Path Message, sends this received packet to the reception Path State management unit 212. The reception packet processing unit 202, if the received packet is the Resv Message, sends this received packet to the reception Resv State management unit 222. The reception packet processing unit 202, if the received packet is of main signal traffic, transmits this received packet to the label table & forwarding processing unit 240.
  • FIG. 7 illustrates the two reception packet processing units 202, however, the single reception packet processing unit may execute the processes given above.
  • (Transmission Packet Processing Unit)
  • The transmission packet processing unit 204 transmits, to the output interface, the packets received from the transmission Path Message management unit 214, the transmission Resv Message management unit 224 or the label table & forwarding processing unit 240.
  • FIG. 7 illustrates the two transmission packet processing units 204, however, the single transmission packet processing unit may execute the processes given above.
  • (Reception Path State Management Unit)
  • The reception Path State management unit 212 queries the label/route information management unit 230 about whether the route information of the received Path Message is proper or not. Further, the reception Path State management unit 212 manages each Object of the received Path Message, and checks whether the Path State is periodically Refreshed.
  • (Transmission Path Message Management Unit)
  • The transmission Path Message management unit 214, when functioning as the Ingress node, generates the Path Message on the basis of the route information and the bandwidth information inputted from the external I/O IF unit 206 in order to set up the LSP.
  • The transmission Path Message management unit 214, when functioning as the Egress node, does not transmit the Path Message.
  • The transmission Path Message management unit 214, when functioning neither as the Ingress node nor as the Egress node but as the relay node (Transit node), generates the transmission Path Message based on the received Path Message. At this time, the transmission Path Message management unit 214 queries the label/route information management unit 230 about the route information.
  • The transmission Path Message management unit 214, when functioning as the PLR and when receiving the notification that the Backup LSP has been set up from the reception Path State management unit 212, allocates an LPAO (Local Protection Available Object) to the LSP having the FRO.
  • The transmission Path Message management unit 214, when functioning as the MP and when receiving the LPAO, deletes the LPAO. If not the MP and when receiving the LPAO, the transmission Path Message management unit 214 lets the LPAO pass through as it is.
  • The transmission Path Message management unit 214, when recognizing the uplink fault, transmits the Path Tear Message to the downlink node. The transmission Path Message management unit 214 does not, however, transmit the Path Tear Message to the downlink node with respect to the LSP having the LPAO.
  • The transmission Path Message management unit 214 can be realized as a reservation unit for reserving (ensuring) the LSP resource and also as a reservation updating unit for updating (maintaining) a reserved status of the LSP resource.
  • (Reception Resv State Management Unit)
  • The reception Resv State management unit 222 transmits the label information of the receive Resv Message to the label/route information management unit 230 from the downlink node, and manages the received Resv State. On this occasion, the reception Resv State management unit 222 checks whether the Resv State is Refreshed at fixed time. Further, the reception Resv State management unit 222, when the Backup LSP is set up, notifies the transmission Resv Message management unit 224 of this purport.
  • (Transmission Resv Message Management Unit)
  • The transmission Resv Message management unit 224, when functioning as the Ingress node, does not transmit the Resv Message.
  • The transmission Resv Message management unit 224, when functioning as the Egress node or the Transit node, generates the transmission Resv Message based on the received Resv Message. At this time, the transmission Resv Message management unit 224 queries the label/route information management unit 230 about the to-be-allocated label information and route information.
  • (Label/Route Information Management Unit)
  • The label/route information management unit 230 manages the label information and the route information. The label/route information management unit 230 responds to the queries given from the respective blocks (the reception Path State management unit 212, the transmission Path Message management unit 214, the reception Resv State management unit 222, the transmission Resv Message management unit 224, the label table & forwarding processing unit 240, etc). The label/route information management unit 230 sends the label-related information to the label table & forwarding processing unit 240.
  • The reception Path State management unit 212, the transmission Path Message management unit 214, the reception Resv State management unit 222, the transmission Resv Message management unit 224 and the label/route information management unit 230 may be realized as one route information management unit.
  • The node can confirm from receiving the Path Message and the Resv Message of the LSP that the LSP resource is ensured.
  • (Label Table & Forwarding Processing Unit)
  • The label table & forwarding processing unit 240 receives the label-related information from the label/route information management unit 230 and retains the label information in a label table.
  • The label table & forwarding processing unit 240, when functioning as the Ingress node and when receiving the packet from the reception packet processing unit 202, determines a forwarding destination, then, thereafter, attaches a label to the packet and transmits the label-attached packet to the transmission packet processing unit 204.
  • The label table & forwarding processing unit 240, when functioning as the Transit node and when receiving the packet from the reception packet processing unit 202, determines, based on the label attached to the received packet, the forwarding destination, then reattaches a label to the packet, and transmits the label-reattached packet to the transmission packet processing unit 204.
  • The label table & forwarding processing unit 240, when functioning as the Egress node and when receiving the packet from the reception packet processing unit 202, determines, based on the label attached to the received packet, the forwarding destination, then removes the label from the packet, and transmits the label-removed packet to the transmission packet processing unit 204.
  • Operational Example in Present Embodiment
  • Given below is an operational example of the communication network using the nodes described above.
  • When the fault occurs in the Protected LSP, a method of preventing the release of the resources of the downlink as viewed from an occurrence point of the fault by use of the LPAO, will be explained.
  • <<Setup of Protected LSP>>
  • FIG. 8 is a diagram showing a configuration when generating the Protected LSP. In FIG. 8, the Protected LSP (LSP#1) is set up extending from the node H (Ingress node) down to the node T (Egress node). The Backup LSP is not yet set up.
  • FIG. 9 is a diagram showing a transmission Path Msg and Path State of each node when setting up the Protected LSP.
  • FIG. 10 is a diagram showing a transmission Resv Msg and Resv State of each node when setting up the Protected LSP.
  • The Protected LSP (LSP#1) is set up from the node H (Ingress node) toward the node T (Egress node). The network administrator explicitly designates the PLR and the MP as roles of the nodes within the network. An assumption in FIG. 8 is that the node A is designated as the PLR, and the node C is designated as the MP. The network administrator supplies the node H with information for setting up the Protected LSP (LSP#1).
  • In the node H, the external I/O IF unit 206 receives the information (e.g., the route information and the bandwidth information) for setting up the Protected LSP (LSP#1) from the outside. The external I/O IF unit 206 transmits the received information to the transmission Path Message management unit 214.
  • The transmission Path State management unit 214 generates, based on the received information, the Path Message for setting up the Protected LSP (LSP#1). This Path Message corresponds to a transmission Path Msg (Message) T102 of the node H in FIG. 9.
  • The transmission Path State management unit 214 transmits the generated Path Message to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the received Path Message toward the node A according to the Path Message.
  • The transmission Path Msg T102 of the node H is recorded with the information necessary for generating the Path Message. For example, these necessary pieces of information are LSP identifying information, Session management information (SO), a request (FRO) for the bandwidth with respect to Fast Reroute, a request (SAO) for the Local Protection, explicit route information (ERO) and transmission Interface information (HOP). The node H generates, based on these pieces of information, the Path Message at the fixed cycle and transmits the Path Message (Refresh).
  • In the node A, the transmission packet processing unit 204 receives the Path Message from the node H. The transmission packet processing unit 204, since the received packet is the Path Message, transmits the received packet to the reception Path State management unit 212. The reception Path State management unit 212 of the node A queries the label/route information management unit 230 about whether the route information of the received Path Message is proper or not. The reception Path State management unit 212 retains intactly the information of each Object of the received Path Message as Path State T154.
  • The reception Path State management unit 212 of the node A updates the Path State T154 when receiving the next Path Message. The reception Path State management unit 212, if the Path Message is not received for a predetermined period of time (e.g., 150 seconds, which may also be the same as the fixed time described above) from the node H, clears the information of each Object of the Path State T154.
  • The reception Path State management unit 212 transmits the received Path Message to the transmission Path Message management unit 214.
  • The transmission Path Message management unit 214 of the node A receives the Path Message from the reception Path State management unit 212. The transmission Path Message management unit 214 deletes the reception IF information (A-IF1) of the self node A from the ERO of the Path Message. Further, the transmission Path State management unit 214 changes the HOP Object of the Path Message to the transmission IF information (A-IF2) of the self node A.
  • The transmission Path Message management unit 214 of the node A transmits the Path Message with the updated information to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the received Path Message toward the node B according to the Path Message.
  • Hereafter, in the case of the nodes B and C, in the same way as in the case of the node A, the Path Message is received and, after executing the predetermined processes, transmitted to the next node. In each of the nodes, the Path State and the transmission Path Msg are recorded, and the pieces of information such as the ERO and the HOP Object are sequentially updated.
  • In the node T (Egress node), the transmission packet processing unit 204 receives the Path Message from the node C. The transmission packet processing unit 204, as the received packet is the Path Message, transmits the packet to the reception Path State management unit 212.
  • The reception Path State management unit 212 of the node T queries the label/route information management unit 230 as to whether the route information of the received Path Message is proper or not. The reception Path State management unit 212 retains intactly the information of each Object of the received Path Message as a Path State T160.
  • The reception Path State management unit 212 of the node T, when receiving the next Path Message, updates the Path State T160. The reception Path State management unit 212, if the Path Message is not received from the node C for the predetermined time, clears the information of each Object of the Path State T160.
  • FIG. 10 is a diagram showing the information of each node with respect to the Resv Message on the occasion of setting up the Protected LSP (LSP#1). This information contains the following items of information needed for generating the Resv Message. For example, the information is exemplified by the LSP identifying information, the Session management information (SO), the route information, the label information, record information (RRO) containing the Local Protection information, and the transmission Interface information (HOP).
  • The transmission Resv Message management unit 224 of the node T (Egress node) generates (Refresh), based on a transmission Resv Msg T260, the Resv Message at the fixed cycle. The transmission Resv Message management unit 224 transmits the generated Resv Message to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the Resv Message received from the transmission Resv Message management unit 224 toward the node C based on the Resv Message.
  • In the node C (Transit node), the transmission packet processing unit 204 receives the Resv Message from the node T. The transmission packet processing unit 204, since the received packet is the Resv Message, transmits the packet to the reception Resv State management unit 222.
  • The reception Resv State management unit 222 retains intactly the information of each Object of the received Resv Message as a Resv State T208. The reception Resv State management unit 222 of the node C extracts the label information from the received Resv Message. The extracted label information is transmitted to the label/route information management unit 230. The label/route information management unit 230 transmits the label information received from the reception Resv State management unit 222 to the label table & forwarding processing unit 240. The label table & forwarding processing unit 240 retains the received label information in the label table.
  • The reception Resv State management unit 222 of the node C updates, when receiving the next Resv Message, a Resv State T208. The reception Resv State management unit 222, if the Resv Message is not received from the node T for the predetermined time (e.g., 150 seconds, which may be the same as the fixed time described above), clears the information of each Object of the Resv State T208.
  • The reception Resv State management unit 222 transmits the received Resv Message to the transmission Resv Message management unit 224.
  • The transmission Resv Message management unit 224 receives the Resv Message from the reception Resv State management unit 222. The transmission Resv Message management unit 224 adds transmission IF information (C-IF1) and the label information (200) of the self node C to the RRO of the Resv Message. Further, the transmission Resv Message management unit 224 changes the HOP Object of the Resv Message to the transmission IF information (C-IF1) of the self node C.
  • The transmission Resv Message management unit 224 transmits the Resv Message with the updated information to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the received Resv Message to the node B according to the Resv Message.
  • Hereafter, in the case of the nodes B and A, in the same way as in the case of the node C, the Resv Message is received and, after executing the predetermined processes, transmitted. In each of the nodes, the Resv State and the transmission Resv Msg are recorded, and the pieces of information such as the RRO and the HOP Object are sequentially updated.
  • In the node H (Ingress node), the transmission packet processing unit 204 receives the Resv Message from the node A. The transmission packet processing unit 204, as the received packet is the Resv Message, transmits the packet to the reception Resv State management unit 222.
  • The reception Resv State management unit 222 of the node H extracts the label information from the received Resv Message, and sends the extracted label information to the label/route information management unit 230. The reception Resv State management unit 222 retains intactly the information of each Object of the received Resv Message as Resv State T202.
  • Each node receives the Path Message and the Resv Message of the LSP and is thereby enabled to recognize that the LSP is set up, i.e., the resource is ensured.
  • The reception Resv State management unit 222 of the node H, when receiving the next Resv Message, updates the Resv State T202. The reception Resv State management unit 222, if the Resv Message is not received from the node A for the predetermined time, clears the information of each Object of the Resv State T202.
  • The node H receives the Resv Message and is thereby enabled to recognize that the Protected LSP is set up, i.e., the resource is ensured.
  • <<Setup of Backup LSP>>
  • The Backup LSP is set up in the same way as setting up the Backup LSP in the example of the standard operation illustrated in FIG. 3.
  • <<Signaling of Protected LSP after Setup of Backup LSP>>
  • FIG. 11 is a diagram showing an outline of signaling of the Protected LSP after setting up the Protected LSP and the Backup LSP. In the node A serving as PLR, the Backup LSP for the Protected LSP is set up. The Backup LSP (LSP#2) is set up toward the node C via the node D from the node A.
  • The node A as the PLR, upon a trigger that the Protected LSP and the Backup LSP have been set up, adds an LPAO (Local Protection Available Object) to the Path Message and transmits the Path Message to the downlink node. The node B serving as the Transit node let the LPAO pass through as it is, and the node C as the MP deletes this LPAO from the Path Message and transmits the Path Message to the downlink node.
  • Herein, the LPAO (Local Protection Available Object) is an Object showing that the Backup LSP is set up for the Protected LSP. The LPAO is the Object that does not exist in the standard signaling message. The LPAO is the Object, which is newly added according to the present embodiment. The LPAO is transmitted between the PLR and the MP.
  • FIG. 12 is a diagram showing the transmission Path Msg and the Path State of the respective nodes after setting up the Backup LSP.
  • FIG. 13 is a diagram showing the transmission Resv Msg and the Resv State of the respective nodes after setting up the Backup LSP.
  • When the node A as the PLR recognizes that the Backup LSP is set up, the reception Path State management unit 212 of the node A notifies the transmission Path Message management unit 214 that the Backup LSP is set up.
  • A check as to whether the Protected LSP and the Backup LSP are set up may be realized by way of a check unit of the node.
  • The transmission Path Message management unit 214 newly adds the LPAO to the LSP# 1 having the FRO of the transmission Path Msg (FIG. 12: a transmission Path Msg T304 of the node A). The transmission Path Message management unit 214 transmits the LPAO-added Path Message to the transmission packet processing unit 204.
  • The transmission packet processing unit 204 sends the received Path Message toward the node B according to the Path Message.
  • In the node B serving as the Transit node, the transmission packet processing unit 204 receives the Path Message from the node A. The transmission packet processing unit 204, as the received packet is the Path Message, sends the packet to the reception Path State management unit 212.
  • The reception Path State management unit 212 of the node B queries the label/route information management unit 230 about whether the route information of the received Path Message is proper or not. The reception Path State management unit 212 retains the information of each Object (containing the LPAO) of the received Path Message as a Path State T356 as it is.
  • The reception Path State management unit 212 of the node B, when receiving the next Path Message, updates the Path State. The reception Path State management unit 212, if the Path Message is not received from the node A for the predetermined time, clears the information of each Object of the Path State T356.
  • The reception Path State management unit 212 of the node B sends the received Path Message to the transmission Path Message management unit 214.
  • The transmission Path Message management unit 214 of the node B receives the Path Message from the reception Path State management unit 212. The transmission Path Message management unit 214 deletes reception IF information (B-IF1) of the self-node B from the ERO of the Path Message. Further, the transmission Path Message management unit 214 changes the HOP Object of the Path Message to transmission IF information (B-IF2) of the self-node B.
  • The transmission Path Message management unit 214 of the node B transmits the Path Message (containing the LPAO) with the updated information to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the received Path Message to the node C according to the Path Message.
  • In the node C serving as the MP, the reception packet processing unit 202 receives the Path Message from the node B. The reception packet processing unit 202, since the received packet is the Path Message, transmits the packet to the reception Path State management unit 212.
  • The reception Path State management unit 212 of the node C queries the label/route information management unit 230 as to whether the route information of the received Path Message is proper or not. The reception Path State management unit 212 retains the information of each Object (containing the LPAO) of the received Path Message as a Path State T358 as it is.
  • The reception Path State management unit 212 of the node C, when receiving the next Path Message, updates the Path State. The reception Path State management unit 212, if the Path Message is not received from the node B for the predetermined time, clears the information of each Object of the Path State T358.
  • The reception Path State management unit 212 of the node C transmits the received Path Message to the transmission Path Message management unit 214.
  • The transmission Path Message management unit 214 of the node C receives the Path Message from the reception Path State management unit 212. The transmission Path Message management unit 214 deletes reception IF information (C-IF1) of the self-node C from the ERO of the Path Message. Further, the transmission Path Message management unit 214 changes the HOP Object of the Path Message to transmission IF information (C-IF2) of the self-node C.
  • The transmission Path Message management unit 214 deletes the LPAO from the received Path Message, and retains the Path Message as transmission Path Msg (FIG. 12: transmission Path Msg T308 of the node C).
  • The transmission Path Message management unit 214 of the node C transmits the Path Message with the updated information to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the received Path Message to the node T according to the Path Message.
  • FIG. 14 is a diagram showing add/delete processing conditions of the LPAO. The self-node is the PLR, the Path Message containing the FRO is received, and the Backup LSP is set up, in which case the LPAO is added to the Path Message toward the downlink. The self-node is the MP, and the Path Message containing the FRO is received, in which case the LPAO is deleted.
  • Furthermore, the node A as the PLR, when recognizing that the Backup LSP is set up, notifies the node H as the Ingress node that the Local Protection becomes available (LP available) as shown in the RRO of the Resv Msg T454 of the node A in FIG. 13.
  • <<Operation when Link Fault Occurs>>
  • FIG. 15 is a view showing an outline of an operation when the link fault occurs on the Protected LSP. In FIG. 15, the link fault occurs between the node A and the node B.
  • The node B recognizes that the Path Message is not Refreshed due to the link fault on the uplink. The node B, as the Path Message of the LSP has the FRO and the LPAO, does not release the resource based on the Path Tear Message but continues the Refresh operation to the downlink node (node C). With this scheme, it follows that the resource between the node B and the node C with respect to the Protected LSP (LSP#1) is maintained without being released. Namely, the release of the resource between the node B and the node C with respect to the Protected LSP (LSP#1) is inhibited.
  • FIG. 16 is a view showing a configuration when the link fault occurs on the Protected LSP.
  • FIG. 17 is a diagram showing the transmission Path Msg and the Path State of the respective nodes during the occurrence of the link fault.
  • FIG. 18 is a diagram showing the transmission Resv Msg and the Resv State of the individual nodes during the occurrence of the link fault.
  • The node A as the PLR, when recognizing the fault between the node A and the node B, switches over the data traffic to the Backup LSP side. The node A as the PLR, upon recognizing the fault between the node A and the node B, switches back the data traffic to the Backup LSP side. The reception Resv State management unit 222 does not receive the Resv Message from the node B, whereby the node A can recognize the fault between the node A and the node B. The node A thus detects the fault. The node A switches over the Path Message sent to the node B side to the Backup LSP side. At this time, the transmission Path Message management unit 214 of the node A changes the [B-IF1] and [C-IF1] of the ERO of the transmission Path Msg of the node A to [C-IF3] and changes [A-IF2] of the HOP to [A-IF3] (FIG. 17: transmission Path Msg T504 of the node A). The transmission Path Message management unit 214 transmits the element-changed Path Message to the transmission packet processing unit 204.
  • The transmission packet processing unit 204 sends the received Path Message to the node C from the Backup LSP side according to the Path Message.
  • In the node C, the transmission packet processing unit 204 receives the Path Message from the node A on the side of the Backup LSP. The transmission packet processing unit 204, as the received packet is the Path Message, sends the packet to the reception Path State management unit 212.
  • The reception Path State management unit 212 of the node C queries the label/route information management unit 230 about whether the route information of the received path is proper or not.
  • The reception Path State management unit 212 adds LSP#1-BU (BackUp) to the Path State, and retains the information of each Object of the received Path Message (FIG. 17: Path State T558 of the node C).
  • The reception Path State management unit 212 of the node C transmits the received Path Message to the transmission Path Message management unit 214.
  • The transmission Path Message management unit 214 of the node C receives the Path Message from the reception Path State management unit 212. The transmission Path Message management unit 214 deletes the reception IF information (C-IF3) of the self-node C from the ERO of the Path Message. Further, the transmission Path Message management unit 214 changes the HOP Object of the Path Message to the transmission IF information (C-IF2) of the self-node C. The node C is the MP, and hence the transmission Path Message management unit 214 deletes the LPAO from the received Path Message.
  • The transmission Path Message management unit 214 transmits the Path Message with the updated information to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the received Path Message to the node T according to the Path Message.
  • On the other hand, the node B as the Transit node, when recognizing the fault between the node A and the node B, clears the Path State of the node B (FIG. 17: Path State T556 of the node B). The node B, none of the Path Message being received by the reception Path State management unit 212 from the node A, can therefore recognize the fault between the node A and the node B. The transmission Path Message management unit 214 of the node B maintains the transmission Path Msg T506 of the node B as it is. This is because the transmission Path Message T506 of the node B contains the FRO and LPAO and the continuous Refresh is required. With this scheme, as illustrated in FIG. 16, the node B continuously transmits the Path Message toward the node C even during the occurrence of the fault between the node A and the node B. It is therefore feasible to maintain the resource for the Protected LSP (LSP#1) between the node B and the node C.
  • It follows that the node C receives the Path Message (LSP#1-BU) from the node A and the Path Message (LSP#1-P) from the node B.
  • FIG. 19 is a diagram showing a condition for determining whether the Transit node (e.g., the node C) residing in the protection zone continues the Refresh operation of the Path Message or not. In the Transit node residing in the protection zone, if the uplink is normal and the Path Message is Refreshed from the uplink, the node Refreshes also the Path Message to the downlink. In the Transit node residing in the protection zone, if the Path Message to be transmitted even if the abnormal state occurs in the uplink contains the FRO and the LPAO, the node Refreshes also the Path Message to the downlink. In cases other than this, the Path Tear is set without Refreshing.
  • During the occurrence of the fault between the node A and the node B, the node C receives the Path Message from the Protected LSP side and from the Backup LSP side as well. Hence, as shown in the transmission Resv Msg T658 of the node C in FIG. 18, the Resv Message is sent to both of the node A and the node B.
  • Further, the node A receives the Resv Message from the Backup LSP side. The reception Resv State management unit 222 of the node A changes [C-IF1] of the RRO of the Resv State of the node A to [C-IF3] and changes the HOP to [B-IF1] (FIG. 18: Resv State T604 of the node A). The reception Resv State management unit 222 sends the received Resv Message to the transmission Resv Message management unit 224.
  • The transmission Resv Message management unit 224 of the node A receives the Resv Message from the reception Resv State management unit 222. The transmission Resv Message management unit 224 updates the transmission Resv Msg. The transmission Resv Message management unit 224 transmits the Resv Message to the transmission packet processing unit 204. The transmission packet processing unit 204 sends the Resv Message toward the node H according to the Resv Message. These operations enable avoidance of a conflict among the resources during the occurrence of the fault.
  • The resource of the Protected LSP can be maintained by use of the LPAO showing that the Backup LSP is set up for the Protected LSP. The LPAO can be realized by route maintaining information.
  • The node A as the PLR, upon recognizing the recovery from the link fault, transmits the Path Message toward the node B. The node B receiving the Path Message sends the Path Message to the node C. The node C transmits the Resv Message to the node B, and the node B sends the Resv Message to the node A. The PLR (node A) receiving the Resv Message recognizes that the Protected LSP is normally recovered, then switches back the data traffic, and stops transmitting the Path Message sent toward the Backup LSP side.
  • According to this configuration, during even the occurrence of the link fault, the resource on the Protected LSP can be maintained, and therefore the data traffic can be switched back on the occasion of the recovery from the link fault.
  • The detection of the link fault can be realized by way of a detection unit. The switch-back of the data traffic can be actualized by way of a switch control unit. The maintenance of the resource of the Protected LSP can be realized by way of an inhibiting unit which inhibits the resource from being released.
  • <<Operation when Requested to Set Up New LSP>>
  • FIG. 20 is a view showing an operational example when requested to set up a new LSP (other than LSP# 1 and LSP#2).
  • As shown in FIG. 20, an assumption is that an LSP# 3 extending from the node X down to the node Y via the node B and the node C is requested to be set up. At this time, the node B receiving the Path Message of the LSP# 3, as there is no resource between the node B and the node C, notifies the node X by a Path Error Message that the LSP can not be set up. As a result, in the node B, the resource conflict between the Protected LSP (LSP#1) and the LSP# 3 can be avoided (the priority is given to the resource of the Protected LSP (LSP#1)), and hence the Local Revertive can be surely done when recovered from the fault between the node A and the node B.
  • <<Operation if Delete Request of LSP is Made on Protected LSP during Occurrence of Link Fault>>
  • An operation in the case of receiving a delete request (Path Tear) of the LSP on the Protected LSP during the occurrence of the fault, will be explained.
  • FIG. 21 is a view showing a configuration when the delete request of the LSP is made on the Protected LSP during the occurrence of the fault.
  • FIG. 22 is a diagram showing the transmission Path Msg and the Resv State of the individual nodes after receiving the Path Tear Message.
  • FIG. 23 is a diagram showing the transmission Resv Msg and the Resv State of the individual nodes after receiving the Path Tear Message.
  • The node H, when receiving the delete request of the LSP# 1, sends the Path Tear Message to the node T from the node H via the node A, the node D and the node C. According to this configuration, the resource of the LSP# 1 via the Backup LSP is released.
  • The node B can not receive the Path Tear Message from the uplink (the node A) due to the occurrence of the fault between the node A and the node B. Consequently, the resource between the node B and the node C is not released. Such being the case, for avoiding the maintenance of the unnecessary resource, the node C as the MP, upon a trigger that the node C receives the Path Tear Message from the Backup LSP side, transmits the Resv Tear Message toward the uplink node B. The node B, when receiving the Resv Tear Message, releases the resource between the node B and the node C. According to this configuration, the resource between the node B and the node C is released.
  • FIG. 24 is a diagram showing conditions under which the MP transmits the Resv Tear Message to the uplink on the side of the Protected LSP. The self-node is the MP, the MP has the Path States of the Protected LSP and of the Backup LSP with respect to the same LSP and receives the Path Tear Message from the Backup LSP side, under which conditions the MP transmits the Resv Tear Message to the uplink on the side of the Protected LSP. FIGS. 22 and 23 show the results of clearing all items of information about the LSP# 1 after the Path Tear.
  • According to this configuration, it is possible to handle the delete request of the LSP, which is received when switched over to the Backup LSP.
  • <<Operation if Link Fault Occurs between Node B and Node C>>
  • An operation (a method of preventing the uplink resource from being released at a point where the link fault occurs) if the link fault occurs not nearest to the node A as the PLR described above but between the node B and the node C, will be explained.
  • FIG. 25 is a diagram showing a configuration in the case of the occurrence of the link fault between the node B and the node C.
  • As described above, when the link fault occurs between the node A and the node B, the node A as the PLR can directly detect the abnormal state of the nearest downlink. The node A recognizing the link fault between the node A and the node B switches over the data traffic and the Path Message to the Backup LSP side.
  • On the other hand, as shown in FIG. 25, if the link fault occurs between the node B and the node C, the node B transmits the Path Error Message toward the uplink node A. The Path Error Message is route error information for notifying of the downlink fault etc. The node A as the PLR receiving the Path Error Message from the node B recognizes the occurrence of the link fault on the downlink. The node A switches over the data traffic and the Path Message sent to the node B to the Backup LSP side. Moreover, if the Path Message sent from the node A to the node B contains the FRO and the LPAO, it is required that the resource between the node A and the node B be maintained. Therefore, the node A continues to transmit the Path Message also to the node B. This operation enables the avoidance of the resource conflict with the LSP of the route built up by, e.g., the node Z, the node A, the node B and the node X.
  • FIG. 26 is a diagram showing conditions for Refreshing the Path Message of the Protected LSP on the PLR.
  • In the node serving as the PLR, the uplink is normal, the Path Message is Refreshed from the uplink, the nearest downlink is normal, and the Path Error Message is not received from the downlink, in which case the Path Message is Refreshed only on the side of the Protected LSP.
  • In the node serving as the PLR, the uplink is normal, the Path Message is Refreshed from the uplink, and the nearest downlink is abnormal, in which case the Path Message is Refreshed (switched over) on the side of the Backup LSP.
  • In the node serving as the PLR, the uplink is normal, the Path Message is Refreshed from the uplink, the Path Message to be transmitted contains the FRO and the LPAO, the nearest downlink is normal, and the Path Error Message is received from the downlink, in which case the Path Message is Refreshed on the side of the Protected LSP and on the side of the Backup LSP.
  • In the node serving as the PLR, the uplink is normal, the Path Message is Refreshed from the uplink, the Path Message to be transmitted contains neither the FRO nor the LPAO, the nearest downlink is normal, and the Path Error Message is received from the downlink, in which case the Path Message is Refreshed (switched over) on the side of the Backup LSP.
  • In the node serving as the PLR, if the uplink is abnormal, the Path Tear Message is transmitted.
  • According to this configuration, the node serving as the PLR changes the Refresh operation of the Path Message corresponding to the fault status of the downlink, whereby the resource conflict between the Protected LSP and another LSP can be avoided.

Claims (10)

1. A communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located at the ingress of the second communication path, comprising:
a checking unit checking whether a bandwidth from the ingress of the first communication path down to the egress thereof and a bandwidth from the ingress of the second communication path down to the egress thereof as a standby of a partial zone of the first communication path, are established or not;
a route information management unit generating, when the checking unit confirms that the bandwidth from the ingress of the first communication path down to the egress thereof and the bandwidth from the ingress of the second communication path down to the egress thereof as the standby of the partial zone of the first communication path are established, route maintaining information for maintaining the bandwidth of the partial zone of the first communication path; and
a transmission unit transmitting the route maintaining information generated by the route information management unit to the neighboring communication device on the side of the egress of the first communication path.
2. A communication device according to claim 1, further comprising a reception unit receiving, from the neighboring communication device on the side of the egress of the first communication path, route error information showing occurrence of a link fault on the egress side from the neighboring communication device on the side of the egress of the first communication path,
wherein when the checking unit confirms that the bandwidth from the ingress of the first communication path down to the egress thereof and the bandwidth from the ingress of the second communication path down to the egress thereof as the standby of the partial zone of the first communication path are established and when the reception unit receives, from the neighboring communication device on the side of the egress of the first communication path, the route error information showing the occurrence of the link fault on the egress side from the neighboring communication device on the side of the egress of the first communication path, the transmission unit transmits the route maintaining information to the neighboring communication device on the side of the egress of the first communication path.
3. A communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located on the first communication path between the ingress and the egress of the second communication path, comprising:
a reception unit receiving route maintaining information for maintaining a bandwidth in a partial zone of the first communication path from the neighboring communication device on the side of the ingress of the first communication path;
a route information management unit stored with the route maintaining information; and
a transmission unit transmitting the route maintaining information to the neighboring communication device on the side of the egress of the first communication path.
4. A communication device according to claim 3, wherein if the link fault occurs between the self communication device and the neighboring communication device on the side of the ingress of the first communication path, the transmission unit transmits the route maintaining information stored in the route information management unit to the neighboring communication device on the side of the egress of the first communication path.
5. A communication device according to claim 3, wherein when the reception unit receives delete request information for deleting the bandwidth of the first communication path from the neighboring communication device on the side of the egress of the first communication path, the route information management unit deletes the route maintaining information.
6. A communication device according to claim 3, wherein if the link fault occurs between the self communication device and the neighboring communication device on the side of the egress of the first communication path, the transmission unit transmits route error information showing the occurrence of the link fault on the side of the egress of the first communication path to the neighboring communication device on the side of the ingress of the first communication path.
7. A communication device, in a communication network including: a first communication path, along which a plurality of communication devices is cascade-connected, having an ingress and an egress; and a second communication path, along which the plurality of communication devices is cascade-connected, the communication devices existing both ends thereof being different from each other on the first communication path, having its ingress corresponding to the communication device, of the communication devices at both ends, located on the side of the ingress of the first communication path and its egress corresponding to the communication device, of the communication devices at both ends, located on the side of the egress of the first communication path, the communication device being the communication device located at the egress of the second communication path, comprising:
a reception unit receiving route maintaining information for maintaining a bandwidth in a partial zone of the first communication path from the neighboring communication device on the side of the ingress of the first communication path; and a route information management unit stored with the route maintaining information.
8. A communication device according to claim 7, further comprising a transmission unit transmitting, if the link fault occurs on the first communication path between the ingress and the egress of the second communication path, when the route information management unit is stored with the route maintaining information, and when the reception unit receives delete request information for deleting a resource of the first communication path from the communication device on the second communication path, the delete request information to the neighboring communication device on the side of the ingress of the first communication path.
9. A network system including a first communication path having an ingress and an egress, and a second communication path, of which a branch point and a merge point, as viewed from the first communication path, are specified as an ingress and an egress, generated so as to bypass a middle zone of the first communication path that is specified from the branch point to the merge point, data to be sent, if any fault does not occur in the middle zone, from the ingress of the first communication path being forwarded to the egress of the first communication path via the middle zone, the system comprising:
a detection unit detecting the fault in the middle zone;
a switch control unit switching over, when the fault in the middle zone is detected, a part of a forwarding route of the data from the ingress down to the egress of the first communication path to the second communication path from the middle zone, and switching back, if recovered from the fault in the middle zone, the part of the forwarding route of the data from the ingress down to the egress of the first communication path to the middle zone from the second communication path; and
an inhibiting unit inhibiting, during a period from the occurrence of the fault in the middle zone up to the recovery, a release of a resource for the first communication path with respect to a fault-not-yet-occurring area of the middle zone.
10. A communication device in a network system including a first communication path having an ingress and an egress, and a second communication path, of which a branch point and a merge point, as viewed from the first communication path, are specified as an ingress and an egress, generated so as to bypass a middle zone of the first communication path that is specified from the branch point to the merge point, data to be sent from the ingress of the first communication path being forwarded to the egress of the first communication path via the middle zone if any fault does not occur in the middle zone, a forwarding route of the data sent from the ingress of the first communication path being switched over to the second communication path from the middle zone if the fault occurs in the middle zone, and the forwarding route of the data sent from the ingress of the first communication path being switched over to the middle zone from the second communication path if the middle zone is recovered from the fault, the communication device disposed in the middle zone, comprising:
a reservation unit reserving a resource for the first communication path that is related to the middle zone when generating the first communication path; and
a reservation updating unit updating a reserved status of the resource for the first communication path,
wherein the reserved status of the resource for the first communication path is not canceled due to the occurrence of the fault in the middle zone, and
the reservation updating unit updates the reserved status even when the fault occurs in the middle zone.
US12/191,499 2003-09-26 2008-08-14 Communication device Abandoned US20080304494A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US12/191,499 US20080304494A1 (en) 2003-09-26 2008-08-14 Communication device

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
JP2003336250A JP4318520B2 (en) 2003-09-26 2003-09-26 Terminal status control system
US10/808,757 US7738922B2 (en) 2003-09-26 2004-03-25 Terminal state control system
JP2007-227525 2007-09-03
JP2007227525A JP4342580B2 (en) 2007-09-03 2007-09-03 Communication device
US12/191,499 US20080304494A1 (en) 2003-09-26 2008-08-14 Communication device

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/808,757 Division US7738922B2 (en) 2003-09-26 2004-03-25 Terminal state control system

Publications (1)

Publication Number Publication Date
US20080304494A1 true US20080304494A1 (en) 2008-12-11

Family

ID=34191536

Family Applications (3)

Application Number Title Priority Date Filing Date
US10/808,757 Expired - Fee Related US7738922B2 (en) 2003-09-26 2004-03-25 Terminal state control system
US12/061,822 Abandoned US20080188221A1 (en) 2003-09-26 2008-04-03 Terminal state control system
US12/191,499 Abandoned US20080304494A1 (en) 2003-09-26 2008-08-14 Communication device

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US10/808,757 Expired - Fee Related US7738922B2 (en) 2003-09-26 2004-03-25 Terminal state control system
US12/061,822 Abandoned US20080188221A1 (en) 2003-09-26 2008-04-03 Terminal state control system

Country Status (5)

Country Link
US (3) US7738922B2 (en)
EP (1) EP1519613B1 (en)
JP (1) JP4318520B2 (en)
CN (1) CN100574525C (en)
DE (1) DE602004027585D1 (en)

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060198321A1 (en) * 2005-03-04 2006-09-07 Nadeau Thomas D System and methods for network reachability detection
US20070165515A1 (en) * 2006-01-18 2007-07-19 Jean-Philippe Vasseur Dynamic protection against failure of a head-end node of one or more TE-LSPs
US20070280242A1 (en) * 2006-06-05 2007-12-06 Balaji Rajagopalan Method and apparatus for maintaining network connectivity via label switched path(s)
US20080019266A1 (en) * 2006-07-18 2008-01-24 Yu Liu Path Flow Formulation for Fast Reroute Bypass Tunnels in MPLS Networks
US20080026726A1 (en) * 2006-07-11 2008-01-31 Radioframe Networks, Inc. Access control in a cellular system
US20080051088A1 (en) * 2006-07-11 2008-02-28 Radioframe Networks, Inc. Facilitating use of a restricted base tranceiver station
US20090003223A1 (en) * 2007-06-29 2009-01-01 Mccallum Gavin Discovering configured tunnels between nodes on a path in a data communications network
US20090303874A1 (en) * 2008-06-04 2009-12-10 Hiroyuki Tanuma Transmission network, transmission apparatus, channel switching method and program for transmission network
US20100002605A1 (en) * 2007-03-15 2010-01-07 Fujitsu Limited Relay node
US20100205330A1 (en) * 2009-02-09 2010-08-12 Yoshiyuki Noborikawa Method of setting communication path in storage system, and management apparatus therefor
US7912934B1 (en) 2006-01-09 2011-03-22 Cisco Technology, Inc. Methods and apparatus for scheduling network probes
US20110092205A1 (en) * 2008-04-09 2011-04-21 Ntt Docomo, Inc. Position registering method, radio control station, and exchange
US7937492B1 (en) * 2008-09-30 2011-05-03 Juniper Networks, Inc. LSP ping and traceroute for bypass tunnels
US20110122841A1 (en) * 2008-03-05 2011-05-26 Ntt Docomo, Inc. Mobile communication system and network device
US20110158237A1 (en) * 2009-12-30 2011-06-30 Verizon Patent And Licensing, Inc. Modification of peer-to-peer based feature network based on changing conditions / session signaling
US7983174B1 (en) 2005-12-19 2011-07-19 Cisco Technology, Inc. Method and apparatus for diagnosing a fault in a network path
US8165032B1 (en) * 2009-03-27 2012-04-24 Brocade Communications Systems, Inc. Dynamic configuration of liveliness detection
US20130051217A1 (en) * 2011-08-30 2013-02-28 Verizon Patent And Licensing Inc. System and method for enhancing loop free alternative coverage
US20130301402A1 (en) * 2010-12-15 2013-11-14 TELEFONAKTIEBOLAGET L M ERRICSSON (publ) Message passing to assure deletion of label switched path
US20140328163A1 (en) * 2013-05-06 2014-11-06 Verizon Patent And Licensing Inc. Midspan re-optimization of traffic engineered label switched paths
US9191387B2 (en) 2009-07-21 2015-11-17 Nec Corporation Communication system for checking for unauthorized use of a terminal
US20160119392A1 (en) * 2014-10-27 2016-04-28 Juniper Networks, Inc. Merge point determination in refresh interval independent fast reroute facility protection
US9660860B1 (en) 2014-12-30 2017-05-23 Juniper Networks, Inc. Path computation delay timer in multi-protocol label switched networks
US10020984B1 (en) * 2014-01-10 2018-07-10 Juniper Networks, Inc. RSVP local protection signaling reduction

Families Citing this family (139)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7155222B1 (en) * 2000-01-10 2006-12-26 Qualcomm, Inc. Method for performing RR-level registration in a wireless communication system
US7486952B1 (en) * 2000-02-09 2009-02-03 Alcatel-Lucent Usa Inc. Facilitated security for handoff in wireless communications
WO2001097548A1 (en) * 2000-06-14 2001-12-20 Nokia Corporation Method and system for performing a location registration
TW552815B (en) * 2002-03-05 2003-09-11 Ind Tech Res Inst Reallocation method for a distributed GGSN system
US7885644B2 (en) * 2002-10-18 2011-02-08 Kineto Wireless, Inc. Method and system of providing landline equivalent location information over an integrated communication system
US7369859B2 (en) * 2003-10-17 2008-05-06 Kineto Wireless, Inc. Method and system for determining the location of an unlicensed mobile access subscriber
US7640008B2 (en) * 2002-10-18 2009-12-29 Kineto Wireless, Inc. Apparatus and method for extending the coverage area of a licensed wireless communication system using an unlicensed wireless communication system
US7940746B2 (en) 2004-08-24 2011-05-10 Comcast Cable Holdings, Llc Method and system for locating a voice over internet protocol (VoIP) device connected to a network
US7184760B2 (en) * 2004-12-29 2007-02-27 M-Stack Limited Air interface management in mobile communications
US7933598B1 (en) 2005-03-14 2011-04-26 Kineto Wireless, Inc. Methods and apparatuses for effecting handover in integrated wireless systems
US7801525B2 (en) * 2005-03-25 2010-09-21 Alcatel-Lucent Usa Inc. Network support for paging channel and access channel optimization
JP4552728B2 (en) * 2005-03-28 2010-09-29 日本電気株式会社 Communication system and communication cost calculation method
US20060234702A1 (en) * 2005-04-19 2006-10-19 Telefonaktiebolaget L M Ericsson (Publ) Selective transmission of mobile radio communications system service information
US8059672B2 (en) * 2005-05-18 2011-11-15 Sprint Communications Company L.P. Internet communications between wireless base stations and service nodes
JP4725955B2 (en) * 2005-06-30 2011-07-13 株式会社リコー Information processing apparatus, message management method, program, and storage medium
DE102005036583A1 (en) 2005-07-21 2007-02-01 T-Mobile International Ag & Co. Kg Method and arrangement for optimizing the operational readiness times and cell change performance of mobile terminals
KR100810207B1 (en) * 2005-07-22 2008-03-06 삼성전자주식회사 Handover method between core network entities in packet-switched based network and therefor apparatus
DE202005021930U1 (en) * 2005-08-01 2011-08-08 Corning Cable Systems Llc Fiber optic decoupling cables and pre-connected assemblies with toning parts
WO2007015067A2 (en) * 2005-08-01 2007-02-08 Ubiquisys Limited Local area cellular basestation
JP4676275B2 (en) * 2005-08-04 2011-04-27 富士通株式会社 Mobile communication network system and location registration method
JP4615396B2 (en) * 2005-08-23 2011-01-19 株式会社エヌ・ティ・ティ・ドコモ Location register and accommodation transfer control method
US7817997B2 (en) * 2005-10-04 2010-10-19 Telefonaktiebolaget Lm Ericsson (Publ) Redirection of IP-connected radio base station to correct control node
US9077433B2 (en) 2005-10-04 2015-07-07 Huawei Technologies Co., Ltd. Mobile station device and method, base station device and method, and mobile station device operating frequency band mapping method
US20070082667A1 (en) * 2005-10-06 2007-04-12 Lucent Technologies, Inc. Process for migrating a mobile station identity from a mobile identification number to an international mobile station identity
EP1940182B1 (en) * 2005-10-18 2013-12-11 ZTE Corporation Relocation methods of serving radio network controller to avoid the interference caused by UE measurement report
CN100428853C (en) * 2005-10-19 2008-10-22 华为技术有限公司 Method for controlling access-in base station of subscriber station under malti-base-station environment
WO2007058024A1 (en) * 2005-11-16 2007-05-24 Nec Corporation Mobile communication system, core network, radio network system, and method for selecting network for containing the system
JP4754335B2 (en) * 2005-11-28 2011-08-24 Kddi株式会社 Radio control system and radio control method
PL1796408T3 (en) * 2005-12-09 2008-11-28 Siemens Ag Radio communication after the switch-on of a subscriber station
US9113331B2 (en) * 2005-12-23 2015-08-18 Telefonaktiebolaget L M Ericsson (Publ) Validating user identity by cooperation between core network and access controller
JP4772551B2 (en) * 2006-03-24 2011-09-14 株式会社エヌ・ティ・ティ・ドコモ Portable base station apparatus and billing method
GB0607084D0 (en) * 2006-04-07 2006-05-17 Nokia Corp Managing connections in a mobile telecommunications network
EP1845741B1 (en) * 2006-04-12 2013-03-13 Alcatel Lucent Mobility management method for mobile terminals in a cellular wireless communication system, and equipment for implementing the method
US7941144B2 (en) * 2006-05-19 2011-05-10 Telefonaktiebolaget Lm Ericsson (Publ) Access control in a mobile communication system
JP2007329542A (en) * 2006-06-06 2007-12-20 Nec Corp Gateway server, security warrant system, and method and program thereof
US7966020B2 (en) * 2006-06-16 2011-06-21 Openwave Systems Inc. Wireless user based notification system
KR100959336B1 (en) * 2006-06-23 2010-05-20 삼성전자주식회사 Apparatus and method for avoiding interference of neighbor-cell in broadband wireless communication terminal
US7961690B2 (en) * 2006-07-07 2011-06-14 Symbol Technologies, Inc. Wireless switch network architecture implementing mobility areas within a mobility domain
US7826869B2 (en) * 2006-07-07 2010-11-02 Symbol Technologies, Inc. Mobility relay techniques for reducing layer 3 mobility control traffic and peering sessions to provide scalability in large wireless switch networks
CN100499866C (en) * 2006-07-14 2009-06-10 华为技术有限公司 Method and system for supplying sufficient LAI/RAI for switch-in points in universal mobile communication system
GB0619179D0 (en) * 2006-09-29 2006-11-08 Ip Access Ltd Telecommunications access control system and method
FR2907302A1 (en) * 2006-10-17 2008-04-18 France Telecom METHOD AND SYSTEM FOR USER CUSTOM MOBILITY IN A MOBILE COMMUNICATION SYSTEM
WO2008047041A2 (en) * 2006-10-17 2008-04-24 France Telecom System for controlling access to a service, and corresponding method, control device, and computer programme
US8320331B2 (en) * 2006-10-27 2012-11-27 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for estimating a position of an access point in a wireless communications network
EP2090129A2 (en) * 2006-10-30 2009-08-19 Interdigital Technology Corporation Method and apparatus for implementing tracking area update and cell reselection in a long term evolution system
US7990927B2 (en) * 2006-10-31 2011-08-02 Infineon Technologies Ag Method and apparatus for transmitting data in a communication system
WO2008055251A2 (en) * 2006-10-31 2008-05-08 Kineto Wireless, Inc. Method and apparatus to enable hand-in for femtocells
EP2090123B1 (en) 2006-11-22 2019-06-19 Vodafone Group PLC Telecommunications networks and devices
JP4884240B2 (en) * 2007-01-17 2012-02-29 富士通株式会社 Location registration method and apparatus for mobile communication system
GB2446738C (en) 2007-02-02 2014-10-01 Ubiquisys Ltd Basestation measurement modes
GB2447442A (en) 2007-02-23 2008-09-17 Ubiquisys Ltd Base station for cellular communication system
US8019331B2 (en) * 2007-02-26 2011-09-13 Kineto Wireless, Inc. Femtocell integration into the macro network
CN101287284B (en) * 2007-04-13 2012-04-18 中兴通讯股份有限公司 Method for apparatus to join wireless transmission network
US8072953B2 (en) * 2007-04-24 2011-12-06 Interdigital Technology Corporation Wireless communication method and apparatus for performing home Node-B identification and access restriction
US8224323B2 (en) * 2007-05-10 2012-07-17 Zte (Usa) Inc. Enhanced timer based registration method for wireless communication networks
CN101325509B (en) 2007-06-11 2011-04-06 华为技术有限公司 Method, system and apparatus for installing software component
CN101330722B (en) * 2007-06-18 2012-10-17 华为技术有限公司 Method for controlling district access as well as user facility
JP4989336B2 (en) 2007-06-27 2012-08-01 株式会社エヌ・ティ・ティ・ドコモ Call admission control method and radio control apparatus
JP4897613B2 (en) * 2007-08-13 2012-03-14 株式会社エヌ・ティ・ティ・ドコモ Mobile communication system, base station apparatus, and base station state control method
US8923212B2 (en) * 2007-08-17 2014-12-30 Qualcomm Incorporated Method and apparatus for interference management
US20090086691A1 (en) * 2007-10-01 2009-04-02 Qual Comm Incorporated System and method to facilitate handling of access terminals camped onto an access point base station
US8948749B2 (en) 2007-10-12 2015-02-03 Qualcomm Incorporated System and method to facilitate acquisition of access point base stations
US9198122B2 (en) * 2007-10-12 2015-11-24 Qualcomm Incorporated Method and system for service redirection background
GB2454649B (en) * 2007-10-26 2012-05-30 Ubiquisys Ltd Cellular basestation
KR101501593B1 (en) * 2007-10-29 2015-03-11 가부시키가이샤 엔티티 도코모 Mobile communication system, home base station, and mobile station
JP2009130602A (en) 2007-11-22 2009-06-11 Kyocera Corp Handover method, and controller and terminal device using method
JP5177498B2 (en) * 2007-12-10 2013-04-03 日本電気株式会社 Mobile communication control method and system
JP2009147531A (en) * 2007-12-12 2009-07-02 Mitsubishi Electric Corp Handover control method and radio communication system
KR20090069472A (en) * 2007-12-26 2009-07-01 삼성전자주식회사 Apparatus and method for location updating of a portable terminal in a radio network
JP2009182863A (en) * 2008-01-31 2009-08-13 Hitachi Ltd Authentication information registration system
US20090197606A1 (en) * 2008-01-31 2009-08-06 Telefonaktiebolaget L M Ericsson High-speed serving cell change
US9467923B2 (en) * 2008-02-07 2016-10-11 Broadcom Corporation Method and system for location-based prearranged hand-off
EP2241135B1 (en) * 2008-02-08 2017-03-01 Telefonaktiebolaget LM Ericsson (publ) Method and node in a communications network
US20110070886A1 (en) * 2008-02-18 2011-03-24 Ntt Docomo, Inc. Mobile communication system, location registration method, handover method, exchange, mobile station, and radio control station
JP4592769B2 (en) 2008-02-27 2010-12-08 京セラ株式会社 Base station and mobile
US9913206B2 (en) * 2008-03-21 2018-03-06 Interdigital Patent Holdings, Inc. Method and apparatus for searching for closed subscriber group cells
WO2009119173A1 (en) * 2008-03-26 2009-10-01 日本電気株式会社 Radio resource control method, radio station device, recording medium containing radio station control program, and radio communication system
US8452282B2 (en) * 2008-03-31 2013-05-28 Ntt Docomo, Inc. Mobile communication method, mobile communication system, program, exchange, and specific radio base station
JP5173556B2 (en) * 2008-04-24 2013-04-03 株式会社日立製作所 Wireless communication system and base station accommodation server
JP5123727B2 (en) * 2008-04-28 2013-01-23 株式会社エヌ・ティ・ティ・ドコモ HANDOVER METHOD, RADIO BASE STATION, AND MOBILE STATION
US8818333B2 (en) * 2008-06-10 2014-08-26 Alcatel Lucent Method for handling roaming of mobile device to restricted area
US9143991B2 (en) * 2008-06-13 2015-09-22 Fujitsu Limited Seamless handover of a mobile station from a macro base station to a privately accessible femto base station
CN101616408B (en) * 2008-06-23 2012-04-18 华为技术有限公司 Key derivation method, key derivation device and system
US9049581B2 (en) * 2008-06-23 2015-06-02 Qualcomm Incorporated Utilizing system access sequences to request resources for GCI reporting in wireless networks
WO2010004608A1 (en) * 2008-07-07 2010-01-14 富士通株式会社 Radio network control device and radio network control method
FR2934107B1 (en) * 2008-07-17 2010-08-27 Alcatel Lucent METHOD OF MANAGING A TELECOMMUNICATION NETWORK AND ASSOCIATED EQUIPMENT
JP5121624B2 (en) * 2008-08-08 2013-01-16 株式会社エヌ・ティ・ティ・ドコモ Mobile communication method and circuit switching center
JP2010041652A (en) 2008-08-08 2010-02-18 Fujitsu Ltd Terminal apparatus, base station apparatus detection method, wireless communication system, and base station apparatus
US20100041387A1 (en) * 2008-08-15 2010-02-18 Amit Khetawat Method and Apparatus for Inter Home Node B Cell Update Handling
JP5169635B2 (en) 2008-08-29 2013-03-27 富士通株式会社 Base station apparatus, service flow establishment program, and service flow establishment method
JP5417780B2 (en) 2008-09-18 2014-02-19 富士通株式会社 Wireless communication system, terminal device, and wireless base station
KR101472749B1 (en) 2008-09-25 2014-12-16 삼성전자주식회사 METHOD AND APPARATUS FOR UE ADMISSION CONTROL IN HOME eNB
WO2010039071A1 (en) * 2008-10-02 2010-04-08 Telefonaktiebolaget L M Ericsson (Publ) Methods and arrangements in a wireless communication network technical field
CN102187721B (en) 2008-10-14 2013-12-04 富士通株式会社 Communication control device, communication control method
KR20100042204A (en) * 2008-10-15 2010-04-23 엘지전자 주식회사 Method of performing location update
US20100118705A1 (en) * 2008-11-07 2010-05-13 Motorola, Inc. Method for seamless transfer of a mobile station to a neighboring base station in an overload condition
JP2010154508A (en) * 2008-11-25 2010-07-08 Sumitomo Electric Ind Ltd Small-size base station and communication control system
JP5126042B2 (en) * 2008-12-16 2013-01-23 日本電気株式会社 Control apparatus, control system, small radio base station, and control method
JP5287361B2 (en) * 2009-03-04 2013-09-11 日本電気株式会社 Management device, communication system, control method, and program
US8903413B2 (en) * 2009-03-20 2014-12-02 Qualcomm Incorporated Hybrid cell management in wireless networks
US9655028B2 (en) 2009-05-04 2017-05-16 Nokia Solutions And Networks Oy Informing a user equipment of a cell and a radio base station serving the cell about access rights granted to the user equipment
EP2430864B1 (en) * 2009-05-11 2018-02-14 Sierra Wireless, Inc. Method and system for performing position updates in a wireless communication system
EP2464989A2 (en) * 2009-08-13 2012-06-20 InterDigital Patent Holdings, Inc. Method and apparatus for supporting positioning measurements
GB2473882A (en) * 2009-09-29 2011-03-30 Nec Corp Allocation of temporary identifiers to mobile devices connecting to home node base stations
US8666403B2 (en) * 2009-10-23 2014-03-04 Nokia Solutions And Networks Oy Systems, methods, and apparatuses for facilitating device-to-device connection establishment
KR101086540B1 (en) 2009-11-03 2011-11-23 주식회사 팬택 Terminal for entering Compact Base Station, Network Apparatus and Method for operating thereof
US8743688B2 (en) * 2009-12-11 2014-06-03 At&T Intellectual Property I, L.P. Method and apparatus for dynamically controlling internet protocol packet handling in a voice over internet protocol network
EP2514239A1 (en) * 2009-12-18 2012-10-24 Panasonic Corporation Method, system and apparatus for resumption of normal service
WO2011085222A2 (en) 2010-01-08 2011-07-14 Interdigital Patent Holdings, Inc. Method and apparatus for adding csg identities to a white list in connected mode
KR101634214B1 (en) * 2010-01-18 2016-06-28 삼성전자 주식회사 Method and apparatus for plmn selection of portable terminal
CN101795434A (en) * 2010-03-01 2010-08-04 华为终端有限公司 Control method for area communication and terminal
KR101612299B1 (en) * 2010-03-12 2016-04-18 삼성전자주식회사 Apparatus and method for eliminating inter cell interference in a multiple antenna system
JP5373690B2 (en) * 2010-04-16 2013-12-18 パナソニック株式会社 Communication system, main unit, radio access unit, and communication method
JP5394331B2 (en) * 2010-06-21 2014-01-22 京セラ株式会社 base station
CN101888698B (en) * 2010-07-01 2014-05-21 黎英征 Paging method for mobile communication system
JP4975151B2 (en) * 2010-08-11 2012-07-11 株式会社エヌ・ティ・ティ・ドコモ Mobile device, network device, wireless communication system, and cell information reporting method
CN103119972B (en) * 2010-09-24 2016-08-24 日本电气株式会社 Gateway
WO2012044628A1 (en) 2010-09-28 2012-04-05 Research In Motion Limited Releasing connections with local gw when ue moves out of residential/enterprise network coverage
EP2622904B1 (en) 2010-09-28 2023-04-26 BlackBerry Limited Method and user equipment having at least one pdn connection comprising lipa connectivity
JP5588817B2 (en) * 2010-10-14 2014-09-10 日本無線株式会社 WiMAX roaming communication system
JP5620808B2 (en) * 2010-12-24 2014-11-05 株式会社Nttドコモ COMMUNICATION MANAGEMENT DEVICE, MOBILE DEVICE, COMMUNICATION SYSTEM, AND COMMUNICATION MANAGEMENT METHOD
KR101728371B1 (en) * 2011-01-07 2017-04-19 삼성전자주식회사 Method and apparatus for supporting high speed mobile terminal in distributed antenna system
CN102595343B (en) * 2011-01-12 2016-01-13 腾讯科技(深圳)有限公司 The methods, devices and systems of transmission information
JP5031112B2 (en) * 2011-02-24 2012-09-19 株式会社エヌ・ティ・ティ・ドコモ Emergency information notification system
US9066312B2 (en) * 2011-03-03 2015-06-23 Acer Incorporated Mobile communication devices and location registration methods
CN102695157A (en) * 2011-03-23 2012-09-26 富泰华工业(深圳)有限公司 Mobile communication terminal and position updating method thereof
KR20140050579A (en) * 2011-04-03 2014-04-29 엘지전자 주식회사 Method for transmitting location information and user equipment
WO2012164826A1 (en) * 2011-06-01 2012-12-06 日本電気株式会社 Visitor verification system and visitor verification method used therein
US8504041B2 (en) * 2011-06-08 2013-08-06 Telefonaktiebolaget Lm Ericsson (Publ) Network elements providing communications with pooled switching centers and related methods
CN103124431A (en) * 2011-11-21 2013-05-29 中国电信股份有限公司 Method, system and terminal for monitoring area locating
CN103164747B (en) * 2011-12-13 2020-01-14 中国人民解放军第二炮兵工程学院 Battlefield first-aid repair resource recombination optimization decision method
PL2613597T3 (en) 2012-01-06 2021-12-06 Alcatel Lucent Reducing the load due to reporting of information changes to a policy and/or charging controller in a mobile communication system
EP2648465B1 (en) * 2012-04-06 2017-02-01 Acer Incorporated Mobile communication devices and location registration methods
JP5598525B2 (en) * 2012-10-29 2014-10-01 日本電気株式会社 Control apparatus, control system, small radio base station, and control method
US9374285B1 (en) * 2013-02-07 2016-06-21 Big Switch Networks, Inc. Systems and methods for determining network topologies
WO2017041817A1 (en) * 2015-09-07 2017-03-16 Telefonaktiebolaget Lm Ericsson (Publ) Method for redundancy of a vlr database of a virtualized msc
US10136318B1 (en) 2017-06-21 2018-11-20 At&T Intellectual Property I, L.P. Authentication device selection to facilitate authentication via an updateable subscriber identifier
US20190014095A1 (en) 2017-07-06 2019-01-10 At&T Intellectual Property I, L.P. Facilitating provisioning of an out-of-band pseudonym over a secure communication channel
JP7186013B2 (en) * 2018-04-27 2022-12-08 エヌ・ティ・ティテレコン株式会社 Network communication device and control station device

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030063613A1 (en) * 2001-09-28 2003-04-03 Carpini Walter Joseph Label switched communication network and system and method for path restoration
US20040136357A1 (en) * 2002-10-23 2004-07-15 Ntt Docomo, Inc. Routing control system, routing control device, and routing control method
US20060146696A1 (en) * 2005-01-06 2006-07-06 At&T Corp. Bandwidth management for MPLS fast rerouting
US20060256712A1 (en) * 2003-02-21 2006-11-16 Nippon Telegraph And Telephone Corporation Device and method for correcting a path trouble in a communication network
US20060268682A1 (en) * 2005-05-31 2006-11-30 Jean-Philippe Vasseur System and method for protecting against failure of a TE-LSP tail-end node
US7170895B2 (en) * 2002-03-29 2007-01-30 Tropic Networks Inc. Switch and a switching apparatus for a communication network
US20070177523A1 (en) * 2006-01-31 2007-08-02 Intec Netcore, Inc. System and method for network monitoring
US20080095061A1 (en) * 2006-10-19 2008-04-24 Alcatel Method and system for verifying connectivity of multi-segment pseudo-wires by tracing
US20080170493A1 (en) * 2007-01-11 2008-07-17 Jean-Philippe Vasseur Protection of hierarchical tunnel head-end nodes
US20080240121A1 (en) * 2005-08-05 2008-10-02 Yi Xiong Method for Fast Converging End-to End Services and Provider Edge Equipment Thereof
US7848646B2 (en) * 2005-07-25 2010-12-07 Hitachi, Ltd. Optical, network, node apparatus and method for recovery path fault

Family Cites Families (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2545466B2 (en) * 1989-08-24 1996-10-16 日本電信電話株式会社 Mobile communication location registration method
US5255307A (en) 1992-05-07 1993-10-19 Sony Electronics Inc. Status indicator control for cellular mobile telephone system
WO1994005128A1 (en) 1992-08-11 1994-03-03 Fujitsu Limited Position registration system of mobile communication terminals
JPH06245255A (en) 1993-02-15 1994-09-02 Hitachi Ltd Mobile communication method and communication system based on personal information
JPH0738627A (en) * 1993-07-15 1995-02-07 Casio Comput Co Ltd Radio telephone set and radio transmitter-receiver
FI100076B (en) 1995-01-04 1997-09-15 Nokia Telecommunications Oy Radio system for wireless subscriber connection
JP3015705B2 (en) 1995-02-28 2000-03-06 三洋電機株式会社 Telephone device and mobile phone system
US5598459A (en) 1995-06-29 1997-01-28 Ericsson Inc. Authentication and handover methods and systems for radio personal communications
GB2315193B (en) 1996-07-10 2000-11-15 Orange Personal Comm Serv Ltd Mobile communications system
JPH1065801A (en) * 1996-08-26 1998-03-06 Nec Corp System for identifying mobile equipment
JPH10108245A (en) 1996-09-30 1998-04-24 Matsushita Electric Ind Co Ltd Phs mobile station
GB2322041B (en) * 1997-02-05 2001-09-19 Nokia Mobile Phones Ltd Intelligent network searching for a multi mode phone
JPH10257548A (en) 1997-03-11 1998-09-25 Kokusai Electric Co Ltd Radio telephone system
FI972396A (en) 1997-06-05 1998-12-06 Nokia Telecommunications Oy Channel switching in a mobile communication system
FR2771583B1 (en) * 1997-11-27 2004-09-24 Alsthom Cge Alkatel METHOD FOR COOPERATION BETWEEN ENTITIES OF A CELLULAR MOBILE RADIO COMMUNICATIONS NETWORK, DURING HANDOVER COMMUNICATION TRANSFERS
JP2000004481A (en) 1998-06-17 2000-01-07 Toshiba Corp Radio communication equipment
JP2947280B1 (en) * 1998-07-28 1999-09-13 日本電気株式会社 Location registration control method
JP3080076B2 (en) * 1998-07-30 2000-08-21 日本電気株式会社 Paging signal transmission system, transmission method used therefor, and recording medium recording control program therefor
KR100300350B1 (en) * 1998-10-20 2001-09-06 윤종용 Apparatus and method for detecting mobile telephone in idle state
US6782262B1 (en) * 1998-10-28 2004-08-24 Telefonaktiebolaget Lm Ericsson Self-tuning sufficient signal strength threshold
US6275706B1 (en) * 1998-11-09 2001-08-14 Telefonaktiebolaget L M Ericsson Mobile telecommunications network and method for implementing and identifying hierarchical overlapping radio coverage areas
FI112908B (en) 1999-03-09 2004-01-30 Nokia Corp Method, network, network element and mobile phone for enclosing a cell in a mobile communication system
US7003297B2 (en) 1999-04-06 2006-02-21 Telefonaktiebolaget Lm Ericsson (Publ) Partial support of mobility between radio access networks
JP4105824B2 (en) * 1999-06-10 2008-06-25 松下電器産業株式会社 Base station apparatus and network identifier assignment method
JP2001189950A (en) * 1999-12-28 2001-07-10 Fujitsu Ltd Wireless exchange system providing service to limit movement of mobile subscriber, and mobile exchange station applied to the system
US20020111166A1 (en) 2001-02-12 2002-08-15 Opuswave Network, Inc. Method and system for selecting a prefer red cell in a wireless communication system
US6603968B2 (en) * 2001-06-22 2003-08-05 Level Z, L.L.C. Roaming in wireless networks with dynamic modification of subscriber identification
US6470187B1 (en) * 2001-07-18 2002-10-22 Howard Rosen Multi-base station cordless telephone
US20030040314A1 (en) * 2001-08-21 2003-02-27 Telefonaktiebolaget Lm Ericsson Method and apparatus for location area updating in cellular communications
US20030114169A1 (en) * 2001-12-14 2003-06-19 Hitachi, Ltd. Method and system for detecting the position of mobile station

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030063613A1 (en) * 2001-09-28 2003-04-03 Carpini Walter Joseph Label switched communication network and system and method for path restoration
US7170895B2 (en) * 2002-03-29 2007-01-30 Tropic Networks Inc. Switch and a switching apparatus for a communication network
US20040136357A1 (en) * 2002-10-23 2004-07-15 Ntt Docomo, Inc. Routing control system, routing control device, and routing control method
US20060256712A1 (en) * 2003-02-21 2006-11-16 Nippon Telegraph And Telephone Corporation Device and method for correcting a path trouble in a communication network
US20060146696A1 (en) * 2005-01-06 2006-07-06 At&T Corp. Bandwidth management for MPLS fast rerouting
US20060268682A1 (en) * 2005-05-31 2006-11-30 Jean-Philippe Vasseur System and method for protecting against failure of a TE-LSP tail-end node
US7848646B2 (en) * 2005-07-25 2010-12-07 Hitachi, Ltd. Optical, network, node apparatus and method for recovery path fault
US20080240121A1 (en) * 2005-08-05 2008-10-02 Yi Xiong Method for Fast Converging End-to End Services and Provider Edge Equipment Thereof
US20070177523A1 (en) * 2006-01-31 2007-08-02 Intec Netcore, Inc. System and method for network monitoring
US20080095061A1 (en) * 2006-10-19 2008-04-24 Alcatel Method and system for verifying connectivity of multi-segment pseudo-wires by tracing
US20080170493A1 (en) * 2007-01-11 2008-07-17 Jean-Philippe Vasseur Protection of hierarchical tunnel head-end nodes

Cited By (55)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7990888B2 (en) 2005-03-04 2011-08-02 Cisco Technology, Inc. System and methods for network reachability detection
US20060198321A1 (en) * 2005-03-04 2006-09-07 Nadeau Thomas D System and methods for network reachability detection
US7983174B1 (en) 2005-12-19 2011-07-19 Cisco Technology, Inc. Method and apparatus for diagnosing a fault in a network path
US7912934B1 (en) 2006-01-09 2011-03-22 Cisco Technology, Inc. Methods and apparatus for scheduling network probes
US8976645B2 (en) 2006-01-18 2015-03-10 Cisco Technology, Inc. Dynamic protection against failure of a head-end node of one or more TE-LSPS
US20070165515A1 (en) * 2006-01-18 2007-07-19 Jean-Philippe Vasseur Dynamic protection against failure of a head-end node of one or more TE-LSPs
US8441919B2 (en) * 2006-01-18 2013-05-14 Cisco Technology, Inc. Dynamic protection against failure of a head-end node of one or more TE-LSPs
US20070280242A1 (en) * 2006-06-05 2007-12-06 Balaji Rajagopalan Method and apparatus for maintaining network connectivity via label switched path(s)
US7693046B2 (en) * 2006-06-05 2010-04-06 Tellabs San Jose, Inc. Method and apparatus for maintaining network connectivity via label switched path(s)
US20080026726A1 (en) * 2006-07-11 2008-01-31 Radioframe Networks, Inc. Access control in a cellular system
US20080051088A1 (en) * 2006-07-11 2008-02-28 Radioframe Networks, Inc. Facilitating use of a restricted base tranceiver station
US7792530B2 (en) 2006-07-11 2010-09-07 Broadcom Corporation Facilitating use of a restricted base tranceiver station
US7949336B2 (en) 2006-07-11 2011-05-24 Broadcom Corporation Access control in a cellular system
US7889641B2 (en) * 2006-07-18 2011-02-15 Opnet Technologies, Inc. Path flow formulation for fast reroute bypass tunnels in MPLS networks
US20080019266A1 (en) * 2006-07-18 2008-01-24 Yu Liu Path Flow Formulation for Fast Reroute Bypass Tunnels in MPLS Networks
US20100002605A1 (en) * 2007-03-15 2010-01-07 Fujitsu Limited Relay node
US8064365B2 (en) * 2007-03-15 2011-11-22 Fujitsu Limited Relay node
US20090003223A1 (en) * 2007-06-29 2009-01-01 Mccallum Gavin Discovering configured tunnels between nodes on a path in a data communications network
US8111627B2 (en) * 2007-06-29 2012-02-07 Cisco Technology, Inc. Discovering configured tunnels between nodes on a path in a data communications network
US8553599B2 (en) 2008-03-05 2013-10-08 Ntt Docomo, Inc. Mobile communication system and network device
US20110122841A1 (en) * 2008-03-05 2011-05-26 Ntt Docomo, Inc. Mobile communication system and network device
US8897738B2 (en) 2008-03-05 2014-11-25 Ntt Docomo, Inc. Mobile communication system and network device
US20110092205A1 (en) * 2008-04-09 2011-04-21 Ntt Docomo, Inc. Position registering method, radio control station, and exchange
US8229429B2 (en) 2008-04-09 2012-07-24 Ntt Docomo, Inc. Position registering method, radio control station, and exchange
US8228789B2 (en) * 2008-06-04 2012-07-24 Nec Corporation Transmission network, transmission apparatus, channel switching method and program for transmission network
US20090303874A1 (en) * 2008-06-04 2009-12-10 Hiroyuki Tanuma Transmission network, transmission apparatus, channel switching method and program for transmission network
US8799509B2 (en) 2008-09-30 2014-08-05 Juniper Networks, Inc. LSP ping and traceroute for bypass tunnels
US20110170426A1 (en) * 2008-09-30 2011-07-14 Juniper Networks, Inc. Lsp ping and traceroute for bypass tunnels
US10178006B2 (en) 2008-09-30 2019-01-08 Juniper Networks, Inc. LSP ping and traceroute for bypass tunnels
US7937492B1 (en) * 2008-09-30 2011-05-03 Juniper Networks, Inc. LSP ping and traceroute for bypass tunnels
US9647912B2 (en) 2008-09-30 2017-05-09 Juniper Networks, Inc. LSP ping and traceroute for bypass tunnels
US8250259B2 (en) 2009-02-09 2012-08-21 Hitachi, Ltd. Method of setting communication path in storage system, and management apparatus therefor
US8140720B2 (en) * 2009-02-09 2012-03-20 Hitachi, Ltd. Method of setting communication path in storage system, and management apparatus therefor
US20100205330A1 (en) * 2009-02-09 2010-08-12 Yoshiyuki Noborikawa Method of setting communication path in storage system, and management apparatus therefor
US8165032B1 (en) * 2009-03-27 2012-04-24 Brocade Communications Systems, Inc. Dynamic configuration of liveliness detection
US9191387B2 (en) 2009-07-21 2015-11-17 Nec Corporation Communication system for checking for unauthorized use of a terminal
US20110158237A1 (en) * 2009-12-30 2011-06-30 Verizon Patent And Licensing, Inc. Modification of peer-to-peer based feature network based on changing conditions / session signaling
US8699488B2 (en) * 2009-12-30 2014-04-15 Verizon Patent And Licensing Inc. Modification of peer-to-peer based feature network based on changing conditions / session signaling
US20130301402A1 (en) * 2010-12-15 2013-11-14 TELEFONAKTIEBOLAGET L M ERRICSSON (publ) Message passing to assure deletion of label switched path
US9774492B2 (en) * 2010-12-15 2017-09-26 Telefonaktiebolaget Lm Ericsson (Publ) Message passing to assure deletion of label switched path
US20130051217A1 (en) * 2011-08-30 2013-02-28 Verizon Patent And Licensing Inc. System and method for enhancing loop free alternative coverage
US8934335B2 (en) * 2011-08-30 2015-01-13 Verizon Patent And Licensing Inc. System and method for enhancing loop free alternative coverage
US9473392B2 (en) * 2013-05-06 2016-10-18 Verizon Patent And Licensing Inc. Midspan re-optimization of traffic engineered label switched paths
US20140328163A1 (en) * 2013-05-06 2014-11-06 Verizon Patent And Licensing Inc. Midspan re-optimization of traffic engineered label switched paths
US10659290B1 (en) 2014-01-10 2020-05-19 Juniper Networks, Inc. RSVP local protection signaling reduction
US10020984B1 (en) * 2014-01-10 2018-07-10 Juniper Networks, Inc. RSVP local protection signaling reduction
US9590894B2 (en) 2014-10-27 2017-03-07 Juniper Networks, Inc. Establishing label switched paths having refresh interval independent fast reroute facility protection
US9590895B2 (en) 2014-10-27 2017-03-07 Juniper Networks, Inc. Refresh interval independent fast reroute facility protection tear down messaging
US20160119224A1 (en) * 2014-10-27 2016-04-28 Juniper Networks, Inc. Label switched path node failure management for label switched paths having refresh interval independent fast reroute facility protection
US10182003B2 (en) 2014-10-27 2019-01-15 Juniper Networks, Inc. Refresh interval independent fast reroute facility protection tear down messaging
US10187301B2 (en) 2014-10-27 2019-01-22 Juniper Networks, Inc. Establishing label switched paths having refresh interval independent fast reroute facility protection
US10187298B2 (en) * 2014-10-27 2019-01-22 Juniper Networks, Inc. Merge point determination in refresh interval independent fast reroute facility protection
US10469365B2 (en) * 2014-10-27 2019-11-05 Juniper Networks, Inc. Label switched path node failure management for label switched paths having refresh interval independent fast reroute facility protection
US20160119392A1 (en) * 2014-10-27 2016-04-28 Juniper Networks, Inc. Merge point determination in refresh interval independent fast reroute facility protection
US9660860B1 (en) 2014-12-30 2017-05-23 Juniper Networks, Inc. Path computation delay timer in multi-protocol label switched networks

Also Published As

Publication number Publication date
EP1519613A3 (en) 2008-07-23
CN100574525C (en) 2009-12-23
EP1519613B1 (en) 2010-06-09
US20080188221A1 (en) 2008-08-07
EP1519613A2 (en) 2005-03-30
JP2005109570A (en) 2005-04-21
CN1602110A (en) 2005-03-30
JP4318520B2 (en) 2009-08-26
US7738922B2 (en) 2010-06-15
DE602004027585D1 (en) 2010-07-22
US20050070283A1 (en) 2005-03-31

Similar Documents

Publication Publication Date Title
US20080304494A1 (en) Communication device
US7710860B2 (en) Data relay apparatus and data relay method
EP2071768B1 (en) A method for implementing the multicast fast-reroute and a node
JP4647835B2 (en) Transmission apparatus and failure avoidance method
US7411964B2 (en) Communication network, path setting method and recording medium having path setting program recorded thereon
US7602702B1 (en) Fast reroute of traffic associated with a point to multi-point network tunnel
US7978596B2 (en) Connection-oriented network node
US9350620B2 (en) Method for creating ring network label switched path, related device, and communications system
CN100527683C (en) Failure protecting method and system
US9210037B2 (en) Method, apparatus and system for interconnected ring protection
US20060013127A1 (en) MPLS network system and node
US20070286069A1 (en) Method For Implementing Working/Standby Transmission Path
KR101468763B1 (en) Rsvp-te enhancement for mpls-frr bandwidth optimization
KR101750844B1 (en) Method and device for automatically distributing labels in ring network protection
US6848062B1 (en) Mesh protection service in a communications network
US20150186202A1 (en) Method and Device for Sending Inter-Domain Fault Information
KR102157711B1 (en) Methods for recovering failure in communication networks
EP2658177B1 (en) Method for detecting tunnel faults and traffic engineering node
CN101374106A (en) Method for forwarding data packet on MPLS LSP, network node and system
CN100591051C (en) Multi-link failure processing method and label switching router
JP2006033124A (en) Tunnel fault notification device and method
CN107347034B (en) Link information processing method, device and system
US9998807B2 (en) Method and apparatus for establishing trail network
JP2019510422A (en) Fast and topology-independent route protection in SDN networks
JP2009188673A (en) Transmitting apparatus and path setting method

Legal Events

Date Code Title Description
AS Assignment

Owner name: FUJITSU LIMITED, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:YOKOYAMA, TOSHIFUMI;REEL/FRAME:021389/0756

Effective date: 20080730

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION