Skip to main content
SpringerLink
Log in

Performance of Routing Lookups

  • Conference paper
Advances in Computing and Information Technology (ACITY 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 198))

  • 1738 Accesses

Abstract

We look at the performance of routing lookups when techniques for restructuring binary search trees are applied. We try to obtain near-optimal routing lookups with bounded worst-case performance. For this, we look at the problem of constructing search trees so that the average lookup time is minimized while keeping the worst-case lookup time within a fixed bound.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bose, P., Douïeb, K.: Efficient construction of near-optimal binary and multiway search trees. In: Dehne, F., Gavrilova, M., Sack, J.-R., Tóth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 230–241. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Bose, P., Douïeb, K.: Should Static Search Trees Ever Be Unbalanced? In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 109–120. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Cheung, G., McCanne, S.: Optimal Routing Table Design for IP Address Lookups under Memory Constraints. In: Proceedings of IEEE Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1999, vol. 3, pp. 1437–1444. IEEE Press, New York (1999)

    Google Scholar 

  4. Degermark, M., Brodnik, A., Carlsson, S., Pink, S.: Small forwarding tables for fast routing lookups. ACM SIGCOMM Computer Communication Review 27(4), 3–14 (1997)

    Article  Google Scholar 

  5. Evans, W., Kirkpatrick, D.: Restructuring ordered binary trees. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 477–486. SIAM, Philadelphia (2000)

    Google Scholar 

  6. Evans, W., Kirkpatrick, D.: Restructuring ordered binary trees. Journal of Algorithms 50(2), 168–193 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gagie, T.: Restructuring binary search trees revisited. Information Processing Letters 95(3), 418–421 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Garey, M.R.: Optimal binary search trees with restricted maximal depth. SIAM Journal on Computing 3(2), 101–110 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  9. Garsia, A.M., Wachs, M.L.: A new algorithm for minimum cost binary trees. SIAM Journal on Computing 6, 622–642 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gupta, P., Lin, S., McKeown, N.: Routing lookups in hardware at memory access speeds. In: Proceedings of IEEE Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1998, vol. 3, pp. 1240–1247. IEEE Press, New York (1998)

    Google Scholar 

  11. Gupta, P., Prabhakar, B., Boyd, S.: Near-optimal routing lookups with bounded worst case performance. In: Proceedings of IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2000, vol. 3, pp. 1184–1192. IEEE Press, New York (2000)

    Google Scholar 

  12. Gupta, P., Prabhakar, B., Boyd, S.: Near-optimal depth-constrained codes. IEEE Transactions on Information Theory 50(12), 3294–3298 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hu, T.C.: Combinatorial Algorithms. Addison-Wesley, Reading (1982)

    MATH  Google Scholar 

  14. Hu, T.C., Tucker, A.C.: Optimal computer search trees and variable-length alphabetical codes. SIAM Journal on Applied Mathematics 21(4), 514–532 (1971)

    Article  MathSciNet  MATH  Google Scholar 

  15. Itai, A.: Optimal alphabetic trees. SIAM Journal on Computing 9(1), 9–18 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  16. Knuth, D.E.: Optimum binary search trees. Acta Informatica 1(1), 14–25 (1971)

    Article  MATH  Google Scholar 

  17. Lampson, B., Srinivasan, V., Varghese, G.: IP Lookups using Multiway and Multicolumn Search. In: Proceedings of IEEE Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 1998, vol. 3, pp. 1248–1256. IEEE Press, New York (1998)

    Google Scholar 

  18. Larmore, L.L., Przytycka, T.M.: A fast algorithm for optimum height-limited alphabetic binary trees. SIAM Journal on Computing 23(6), 1283–1312 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  19. Mehlhorn, K.: A best possible bound for the weighted path length of binary search trees. SIAM Journal on Computing 6(2), 235–239 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  20. Nagaraj, S.V.: Optimal binary search trees. Theoretical Computer Science 188(1–2), 1–44 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  21. Nilsson, S., Karlsson, G.: IP-Address Lookup Using LC-Tries. IEEE Journal on Selected Areas in Communications 17(6), 1083–1092 (1999)

    Article  Google Scholar 

  22. Prisco, R.D., Santis, A.D.: New lower bounds on the cost of binary search trees. Theoretical Computer Science 156(1-2), 315–325 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  23. Srinivasan, V., Varghese, G.: Faster IP Lookups using Controlled Prefix Expansion. ACM Transcations on Computer Systems 17(1), 1–40 (1999)

    Article  Google Scholar 

  24. Wessner, R.L.: Optimal alphabetic search trees with restricted maximal height. Information Processing Letters 4(4), 90–94 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  25. Yeung, R.W.: Alphabetic codes revisited. IEEE Transactions on Information Theory 37(3), 564–572 (1991)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RMK Engineering College, RSM Nagar, Kavaraipettai, 601 206, Tamil Nadu, India

    S. V. Nagaraj

Authors
  1. S. V. Nagaraj
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Southeastern Louisiana University, 70402, Hammond, LA, USA

    David C. Wyld

  2. Chair of Systems and Computer Networks, Wroclaw University of Technology, Wybrzeze Wyspianskiego 27, 50-370, Wroclaw, Poland

    Michal Wozniak

  3. University of Calcutta, Calcutta, India

    Nabendu Chaki

  4. Jackson State University Jackson, 39217, MS, USA

    Natarajan Meghanathan

  5. Wireilla Net Solutions PTY Ltd, Melbourne, Victoria, Australia

    Dhinaharan Nagamalai

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagaraj, S.V. (2011). Performance of Routing Lookups. In: Wyld, D.C., Wozniak, M., Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Advances in Computing and Information Technology. ACITY 2011. Communications in Computer and Information Science, vol 198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22555-0_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22555-0_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22554-3

  • Online ISBN: 978-3-642-22555-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation