Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Lower and upper bounds for the allocation problem and other nonlinear optimization problems
Mathematics of Operations Research
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
A comparison of exact and ε-approximation algorithms for constrained routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
SoMR: A scalable distributed QoS multicast routing protocol
Journal of Parallel and Distributed Computing
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
Precomputation for intra-domain QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS protocols for end-to-end delay guarantee of instantaneous jobs on computer networks
Information-Knowledge-Systems Management
A new design for end-to-end proportional loss differentiation in IP networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy-aware online routing with QoS constraints in multi-rate wireless ad hoc networks
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
| Hi-index | 0.00 |
In this paper, we study problems related to supporting unicast and multicast connections with quality of service (QoS) requirements. We investigate the problem of optimal routing and resource allocation in the context of performance dependent costs. In this context, each network element can offer several QoS guarantees, each associated with a different cost. This is a natural extension to the commonly used bi-criteria model, where each link is associated with a single delay and a single cost. This framework is simple yet strong enough to model many practical interesting networking problems.An important problems in this framework is finding a good path for a connection that minimizes the cost while retaining the end-to-end delay requirement. Once such a path (or a tree, in the multicast case) is found, one needs to partition the end-to-end QoS requirements among the links of the path (tree). We consider the case of general integer cost functions (where delays and cost are integers). As the related problem is NP complete, we concentrate on finding efficient ε-approximation solutions. We improve on recent previous results by Ergün et al. Lorenz and Orda, and Raz and Shavitt, both in terms of generality as well as in terms of complexity of the solution. In particular, we present novel approximation techniques that yield the best known complexity for the unicast QoS routing problem, and the first approximation algorithm for the QoS partition problem on trees, both for the centralized and distributed cases.