loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Second International Conference on Systems and Networks Communications (ICSNC 2007)
On the Performance of Shortest Path Routing Algorithms for Modeling and Simulation of Static Source Routed Networks -- an Extension to the Dijkstra Algorithm
Cap Esterel, France
August 25-August 31
ISBN: 0-7695-2938-0
ASCII Text
x 
 
Nuno M. Garcia, Przemyslaw Lenkiewicz, M?rio M. Freire, Paulo P. Monteiro, "On the Performance of Shortest Path Routing Algorithms for Modeling and Simulation of Static Source Routed Networks -- an Extension to the Dijkstra Algorithm," Systems and Networks Communication, International Conference on, pp. 60, Second International Conference on Systems and Networks Communications (ICSNC 2007), 2007.
 
 
BibTex
x
 
@article{ 10.1109/ICSNC.2007.56,
author = {Nuno M. Garcia and Przemyslaw Lenkiewicz and M?rio M. Freire and Paulo P. Monteiro},
title = {On the Performance of Shortest Path Routing Algorithms for Modeling and Simulation of Static Source Routed Networks -- an Extension to the Dijkstra Algorithm},
journal ={Systems and Networks Communication, International Conference on},
volume = {0},
year = {2007},
isbn = {0-7695-2938-0},
pages = {60},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICSNC.2007.56},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Systems and Networks Communication, International Conference on
TI - On the Performance of Shortest Path Routing Algorithms for Modeling and Simulation of Static Source Routed Networks -- an Extension to the Dijkstra Algorithm
SN - 0-7695-2938-0
SP
EP
A1 - Nuno M. Garcia,
A1 - Przemyslaw Lenkiewicz,
A1 - M?rio M. Freire,
A1 - Paulo P. Monteiro,
PY - 2007
KW - null
VL - 0
JA - Systems and Networks Communication, International Conference on
ER -
 
Nuno M. Garcia, Nokia Siemens Portugal; University of Beira Interior, Portugal
Przemyslaw Lenkiewicz, University of Beira Interior, Portugal
M?rio M. Freire, University of Beira Interior, Portugal
Paulo P. Monteiro, Nokia Siemens Portugal; University of Aveiro, Portugal
Shortest path routing algorithms, such as Dijkstra?s algorithm present an overload problem when used to define routes for ring topologies in networks that implement source routing. This paper presents the effects of Dijkstra?s shortest path routing in the simulation and modeling of static source routed networks, in particular we evaluated the effect of this routing scheme in the performance of Optical Burst Switched (OBS) networks. A new static shortest path algorithm is presented and its performance compared with the standard shortest path algorithm, using two new metrics. We propose the use of this routing algorithm in network simulators instead of standard Dijkstra, as it produces more symmetric and balanced routes over the network links, thus producing results that are closer to real networks which implement a more dynamic routing.
Citation:
Nuno M. Garcia, Przemyslaw Lenkiewicz, M?rio M. Freire, Paulo P. Monteiro, "On the Performance of Shortest Path Routing Algorithms for Modeling and Simulation of Static Source Routed Networks -- an Extension to the Dijkstra Algorithm," icsnc, pp.60, Second International Conference on Systems and Networks Communications (ICSNC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.