- A queueing-based approach to overload detection
- Lecture Notes in Computer Science
- Pages (from-to)
- Document type
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
The control of communication networks critically relies on procedures capable of detecting unanticipated load changes. In this paper we develop such techniques, in a setting in which each connection consumes roughly the same amount of bandwidth (with VoIP as a leading example). For the situation of exponential holding times an explicit analysis can be performed in a large-deviations regime, leading to approximations of the test statistic of interest (and, in addition, to results for the transient of the M/M/infinity queue, which are of independent interest). This procedure being applicable to exponential holding times only, and also being numerically rather involved, we then develop an approximate procedure for general holding times. In this procedure we record the number of trunks occupied at equidistant points in time Δ,2Δ,. . ., where Δ is chosen sufficiently large to safely assume that the samples are independent; this procedure is backed by results on the transient of the M/G/infinity queue. The validity of the testing procedures is demonstrated through an extensive set of numerical experiments.
- go to publisher's site
- Proceedings title: Network control and optimization: third Euro-NFWorkshop, NET-COOP 2009, Eindhoven, The Netherlands, November
23-25, 2009: proceedings
Place of publication: Berlin
Editors: R. Núñez-Queija, J. Resing
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.