Treffer: Internet packet routing : Application of a K-quickest path algorithm
Title:
Internet packet routing : Application of a K-quickest path algorithm
Source:
European journal of operational research. 181(3):1045-1054
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Approche probabiliste, Probabilistic approach, Enfoque probabilista, Autosimilitude, Selfsimilarity, Autosimilitud, Classification hiérarchique, Hierarchical classification, Clasificación jerarquizada, Commutation paquet, Packet switching, Conmutación por paquete, Internet, Loi Pareto, Pareto distribution, Ley Pareto, Moyenne temporelle, Time average, Promedio temporal, Routage, Routing, Enrutamiento, Réseau télécommunication, Telecommunication network, Red telecomunicación, Transmission donnée, Data transmission, Transmisión datos, Quickest path, Simple paths ranking, Telecommunication networks
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Faculdade de Economia da Universidade de Coimbra, Avenida Dias da Silva, 165, 3004-512 Coimbra, Portugal
Instituto de Engenharia de Sistemas e Computadores -Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal
Departamento de Matemātica, Polo Ida Universidade de Coimbra, Apartado 3008, 3001-454 Coimbra, Portugal
Departamento de Engenharia Electrotécnica e de Computadores, Polo II da Universidade de Coimbra, Pinhal de Marrocos, 3030-290 Coimbra, Portugal
DEIO-CIO, Faculdade de Ciências, Universidade de Lisboa, Bloco C6, Campo Grande, 1749-016 Lisboa, Portugal
Instituto de Engenharia de Sistemas e Computadores -Coimbra, Rua Antero de Quental, 199, 3000-033 Coimbra, Portugal
Departamento de Matemātica, Polo Ida Universidade de Coimbra, Apartado 3008, 3001-454 Coimbra, Portugal
Departamento de Engenharia Electrotécnica e de Computadores, Polo II da Universidade de Coimbra, Pinhal de Marrocos, 3030-290 Coimbra, Portugal
DEIO-CIO, Faculdade de Ciências, Universidade de Lisboa, Bloco C6, Campo Grande, 1749-016 Lisboa, Portugal
ISSN:
0377-2217
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Operational research. Management
Operational research. Management
Accession Number:
edscal.18674422
Database:
PASCAL Archive
Weitere Informationen
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.