Routing protocols are a critical component in IP networks. 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 and Xorp are the most used in PC-based router. In this paper we evaluate the OSPF performance of Quagga and Xorp routing software according to the test methodologies defined within the Internet Engineering Task Force. Moreover we describe a set of changes made on Quagga code in order to optimize some processes, whose algorithms were not efficient. In order to show the flexibility of an Open Source Routing Software, we have also implemented in Quagga an incremental algorithm for the evaluation of the shortest path. The realized implementation allows the shortest path computation time to be reduced of about the 97 © 2007 Springer.

Performance and Flexibility of Open Source Routing Software / Eramo, Vincenzo; Listanti, Marco; Cianfrani, Antonio; E., Cipollone. - ELETTRONICO. - (2007), pp. 259-270. (Intervento presentato al convegno 1st IFIP International Conference on New Technologies, Mobility and Security tenutosi a Paris (France) nel 2-4 Maggio 2007) [10.1007/978-1-4020-6270-4-22].

Performance and Flexibility of Open Source Routing Software

ERAMO, Vincenzo;LISTANTI, Marco;CIANFRANI, Antonio;
2007

Abstract

Routing protocols are a critical component in IP networks. 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 and Xorp are the most used in PC-based router. In this paper we evaluate the OSPF performance of Quagga and Xorp routing software according to the test methodologies defined within the Internet Engineering Task Force. Moreover we describe a set of changes made on Quagga code in order to optimize some processes, whose algorithms were not efficient. In order to show the flexibility of an Open Source Routing Software, we have also implemented in Quagga an incremental algorithm for the evaluation of the shortest path. The realized implementation allows the shortest path computation time to be reduced of about the 97 © 2007 Springer.
2007
1st IFIP International Conference on New Technologies, Mobility and Security
Binary heap, Dijkstra's algorithms, Incremental algorithm, Open shortest path first, Open-source code, Routing software
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Performance and Flexibility of Open Source Routing Software / Eramo, Vincenzo; Listanti, Marco; Cianfrani, Antonio; E., Cipollone. - ELETTRONICO. - (2007), pp. 259-270. (Intervento presentato al convegno 1st IFIP International Conference on New Technologies, Mobility and Security tenutosi a Paris (France) nel 2-4 Maggio 2007) [10.1007/978-1-4020-6270-4-22].
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/381705
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact