On linear prediction of Internet traffic for packet and burst switching networks
Fecha
2001Autor
Versión
Acceso abierto / Sarbide irekia
Tipo
Contribución a congreso / Biltzarrerako ekarpena
Impacto
|
10.1109/ICCCN.2001.956231
Resumen
In this paper, we show that prediction algorithms in the least
mean square error sense prove better in a burst rather than in a packet
switching network. For the latter, further information about the packet
arrival distribution within the prediction interval is required. Regarding
burst switching, we compare Optical Burst Switching networks with and
without linear prediction to conclude that line ...
[++]
In this paper, we show that prediction algorithms in the least
mean square error sense prove better in a burst rather than in a packet
switching network. For the latter, further information about the packet
arrival distribution within the prediction interval is required. Regarding
burst switching, we compare Optical Burst Switching networks with and
without linear prediction to conclude that linear prediction provides a significant
improvement in end-to-end latency with low bandwidth waste. [--]
Materias
Internet performance analysis,
Traffic prediction,
Long-range dependence,
Short-range dependence,
Traffic measurement
Editor
IEEE
Publicado en
Computer Communications and Networks, 2001. Proceedings. Tenth International Conference on, pp. 138-143
Notas
Trabajo presentado a la International Conference on Computer Communications and Networks (ICCCN 2001), Scottsdale (Estados Unidos), octubre de 2001
Departamento
Universidad Pública de Navarra. Departamento de Automática y Computación /
Nafarroako Unibertsitate Publikoa. Automatika eta Konputazioa Saila