Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/5485
Title: | Internet packet routing: Application of a K-quickest path algorithm | Authors: | Clímaco, João C. N. Pascoal, Marta M. B. Craveirinha, José M. F. Captivo, M. Eugénia V. |
Keywords: | Telecommunication networks; Quickest path; Simple paths ranking | Issue Date: | 2007 | Citation: | European Journal of Operational Research. 181:3 (2007) 1045-1054 | 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. | URI: | https://hdl.handle.net/10316/5485 | DOI: | 10.1016/j.ejor.2006.03.013 | Rights: | openAccess |
Appears in Collections: | FEUC- Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
filee29acc81ac9343228be10f615af717d4.pdf | 198.94 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
70
checked on Apr 15, 2024
WEB OF SCIENCETM
Citations
61
checked on Apr 2, 2024
Page view(s)
417
checked on Apr 23, 2024
Download(s) 20
1,264
checked on Apr 23, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.