Loop detection and prevention mechanism in multiprotocol label switching

The extended color thread algorithm is based on running a thread hop by hop before the labels are distributed inside a MPLS Cloud Since the path for the data packets is set beforehand, the loop formation occurs at the control path. The shortest paths between selected source and destination have been calculated using Dijkstra's shortest path algorithm and threads are allowed to extend through the routers. With the passage of each next hop, a distributed procedure is executed within the thread, generating a unique color at nodes. This keeps a track on router's control path and at the same time ensures that no loop formation occurs. In loop prevention mode, a router transmits a label mapping, when it rewinds the thread for that particular LSP. Likewise, if a router operates in loop detection mode, it returns a label-mapping message without a thread object, after receiving a colored thread. The scheme is a loop prevention scheme, thus, ensuring loop detection and loop mitigation. The same algorithm is then extended to a proposed MPLS environment with global label space. (Abstract shortened by UMI.).

Name thesis:degree_name

Master of Electrical Engineering (MEE)

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Electrical and Computer Engineering

Grantor dc:publisher

University of Nevada, Las Vegas

Year

2002

Author dc:creator

• Jolly, Vasu

Contributors dc:contributor

• Shahram Latifi

Statement dc:rights

• IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/

Language dc:language

English

Identifier

https://oasis.library.unlv.edu/rtds/1429

OAI identifier oai:identifier

oai:oasis.library.unlv.edu:rtds-2428