Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Framework for performance engineering of OSPF software

Framework for performance engineering of OSPF software

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Software — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

The performance of the Open Shortest Path first (OSPF) routing protocol software is presented, which includes measuring its performance, analysing the results, proposing solutions for improvement and evaluating their effect. First, a reusable framework for evaluating the performance of routing software is proposed, which allows to perform reproducible experiments in a controlled environment with different network topologies. Then, performance bottlenecks are identified and the relative performance of several low-level optimisations suggested to improve the route computation code and data structures is discussed. In addition, the design and implementation of an algorithm-level optimisation is presented, using the Incremental Shortest Path First (ISPF) algorithm, and its performance benefits are then presented. Substantial gains in performance are achieved by using ISPF, more than what is possible by employing techniques for code optimisation and by using efficient data structures to implement Dijkstra's SPF algorithm. Finally, the effect of topological change on the size of the affected subtree is investigated, and it is found that most of the time a topological change affects a small number of nodes in an OSPF area, causing a small number of route updates in the routing table and consequently, a smaller execution time for ISPF.

Inspec keywords: software performance evaluation; telecommunication network topology; routing protocols; graph theory

Other keywords: performance engineering; incremental shortest path first algorithm; open shortest oath first routing protocol software; routing software performance evaluation; reusable framework; algorithm-level optimisation; network topology; data structures; code optimisation; Dijkstra shortest path first algorithm

Subjects: Protocols; Combinatorial mathematics; Combinatorial mathematics; Communication network design, planning and routing; Protocols; Software performance evaluation

References

    1. 1)
      • J. McQuillan , I. Richer , E. Rosen . The new routing algorithm for the ARPANET. IEEE Trans. Commun. , 5 , 711 - 719
    2. 2)
      • E. Dijkstra . A note on two problems in connection with graphs. Num. Math. , 269 - 271
    3. 3)
      • A. Shaikh , M. Goyal , A. Greenberg , R. Rajan , K.K. Ramakrishnan . An OPSF topology server: design and evaluation. IEEE J. Sel. Areas Commun. , 4 , 746 - 755
    4. 4)
      • K. Calvert , M. Doar , E. Zegura . Modeling internet topology. IEEE Comm. Magazine , 6 , 160 - 163
    5. 5)
      • RFC 4061: ‘Benchmarking basic OSPF single router control plane convergence’, 2005.
    6. 6)
      • R.B. Dial . Algorithm 360: shortest-path forest with topological ordering. Commun. ACM , 11 , 632 - 633
    7. 7)
      • Eramo, V., Listanti, M., Caione, N., Russo, I., Gasparro, G.: `Routing performance of a router based on PC hardware and open source software', Proc. 9th IASTED Int. Conf. on Internet and Multimedia Systems and Applications (EuroIMSA 2005), 2005.
    8. 8)
      • El-Sayed, H., Ahmed, M., Jaseemuddin, M., Petriu, D.: `A framework for performance characterization and enhancement of the OSPF routing protocol', Proc. 9th IASTED Int. Conf. on Internet and Multimedia Systems and Applications (EuroIMSA 2005), 2005.
    9. 9)
      • Basu, A., Riecke, G.J.: `Stability issues in OSPF routing', Proc. ACM SIGCOMM, August 2001.
    10. 10)
      • Shaikh, A.: `Experience in black-box OSPF measurement', Proc. 1st ACM SIGCOMM Workshop on Internet Measurement, 2001.
    11. 11)
      • RFC 1771: ‘A border gateway protocol’, 1995.
    12. 12)
      • Shaikh, A., Isett, C., Greenberg, A., Roughan, M., Gottlieb, J.: `A case study of OSPF behavior in a large enterprise network', Proc. ACM SIGCOMM Internet Measurement Workshop (IMW), November 2002, p. 217–230.
    13. 13)
      • http://www-306.ibm.com/software/awdtools/purifyplus.
    14. 14)
      • RFC 4063: ‘Considerations when using basic OSPF convergence benchmarks’, 2005.
    15. 15)
      • http://www.gated.org/.
    16. 16)
      • R.K. Ahuja , T.L. Magnanti , J.B. Orlin . (1993) Network flows: theory, algorithms and applications.
    17. 17)
      • http://www.zebra.org/.
    18. 18)
      • Watson, D., Jahanian, F., Labovitz, C.: `Experiences with monitoring OSPF on a regional service provider network', Proc. 23rd IEEE Int. Conf. on Distributed Computing Systems (ICDCS'03), 2003.
    19. 19)
      • RFC 4062: ‘OSPF benchmarking terminology and concepts’, 2005.
    20. 20)
      • RFC 2328: ‘OSPF version 2’, 1998..
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-sen_20060032
Loading

Related content

content/journals/10.1049/ip-sen_20060032
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address