Document Type
Thesis
Date of Award
Summer 8-31-2003
Degree Name
Master of Science in Computer Engineering - (M.S.)
Department
Electrical and Computer Engineering
First Advisor
Nirwan Ansari
Second Advisor
Edwin Hou
Third Advisor
Roberto Rojas-Cessa
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.
Recommended Citation
Krishnan, Ram Narayan, "Tree based reliable topology for distributing link state information" (2003). Theses. 650.
https://digitalcommons.njit.edu/theses/650
