Self-stabilizing inter-domain policy routing

As the complexity of the networked systems increases, the likelihood of experiencing unanticipated faults grows. Self-stabilization is the most general technique to design fault tolerant systems. This paradigm was introduced by Dijkstra in 1974. A self-stabilizing system guarantees that starting from an arbitrary state, the system converges to a legal state in a finite number of steps and remains in a legal state until another fault occurs. Such a system after any unexpected perturbation eventually recovers without any outside intervention; The goal of this thesis research is to design a self-stabilizing Inter Domain Policy Routing Algorithm in order to make the policy routing procedure resistant to failures. We propose two algorithms. Our first algorithm sets up a path from a source to a destination, where the source and destination belong to different autonomous systems. It uses the Path Control Protocol (PCP). This algorithm can handle path failures, but cannot cope with message losses. Our second solution takes care of this problem by using the Control Message Transport Protocol (CMTP). (Abstract shortened by UMI.).

Name thesis:degree_name

Master of Science (MS)

Level thesis:degree_level

Thesis

Discipline thesis:degree_discipline

Computer Science

Grantor dc:publisher

University of Nevada, Las Vegas

Year

2004

Author dc:creator

• Trichy Ramasubramanian, Venkatakrishnan

Contributors dc:contributor

• Ajoy K. Datta
• Sebastien Tixeuil

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/1634

OAI identifier oai:identifier

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