Dimensioning bandwidth for elastic traffic in high-speed data networks
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Operations Research
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Traffic matrix estimation on a large IP backbone: a comparison on real data
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Multi-layer MPLS network design: The impact of statistical multiplexing
Computer Networks: The International Journal of Computer and Telecommunications Networking
SNDlib 1.0—Survivable Network Design Library
Networks - Network Optimization (INOC 2007)
Equivalent capacity and its application to bandwidth allocation in high-speed networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The paper revisits a very simple network routing and dimensioning model, with two specific assumptions: the traffic amounts to be routed are Gaussian random variables, and each commodity must use one single route in the network. The need to control congestion leads naturally to probabilistic constraints. The impact of stochastic assumptions on solution algorithms is investigated, when compared to the usual deterministic case.