WO1992022971A1 - Method for determining alternative route - Google Patents
Method for determining alternative route Download PDFInfo
- Publication number
- WO1992022971A1 WO1992022971A1 PCT/JP1992/000764 JP9200764W WO9222971A1 WO 1992022971 A1 WO1992022971 A1 WO 1992022971A1 JP 9200764 W JP9200764 W JP 9200764W WO 9222971 A1 WO9222971 A1 WO 9222971A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- node
- route
- identification information
- bucket
- packet
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/10—Routing in connection-oriented networks, e.g. X.25 or ATM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
Definitions
- the present invention relates to a high-speed bucket communication network including a plurality of nodes, wherein adjacent ones of the plurality of nodes are linked to each other.
- the high-speed bucket communication network to which the present invention is applied which relates to a bypass path determination method for determining identification information of a packet path of a bypass path that bypasses one node of It is like.
- a logical packet communication path from the sender of the bucket to the receiver is generally set up via a plurality of nodes in the network, and such a packet communication is performed between each node.
- a bucket route that accommodates multiple communication routes is set.
- a physical transmission path between nodes (for example, an optical fiber) accommodates a plurality of bucket paths as described above.
- a plurality of bucket routes are identified by an identification number, and for a node existing in the route of the bucket, a plurality of incoming packet routes of the node are respectively connected to corresponding outgoing bucket routes.
- Has cross-connect equipment Which incoming packet route is to be connected to which outgoing packet route is given in advance as routing information to each node device from the operation system that manages the high-speed bucket communication network.
- each bucket identifies the bucket route while being transmitted through the bucket route.
- An area for displaying the identification number (identification information of the bucket route) is provided, and the content of this area is rewritten in the cross-connect device in each node according to the conversion table provided in the cross-connect device.
- each node recognizes what bucket route is set for the incoming bucket route and the outgoing bucket route, and what the identification number is. There is a need.
- Each of the plurality of nodes as described above is used to identify a packet route in use and a bucket in non-use for a link between its own node and all adjacent nodes. It has a bucket route identification information conversion table 4 for storing route identification information and. Background art
- the node that has detected the fault uses the self node as the end node of the detour path and sends a detour path search message that specifies the start node of the target detour path.
- the node that has sent this link to the link in any direction connected to the node and received this bypass path search message if the own node is not the start node, the node that the bypass path search message passed through
- a detour path search message including the information of the own node is transmitted to the link in any direction connecting to the node to indicate that the node is the node.
- a node that has received the bypass path search message if the own node is the start node, reverses the node that the message has passed through, which is included in the bypass path search message.
- the detour path setting message is sent to the above destination node. In this way, a detour path is determined.
- An object of the present invention is to associate with the identification information of the packet route set for the outgoing link of the starting point in the original bucket route, An object of the present invention is to provide a detour path determination method for setting identification information of a packet route in each link of the detour path.
- the plurality of nodes include a plurality of nodes, and adjacent ones of the plurality of nodes are linked, and all nodes adjacent to the own node are connected. And a packet route identification information conversion table for storing the identifier of the bucket route in use and the identifier of the bucket route not in use for the link between
- the plurality of nodes are determined in advance. For each of the predefined bucket routes that pass through its own node, each of the nodes on the predefined packet route from the node one upstream of its own node.
- the identification information of the unused bucket route of the link from the node to the own node from the node two upstream of the own node on the previously set packet route.
- a new number of bucket path identifications equal to the number of packet path identifications used in the link to the one upstream node are used for the bypass path.
- a first detour packet route setting step of updating the identification information conversion table of the packet route of the own node, and the end point node performs the first detour packet route setting step.
- the node itself in the already established packet route The information on the identification information of the packet route used in the link from the upstream node to the upstream node is transmitted to the upstream node of the bypass path.
- a first bucket route setting information notification step for notifying the other nodes, and a node other than the end point node and the start point node in the detour path, from its own node in the detour path to its own node.
- the identification information of the newly set bucket route and the identification information of the newly set packet route at the downstream node The corresponding bucket route used in the link from the node two upstream of its own node to the upstream node in the original bucket route.
- Information about the identification information; Scan downstream Bruno receives one de or these, in the newly set identification information of the bucket preparative route
- the newly set The second step is to newly set the identification information of the bucket routes equal in number to the identification information of the bucket route to be used for the bypass path and to update the identification information conversion table of the packet routes.
- a detour packet route setting step, and a bucket other than the end point node and the start point node in the detour path newly set by the second detour packet route setting means Used in the link from the node two nodes upstream of the own node to the node one upstream in the established packet route.
- the information about the bucket route identification information is The second bucket route setting information notification step for notifying a node one node upstream of its own node of the detour path, and the determined starting point node of the detour path is the detour path.
- the bucket route identification information At the link on the path from the own node to the node one level downstream from the own node, the bucket route identification information newly set on the downstream node and the newly set bucket route identification information.
- the plurality of nodes include a plurality of nodes, and adjacent ones of the plurality of nodes are linked to each other.
- -A high-speed link having a packet route identification information conversion table that stores the used bucket route identification information and the unused bucket route identification information.
- the identification information of the bucket path of the bypass path that determines the identification information of the bucket path of the bypass path that bypasses one of the nodes of the packet path that has been set, the system further comprises:
- Each of the nodes has a link from one node upstream of its own node to its own node for each of the established packet routes that pass through its own node.
- Bucket route used Identification information and information on the identification of the bucket route used in the link from the node two nodes upstream of the own node to the node one node upstream of the node; and Packet route storage means for storing upstream nodes, and for each bucket route passing through its own node, two upstream nodes in the previously set bucket route.
- Path starting means and its own node as an end point, a detour path determining means for determining a detour path that bypasses the one upstream node in the previously set packet route, and an end point at a node other than its own node
- a detour path upstream node storage means for storing one upstream node of the detour path passing through the own node; and that the own node is the end point of the determined detour path.
- First detour packet route setting means for newly setting the identification information of an equal number of bucket routes to be used for the detour path and updating the identification information conversion table of the packet route;
- the identification information of the bucket route newly set by the first detour bucket route setting means When its own node is the end point of the determined detour path, the identification information of the bucket route newly set by the first detour bucket route setting means, and the newly set bucket route.
- the path storage means corresponding to the identification information of the route In a preset packet route that is to be bypassed by the bypass path, a node from the node two upstream of the own node to the node one upstream of the own node.
- First packet route setting information notifying means for notifying the information on the identification information of the bucket route used in the link to the one upstream node of the bypass path; Is a node passing through the bypass path determined above, at a link in the bypass path from the own node to a node one downstream from the own node.
- One node above two nodes upstream of Knowledge of the bucket route used on the link to the flow node When the information about the alternative information is notified from the downstream node of the detour path, the information of the own node on the detour path is corresponded to the newly set identification information of the bucket route.
- Second detour packet route setting means for newly setting the identification information of the detour route for use in the detour path and updating the identification information conversion table of the packet route; and its own node. Is a node through which the determined detour path passes, the identification information of the bucket route newly set by the second detour bucket route setting means, and the previously set packet. 2 of your own nodes on the route
- the information on the identification information of the packet route used in the link from the upstream node to the upstream node is referred to as one of the own nodes of the bypass path.
- the identification information of the newly set bucket route and the identification information of the newly set packet route at the downstream node The packet route used in the link from the node upstream of the own node to the node upstream of the own node in the preset bucket route corresponding to Information about the identification information of the detour path
- you in the packet route of said original And updating the packet route identification information conversion table in its own node with the newly set bucket route identification information based on the information on the bucket route identification information to be used.
- FIG. 1 is a diagram showing a basic configuration of a first embodiment of the present invention
- FIG. 2 is a diagram showing a basic configuration of a second embodiment of the present invention
- FIG. 3 is an example of a packet route storage step i.
- FIG. 4 is a diagram showing an example of a maintenance bucket in the bucket route storage step.
- FIG. 5 is a diagram showing a bucket route before detour in order to show an example of a process for determining packet route identification information of a detour path according to the present invention
- FIG. 6 is a diagram showing a processing procedure for determining identification information of a packet route of a detour path at an end point node.
- FIG. 7 is a diagram showing an example of a process for determining bucket route identification information of a detour path according to the present invention.
- FIG. 8 shows that nodes other than the end node in the detour path start at the node one downstream from the own node, and are newly set at the downstream node.
- the original (pre-set) bucket route corresponding to the identification information of the bucket route of the link reaching the node, and the identification information of the newly set bucket route.
- FIG. 9 is a diagram showing a processing procedure when a message including information on identification information of a used packet route is received.
- Figure 9 shows an example of the format of the information area of a maintenance packet that contains messages sent upstream, traversing the detour path nodes one by one from the end node to the start node.
- Figure 10 shows another example of the format of the information area of the maintenance bucket, which includes messages sent upstream by traversing the nodes of the detour path one by one from the end node to the start node.
- FIG. 11 is a diagram schematically showing the configuration of a cross-connect device as a node device in the embodiment of the present invention.
- FIG. 1 shows a basic procedure of a bypass path determination method according to a first embodiment of the present invention.
- a high-speed packet communication network to which the detour path determination method of the present invention is applied includes a plurality of nodes, and adjacent ones of the plurality of nodes are linked to each other. For each link between its own node and all adjacent nodes, each of the nodes identifies the identity of the bucket route in use and the identity of the bucket route not in use. It has a packet route identification information conversion table 4 to be stored.
- the method for determining a detour path according to the present invention provides a method for determining a previously set packet route in the high-speed packet communication network. This is to determine the identification information of the packet route of the detour path that bypasses one node.
- each of the plurality of nodes has its own node on the preset packet route for each of the preset packet routes passing through its own node.
- the first node on the previously set packet route is a node upstream of the one node, and the last node on the packet route is an end point.
- the nodes other than the start point node on the detour path store the nodes one upstream of the detour path.
- the end point node transfers the node from one upstream of its own node in the detour path to its own node.
- the identification information of the unused bucket route of the link the node upstream of its own node, the node upstream of its own node, etc. on the above-mentioned established packet route.
- the same number of packet route identification information as the number of packet route identification information used in the incoming link is newly set to be used for the bypass path, and the packet route identification information is set. Update the identification information conversion table 4.
- the end point node identifies the bucket route newly set in the first detour bucket route setting step 5, and
- the information on the identification information of the packet route used in the link from the node two nodes upstream to the node one upstream from the node upstream from the node one node upstream of the detour path Notify the node.
- the nodes other than the end point node and the start point node in the detour path are changed from their own nodes to their own nodes in the detour path.
- the link corresponding to the node that is one more downstream downstream corresponds to the newly set packet route identification information at the downstream node and the newly set bucket route identification information.
- the identification information of the bucket route used in the link from the node two upstream of the own node to the node one upstream in the original bucket route.
- Information from the downstream node of the bypass path, and corresponding to the newly set identification information of the packet route a node one upstream of its own node in the bypass path.
- the same number of bucket route identification information as the newly set bucket route identification information is newly set to be used for the bypass path.
- the said package Update the identification information conversion table 4 for the packet route.
- nodes other than the end point node and the start point node in the detour path are sent to the second detour packet route setting means 7.
- the information on the identification information of the bucket route used in the link is notified to a node one upstream of its own node in the bypass path.
- the starting node of the determined bypass path is the downstream node in the link from the own node to the node one downstream from the own node in the bypass path.
- each of the plurality of nodes has a preset path passing through its own node.
- Packet For each of the routes the identification of the packet route used on the link from the node one node upstream of its own node to its own node on the preset bucket route. And information on the identification information of the bucket route used in the link from the node two upstream of the own node to the node one upstream of the node, and An upstream node is stored.
- the detour path determination step 2 the upstream node of the one node on the previously set packet route is set as a start point, and the downstream node is set as an end point.
- the end point node stores the start point node.
- the nodes other than the start node on the bypass path store the nodes one upstream of the bypass path.
- the start node can be reached by taking the detour path one node at a time from the end node.
- the end point node determines its own node from one upstream of its own node in the detour path.
- the own node In the identification information of the unused packet route of the link reaching the link, the own node is stored in the above-mentioned packet route stored in the above-described packet route storage step 1 and stored.
- the number of bucket route identification information equal to the number of bucket route identification information used in the link from the two upstream nodes to the one upstream node of the detour path A new setting to use for Update the identification information table 4 for the Ket route.
- the identification information of the packet route of the above-mentioned detour path is the end-point node. Set on the host side.
- the end point node includes the bucket route identification information newly set in the first detour packet route setting step 5; According to the newly set bucket route identification information, stored in the path storage means 1, in the previously set packet route to be bypassed by the bypass route, the own route information is stored.
- the information on the identification information of the packet route used in the link from the two upstream nodes to the one upstream node is referred to as the one upstream of the bypass path.
- the above-mentioned notification is performed at each of the nodes other than the end point node and the start point node in the detour path in the second detour bucket route setting step 8 and the second By repeating the bucket route setting information notification step 9, the packet route identification information for each link between these nodes is traced back for each node (link) of the bypass path described above.
- the above notification reaches the starting node back on the detour path.
- the identification information table 4 of the packet route at the start node is updated.
- the setting of the identification information of the bucket route of the bypass path is completed.
- the own packet in the original packet route is The information on the identification information of the packet route used in the link from the two upstream nodes to the one upstream node is described by using the address of each bit in the packet route.
- the converted bitmap data can be transmitted to a more upstream node in the form of the converted bitmap data.
- the bitmap is used at a link in the original packet route from two upstream nodes of the own node to the one upstream node.
- the information on the identification information of the bucket route, which has been used, is provided in the format of the converted bitmap data in both the first and second bucket route setting information notification steps 6 and 8. It is sent to the upstream node.
- the number of identification information of the packet route set in the detour path may be very large, so that the above-described bitmap conversion provides information on the identification information of the original bucket route. It can be prevented that the amount of information when notifying is abnormally large.
- the first bucket route setting information notification step 6 when the identification information is to be ordered, includes the original packet. Out of the information on the packet route identification information used in the link from the node two nodes upstream of the own node to the node one node upstream in the route.
- a first identification information detection sub-step 1 2 for detecting a first value
- bitmap conversion sub-step 14 for converting the information into the bitmap data to be converted into bitmap data, wherein the information relating to the identification information of the packet path is transmitted through the first and second packet path setting information.
- the bit map data may be output as data between the start value and the end value. it can.
- the bitmap data is converted into the information on the identification information of the packet route. Since only the data between the first value and the last value needs to be reported, the amount of information for reporting the information of the identification information of the original bucket route can be further reduced.
- FIG. 2 shows a basic configuration of a bucket route identification information determining system for a detour path according to a second embodiment of the present invention.
- a high-speed packet communication network to which the system for identifying packet route identification information of a bypass path according to the present invention includes a plurality of nodes, wherein adjacent ones of the plurality of nodes are linked.
- Each of the plurality of nodes includes:
- a bucket route identification information conversion table 4 ′ for storing the identification information of the bucket route in use and the identification information of the packet route not in use. is there.
- the bypass path determination method of the present invention determines the identification information of the bucket path of the bypass path that bypasses one node of the preset packet path in the high-speed packet communication network. is there.
- Each of the plurality of nodes is a
- the packet route used in the link from the node one node upstream of the own node to the own node For each of the established packet routes that pass through the own node, the packet route used in the link from the node one node upstream of the own node to the own node. Identification information of a bucket route used in a link from the node two nodes upstream of the own node to the node one node upstream of the own node, and the two items. Packet route storage means 1 ′ that memorizes upstream nodes,
- Detour path determining means 2 ′ that determines a detour path that bypasses the node one upstream in the route
- a detour path upstream node storage means 3 ′ that ends at a node other than its own node and records a node upstream of one of the detour paths passing through its own node;
- First detour packet route setting means 5 for newly setting identification information of an equal number of bucket routes for use in the detour path and updating the packet route identification information conversion table 4 '. '
- the information on the identification information of the bucket route used in the link from the node two nodes upstream of the node to the node one node upstream from the node upstream from the node one node upstream of the node A first bucket route setting information notification means 6 ′ for notifying the node;
- the own node is a node passing through the determined detour path
- the link in the detour path from the own node to a node one downstream from the own node.
- Two above Information on the identification of the packet route used in the link from the flow node to the one upstream node is sent from the downstream node of the bypass path.
- the non-linkage of the link from the node one upstream of the own node to the own node in the bypass path is determined.
- the identification information of the bucket route newly set by the second bypass bucket route setting means 7 ' Information on the identification information of the bucket route used in the link from the node upstream of the own node to the node upstream of the one node in the packet route already set
- a second packet route setting information notifying means 9 ′ for notifying a node one upstream of its own node of the detour path.
- the link on the detour path from the own node to the node one downstream from the own node is used.
- the identification information of the bucket route newly set in the node, and two of the own node in the previously set packet route corresponding to the identification information of the newly set bucket route. Used in the link from the upstream node to the upstream node.
- each of the plurality of nodes has the path storage means 1 ′, so that the end point node is However, it is possible to recognize two nodes upstream of the already established packet route, that is, the start node. In addition, information on the identification information of the packet route on the outgoing link in the direction of the node bypassed by the bypass path at the start node can be recognized at the end node.
- the detour path determination means 2 ', the detour path upstream node storage means 3', the first detour bucket route setting means 5 ', the first packet route setting information notification means 6', the second The detour packet route setting means 8 ′, the second packet route setting information notifying means 9 ′, and the updating means 10 ′ correspond respectively to the first embodiment of the present invention. This is to realize the steps. That is, the procedure of the first mode of the present invention is performed by the configuration of the second mode of the present invention.
- the first packet route setting information notifying means 6 ′ may be configured so that the first packet route setting information
- the information on the identification information of the bucket route used in the link from the two upstream nodes of the node to the one upstream node is described by the address of each bit in the bucket.
- the information relating to the identification information of the bucket route is transmitted from any of the first and second packet route setting information notifying means 6 ′, 8 ′ to the format of the converted bitmap data. Can be sent out.
- the first packet route setting information notifying means 6 ′ may be configured to include the second packet route setting information notifying unit 6 ′ in the original bucket route.
- the head identification information detecting means I for detecting the initial value. 2 'and
- Final identification information detecting means 13 ′ for detecting a final value among information relating to the bucket route identification information in the previously set bucket route
- bitmap conversion means 14 ′ for converting the data into bitmap data
- the information relating to the identification information of the packet route is transmitted to any of the first and second packet route setting information notifying means 6 ′ and 8 ′.
- the data can be output as data between the start value and the end value.
- bitmap conversion means 11 ′ or the first identification information detection means 12 ′, the last identification information detection means 13 ′, and the bit map conversion means 14 ′ for converting to bitmap data are also provided, respectively. This implements the corresponding sub-steps in the first embodiment of the present invention described above.
- the first packet route setting information notifying means 6 adds the first packet route identification information newly set by the first detour packet route setting means 5 ′.
- the value and the number of pieces of identification information of the packet route can be notified to the node upstream of the one in the bypass path.
- FIG. 3 is an explanatory diagram of an example of the packet route storage step 1 described above. As shown in Fig. 3, consider a packet route from node A to node E via nodes B, C, and D. Here, as in the packet route storage step 1 described above, each of the plurality of nodes is set in advance from a node upstream of its own node on the preset packet route.
- the identification of the bucket route used on the link to the own node, and the link from the node two upstream of the own node to the node one upstream of the node The information on the identification information of the packet route used in the network and the two upstream nodes
- a maintenance packet containing the information shown in Figure 4 is transferred from Node A to Node B, Node B to Node C, and from Node D to Node E, respectively. I do. That is, the maintenance bucket transmitted from the starting node A to the node B includes the own node name r Aj in the column of the first adjacent node and the resource from the node A to the node B.
- the identification information “1001” of the packet route in link I is included, and the column of the second adjacent node is a starting node, so it is left blank.
- Node B receiving this maintenance packet writes the received contents of “A” and “1001” in the column of the first adjacent node in the column of the second adjacent node as they are, (1)
- the adjacent node column contains the name of the own node ⁇ BJ '' and the identification information ⁇ 00001 '' of the bucket route on link 2 from node B to node C for maintenance. Sends the bucket on link 2 to node C.
- the node C receiving this maintenance packet writes the received contents “B” and “00001” of the column of the first adjacent node in the column of the second adjacent node as they are, (1) In the adjacent node column, the own node name "C" and the identification information "0101" of the packet route on link 3 from node C to node D are provided. Send the maintenance baguette including the link on link 3 reaching node D. Further, the node D that has received the maintenance bucket writes the received contents “CJ and“ 0101 ”in the column of the first adjacent node in the column of the second adjacent node as it is.
- each of the above KB-E stores the above-mentioned information included in the received maintenance bucket.
- FIG. 5 is the identification information conversion table of the packet route at node B
- ⁇ is the identification information conversion table of the packet route at node C
- 7 is the packet information conversion table at node D.
- 6 is a table identifying information conversion table.
- FIG. 5 shows only the identification information of the bucket route to be described as a detour target.
- the link from node ⁇ to node C has the packet route identification information “0 0 0 1, 0 1 0 2, 0 1 0 3 ”, and the identification information of the packet route“ 0 1 1 1, 0 1 1 2, 0 1 1 3 ”is set for the link from node C to node D, respectively.
- the identification information of the packet route on the link from the node ⁇ to the node C is set to“ 0101, 010 ”by the function of the above-mentioned packet route storage means. 2, 0 1 0 3 "is stored.
- a bypass path from node ⁇ to node D bypassing C is determined.
- the node ⁇ ⁇ no The route from node X to node D is determined to be the detour path.
- FIG. 6 shows a processing procedure for determining the identification information of the packet route of the detour path at the end point node.
- Identification information of the packet route on the link from node B to node C in the previously set bucket route which is recorded in the own node 0 0 0 1, 0 1 0 2, 0 1 0 3 ”, that is, the number of packet route identification information to be switched to the detour path (here, 3), the newly set bucket route identification information (here,“ 1 0 0 1, 1 0 0 2, 1 0 0 3 ”) and update the bucket route identification information conversion table (step 61).
- the identification information of the bucket route of the newly set node X ⁇ node D link is stored in the above described bucket route identification information conversion table of the own node.
- Identification information of the unused packet route of the link of node D ⁇ 0 0 0 0 0 2, 0 1 0 3 j Corresponding to the message as a message via the over-head channel Step 6 2 in Fig. 6 to be transmitted to X and Fig. 7)
- Fig. 7 shows the identification information conversion table of the bucket route updated at the destination node D at this time as 7 '.
- the message sent from the above destination node is indicated by a.
- FIG. 8 shows that the nodes other than the end point nodes in the detour path are nodes that are one downstream from the own node. Corresponding to the newly set packet route identification information from the self-node to the downstream node, and the newly set bucket route identification information at the downstream node.
- step 71 it is determined whether or not the own node is the start node, and if it is not the start node, the process proceeds to step 72 and the above-described new message included in the received message is included.
- the identification information conversion table of the packet route in its own node is set in accordance with the set identification information of the packet route. Then, in response to the newly set bucket route identification information, non-use of a link from one upstream node of the own node to the own node in the detour path. Among the identification information of the packet routes in the middle, the identification information of the number of bucket routes equal to the identification information of the newly set bucket route is newly set to be used for the bypass path. Then, the identification information conversion table of the packet route of the own node is updated.
- FIG. 7 shows the updated packet route identification information conversion table 5 at the detour path node X. In the example of FIG. 7, the identification information of the packet route on the link from node B to node X is the same as that of the packet route on the link from node X to node D. Identification information
- step 73 the identification information of the bucket route newly set in the above-mentioned own node, and the node two nodes upstream of the start point node in the previously set bucket route
- the message containing the information on the identification of the bucket route used in the link from the upstream node to the upstream node is sent to the node immediately upstream of its own node in the bypass path. To notify.
- this message sent from the node X is indicated by b.
- step 71 If it is determined in step 71 that the own node is the start node, the process proceeds to step 74 and two of the start nodes included in the received message in the above-described set bucket route. Based on the information on the identification of the packet route used in the link from the upstream node to the one upstream node, the identification information of the packet route on its own node A corresponding part of the conversion table is searched, and an identification information conversion table of the bucket route is set in accordance with the newly set identification information of the bucket route. In FIG. 7, the identification information conversion table of the packet route in the node B is updated from “HI” in FIG. 5 to “′” in FIG. That is, in FIG. 5 and FIG.
- the identification information of the packet route of the ingress link of the node X “The packet format of the outgoing link corresponding to“ 00001, 002, 0000J ”.
- the route identification information is obtained from the node B ⁇ node X link based on the bucket route identification information “0101, 0102, 0103” at the link from node B ⁇ node C.
- the identification information of the packet route in the link has been updated to “2001, 2002, 2003J”. Also, the information contained in the above message can be compressed as described below with reference to FIGS. 9 and 10.
- Fig. 9 shows the format of the format of the information area of the maintenance packet including the message sent upstream, traversing the detour path nodes one by one from the end node to the start node as described above. This shows one example.
- the maintenance bucket shown in Fig. 9 is a newly set node on the node that sends this maintenance bucket, and is a link from the node that is one node upstream of the own node on the bypass path to the own node.
- the minimum value of the bucket route identification information, the number of the bucket route identification information, and two nodes upstream from the own node in the already set bucket route, from the own node The information on the identification information of the packet route set in the link to the one upstream node is replaced with the bit corresponding to the information that the address of each bit includes in the identification information of the bucket route. Includes bitmap mape converted to mapped map.
- the newly set identification information of the bucket route of the link from the node one upstream of the own node to the own node on the detour path is set to its minimum value.
- each node in the detour path when newly setting the identification information of the packet route, uses the identification information conversion table of the packet route of its own node.
- FIG. 10 shows the maintenance including the message sent upstream from the end point node to the start point node as described above, one node at a time in the detour path. It shows another example of the format of the information area of the packet for use.
- the 10 is a link that is newly set at the node that sends out this maintenance packet and that extends from the node one upstream of the own node on the bypass path to the own node.
- the minimum and maximum values of the information on the identification of the bucket route that was set at the link to the node one upstream from the node, set at the link to the node one upstream from the node set at the link to the node one upstream from the node
- the above information of the bit map data obtained by converting the information on the identification information of the bucket route into bit map data corresponding to the information on the identification information of the packet route at each bit address. Min and max And the part between.
- FIG. 11 schematically shows the configuration of a cross-connect device as a node device in an embodiment of the present invention.
- 31 is a controller
- 32 is a reception interface
- 33 is a packet route identification information conversion section
- 34 is a switch section
- 36 is a transmission interface.
- the plurality of receiving interfaces 32 are provided corresponding to incoming links from other nodes, respectively, and the packet of the high-speed packet communication received by each receiving interface corresponds to the corresponding packet.
- the packet route identification information is converted by the packet route identification information conversion unit 33, and the transmission unit corresponding to the packet route identification information of each bucket is converted by the switch unit 34. It is switched to the route to one interface 36, and is sent to the outgoing link corresponding to each transmission interface 36.
- the controller 31 controls the controller 31.
- the receiving interface 32 has a function of detecting a fault on the input link side, and the detected fault is notified to the controller 31.
- the controller 31 performs the control according to the present invention as described above in response to the notification of the failure.
- the message transmission between the nodes for control as described above is performed by the controller 31 of each node device in the same manner as a conventionally devised normal maintenance packet. This is performed by generating a maintenance packet that includes the desired destination address in the header and inserting it into the receiving interface 32.On the contrary, the maintenance packet addressed to the own node by the controller 31 is performed.
- the packet route identification information for each link of the bypass path can be set in association with the packet route identification information set for the link.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Description
Claims
Priority Applications (5)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP51080292A JP3388581B2 (ja) | 1991-06-18 | 1992-06-16 | 交換単位方路識別情報決定方法、および、該方法を実施するためのシステムならびにノード装置 |
EP19920911107 EP0544007B1 (en) | 1991-06-18 | 1992-06-16 | Method for determining alternative route |
CA 2089726 CA2089726C (en) | 1991-06-18 | 1992-06-16 | Detour path determination method |
DE1992633414 DE69233414T2 (de) | 1991-06-18 | 1992-06-16 | Verfahren zur bestimmung eines alternativen leitweges |
US08/406,783 US6084882A (en) | 1991-06-18 | 1995-03-20 | Detour path determination method |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP3/146127 | 1991-06-18 | ||
JP14612791 | 1991-06-18 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO1992022971A1 true WO1992022971A1 (en) | 1992-12-23 |
Family
ID=15400761
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP1992/000764 WO1992022971A1 (en) | 1991-06-18 | 1992-06-16 | Method for determining alternative route |
Country Status (6)
Country | Link |
---|---|
US (1) | US6084882A (ja) |
EP (1) | EP0544007B1 (ja) |
JP (1) | JP3388581B2 (ja) |
CA (1) | CA2089726C (ja) |
DE (1) | DE69233414T2 (ja) |
WO (1) | WO1992022971A1 (ja) |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6282489B1 (en) * | 1993-05-28 | 2001-08-28 | Mapquest.Com, Inc. | Methods and apparatus for displaying a travel route and generating a list of places of interest located near the travel route |
US6034945A (en) | 1996-05-15 | 2000-03-07 | Cisco Technology, Inc. | Method and apparatus for per traffic flow buffer management |
US6430191B1 (en) | 1997-06-30 | 2002-08-06 | Cisco Technology, Inc. | Multi-stage queuing discipline |
US6201813B1 (en) | 1997-06-30 | 2001-03-13 | Cisco Technology, Inc. | Method and apparatus for using ATM queues for segmentation and reassembly of data frames |
US7835266B2 (en) * | 2002-10-29 | 2010-11-16 | Fujitsu Limited | Node apparatus and maintenance and operation supporting device |
WO2004056051A1 (en) * | 2002-12-18 | 2004-07-01 | Koninklijke Philips Electronics N.V. | Return path derivation in packet-switched networks |
US7471669B1 (en) * | 2004-09-30 | 2008-12-30 | Nortel Networks Limited | Routing of protocol data units within a communication network |
US7729708B2 (en) * | 2005-01-31 | 2010-06-01 | The Invention Science Fund I, Llc | Method and system for interactive mapping to provide goal-oriented instructions |
US20080215435A1 (en) * | 2005-03-22 | 2008-09-04 | Searete Llc, A Limited Liability Corporation Of The State Of Delaware | Map-based guide system and method |
US9286729B2 (en) | 2005-02-25 | 2016-03-15 | The Invention Science Fund I, Llc | Image mapping to provide visual geographic path |
US7734073B2 (en) * | 2005-02-25 | 2010-06-08 | The Invention Science Fund I, Llc | Image mapping to provide visual geographic path |
US20060217880A1 (en) * | 2005-03-22 | 2006-09-28 | Jung Edward K | Map-based guide system and method |
US9702713B2 (en) | 2005-01-31 | 2017-07-11 | Searete Llc | Map-based guide system and method |
US8635014B2 (en) * | 2005-03-22 | 2014-01-21 | The Invention Science Fund I, Llc | Map-based guide system and method |
US9214033B2 (en) | 2005-06-01 | 2015-12-15 | Invention Science Fund I, Llc | Map display system and method |
US7756300B2 (en) | 2005-02-25 | 2010-07-13 | The Invention Science Fund I, Llc | Image mapping to provide visual geographic path |
US9188454B2 (en) * | 2005-03-22 | 2015-11-17 | Invention Science Fund I, Llc | Map-based guide system and method |
US7522996B2 (en) * | 2005-04-30 | 2009-04-21 | Searete Llc | Map display system and method |
US8396001B2 (en) * | 2005-02-03 | 2013-03-12 | The Invention Science Fund I, Llc | Interactive queued mapping method and system |
US8311733B2 (en) * | 2005-02-15 | 2012-11-13 | The Invention Science Fund I, Llc | Interactive key frame image mapping system and method |
JP5219842B2 (ja) * | 2006-02-01 | 2013-06-26 | ココ・コミュニケーションズ・コーポレーション | プロトコル回線レイヤ |
CN116501694A (zh) * | 2022-01-21 | 2023-07-28 | 戴尔产品有限公司 | 数据存储方法、数据读取方法、电子设备和程序产品 |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS6416041A (en) * | 1987-07-09 | 1989-01-19 | Canon Kk | Time division multiplexing system |
JPH0276435A (ja) * | 1988-09-13 | 1990-03-15 | Nec Eng Ltd | X−75方式パケット交換網の網制御方式 |
JPH0278373A (ja) * | 1988-09-14 | 1990-03-19 | Fuji Xerox Co Ltd | 画像データ伝送装置 |
JPH0298257A (ja) * | 1988-10-05 | 1990-04-10 | Fujitsu Ltd | 通信路再設定方式 |
JPH03112239A (ja) * | 1989-09-26 | 1991-05-13 | Mitsubishi Electric Corp | パケット伝送方法 |
WO1991007040A1 (en) * | 1989-11-06 | 1991-05-16 | American Telephone & Telegraph Company | Automatic fault recovery in a packet network |
Family Cites Families (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE3642141A1 (de) * | 1986-12-10 | 1988-06-16 | Philips Patentverwaltung | Verfahren zur dezentralen netzersatzschaltung |
CA1291549C (en) * | 1987-11-06 | 1991-10-29 | Wayne D. Grover | Method and apparatus for self-healing and self-provisioning networks |
US5241533A (en) * | 1988-07-21 | 1993-08-31 | Hitachi, Ltd. | Packet switching network with alternate trunking function |
JP2553193B2 (ja) * | 1989-03-30 | 1996-11-13 | 日本電気株式会社 | ネットワーク制御パス網の予備回線制御方式 |
JP2540950B2 (ja) * | 1989-07-26 | 1996-10-09 | 日本電気株式会社 | 分散型障害回復方式及び装置 |
US5235599A (en) * | 1989-07-26 | 1993-08-10 | Nec Corporation | Self-healing network with distributed failure restoration capabilities |
CA2032620C (en) * | 1989-12-22 | 1995-08-15 | Takafumi Chujo | Method for searching for alternate path in communication network |
US5093824A (en) * | 1990-03-27 | 1992-03-03 | Bell Communications Research, Inc. | Distributed protocol for improving the survivability of telecommunications trunk networks |
US5233600A (en) * | 1990-08-06 | 1993-08-03 | Alcatel Network Systems, Inc. | Method and apparatus for identifying a failed span in a network of span interconnected nodes |
-
1992
- 1992-06-16 WO PCT/JP1992/000764 patent/WO1992022971A1/ja active IP Right Grant
- 1992-06-16 EP EP19920911107 patent/EP0544007B1/en not_active Expired - Lifetime
- 1992-06-16 DE DE1992633414 patent/DE69233414T2/de not_active Expired - Fee Related
- 1992-06-16 JP JP51080292A patent/JP3388581B2/ja not_active Expired - Fee Related
- 1992-06-16 CA CA 2089726 patent/CA2089726C/en not_active Expired - Fee Related
-
1995
- 1995-03-20 US US08/406,783 patent/US6084882A/en not_active Expired - Fee Related
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS6416041A (en) * | 1987-07-09 | 1989-01-19 | Canon Kk | Time division multiplexing system |
JPH0276435A (ja) * | 1988-09-13 | 1990-03-15 | Nec Eng Ltd | X−75方式パケット交換網の網制御方式 |
JPH0278373A (ja) * | 1988-09-14 | 1990-03-19 | Fuji Xerox Co Ltd | 画像データ伝送装置 |
JPH0298257A (ja) * | 1988-10-05 | 1990-04-10 | Fujitsu Ltd | 通信路再設定方式 |
JPH03112239A (ja) * | 1989-09-26 | 1991-05-13 | Mitsubishi Electric Corp | パケット伝送方法 |
WO1991007040A1 (en) * | 1989-11-06 | 1991-05-16 | American Telephone & Telegraph Company | Automatic fault recovery in a packet network |
Non-Patent Citations (1)
Title |
---|
See also references of EP0544007A4 * |
Also Published As
Publication number | Publication date |
---|---|
DE69233414D1 (de) | 2004-10-28 |
DE69233414T2 (de) | 2005-09-29 |
EP0544007B1 (en) | 2004-09-22 |
CA2089726A1 (en) | 1992-12-19 |
EP0544007A4 (ja) | 1995-02-22 |
CA2089726C (en) | 1999-10-26 |
US6084882A (en) | 2000-07-04 |
EP0544007A1 (en) | 1993-06-02 |
JP3388581B2 (ja) | 2003-03-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO1992022971A1 (en) | Method for determining alternative route | |
US7161910B2 (en) | Minimum cost routing based on relative costs of node resources | |
US5579480A (en) | System and method for traversing ATM networks based on forward and reverse virtual connection labels | |
JP2533998B2 (ja) | パケット網における自動的な障害回復 | |
US4884263A (en) | Packet-switched communications network with parallel virtual circuits for re-routing message packets | |
US7680029B2 (en) | Transmission apparatus with mechanism for reserving resources for recovery paths in label-switched network | |
US6034961A (en) | Active/standby routing system on ATM network | |
EP0544018B1 (en) | System for transferring discriminative information of packet route | |
US20030043792A1 (en) | Label switched communication network, a method of conditioning the network and a method of data transmission | |
JP2001333091A (ja) | 通信装置 | |
JPH08163174A (ja) | 可変長データ交換機,同可変長データ交換機に収容された可変長データ端末,可変長データ通信システム及び可変長データ通信方法 | |
JPH04504347A (ja) | パケット網における自動的な障害回復 | |
JPH05114910A (ja) | 通信ネツトワーク制御方式 | |
US6404740B1 (en) | System for testing internal connectivity in ATM switching equipment | |
CN104604191B (zh) | 通信设备、通信系统、用于确定路径的方法 | |
US5347271A (en) | Network switching contorol method and system | |
WO2006073066A1 (ja) | 通信装置、ルーティング方法及びプログラム | |
WO2006098028A1 (ja) | ネットワークシステム及びネットワーク接続機器 | |
JP2856505B2 (ja) | バーチャルパス切り替え装置 | |
JP2853330B2 (ja) | パケット方路の識別情報転送システム | |
JP3116217B2 (ja) | ネットワークシステム | |
US20060069741A1 (en) | Route objects in telecommunications networks | |
JPH11239146A (ja) | バーチャルパス/バーチャルチャネル切替装置及び切替方法 | |
JPH0685818A (ja) | 経路設定型ルータ装置 | |
JPH04215349A (ja) | 回線選択制御方式 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): CA JP US |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): DE FR GB |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2089726 Country of ref document: CA |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1992911107 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 1992911107 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 1992911107 Country of ref document: EP |