Decentralized capacity reallocation for a loss network

A. Kurve, G. Pang, G. Kesidis, G. De Veciana

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Stochastic loss network models have been widely used to study the characteristics of a large class of resource constrained networks in terms of their blocking probability. We consider a distributed capacity allocation problem for a loss network with directed edges. Each infrastructure node (or superpeer) can independently adjust its link-capacity allocations, subject to a constraint on the total amount for each node, so as to minimize its estimate of call blocking rates. We argue via Erlang fixed-point approximation that such decentralized local changes do work to minimize a global measure of weighted call blocking rates.

Original languageEnglish (US)
Title of host publication2012 46th Annual Conference on Information Sciences and Systems, CISS 2012
DOIs
StatePublished - Nov 12 2012
Event2012 46th Annual Conference on Information Sciences and Systems, CISS 2012 - Princeton, NJ, United States
Duration: Mar 21 2012Mar 23 2012

Publication series

Name2012 46th Annual Conference on Information Sciences and Systems, CISS 2012

Other

Other2012 46th Annual Conference on Information Sciences and Systems, CISS 2012
CountryUnited States
CityPrinceton, NJ
Period3/21/123/23/12

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Information Systems

Cite this

Kurve, A., Pang, G., Kesidis, G., & De Veciana, G. (2012). Decentralized capacity reallocation for a loss network. In 2012 46th Annual Conference on Information Sciences and Systems, CISS 2012 [6310748] (2012 46th Annual Conference on Information Sciences and Systems, CISS 2012). https://doi.org/10.1109/CISS.2012.6310748