Label switched path set up scheme with reduced need for...

Details Label switched path set up scheme with reduced need for... Label switched path set up scheme with reduced need for...

1999-07-16

2003-03-04

Lee, Thomas (Department: 2154)

Electrical computers and digital processing systems: multicomput

Computer-to-computer protocol implementing

Computer-to-computer handshaking

C709S230000, C709S234000, C709S238000, C709S240000, C709S241000, C709S242000, C370S392000, C370S396000, C370S397000

Reexamination Certificate

active

06529958

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
The present invention relates to a node device having a label switching function and a method for setting up a label switched path.
2. Description of the Background Art
In a network layer protocol in which IP (Internet Protocol) nodes are inter-connected on a network, there is a scheme for realizing high speed packet transfer called MPLS (Multi-Protocol Label Switching).
In the MPLS, the label switching is carried out by allocating specific “labels” to specific packet flows between nodes and setting an input side label and an output side label in correspondence at each node, so that the IP processing can be omitted and a high speed packet transfer can be realized. For example, in the case where the link layer is ATM, VPI(Virtual Path Identifier)/VCI (Virtual Channel Identifier) will be used as a label. A route through which the packet flow is label switched is called a label switched path. In the following description, the label switched path will be referred to simply as a path.
In the case of constructing the path, a label distribution protocol is used. The label distribution protocol exchanges control messages (path control messages) between nodes on a packet flow route in order to notify a correspondence between a flow identifier for identifying the packet flow in network global fashion and a label for identifying the packet flow in link local fashion.
In general, the path control message is transferred according to the layer
3
route information, but when the layer
3
route is looping, there are possibilities for the path control message to loop or a looping path to form.
In order to resolve this problem, there is a loop prevention method disclosed in “Internet-Draft, draft-ohba-mpls-loop-prevention-00.txt”, in which the ingress node information is contained in the path control message and each node stores the ingress node address (ingress node information) and the hop count from the ingress node for each branch on the input side of the path, and notifies to the downstream side the ingress node information which has the largest hop count from the ingress node among all the stored ingress node information along with the largest hop count +1. In addition, in the case of adding a new branch on the input side of the current path, or in the case of updating the ingress node information or the hop count from the ingress node for the existing input side branch, if the same ingress node information is already registered for another input side branch with respect to the same flow, it is judged that a loop will be formed so that the addition/updating of the input side branch is not carried out.
This loop prevention method has an advantage over the path vector scheme (in which each node that forwards the path control message adds its own address to the label allocation message and it is judged as a loop is the received label allocation message has the own address already written therein) in that the message length becomes fixed regardless of the hop count.
However, this loop prevention method has the following problem at a time of the route change.
For instance, consider a case where a path through a sequence of node devices R
11
→R
12
→R
13
→R
14
→R
15
→R
16
on the layer
3
route is formed as shown in FIG.
1
.
In this case, each node device on the path stores a flow identifier (flowid), an input link information (input physical link information (input interface)+input label)) for identifying the path, and “R
11
” as the ingress node information. The input link information (input link) is an information set in correspondence to the output link information (output link) and used in the label switching, which is obtained from a label obtained from the link identifier and an information on a physical link that exchanged the message. The physical link information will be denoted as Iij (i: an upstream node number of the link, j: a downstream node number of the link), and the link will be denoted as “physical link information: label”.
FIG. 2
shows the state of a flow table provided in the node device R
15
in the case of the path shown in FIG.
1
.
In this case, when the route change occurs at R
12
and the next hop leading to Flowid=R
16
is changed from R
13
to R
17
, the label allocation release message (RELEASE message) specifying (flowid=R
16
, ingress=R
11
) is sent on the old route from R
12
, while the label allocation request message (SETUP message) specifying (flowid=R
16
, ingress=R
11
) is sent on the new route from R
12
.
Now, if the SETUP message reaches to R
15
before the RELEASE message, another entry with flowid=R
16
and ingress=R
11
is already set in correspondence to the input link (I
1516
: x
1516
) when the SETUP message for the input link (I
1715
: x
1715
) is received, so that R
15
judges that it is a loop even though it is actually not a loop.
As a result, the label allocation failure (SETUP_NACK) message will be returned from R
15
to R
17
. At this point, R
17
carries out the retransmission (retry) of the SETUP message after a prescribed period of time, but the retry would have to be repeated many times before the RELEASE message arrives from the old route if the retry interval is set too short, whereas a considerable amount of time would elapse before the path is switched to the new route if the retry interval is set too long. Yet, it is generally difficult to determine the optimum value for the retry interval, so that there is a need for a loop prevention mechanism that can minimize the need of the retry.
SUMMARY OF THE INVENTION
It is therefore an object of the present invention to provide a label switched path set up scheme which is capable of detecting a loop of the label switched path efficiently and quickly, and which can enable the switching of the label switched path even in the case where conventionally a label switch path loop would be erroneously detected at a time of the route change, without requiring a label set up retry operation from a previous hop node device of the node device that have erroneously detected the loop which would have been necessary conventionally.
According to one aspect of the present invention there is provided a method for setting up a label switched path, comprising the steps of: judging whether the label switched path forms a loop or not at a node that received a request message regarding a label switched path set up for a packet flow, on a basis of label switched path information stored in a first mode at said node that received the request message, the request message including a flow identifier for identifying the packet flow and information indicating that it is a message currently awaiting a response regarding the packet flow, and the first mode indicating that a message from which the label switched path information originates is a message currently awaiting a response; storing the flow identifier contained in the request message as the label switched path information in the first mode at said node device that received the request message, and transferring the request message from said node that received the request message to another node on a route of the packet flow, when said node that received the request message cannot judge that the label switched path does not form a loop; returning a response message for the request message from said node that received the request message when said node that received the request message judges that the label switched path does not form a loop; and changing the label switched path information currently stored in the first mode at a node that received the response message into a second mode different from the first mode such that the label switched path information that is changed into the second mode will not be used subsequently in judging whether any requested label switched path forms a loop or not at said node that received the response message and the label switched path will become available at said node that received the

Affiliated with

Also associated with

Rating

Label switched path set up scheme with reduced need for... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Label switched path set up scheme with reduced need for..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Label switched path set up scheme with reduced need for... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3039927