Routing in circuit-switched networks: optimization, shadow prices and decentralization

Kelly, F. P.

doi:10.2307/1427273

Cited by 203 publications

(27 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kelly [8,9] established that the EFPA is asymptotically exact in a large network limiting regime where the arrival rates and resource capacities are increased in a proportional manner. More formally, given an SLN with parameters C and ν, a scaled version of the system is defined by the scaled capacities…”

Section: Asymptotic Optimalitymentioning

confidence: 99%

Improved approximations for the Erlang loss model

Anselmi

Sharma

et al. 2009

Queueing Syst

View full text Add to dashboard Cite

Stochastic loss networks are often very effective models for studying the random dynamics of systems requiring simultaneous resource possession. Given a stochastic network and a multi-class customer workload, the classical Erlang model renders the stationary probability that a customer will be lost due to insufficient capacity for at least one required resource type. Recently a novel family of slice methods has been proposed by Jung et al. (Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, pp. 407-418, 2008) to approximate the stationary loss probabilities in the Erlang model, and has been shown to provide better performance than the classical Erlang fixed point approximation in many regimes of interest. In this paper, we propose some new methods for loss probability calculation. We propose a refinement of the 3-point slice method of Jung et al. (Proceedings of ACM SIGMETRICS conference on measurement and modeling of computer systems, pp. 407-418, 2008) which exhibits improved accuracy, especially when heavily loaded networks are considered, at comparable computational cost. Next we exploit the structure of the stationary distribution to propose randomized algorithms to approximate both the stationary distribution and the loss proba-The research of J. Anselmi was supported by the Conseil Régional Rhône-Alpes, Global competitiveness cluster Minalogic contract SCEPTRE.

show abstract

Section: Asymptotic Optimalitymentioning

confidence: 99%

Improved approximations for the Erlang loss model

Anselmi

Sharma

et al. 2009

Queueing Syst

View full text Add to dashboard Cite

show abstract

“…The concept of implied cost of accepting a call on a link of a circuit-switched network was firstly formalised by Kelly (1988) and later extended to multirate networks (without alternative routing) in Mitra et al (1999); Faragó et al (1995). This parameter, c kt , represents the cost of the acceptance of a call of type t on a link l k expressed through the expected value of the loss of revenue in all network traffic flows which may use link l k , associated with the decrease in the capacity of link l k (the so called 'knock-off' effect of the acceptance of a type t call).…”

Section: Analytical Modelmentioning

confidence: 99%

“…This parameter, c kt , represents the cost of the acceptance of a call of type t on a link l k expressed through the expected value of the loss of revenue in all network traffic flows which may use link l k , associated with the decrease in the capacity of link l k (the so called 'knock-off' effect of the acceptance of a type t call). Here we have adapted the definition of c kt to multirate loss networks with alternative routing by extending the corresponding expression given for single-service networks in Kelly (1988). Hence c kt is given by:…”

Section: Analytical Modelmentioning

confidence: 99%

A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance

Martins

Craveirinha

Clímaco

2006

CMS

View full text Add to dashboard Cite

show abstract

“…The traffic carried on the link is then given by (l,m,i) and the traffic offered to the link by [16,25] …”

Section: Erlang Fixed Pointmentioning

confidence: 99%

On the advantages of optimal end-to-end QoS budget partitioning

2007

View full text Add to dashboard Cite

We investigate the optimal partitioning of the end-to-end network QoS budget to quantify the advantage of having a non-uniform allocation of the budget over the links in a path. We formulate an optimization problem that provides a unified framework to study QoS budget allocation. We examine the underlying mathematical structure for the optimal partitioning and dimensioning equations. In the context of network dimensioning, we then show that optimal partitioning can bring large cost reductions as compared with equal partitioning based on the results on small networks.More importantly, we also find that optimal partitioning gives significant improvements in robustness in the presence of failed components and in fairness when the traffic demand is different from the forecast, two effects that had not been observed in previous work and that can have a significant effect on network operations.

show abstract

Routing in circuit-switched networks: optimization, shadow prices and decentralization

Cited by 203 publications

References 26 publications

Improved approximations for the Erlang loss model

Improved approximations for the Erlang loss model

A New Multiobjective Dynamic Routing Method for Multiservice Networks: Modelling and Performance

On the advantages of optimal end-to-end QoS budget partitioning

Contact Info

Product

Resources

About