The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title:	Tree based reliable topology for distributing link state information
Author:	Krishnan, Ram Narayan
View Online:	njit-etd2003-091 (viii, 23 pages ~ 1.8 MB pdf)
Department:	Department of Electrical and Computer Engineering
Degree:	Master of Science
Program:	Computer Engineering
Document Type:	Thesis
Advisory Committee:	Ansari, Nirwan (Committee chair) Hou, Edwin (Committee member) Rojas-Cessa, Roberto (Committee member)
Date:	2003-08
Keywords:	Quality-of-Service (QoS) routing problem Link state
Availability:	Unrestricted
Abstract:	Finding paths that satisfy the performance requirements of applications according to link state information in a network is known as the Quality-of- Service (QoS) routing problem and has been extensively studied. However, distributing link state information may introduce a significant protocol overhead on network resources. In this thesis, the issue on how to update link state information efficiently and effectively is investigated. A theoretical framework is presented, and a high performance link state policy that is capable of minimizing the false blocking probability of connections under a given update rate constraint is proposed. Through theoretical analysis, it is shown that the proposed policy outperforms the current state of the art in terms of the update rate and higher scalability and reliability.