Publication:
On linear prediction of Internet traffic for packet and burst switching networks

Consultable a partir de

Date

2001

Director

Publisher

IEEE
Acceso abierto / Sarbide irekia
Contribución a congreso / Biltzarrerako ekarpena

Project identifier

Abstract

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.

Description

Trabajo presentado a la International Conference on Computer Communications and Networks (ICCCN 2001), Scottsdale (Estados Unidos), octubre de 2001

Keywords

Internet performance analysis, Traffic prediction, Long-range dependence, Short-range dependence, Traffic measurement

Department

Automática y Computación / Automatika eta Konputazioa

Faculty/School

Degree

Doctorate program

item.page.cita

item.page.rights

Los documentos de Academica-e están protegidos por derechos de autor con todos los derechos reservados, a no ser que se indique lo contrario.