Abstract
dc:description.abstractFinding 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.
Degree
thesis:*- Name thesis:degree_name
- Master of Science in Computer Engineering - (M.S.)
- Discipline thesis:degree_discipline
- Electrical and Computer Engineering
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Krishnan, Ram Narayan
- Contributors dc:contributor
-
- Nirwan Ansari
- Edwin Hou
- Roberto Rojas-Cessa
Subjects
dc:subject × 3Identifiers
dc:identifier.*- Repository record dc:identifier
- https://digitalcommons.njit.edu/theses/650