Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481898 | European Journal of Operational Research | 2007 | 10 Pages |
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 simulate 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
João C.N. Clímaco, Marta M.B. Pascoal, José M.F. Craveirinha, M. Eugénia V. Captivo,