AN IP PACKET FORWARDING TECHNIQUE BASED ON A NEW STRUCTURE OF LOOKUP TABLE

H. Arafat Ali, A.I. El-Desouky, and M.F. Ared

References

  1. [1] H. Tzeng & T. Przygienda, On fast address lookup algorithms,IEEE Journal on Selected Areas in Communications, 17(6),June 1999, 1067–1082. doi:10.1109/49.772436
  2. [2] W. Doeringer, G. Karjoth, & M. Nassehi, Routing on longestmatching prefixes, IEEE/ACM Transactions on Networking,4(1), 1996, 86–97. doi:10.1109/90.503764
  3. [3] C. Gavoille, Routing in distributed networks: Overview andopen problems, ACM SIGACT News—Distributed ComputingColumn, 32(1), 2001, 36–52. doi:10.1145/568438.568451
  4. [4] M. Ruiz-Sanchez, E. Biersack, & W. Dabbous, Survey andtaxonomy of IP address lookup algorithms, IEEE Network,15(2), March/April 2001, 8–23. doi:10.1109/65.912716
  5. [5] G. Cheung & S. McCanne, Optimal routing table design forIP address lookups under memory constraints, Proc. IEEEINFOCOM ’99, New York, NY, March 21–25, 1999, 1437–1444.
  6. [6] L. Buchsbaum, G.S. Fowler, B. Krishnamurthy, K. Vo, & J.Wang, Fast prefix matching of bounded strings, 5th Workshopon Algorithm Engineering and Experiments (ALENEX03),Baltimore, Maryland, January 11, 2003, 128–140.
  7. [7] Leon-Garcia & I. Widjaja, Communication networks, funda-mental concepts and key structures (Boston: McGraw Hill,2000).
  8. [8] M. Degermark, A. Brodnik, S. Carlsson, & S. Pink, Smallforwarding tables for fast routing lookups, Proc. of ACMSIGCOMM’97, Cannes, 1997, 3–14. doi:10.1145/263109.263133
  9. [9] K. Kim & S. Sahni, IP lookup by binary search on prefixlength, Journal of Interconnection Networks, 3(3&4), 2002,105–128. doi:10.1142/S0219265902000586
  10. [10] B. Lampson, V. Srinivasan, & G. Varghese, IP lookups usingmultiway and multicolumn search, Proc. INFOCOM, 3, SanFrancisco, CA, 3, March–April 1998, 1248–1256. doi:10.1109/INFCOM.1998.662939
  11. [11] M. Waldvogel, G. Varghese, J. Turner, & B. Plattner, Scalablehigh speed IP routing lookups, Proc. ACM SIGCOMM ’97,September 14–18, Cannes, France, 1997, 25–36.120 doi:10.1145/263109.263136
  12. [12] J. Xu, M. Singhal, & J. Degroat, A novel cache architectureto support layer-four packet classification at memory accessspeeds, IEEE INFOCOM 2000, Tel Aviv, Israel, March 26–30,2000, 1445–1454. doi:10.1109/INFCOM.2000.832542
  13. [13] R.V. Boppana & S.P. Konduru, An adaptive distance vectorrouting algorithm for mobile, ad hoc networks, IEEE INFO-COM 2001, Anchorage, Alaska, April 22–26, 2001, 1753–1762. doi:10.1109/INFCOM.2001.916673
  14. [14] K. Kim & S. Sahni, Efficient construction of variable-stridemultibit tries for IP lookup, Proc. IEEE Symp. on Applicationsand the Internet (SAINT), Nara City, Nara, Japan, January28–February 1, 2002, 220–227. doi:10.1109/SAINT.2002.994482
  15. [15] V. Srinivasan & G. Varghese, Fast address lookups using con-trolled prefix expansion, Proc. ACM Sigmetrics ’98, Madison,WI, June 1998, 1–11. doi:10.1145/277858.277863
  16. [16] S. Nilsson & G. Karlsson, IP-address lookup using LC-tries,IEEE Journal of Selected Areas in Communications, 17(6),1999, 1083–1092. doi:10.1109/49.772439
  17. [17] S. Suri, T. Sandholm, & P. Warkhede, Compressing two-dimensional routing table, Algorithmica, 35(4), 2003, 287–300. doi:10.1007/s00453-002-1000-7
  18. [18] P. Gupta, S. Lin, & N. McKeown, Routing lookups in hardwareat memory access speeds, Proc. IEEE INFOCOM ’98, 1998,San Francisco, CA, April 1998, 1240–1247. doi:10.1109/INFCOM.1998.662938
  19. [19] V. Srinivasan & G. Varghese, Faster IP lookups using controlledprefix expansion, IEEE Trans. on Computer Systems, 17(1),1999, 1–40. doi:10.1145/296502.296503
  20. [20] A. Wolski, J. Kuha, T. Luukkanen, & A. Pesonen, Design ofRapidBase—An active measurement database system, Proc.Int. Database Engineering and Applications Symp. (IDEAS2000), Yokahama, Japan, September 18–20, 2000, 75–82.

Important Links:

Go Back