The paper addresses the problem of estimating the traffic demand between any pair of nodes in a circuitswitched network on the basis of trunk group measurements (canied load and blocking probability on a link) and the routing plan. Two methodsa closed form one based on the use of the pseudo-inverse
Analysis and control of traffic routing in circuit-switched networks
β Scribed by Prosper Chemouil; Janusz Filipiak; Paul Gauthier
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 994 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0169-7552
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Many studies have revealed that the traffic generated by multimedia applications exhibits a high degree of burstiness and possesses strong correlation in the number of message arrivals between adjacent time intervals, which can significantly affect network performance. This paper propos
A recently introduced multiscale framework is used to develop efficient analysis and design techniques for networks with self-similar traffic. These allow the interarrival density function for fractal point processes under Bernoulli random erasure to be determined, as well as the counting process di