Internet packet routing: application of a K-quickest path algorithm

Authors

Abstract

This paper describes a study on the application of an algorithm to rank the K quickest paths to the routing of data packets in Internet networks. For this purpose an experimental framework was developed by considering two types
of random generated networks.
To obtain realistic values of the IP packet sizes, a truncated Pareto distribution was defined, having in mind to reflect a key feature of Internet traffic, namely its self-similar stochastic nature. Results concerning the average CPU times of the algorithm for the different sets of experiments will be presented and discussed.

Keywords

Telecommunication networks, quickest path, simple paths ranking

Conference

III International Conference on Decision Support for Telecommunications and Information Society DSTIS'03, September 2003