Title :
A mechanism for pricing service guarantees
Author :
Hajek, Bruce ; Yang, Sichao
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL, USA
Abstract :
The calculus of deterministic constraints on service and traffic streams offers a rich language to specify service guarantees. In particular, the service curve earliest deadline first (SCED) algorithm has an associated feasibility test given by linear constraints. Users sending streams of data through the server may have differing needs for delay and throughput.We suggest a way based on utility function maximization, subject to the linear constraints of the SCED algorithm, for allocation of service. In addition, a generalization of the SCED algorithm is given which does not require that the deadline sequences within streams be monotone nondecreasing.
Keywords :
quality of service; queueing theory; telecommunication traffic; deterministic constraints; pricing service guarantees; service allocation; service curve earliest deadline first algorithm; utility function maximization; Calculus; Concrete; Delay; Global Positioning System; Intserv networks; Network servers; Pricing; Quality of service; Testing; Throughput;
Conference_Titel :
Networking and Information Theory, 2009. ITW 2009. IEEE Information Theory Workshop on
Conference_Location :
Volos
Print_ISBN :
978-1-4244-4535-6
Electronic_ISBN :
978-1-4244-4536-3
DOI :
10.1109/ITWNIT.2009.5158573
