WO2005079024A1 - データ通信ネットワークにおけるシグナリング管理 - Google Patents
データ通信ネットワークにおけるシグナリング管理 Download PDFInfo
- Publication number
- WO2005079024A1 WO2005079024A1 PCT/JP2005/002067 JP2005002067W WO2005079024A1 WO 2005079024 A1 WO2005079024 A1 WO 2005079024A1 JP 2005002067 W JP2005002067 W JP 2005002067W WO 2005079024 A1 WO2005079024 A1 WO 2005079024A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- signaling
- communication
- network
- message
- data path
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/824—Applicable to portable or mobile terminals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
- H04L47/724—Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/74—Admission control; Resource allocation measures in reaction to resource unavailability
- H04L47/746—Reaction triggered by a failure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
- H04L47/762—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
- H04L47/765—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the end-points
- H04L47/767—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions triggered by the end-points after changing the attachment point, e.g. after hand-off
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/822—Collecting or measuring resource availability data
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
Definitions
- the present invention relates to data communication networks, and more particularly to resource management signaling of packet based data communication systems.
- the present invention also relates to general state management of end-to-end path specific signaling applications.
- Non-Patent Document 1 Resource Reservation Protocol (RSVP) (Non-Patent Document 1) are usually used. If signaling flows along the data traffic path, any change in the data traffic path will cause some signaling channel re-establishment, eg, local repair in RSVP.
- RSVP Resource Reservation Protocol
- Non-Patent Document 1 R. Braden, et. Al., "Resource Reservation Protocol", IETF RFC 2205 http: / 1 www.ietf. Org / rfc / rfc2205. Txt
- Non Patent Literature 2 D. Johnson, et. Al, "Mobility Support in IPv6", IETF Internet Draft: draft-ietf-mobileip-ipv6-24.txt
- Non-Patent Document 3 Hesham Soliman, et. Al., "Hierarchical Mobile IPv6 mobility management (HMIPv6)", IETF Internet Draft: draft-ietf-mobileip-hmipv6-08.txt http://www.ietf.org/internet -drafts / draft-ietf-mobileip-hmipv6-08.txt
- the present invention proposes a method for solving the signaling problem due to ping pong effect by saving the signaling state along the old route instead of disconnecting the entire signaling chain after a route change.
- Network resources that the old state holds formally are released
- the signaling state on the force node is held.
- Status from the network Become a "potential" state that does not require active monitoring of
- QoS quality of service
- the state does not hold previously reserved network resources. It maintains path information such as routing information or peer-to-peer association. By doing so, high efficiency in re-use of network resources is achieved and at the same time rapid re-establishment of old signaling paths is facilitated.
- the present invention can be used to continue to monitor the disconnects of the old route and to re-use if modifications are made.
- Packet t is a self-contained unit of data in any possible format that can be distributed over a data network.
- a "packet” will usually also be two parts: “header” and “payload” parts.
- the 'payload' part contains the data to be delivered, and the 'header' part contains the information to help deliver the packet.
- the “header” must include the source and destination addresses to identify the sender and receiver of the “packet” respectively!
- mobile terminal t is a network element that changes the access point to a packet switched data communication network.
- a mobile terminal is used to refer to an end user's communication terminal capable of changing the access point to the packet switched data communication network.
- the terms “mononode” and “mobile terminal” are used interchangeably unless the context clearly indicates otherwise.
- the term "access router” is a network element that provides a "mobile terminal” with a network connection by any access technology. These access technologies may be wireless technologies, wired technologies or optical technologies. The access router can usually be aware of the signaling. That is, they are involved in signaling message processing.
- FIG. 1 is a diagram showing an exemplary configuration of a mobility scenario, and various nodes related to signaling management.
- FIG. 2 Diagram showing an example procedure used to manage the state along the old data path when a mobility event occurs
- FIG. 3 A flow chart showing an exemplary implementation method for detecting the validity of old data path conditions, and a method for managing addresses
- FIG. 4 An illustrative procedure used to manage the state along the old data path when the local mobility anchor point is used to conceal the movement of the mobile terminal from the external node.
- FIG. 5 A diagram showing the configuration as an example of a temporal rerouting scenario and the various nodes involved in the signaling management.
- FIG. 6 -A diagram showing an example procedure used to manage the state along the data path in case of occasional route change, and a method to quickly re-establish the data path state.
- resource management signaling is usually performed along data traffic paths to establish services and reserve necessary resources.
- RSVP Non-Patent Document 1
- nodes different from the sender and the source of the signaling message related to the signaling, eg to intercept and process the signaling message.
- These nodes are called signaling aware nodes.
- these signaling aware nodes usually control the resources for providing services to users.
- QoS Quality of Service
- FIG. 1 is a schematic diagram of a mobile communication scenario.
- data communication is performed between the mopile node (MN) (102) and the correspondent node (CN) (101).
- MN (102) initially resides at location 102A and is connected to the network by access router (AR) A (103A) through link 106.
- the link 106 may take any form depending on the access technology used at the mopile node (102), eg, wireless, infrared, optical, etc.
- the data traffic path is the link through AR A (103A), Signaling Router (SR) A (105A), Crossover Router (CoR) (104), Signaling Router (SR) C (105C) Located along 106, 107, 108, 109 and 110. All network nodes in the illustrated diagram are aware of signaling. Those skilled in the art will immediately understand that more network elements not shown can be used in communication. Thus, the link is a logical connection and may physically be a combination of many different links of different communication technologies, such as, for example, Ethernet and ATM.
- MN (102) can perform signaling using a signaling proxy that performs signaling on its own or on its behalf. If MN (102) needs a signaling proxy, AR A (103A) can act as a signaling proxy to signal for MN (102). The reason is that it is the closest to the MN (102), which is a recognition node.
- CN (lOl) may be any device connected to the network with any type of technology.
- CN (101) is considered to be static. It may be a node having a data function.
- CN (lOl) uses, for example, a signaling proxy that performs signaling on its own or on behalf of itself by signaling router C (105C), which is the signaling aware node closest to CN (lOl). , Can perform signaling.
- the signaling aware nodes In order to perform signaling along data traffic paths, the signaling aware nodes must discover each other and establish coordination. For example, AR A (103 A) and SR A (105 A) need to find each other's location and set up a signaling relationship such as storage of each other's address. After the discovery process, each signaling aware node maintains state information about its signaling peers. The status includes, for example, the address of the peer (peer), the protocol and port used, and the signaling application that can be used. Only this state information that can be used allows resource management signaling to be performed. For example, the MN (102) can request the network to allocate bandwidth corresponding to its data flow by sending a signaling message to AR A (103A).
- the MN (102) can request the network to allocate bandwidth corresponding to its data flow by sending a signaling message to AR A (103A).
- AR A (103A) can allocate the corresponding resources and forward the message to SR A (105A).
- Resources assigned to AR A (103A) are associated with the state. State information can be kept available or active for a limited time. For example, in the case of QoS signaling, the status of the reservation must be refreshed at regular intervals. Otherwise, the corresponding state and associated resources will be released. This refresh can prevent network failures from running out of network resources.
- the network topology may also change.
- the MN (102) is connected to the network via Access Router (AR) B (103B).
- AR Access Router
- the data traffic path is now at two new network nodes, namely AR B (103 B) instead of AR A (103 A) and SR A (105 A).
- SR B (105B) with links 111, 112, 113, 109 and 110.
- signaling must be done to set up similar signaling states on the new node. This includes the discovery of signaling aware nodes and the establishment of signaling related nodes.
- CoR (104) is the first signaling aware node of the intersection of the new and old data paths.
- the part of the old data path consisting of AR A (103A), link 107, SR A (105A) and link 108 is no longer used for data applications between MN (102) and CN (101).
- the present invention provides a method for managing state and resources for this part of the data path.
- FIG. 2 is an example of a signaling process when MN (102) also moves position 102A force to position 102B and returns to position 102A.
- MN (102) starts at position 102A.
- the MN (102) establishes a communication application with the CN (101) and also, for example, all the acknowledgment nodes and CoRs (104) along the data traffic path such as AR A (103A).
- a mobility event causes the MN (102) to change its position from position 102A to position 102B and access the network through AR B (103B) (step 202). Since AR A (103 A) and AR B (103 B) have different address spaces, MN (102) has to change its local address.
- ⁇ (102) must notify CN (101) of the address change by the mobility protocol message (step 203). For example, if mopile IPv6 (Internet Protocol version 6) (non-patent document 2) is used, this message transmitted in step 203 may be a mopile IP binding update message.
- CN (101) can update its corresponding communication application, eg, send new /! Data packets to a new address.
- this address update process can include several message exchange rounds. In order to simplify the drawing, the figure only shows one message exchange at step 203. Yes.
- MN (102) and CN (101) discover that this new address has never been used before. This means that the data path is a new path (step 204).
- the MN (102) can recognize this in its local database by setting and storing timers for all previously used addresses.
- FIG. 3 shows how this function can be implemented in MN (102).
- MN (1 02) changes its access point, it obtains a new local address (step 301).
- the MN (102) searches its local address database and checks if the address has been used before (step 302).
- the addresses stored in the database are associated with timers. When this timer times out, this address is deleted from the database.
- This address database can be maintained in the memory of M N (102). If the MN (102) is rebooted, the database is re-initialized with an empty record. This is because MN (102) completely resets its communication application after reboot, and the records are no longer useful.
- the MN (102) checks if it can find a new address in the database (step 303). If the address is present due to a valid timer, M N (102) sets the "old path" flag to "true” (step 304). Otherwise, the MN (102) sets the "old route” flag to "false” (step 305). After this, MN (102) sets a timer to the old address and stores it in the database.
- the timer value is preset for MN (102). Note that the determination of the timer value may differ depending on several factors such as, for example, the type of network interface, the strength of the last detected signaling, the expected coverage area, the access point load status, and the cost of the link. There is.
- the MN (102) can use local policies to calculate the value to use for the timer based on the weighted sum of all factors.
- CN (lOl) can perform the function of the procedure similar to FIG. 3 only by replacing process 301 with “reception of address update message (sent in step 203)”.
- CN (101) stores an address in its database, for example, If used, the MN's (102) 's identifier, such as the MN's (102)' s home address, must also be remembered. The value of the timer for the address will be indicated by the MN (102) in the address update message sent in step 203.
- the signaling routing procedure includes, for example, the discovery of signaling aware nodes such as AR B (103B) and SR B (105B). Since both data paths are used for the same communication application and are therefore associated with the same session identifier assigned to that application, CoR (104) will not Can be found (step 205).
- signaling aware nodes such as AR B (103B) and SR B (105B). Since both data paths are used for the same communication application and are therefore associated with the same session identifier assigned to that application, CoR (104) will not Can be found (step 205).
- MN (102) starts a resource reservation message along the new data path.
- Step 206A This message establishes the necessary state information about the application session along the new data path, and assigns the associated nodes the network resources corresponding to the data flow.
- CoR (104) updates the corresponding status information for that session. For example, since the new address is used by the MN (102), it updates the filters for data flow.
- CoR (104) forwards the update message to the common part of the data path (step 207A). This message updates the state on the signaling aware node along the common data path, similar to the operation in CoR (104).
- CN (101) transmits a common route update message (step 206B).
- This message updates signaling state information on the nodes along the common part of the data path, eg data flow filter update etc.
- CoR (104) receives this message, CoR (104) sends the corresponding status information for that session.
- This reservation message sent in step 207B follows the new data path on the signaling aware node on the signaling state. Configure and assign the required network resources to the session.
- CoR (104) directs the MN (102) along the new data route to one.
- Send a reservation message (step 206C).
- This reservation message sent in step 206C establishes a new signaling state on the signaling aware node along the data path and allocates the necessary network resources for the data flow.
- CoR (104) sends a status update message in the direction of CN (101) along the common part of the data path (step 207C).
- This update message sent in step 207C updates all signaling aware nodes along the common data path of the new address used by the MN (102), eg, update the corresponding data flow filter.
- a one-way message exchange in steps 206A, 206B, 206C, 207A, 207B and 207C is shown in the figure.
- the MN (102) can return a response message in the direction of the CoR (104) according to option B.
- Option A is the procedure to use.
- Option B is the procedure to use if the dataflow force MN (102) force is also flowing to CN (101).
- Option A or Option B does not make any changes to the implementation of the signaling awareness node. That is, these procedures share the same state machine implementation.
- Signaling protocol strength Only option C is used if there is a high security coordination between signaling peers.
- the MN (102) oR (104) Force to MN (102) Indicates to CoR (104) whether the state of the data path should be maintained. Since there are network resources allocated to the flow of the communication application along the old data path, these resources must be released if the old data path is no longer used. Resources are usually released by state timeouts along the old data path. For example, the MN (102) does not send refresh messages within the time limit. In the case of scarce networks, this type of timeout is not acceptable. Therefore, resource reservations along old routes need to be explicitly disconnected.
- the MN (102) requires coexistence of two data paths, eg, multi-homing mopile nodes, soft handover, etc., so the MN (102) power network disconnects the old V, path immediately. Desirable to indicate whether or not to.
- the MN (102) transmits the flag in the reservation message transmitted in Step 206A of Option A, or the flag in the response to the reservation message transmitted in Step 207B of Option B and Option C or Step 206C. It can be used to indicate if it is disconnected. In this case, a force flag for which a tear-down flag is assumed may indicate that the reservation is to be cut or maintained.
- CoR (104) clearly disconnects the resource reservation along the old path for MN (102) if it notices such a disconnect flag present in the CoR (104) 1S message. If the CoR (104) did not find such a flag in these messages, or if it did not receive such a message, the CoR (104) would be a resource along the old route that is not used. Keep the reservation as it is.
- the MN (102) uses its local policy to decide whether to turn on the flag in these messages. For example, if the MN (102) has multiple interfaces in use for the same session, ie, in the case of multi-homing, it is preferable for the network to maintain reservations on both data paths. In this case, MN (102) does not turn on the flag. On the other hand, if MN (102) is the data flow source and MN (102) decides to switch to the new data path, MN (102) turns on the flag and disconnects the old data path reservation to the network. To request. Lower layer information is also used when MN (102) determines the value of the flag.
- the MN (102) If the Riga indicates that the link to the old route is already lost, the MN (102) requests the network to disconnect the old route reservation by turning on the flag. There are many more factors that MN (102) must consider in determining the flag. For example, the cost of using the old link, the available bandwidth, the delay of the route, the reliability of the link, etc.
- the CoR (104) when the flag indicated by the CoR (104) force MN (102) is found, the CoR (104) generates a set-to-zero message along the old route. By sending message), it tries to release the resources allocated along the old data path for MN (104). This zeroing message also causes CoR (104) power to the MN (102), any signaling aware node along the data path, to release any network resources allocated for the data flow.
- the signaling aware node can gradually release network resources. For example, when the MN (102) returns to its original position, it gradually releases network resources so that the current resource reservation can be recovered more reliably.
- the parameters for the timer and the steps for gradual release control are incorporated into the zero setup message.
- these signaling aware nodes maintain signaling coordination and any other state information about the flow.
- Such signaling or status information is included in the zero set message and is set by the value of the timer.
- the managing entities of these nodes appear to be in the latent mode. However, in this case, network resources are not allocated to these nodes. The released network resources are available to other sessions. If the timer associated with the state has expired, then these states are also removed from these signaling aware nodes.
- the value of the timer can be set to the same value used in MN for the local address. In this way, address and state deletions can be synchronized along the old path.
- the MN (102) can return to the position 102A in a short time, and can access the same AR A (103A) (step 209). Similarly, the MN (102) acquires the local address from the AR A (103A) and notifies the CN (101) of this address change by a notification message (step 210).
- the MN and CN recognize the address (step 211), and the MN and CN do not start the signaling routing procedure.
- Option A and Option B there are two options for signaling. Also, whether to use the option depends on the previous procedure selected. If Option C is selected for the previous procedure, Option A and Option B can be used according to the communication direction.
- the MN (102) sends an old path restoration message to the CN (101) along the old data path through the AR A (103A).
- This message contains the necessary network resource information for the data flow and the current address information for the MN (102).
- a signaling aware node along the old path eg AR A (103A)
- the signaling aware node can gradually increase network resources, for example, gradually based on traffic conditions, when the requested resources are not available.
- the restore message need only contain minimal information, and this minimal information is extremely small.
- the restoration process needs to re-establish all the states, so this process is also new and takes place much faster than setting up a session.
- the new address of (102) is used to update its state, for example, a flow filter.
- the CoR (104) transfers the common route update message in the direction of the CN (101) (step 213A).
- the message sent in step 213A causes all signaling aware nodes along the common data path to have their state based on the current address of the MN (102) and the required allocation of network resources. Update.
- CN (101) sends a common data update message after finding that MN (102) has returned to the old path (step 212B).
- This update message contains the current address used by the MN (102) and the necessary network resources.
- a signaling aware node along the common data path updates its state based on that information. For example, the new address of MN (102) adjusts the data flow filter.
- CoR (104) receives the common route update message sent in step 212B, CoR (104) sends the old route restoration message to MN (102) through AR A (103A). Transfer (step 213B).
- This restoration message contains the same information as the common route update message sent in step 212B.
- the signaling aware node can gradually increase network resources, for example, stepwise based on traffic conditions, when the requested resources are not available. [0045] As already explained, the choice of options to use depends on the signaling protocol in use, the configuration of the communication application, and the options used previously.
- the messages sent in steps 212A and 212B both contain the necessary network resource information. This is because the communication requirements also change after the change of the access point. For example, when the MN hands over from the wireless LAN interface to its Universal Mobile Telephone System (UMTS) interface, the required bandwidth will be much smaller. Therefore, different network resources may be allocated to connections of different MN (102).
- UMTS Universal Mobile Telephone System
- CoR (104) may detect data path changes in MN (102) (step 214). Similarly, if the MN (102) also indicated that it should release resources on the previous data path (111, 112, 113), then the CoR (104) will zero along the previous data path. Send the configuration message (step 215). This message has the same effect as the message sent in step 208.
- the entire signaling process can continue until the CN (101) or the MN (102) end the communication application session.
- Embodiment 1 assumes that the mobility of the MN (102) can be viewed by the CN (101).
- the movement of MN (102) is transparent to CN (101).
- CN (101) when using the hierarchical mobile IP scheme (Non-patent document 3), as long as MN (102) is located in a certain area of MAP (Mobility Anchor Point), CN (101) It is possible to look at In this case, the mobility anchor point normally functions as CoR (104). Therefore, the CoR (104) keeps track of all movements of the MN (102).
- FIG. 4 shows a possible operation procedure of the present invention when such a local mobility scheme is installed.
- the MN (102) starts a communication application with the CN (101) at the position 102A.
- MN (102) connects to the network through AR A (103A),
- CoR (104) is a local mobility anchor point.
- all data traffic passes through CoR (104) as long as MN (102) stays in its area.
- the MN (102) has network resources reserved along the data path (step 401). Also, the CoR (104) stores the local address of the MN (102).
- a certain mobility event causes MN (102) to move to a new location 102B and connect to the network through AR B (I 03B) (step 402). At the same time, the MN (102) gets the AR B (103 B) force new local address. Because AR B (103B) is also a force that has an address space different from that of AR A (103A). To maintain communication, the MN (102) uses the mobility protocol to notify the mobility anchor point, CoR (104), of the movement and its new address.
- CoR (104) After receiving the address update message sent in step 403, CoR (104) checks whether MN (102) has previously used that address. As described in the first embodiment in which the MN (102) recognizes an address, the CoR (104) performs the first step 301 of receiving the address update message, which is also sent by the MN (102) in step 403. Thus, the method of FIG. 3 can be used. In this case, CoR (104) also maintains a database of previous local addresses used by MN (102), using timers associated with each address.
- the route setting procedure includes new establishment of message transmission cooperation between signaling recognition nodes along the data path, setting of a signaling message routing table, and the like.
- the CoR (104) sends a reservation and status setup message along the new data path towards the MN (102) (step 405).
- This message causes the signaling aware node along the new data path to generate state information about the application session and to allocate the necessary network resources for the data flow.
- CoR (104) is a local mobility anchor point
- the movement of MN (102) from position 102 A to position 102B can be performed by an external network node, such as CN (101), for example.
- CN an external network node
- MN (1 02) stays at the same contact point.
- CoR (104) does not have to send every message along the common part of the data path.
- the MN (102) may respond with a response message to indicate the result of the state setup (step 406). Also, in the same message, MN (102) indicates a request for processing for the old data path, eg, an immediate disconnect or its maintenance. This response is relayed by the signaling aware node along the new data path towards CoR (104). At this point, the communication application is new, flowing through the CoR (104) in the direction of the data path.
- the CoR (104) sends a zero setup message along the old data route (step 407).
- This zero configuration message sent in step 407 causes the signaling aware node along the old data path to release the corresponding network resources for the communication session, but preserve the signaling coordination and state information.
- the corresponding state is latent with the timer set. This is similar to the operation described in the first embodiment.
- MN (102) returns to position 102A and accesses AR A (103A)
- Step 408 The MN (102) is assigned a new local address, and the MN (102) reports this to the CoR (104) with an update message (step 409).
- the CoR (104) After receiving this address update message sent in step 409, the CoR (104) checks its address to see if it is the address that the MN (102) previously used. Search the local database. Address is valid in the database If so, CoR (104) sends a restoration status message along the old path (step 411). With this restoration message sent in step 411, the valid latent state signaling aware node reactivates the state and allocates all necessary resources to the application session. Because the state information is already available, this restoration process takes place much more quickly than the normal state establishment process.
- MN (102) Force If the restoration status message sent in step 411 is found, the MN (102) reports the result of the restoration, and that it is the preferred processing of the previous route Respond with a state restore response message to indicate (step 412).
- This response message sent in step 412 is relayed by the signaling aware node along the path in the direction of CoR (104). If CoR (104) finds a message containing a flag to disconnect the previous path (111, 112, 113), then CoR (104) contains the value of the timer in the direction of the previous data path. Send a set zero message (step 413). This message, as well as the effect of the message sent in step 407, renders the state on the signaling aware node for the application latent and releases the corresponding network resource.
- CN (101) does not recognize the movement as long as MN (102) moves within the region of CoR (104). Therefore, all these signaling occur only in the changed part. There is no need to change or update the common data path.
- the mono node communicates with the fixed node.
- the present invention can also be applied to the case where both ends of the communication endpoint are mono nodes. In this case, there are two crossover routers, and the invention applies on all old data traffic paths.
- the change of data path is caused by the movement of the mobile terminal.
- changes in routes may be triggered due to temporary network failure or load balancing reasons.
- the signaling does not include the mobility protocol.
- Figure 5 is a scenario that illustrates the case where a route change occurs for communication between two fixed end hosts.
- Fixed end host A (EH A) (501A) is a network router A (NR A) (502A), a crossover router A (CoR A) (503A), NR B (502B), CoR B (503B) And start communication with the fixed end host B (EH B) (501B) through the NRD (502D) route.
- NR A network router A
- CoR A crossover router A
- NR B NR B
- CoR B CoR B
- start communication the fixed end host B (EH B) (501B) through the NRD (502D) route.
- the network routing protocol diverts data traffic to other routes such as, for example, CoRA (503A) to NR C (502C) or NR C (502C) to CoRB (503B).
- This type of rerouting also causes certain signaling actions, such as, for example, QoS reservations along new routes for application sessions.
- CoRA A (503A) and Co RB (503B) notice a change in route by monitoring the output or input interface to the communication data flow. Note that this requires some information that can be used by the routing protocol.
- the transition to a new data route may be, for example, only a temporary measure, such as a route being just a backup route. Once the old route is available, data traffic must be returned to the original route, for example, for delay or cost reasons.
- Figure 6 shows the data path quickly An exemplary signaling procedure for using the present invention in temporary failure situations to recover the
- EH A (501A) initiates communication with EH B (501B) through the old path through NR B (502B).
- the signaling status and required network resources are already assigned to data flows along the data path for certain QoS guarantees (step 601).
- the route through the NR B can no longer be used for communication applications (step 602). As discussed above, this may occur due to a combination of several reasons, such as, for example, link failure between CoRA (503A) and NR B (502B).
- the routing protocol used in the network automatically diverts data traffic to other routes, such as, for example, NR C (502C).
- CoR A (503A) and CoR B (503B) detect route changes as described above.
- CoRA A (503A) and CoRB (503B) start discovering new signaling pathways (step 603).
- signaling state and resource reservation are established along the new data route (step 604).
- the detailed operation of these two procedures depends on the communication data flow and the direction of the protocol in use.
- the communication data flows along the new! / Data route! /, And the necessary resources for providing the QoS guarantee are already allocated! /. Since the old data route is no longer in use, CoRA A (503A) and CoRB (503B) send zeroing messages for resources along the old data path (step 605).
- This zero setup message causes all signaling aware nodes along the old data route to release the network resources allocated for the data flow and to put the relevant state into latent mode using a timer. The value of the timer is indicated in the set zero message sent in step 605. If the timer expires, the latent state is deleted.
- Step 606A and Step 606B This search process is Periodically sends a search message along the old data route for a set period of time. If the discovery message can not pass in that period, the old state information on the old data route is deleted.
- the length of the preset period is determined by CoR based on the characteristics of the network, for example, in the case of a skeleton, the period becomes longer.
- the search message passes.
- the search message sent by CoRA (503A) is relayed to CoRB (503B) by NR B (502B) (step 608). This means that at this point old data routes can be used for the service.
- CoR B After receiving this search message, CoR B (503B) reactivates the old state for the old, data route (step 609), and restores the state message along the old path of CoRA A (503A). Send in the direction (step 610).
- This restoration message sent at step 610 contains state information necessary to restore resource reservations and other states used for data flow along the old path. For example, a signaling aware node along an old route, such as NR B (502B), uses the holding information to restore state and prepare it to be used for data flow.
- CoRA informs the corresponding routing management entity to divert the data flow back to the old data path, ie via NR B (502B). Do. Since state and resource reservations are already established before re-bypassing, data flows can obtain QoS guarantees without further processing.
- the present invention can be used in the technology related to data communication networks. Furthermore, the present invention can be used particularly in techniques related to resource management signaling of packet-based data communication systems, and techniques related to general status management of end-to-end (R2) end-to-end path specific signaling applications. .
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP05710119A EP1715635A1 (en) | 2004-02-13 | 2005-02-10 | Signaling management in data communication network |
US10/588,820 US20070291790A1 (en) | 2004-02-13 | 2005-02-10 | Signaling Management in Data Communication Network |
JP2005517979A JPWO2005079024A1 (ja) | 2004-02-13 | 2005-02-10 | データ通信ネットワークにおけるシグナリング管理 |
BRPI0507570-0A BRPI0507570A (pt) | 2004-02-13 | 2005-02-10 | sistemas para gerenciar sinalização em uma rede de comunicação de dados, para o dito terminal de comunicação com capacidade móvel, para o dito terminal correspondente que se comunica com o dito terminal de comunicação com capacidade móvel, para o dito ponto de áncora de mobilidade local, e, métodos para a sinalização de gerenciamento de recursos em uma rede de comunicaçaõ de dados, para o dito terminal de comunicação decidir o valor da sinalização, para o terminal móvel detectar o retorno ao trajeto de dados antigo, para o nó cruzado detectar o retorno do terminal móvel ao trajeto de dados antigo, método para o terminal móvel decidir o valor do cronÈmetro, e para o dito nó cruzado monitorar a disponibilidade de trajeto antigo |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004-037518 | 2004-02-13 | ||
JP2004037518 | 2004-02-13 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2005079024A1 true WO2005079024A1 (ja) | 2005-08-25 |
Family
ID=34857773
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/002067 WO2005079024A1 (ja) | 2004-02-13 | 2005-02-10 | データ通信ネットワークにおけるシグナリング管理 |
Country Status (8)
Country | Link |
---|---|
US (1) | US20070291790A1 (ja) |
EP (1) | EP1715635A1 (ja) |
JP (1) | JPWO2005079024A1 (ja) |
KR (1) | KR20060127185A (ja) |
CN (1) | CN1943187A (ja) |
BR (1) | BRPI0507570A (ja) |
RU (1) | RU2006132723A (ja) |
WO (1) | WO2005079024A1 (ja) |
Families Citing this family (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7864708B1 (en) | 2003-07-15 | 2011-01-04 | Cisco Technology, Inc. | Method and apparatus for forwarding a tunneled packet in a data communications network |
US7630298B2 (en) | 2004-10-27 | 2009-12-08 | Cisco Technology, Inc. | Method and apparatus for forwarding data in a data communications network |
JP4818639B2 (ja) * | 2005-05-13 | 2011-11-16 | 株式会社エヌ・ティ・ティ・ドコモ | データバックアップシステム |
US7848224B2 (en) * | 2005-07-05 | 2010-12-07 | Cisco Technology, Inc. | Method and apparatus for constructing a repair path for multicast data |
US7835312B2 (en) * | 2005-07-20 | 2010-11-16 | Cisco Technology, Inc. | Method and apparatus for updating label-switched paths |
WO2008044646A1 (fr) * | 2006-10-06 | 2008-04-17 | Nippon Telegraph And Telephone Corporation | Appareil de nœud de communication, systÈme de communication, et procÉDÉ d'affectation de ressources de trajet |
CN101741678B (zh) * | 2008-11-26 | 2012-02-29 | 华为技术有限公司 | 一种建立虚拟局域网连接的方法、设备与系统 |
US9578722B2 (en) * | 2008-12-04 | 2017-02-21 | Philips Lighting Holding B.V. | Methods for selecting and controlling devices |
EP2441232B1 (en) * | 2009-06-09 | 2014-10-29 | Nokia Solutions and Networks Oy | Methods, apparatuses, and related computer program product for network element recovery |
US9450989B2 (en) * | 2010-05-19 | 2016-09-20 | Avaya Inc. | SIP anchor points to populate common communication logs |
DE102014106017A1 (de) * | 2014-04-29 | 2015-10-29 | Beckhoff Automation Gmbh | Verfahren zum Betreiben eines Netzwerks und Netzwerkteilnehmer |
CN108347723B (zh) * | 2017-01-25 | 2021-01-29 | 华为技术有限公司 | 一种切换方法和装置 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH08186578A (ja) * | 1994-12-28 | 1996-07-16 | Nippon Telegr & Teleph Corp <Ntt> | Atm網の交換処理制御方法 |
JPH10164069A (ja) * | 1996-11-26 | 1998-06-19 | Oki Electric Ind Co Ltd | コネクション制御方法及び装置 |
WO1999023793A1 (fr) * | 1997-10-30 | 1999-05-14 | Ntt Mobile Communications Network Inc. | Reseau de communication par paquets |
JP2000316179A (ja) * | 1998-07-02 | 2000-11-14 | Nec Commun Syst Ltd | 移動体通信網の加入者データ制御方法 |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6643279B1 (en) * | 1998-09-01 | 2003-11-04 | Nec Corporation | Handoff control for point to multipoint connections in mobile ATM networks |
US7193968B1 (en) * | 2001-02-08 | 2007-03-20 | Cisco Technology, Inc. | Sample netflow for network traffic data collection |
JP3789786B2 (ja) * | 2001-08-15 | 2006-06-28 | 日本電信電話株式会社 | 移動通信システムおよびホームエージェントおよび通信相手端末および移動端末および移動通信方法およびプログラムおよび記録媒体 |
US7020087B2 (en) * | 2003-01-13 | 2006-03-28 | Motorola, Inc. | Segmented and distributed path optimization in a communication network |
-
2005
- 2005-02-10 EP EP05710119A patent/EP1715635A1/en not_active Withdrawn
- 2005-02-10 CN CNA2005800112186A patent/CN1943187A/zh active Pending
- 2005-02-10 BR BRPI0507570-0A patent/BRPI0507570A/pt not_active Application Discontinuation
- 2005-02-10 KR KR1020067018663A patent/KR20060127185A/ko not_active Application Discontinuation
- 2005-02-10 US US10/588,820 patent/US20070291790A1/en not_active Abandoned
- 2005-02-10 JP JP2005517979A patent/JPWO2005079024A1/ja active Pending
- 2005-02-10 WO PCT/JP2005/002067 patent/WO2005079024A1/ja active Application Filing
- 2005-02-10 RU RU2006132723/09A patent/RU2006132723A/ru not_active Application Discontinuation
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH08186578A (ja) * | 1994-12-28 | 1996-07-16 | Nippon Telegr & Teleph Corp <Ntt> | Atm網の交換処理制御方法 |
JPH10164069A (ja) * | 1996-11-26 | 1998-06-19 | Oki Electric Ind Co Ltd | コネクション制御方法及び装置 |
WO1999023793A1 (fr) * | 1997-10-30 | 1999-05-14 | Ntt Mobile Communications Network Inc. | Reseau de communication par paquets |
JP2000316179A (ja) * | 1998-07-02 | 2000-11-14 | Nec Commun Syst Ltd | 移動体通信網の加入者データ制御方法 |
Also Published As
Publication number | Publication date |
---|---|
BRPI0507570A (pt) | 2007-07-03 |
EP1715635A1 (en) | 2006-10-25 |
JPWO2005079024A1 (ja) | 2007-08-02 |
KR20060127185A (ko) | 2006-12-11 |
RU2006132723A (ru) | 2008-03-20 |
CN1943187A (zh) | 2007-04-04 |
US20070291790A1 (en) | 2007-12-20 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2005079024A1 (ja) | データ通信ネットワークにおけるシグナリング管理 | |
US8248916B2 (en) | Recovery methods for restoring service in a distributed radio access network | |
US7082130B2 (en) | System and method for point-to-point protocol device redundancey | |
JP4111793B2 (ja) | 中継システム | |
US7693093B2 (en) | QoS-aware handover procedure for IP-based mobile ad-hoc network environments | |
JP5727055B2 (ja) | 地理的冗長ゲートウェイでのセッション復元性のためのシステムおよび方法 | |
US8248915B2 (en) | Redundant session information for a distributed network | |
US8315172B2 (en) | Monitoring access nodes in a distributed radio access network | |
US7433317B2 (en) | Network connection apparatus and network connection switching method | |
US9577870B2 (en) | Address allocation in a network | |
US20070153750A1 (en) | Reactivating a communication session for a dormant mobile station | |
CN112448877B (zh) | 一种sbfd会话的建立方法、设备及系统 | |
US20040081086A1 (en) | Method for redirecting packet data traffic to an alternative access point/router | |
US6061728A (en) | Arrangement for controlling network proxy device traffic on a transparently-bridged local area network using a master proxy device | |
US8130719B2 (en) | PDSN-based session recovery from RBS/AN failure in a distributed architecture network | |
KR100552471B1 (ko) | 무선네트워크에서 억세스포인트를 이용하여 CoA를 미리예약하고 라우팅을 하여 빠른 핸드오프를 수행하는 방법 | |
US20080316962A1 (en) | Method, system and apparatus for performing mobile internet protocol deregistering | |
WO2004093397A1 (ja) | ルーティング制御方法、ルータ装置、及び端末装置 | |
WO2008038390A1 (fr) | système de communication IP mobile | |
WO2011110109A2 (zh) | 连接建立方法、故障处理方法、通信系统及相关设备 | |
KR101889588B1 (ko) | 피엠아이피브이6 엠에이지 복원 | |
KR100586588B1 (ko) | 애드 혹 망에서의 애드 혹 라우팅 기술을 이용한 서비스연결 설정 방법 | |
JP4583433B2 (ja) | 中継システム | |
JP3659236B2 (ja) | モバイル通信網システム、外部エージェントルータ、アドレスサーバ及びそれらに用いるパケット配送方法 | |
WO2010111918A1 (zh) | 一种接管失效本地移动锚点的方法和网络设备 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 2005710119 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2005517979 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020067018663 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2006132723 Country of ref document: RU |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200580011218.6 Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 2005710119 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1020067018663 Country of ref document: KR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10588820 Country of ref document: US |
|
ENP | Entry into the national phase |
Ref document number: PI0507570 Country of ref document: BR |
|
WWP | Wipo information: published in national office |
Ref document number: 10588820 Country of ref document: US |