Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A Model for Telephone Networks and Its Use for Routing Optimization Purposes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Garcia, J.-M. ; Lab. d́Automatique et d́Analyse des Systèmes du CNRS, Toulouse Cedex, France ; Francoise Le Gall ; Bernussou, J.

The problem studied here concerns the modeling of call blocking in telephone networks. From the usual assumptions such as exponential arrivals and holding time, lost call cleared, the state of the network is described by a finite Markov chain. From the transition probabilities of this process are derived the differential equations associated with the average occupancy of all trunk groups. These traffic equations are simplified by considering independence of blocking for trunk groups in series. The blocking probabilities are estimated using fictitious offered traffic and the Erlang B formula. Such representation takes into account peaky or smooth traffic characteristics. We develop this one-moment model for routing policies such as load sharing and overflow routing. Performances of the model are given in comparison to the solution of the exact Markov chain model or the results of Monte Carlo simulation. Finally, an application to routing optimization and network dimensioning is treated.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:4 ,  Issue: 6 )