A comparison of two optimal approaches for the MCOP problem
Journal of Network and Computer Applications
A scalable approach to the partition of QoS requirements in unicast and multicast
IEEE/ACM Transactions on Networking (TON)
Optimal precomputation for mapping service level agreements in grid applications
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Statistical delay budget partitioning in wireless mesh networks
Computer Communications
Multiconstrained QoS multipath routing in wireless sensor networks
Wireless Networks
QoS protocols for end-to-end delay guarantee of instantaneous jobs on computer networks
Information-Knowledge-Systems Management
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
| Hi-index | 0.07 |
The future Internet is expected to support applications with quality of service (QoS) requirements. To this end, several mechanisms are suggested in the IETF; the most promising among them is DiffServ. An important problem in this framework is how to partition the QoS requirements of an application along a selected path. The problem which is, in general, NP-complete, was solved for continuous convex cost functions by Lorenz and Orda (see IEEE/ACM Trans. Networking. vol.6, p.768-78, 1998 and Proc. IEEE INFOCOM'99, p.246-53, 1999). This paper concentrates on discrete cost functions, which better model the existing and upcoming mechanisms in the Internet. We present efficient exact and approximated solutions for various conditions of the problem. We also show that although the more complex problem of QoS sensitive routing with discrete cost functions is hard, it has a fully polynomial approximation scheme