Optimal partition of QoS requirements on unicast paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Call admission and resource reservation for multicast sessions
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Optimal partition of QoS requirements with discrete cost functions
IEEE Journal on Selected Areas in Communications
Optimal precomputation for mapping service level agreements in grid applications
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Multicast routing in mobile ad hoc networks by using a multiagent system
Information Sciences: an International Journal
Statistical delay budget partitioning in wireless mesh networks
Computer Communications
Optimal precomputation for mapping service level agreements in grid computing
Future Generation Computer Systems
A new design for end-to-end proportional loss differentiation in IP networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.01 |
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.