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

• Autor(a) principal: Clímaco, João C. N.
• Data de Publicação: 2007
• Outros Autores: Pascoal, Marta M. B., Craveirinha, José M. F., Captivo, M. Eugénia V.
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10316/5485; https://doi.org/10.1016/j.ejor.2006.03.013
• topic: Telecommunication networks; Quickest path; Simple paths ranking

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.