Optimal Partition of QoS requirements with Discrete Cost Functions

Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support signaling, 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. This work concentrates on discrete cost functions, and presents efficient exact and approximated solutions for various conditions of the problem. We also show that the more complex problem of QoS sensitive routing with discrete cost functions is hard, but has a fully polynomial approximation scheme.

• Type: Conference
• Year: 2000
• Where: INFOCOM
• Authors: Danny Raz, Yuval Shavitt
• Keywords: Communications, Convex Cost Functions, Cost Functions, Discrete Cost Functions, INFOCOM 2000