טכניון מכון טכנולוגי לישראל
הטכניון מכון טכנולוגי לישראל - בית הספר ללימודי מוסמכים  
Ph.D Thesis
Ph.D StudentBiton Erez
SubjectQoS Provision and Routing with Deterministic and Stochastic
Guarantees
DepartmentDepartment of Electrical Engineering
Supervisor Professor Ariel Orda


Abstract

End-to-end Quality-of-Service (QoS) provision and routing are central and critical issues in the design of integrated multimedia networks. Indeed, end-to-end support for QoS has been widely investigated. In particular, scheduling disciplines as well as worst-case end-to-end performance bounds have been explored in a large number of studies, under both deterministic and stochastic settings. Recently, the corresponding routing problems have been addressed as well. However, a comprehensive study, which considers both problems, i.e., the establishment of end-to-end performance bounds and the corresponding routing problems, has not been reported. Since these two problems are closely related, moreover the former is a prerequisite for the latter, in this research they are investigated as a whole. More specifically, we consider QoS provision and routing schemes for connections with end-to-end delay requirements in networks that employ rate-based schedulers.


In the first part of the dissertation, we focus on the generalized processor sharing (GPS) scheduling discipline. Here, we study three settings: (i) burstiness-constrained (BC) traffic with deterministic QoS requirements, (ii) exponentially bounded burstiness (EBB) traffic with stochastic QoS requirements, and (iii) (general) stochastic bounded burstiness (SBB) traffic. Then, we turn our attention to the rate-controlled earliest deadline first (EDF) scheduling discipline. Here, we consider BC as well as EBB traffic. For each, we obtain end-to-end delay bounds for packetized traffic and links with non-negligible propagation delays, and, consequently, we formulate appropriate routing schemes.


Finally, we consider the provision of QoS, in terms of call termination probability, in fault tolerant networks. We consider the optimal admission control policies for two network models, namely, optical networks and wireless networks.