Optimal partition of QoS requirements on unicast paths and multicast trees

Authors:
Dean H. Lorenz;Ariel Orda
Affiliations:
IEEE and Technion-Israel Institute of Technology, Haifa, 32000, Israel;IEEE and Technion-Israel Institute of Technology, Haifa, 32000, Israel
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2002

Citing 12
Cited 16

Introduction to algorithms

Introduction to algorithms
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
A new approach to service provisioning in ATM networks

IEEE/ACM Transactions on Networking (TON)
Lower and upper bounds for the allocation problem and other nonlinear optimization problems

Mathematics of Operations Research
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with uncertain parameters

IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with inaccurate information: theory and algorithms

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
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Pricing congestible network resources

IEEE Journal on Selected Areas in Communications

QoS routing in networks with inaccurate information: theory and algorithms

IEEE/ACM Transactions on Networking (TON)
Precomputation schemes for QoS routing

IEEE/ACM Transactions on Networking (TON)
A comparison of two optimal approaches for the MCOP problem

Journal of Network and Computer Applications
Optimal and heuristic algorithms for quality-of-service routing with multiple constraints

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

IEEE/ACM Transactions on Networking (TON)
Evolutionary algorithms for route selection and rate allocation in multirate multicast networks

Applied Intelligence
Analysis and algorithms design for the partition of large-scale adaptive mobile wireless networks

Computer Communications
Slack allocation techniques for intra-path load balancing

Journal of High Speed Networks
Optimal routing for end-to-end guarantees using Network Calculus

Performance Evaluation
Adaptive per hop differentiation for end-to-end delay assurance in multihop wireless networks

Ad Hoc Networks
OPQR-G: algorithm for efficient QoS partition and routing in multiservice IP networks

Computer Communications
Novel dynamic delay allocation adjustment for improving bandwidth efficiency

Computer Communications
Real-time scheduling with a budget

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Towards resource-optimal routing plans for real-time traffic

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Route selection and rate allocation using evolutionary computation algorithms in multirate multicast networks

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
On efficient distribution of data in multicast networks: QoS in scalable networks

LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which resource allocation is based on local QoS requirements at each network link, and associated with each link is a cost function that increases with the severity of the QoS requirement. Accordingly, the problem that we address is how to partition an end-to-end QoS requirement into local requirements, such that the overall cost is minimized. We establish efficient (polynomial) solutions for both unicast and multicast connections. These results provide the required foundations for the corresponding QoS routing schemes, which identify either paths or trees that lead to minimal overall cost. In addition, we show that our framework provides better tools for coping with other fundamental multicast problems, such as dynamic tree maintenance.