Premium
Price‐coupled scheduling for differentiated services: G c µ versus GPS
Author(s) -
Van Mieghem Jan A.,
Van Mieghem Piet
Publication year - 2002
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.545
Subject(s) - computer science , quality of service , probabilistic logic , scheduling (production processes) , burstiness , dynamic priority scheduling , computer network , mathematical optimization , artificial intelligence , mathematics , network packet
We present an integrated approach to pricing and scheduling for services that are differentiated in terms of throughput, delay and loss specifications. The key building block to the model are quality value curves that specify a user's value of higher quality levels. From the analysis emerges a pricing rule that charges based on rate and quality grade, and a dynamic scheduling rule, called the G c µ rule. The analysis also derives the economically optimal probabilistic quality of service (QoS) guarantee parameters. We compare our model to the deterministic approach of QoS guarantees using burstiness constraints and fair scheduling rules. The scheduling that arises from such a deterministic approach is the well‐known Generalized Processor Sharing (GPS). A comparative analysis inspires the fair G c µ ‐PS rule as the scheduling rule that combines the unique strengths of GPS and G c µ . This G c µ ‐PS rule is proposed as a tailored scheduling solution for both the expedited forwarding class and the four assured forwarding classes in the IETF's differentiated services. Copyright © 2002 John Wiley & Sons, Ltd.