|
OPTIMIZATION IN THE SHORTEST PATH FIRST COMPUTATION
FOR THE QUAGGA SOFTWARE ROUTING
V. Eramo, M. Listanti, G. Gasparro, A. Cianfrani
University of Roma “La
Sapienza”, INFOCOM Dept.
Via Eudossiana, 18 – 00184 Roma, Italy
Tel: +39 6 44585458; Fax: +39 6 4744481
E-mail: eramo@infocom.uniroma1.it
Abstract
Routing protocols are a critical component in IP networks. Among
these, the Open Shortest Path First (OSPF) has been a widely used routing
protocol in IP networks for some years. Beside dedicated hardware, a great
interest on routing systems based on open software is raising among
Internet Service Providers. Many open source implementations of this
protocol have been developed, among which Quagga is one of the most
complete.
In this paper we perform a study
of the performances of the Shortest Path First computation in Quagga, as
prescribed by the Internet Engineering Task Force, and we provide a
comparison between a Cisco2621 access router and a PC-based router equipped
with Quagga routing software. Moreover we describe a set of modifications
made on the Quagga code in order to optimize some processes, whose
algorithms were not efficient and whose experimental measures had showed a
lack of optimization, thus finally obtaining performances better than the
one measured on commercial systems.
Index Terms: Open Source Code, Quagga
Routing Software, Open Shortest Path First, Dijkstra’s algorithm,
Binary Heap
Reference
Author
Vincenzo
Eramo
Università
di Roma
“La
Sapienza”
Via
Eudossiana, 18
00184 Roma
(Italy)
Phone: +39 06 47852311
Fax:
+39 06 4744481
e-mail: eramo@infocom.uniroma1.it
|
