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

Author

Morató, D. ; Aracil, J. ; Díez, L.A. ; Izal, M. ; Magana, E.

Author_Institution

Dept. Automatics & Comput. Sci., Public Univ. of Navarra, Pamplona, Spain

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

138

Lastpage

143

Abstract

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

Keywords

Internet; least mean squares methods; optical fibre networks; packet switching; prediction theory; switching networks; telecommunication traffic; Internet traffic; end-to-end latency; least mean square error; linear prediction; low bandwidth waste; optical burst switching networks; packet arrival distribution; packet switching networks; Bandwidth; Burst switching; Character generation; IP networks; Internet; Mean square error methods; Optical burst switching; Performance analysis; Prediction methods; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Communications and Networks, 2001. Proceedings. Tenth International Conference on

Conference_Location

Scottsdale, AZ

ISSN

1095-2055

Print_ISBN

0-7803-7128-3

Type

conf

DOI

10.1109/ICCCN.2001.956231

Filename

956231