Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

QoS provision and routing with stochastic guarantees

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Biton, E. ; Dept. of Electr. Eng., Technion, Haifa, Israel ; Orda, A.

This work presents a methodology for providing QoS guarantees by considering the coupling between the scheduling mechanism and the routing schemes. Our main focus are rate-based schedulers and stochastic guarantees. We consider several traffic models and obtain for each an appropriate upper bound on the end-to-end delay tail distribution. With that at hand, we derive corresponding routing schemes that exploit the obtained bound. More specifically, we consider traffic with exponentially bounded burstiness (EBB) and stochastic QoS requirements. First, we extend previous results and provide an upper bound on the tail distribution of the end-to-end delay for packetized traffic and links with non-negligible propagation delays. Consequently, we formulate several routing schemes that identify feasible paths under various network optimization criteria. We demonstrate the efficiency of these routing schemes via simulation examples. Then, we consider traffic with (general) stochastic bounded burstiness (SBB). Here, we provide the corresponding upper bound on the end-to-end delay tail distribution for packetized traffic and links with propagation delays. Finally, focusing on the special case of a bounding function that is the sum of exponents, we design appropriate routing schemes.

Published in:

Quality of Service in Heterogeneous Wired/Wireless Networks, 2004. QSHINE 2004. First International Conference on

Date of Conference:

18-20 Oct. 2004