CaltechAUTHORS
  A Caltech Library Service

A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast

Orda, Ariel and Sprintson, Alexander (2005) A Scalable Approach to the Partition of QoS Requirements in Unicast and Multicast. IEEE/ACM Transactions on Networking, 13 (5). pp. 1146-1159. ISSN 1063-6692. http://resolver.caltech.edu/CaltechAUTHORS:ORDieeeacmtn05

[img]
Preview
PDF
See Usage Policy.

601Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:ORDieeeacmtn05

Abstract

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.


Item Type:Article
Additional Information:“©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.” Manuscript received December 10, 2002; revised January 18, 2004, July 18, 2004, and December 17, 2004; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor M. Zukerman.
Subject Keywords:Multicast, performance-dependent costs, quality of service (QoS) partition, resource allocation, routing
Record Number:CaltechAUTHORS:ORDieeeacmtn05
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:ORDieeeacmtn05
Alternative URL:http://dx.doi.org/10.1109/TNET.2005.857122
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:1033
Collection:CaltechAUTHORS
Deposited By: Archive Administrator
Deposited On:02 Dec 2005
Last Modified:26 Dec 2012 08:42

Repository Staff Only: item control page