Decentralized capacity reallocation for a loss network

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

Full description

Saved in:
Bibliographic Details
Published in2012 46th Annual Conference on Information Sciences and Systems pp. 1 - 5
Main Authors Kurve, A., Pang, G., Kesidis, G., de Veciana, G.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2012
Subjects
Approximation methods
Capacity planning
Network topology
Peer to peer computing
Resource management
Topology
Vectors
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9781467331395
1467331392
DOI:10.1109/CISS.2012.6310748