Persistent Link:
http://hdl.handle.net/10150/289740
Title:
QoS routing in packet networks
Author:
Korkmaz, Turgay
Issue Date:
2001
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Abstract:
The current best-effort service of the Internet is not sufficient to meet the demands of emerging real-time network applications (e.g., video conferencing, Internet telephony). This has motivated the development of new networking technologies (e.g., Intserv, Diffserv, MPLS) that are geared towards providing quality-of-service (QoS) guarantees (e.g., bandwidth, delay, fitter, reliability) to prospective flows. Various aspects of these technologies are being extensively investigated in the research community. In this dissertation, we focus on the routing aspect, with the objective of providing scalable and computationally efficient solutions. The QoS routing problem involves two tasks: (a) capturing and disseminating the state information of the underlying network; and (b) using this information to compute resource-efficient constrained paths. In the presence of multiple constraints (QoS link parameters), these two tasks become notoriously challenging. We investigate several key issues in QoS routing and discuss how to integrate the provided solutions into evolving state-dependent and hierarchical routing protocols (e.g., PNNI and QoS-extended OSPF). First, we develop a hybrid mechanism based on both flooding and tree-based broadcasting for reliable and efficient dissemination of dynamic link-state parameters, such as bandwidth. Second, we present a scalable, source oriented state aggregation methodology for hierarchical networks. Third, we introduce several heuristics and approximation algorithms for path selection under multiple QoS constraints. Fourth, we consider the path selection problem under inaccurate (probabilistically modeled) state information, and provide a heuristic for a special yet important case of this problem, namely, routing under bandwidth and delay constraints. Finally, we evaluate the performance of the proposed methods through simulations.
Type:
text; Dissertation-Reproduction (electronic)
Keywords:
Engineering, Electronics and Electrical.; Computer Science.
Degree Name:
Ph.D.
Degree Level:
doctoral
Degree Program:
Graduate College; Electronical and Computer Engineering
Degree Grantor:
University of Arizona
Advisor:
Krunz, Marwan

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleQoS routing in packet networksen_US
dc.creatorKorkmaz, Turgayen_US
dc.contributor.authorKorkmaz, Turgayen_US
dc.date.issued2001en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.description.abstractThe current best-effort service of the Internet is not sufficient to meet the demands of emerging real-time network applications (e.g., video conferencing, Internet telephony). This has motivated the development of new networking technologies (e.g., Intserv, Diffserv, MPLS) that are geared towards providing quality-of-service (QoS) guarantees (e.g., bandwidth, delay, fitter, reliability) to prospective flows. Various aspects of these technologies are being extensively investigated in the research community. In this dissertation, we focus on the routing aspect, with the objective of providing scalable and computationally efficient solutions. The QoS routing problem involves two tasks: (a) capturing and disseminating the state information of the underlying network; and (b) using this information to compute resource-efficient constrained paths. In the presence of multiple constraints (QoS link parameters), these two tasks become notoriously challenging. We investigate several key issues in QoS routing and discuss how to integrate the provided solutions into evolving state-dependent and hierarchical routing protocols (e.g., PNNI and QoS-extended OSPF). First, we develop a hybrid mechanism based on both flooding and tree-based broadcasting for reliable and efficient dissemination of dynamic link-state parameters, such as bandwidth. Second, we present a scalable, source oriented state aggregation methodology for hierarchical networks. Third, we introduce several heuristics and approximation algorithms for path selection under multiple QoS constraints. Fourth, we consider the path selection problem under inaccurate (probabilistically modeled) state information, and provide a heuristic for a special yet important case of this problem, namely, routing under bandwidth and delay constraints. Finally, we evaluate the performance of the proposed methods through simulations.en_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
dc.subjectEngineering, Electronics and Electrical.en_US
dc.subjectComputer Science.en_US
thesis.degree.namePh.D.en_US
thesis.degree.leveldoctoralen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineElectronical and Computer Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.contributor.advisorKrunz, Marwanen_US
dc.identifier.proquest3031398en_US
dc.identifier.bibrecord.b42287443en_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.