Paper Info
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.
Year
DOI
Venue
2009
10.1109/ITWNIT.2009.5158573
ITW: 2009 IEEE INFORMATION THEORY WORKSHOP ON NETWORKING AND INFORMATION THEORY
Keywords
Field
DocType
resource management,global positioning system,servers,calculus,probability density function,testing,quality of service,throughput,concrete,data mining,queueing theory,pricing,earliest deadline first
Resource management,Mathematical optimization,Computer science,Server,Quality of service,Computer network,Theoretical computer science,Queueing theory,Earliest deadline first scheduling,Probability density function,Monotone polygon,Maximization
Conference
Citations 
PageRank 
References 
0
0.34
9
Authors
2
Name
Order
Citations
PageRank
Bruce Hajek115417.84
Sichao Yang223614.32