A mechanism for pricing service guarantees

Bruce Hajek; Sichao Yang

doi:10.1109/ITWNIT.2009.5158573

A mechanism for pricing service guarantees

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English (US)
Title of host publication	Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Pages	211-215
Number of pages	5
DOIs	https://doi.org/10.1109/ITWNIT.2009.5158573
State	Published - 2009
Event	2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 - Volos, Greece Duration: Jun 10 2009 → Jun 12 2009

Publication series

Name	Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Other

Other	2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009
Country/Territory	Greece
City	Volos
Period	6/10/09 → 6/12/09

ASJC Scopus subject areas

Computer Networks and Communications
Information Systems
Communication

Online availability

10.1109/ITWNIT.2009.5158573

Library availability

Discover UIUC Full Text

Cite this

A mechanism for pricing service guarantees. / Hajek, Bruce; Yang, Sichao.
Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009. 2009. p. 211-215 5158573 (Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hajek, B & Yang, S 2009, A mechanism for pricing service guarantees. in Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009., 5158573, Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009, pp. 211-215, 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009, Volos, Greece, 6/10/09. https://doi.org/10.1109/ITWNIT.2009.5158573

@inproceedings{2b2feef266d749ba9b4509a38c93d1e9,

title = "A mechanism for pricing service guarantees",

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.",

author = "Bruce Hajek and Sichao Yang",

note = "Copyright: Copyright 2010 Elsevier B.V., All rights reserved.; 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009 ; Conference date: 10-06-2009 Through 12-06-2009",

year = "2009",

doi = "10.1109/ITWNIT.2009.5158573",

language = "English (US)",

isbn = "9781424445363",

series = "Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009",

pages = "211--215",

booktitle = "Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009",

}

TY - GEN

T1 - A mechanism for pricing service guarantees

AU - Hajek, Bruce

AU - Yang, Sichao

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77950684116&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77950684116&partnerID=8YFLogxK

U2 - 10.1109/ITWNIT.2009.5158573

DO - 10.1109/ITWNIT.2009.5158573

M3 - Conference contribution

AN - SCOPUS:77950684116

SN - 9781424445363

T3 - Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

SP - 211

EP - 215

BT - Proceedings - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

T2 - 2009 IEEE Information Theory Workshop on Networking and Information Theory, ITW 2009

Y2 - 10 June 2009 through 12 June 2009

ER -

A mechanism for pricing service guarantees

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this