By Topic

A scalable approach to the partition of QoS requirements in unicast and multicast

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)
Orda, A. ; Dept. of Electr. Eng., TechnionIsrael Inst. of Technol., Haifa, Israel ; Sprintson, A.

Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. An important problem in this context is how to partition QoS requirements along a selected topology (path for unicast and tree for multicast). As networks grow in size, the scalability of the solution becomes increasingly important. This calls for efficient algorithms, whose computational complexity is less dependent on the network size. In addition, recently proposed precomputation-based methods can be employed to facilitate scalability by significantly reducing the time needed for handling incoming requests. We present a novel solution technique to the QoS partition problem(s), based on a "divide-and-conquer" scheme. As opposed to previous solutions, our technique considerably reduces the computational complexity in terms of dependence on network size; moreover, it enables the development of precomputation schemes. Hence, our technique provides a scalable approach to the QoS partition problem, for both unicast and multicast. In addition, our algorithms readily generalize to support QoS routing in typical settings of large-scale networks.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:13 ,  Issue: 5 )