Please use this identifier to cite or link to this item: https://doi.org/10.1109/Allerton.2011.6120221
DC FieldValue
dc.titleCongestion equilibrium for differentiated service classes
dc.contributor.authorMa, R.T.B.
dc.contributor.authorMisra, V.
dc.date.accessioned2013-07-04T08:12:36Z
dc.date.available2013-07-04T08:12:36Z
dc.date.issued2011
dc.identifier.citationMa, R.T.B.,Misra, V. (2011). Congestion equilibrium for differentiated service classes. 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 : 589-594. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/Allerton.2011.6120221" target="_blank">https://doi.org/10.1109/Allerton.2011.6120221</a>
dc.identifier.isbn9781457718168
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40799
dc.description.abstractIn this paper, we introduce the notation of a congestion equilibrium where competing players share a common level of congestion in the system. We illustrate the concept by developing a framework under which content providers (CPs) compete for a last-mile bottleneck capacity of an ISP so as to service their users. We show that under minor monotonic-ity assumptions on the system congestion and traffic rates, a unique congestion equilibrium exists. Under an independence of scale assumption, we characterize the congestion and rates in equilibrium as continuous homogeneous functions. In particular, the congestion in equilibrium can be characterized by a continuous non-increasing function of the per capita capacity of the system. Through examples, we show that various congestion metrics apply to our model, e.g. M/M/1 delay metric and throughput metrics that results from work-conserving congestion control mechanism. By using the congestion equilibrium as a building block, we further model class-based service differentiations of an ISP under which CPs choose service class and compete resource with other CPs in the same service class. We formulate a two-stage strategic game between an ISP and the CPs. We characterize the Nash equilibrium and competitive equilibrium, which is based on a corresponding congestion-taking assumption, and propose an algorithm to practical solve a competitive equilibrium. © 2011 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/Allerton.2011.6120221
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/Allerton.2011.6120221
dc.description.sourcetitle2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
dc.description.page589-594
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.