A PATH RESTORATION ALGORITHM SHARING THE RESOURCE IN GMPLS NETWORK

The restoration methods for the MPLS (Multi-Protocol Label Switching) network are 1+1, 1:1, 1:N, and M:N. However, these methods have a problem that it wastes network resources and cannot afford a perfect restoration when the physical connectivity is cut down. There is no guarantee that this problem is not present when the restoration methods are applied to the GMPLS (Generalized MPLS) network. This paper proposes the restoration mechanism that decreases the chances of getting the same problem where the Kini mechanism is applied over the GMPLS network. This mechanism computes a backup path at the time of a working path computation, and the resource allocation can maximize the resource utilization if the resource allocation is executed after the network fault. When the network fault is occured, this method extends the PATH or RESV message in RSVP-TE to allocate the resource as soon as it can.