Abstract
Traditional networks make routing decisions based only on the destination address. This dramatically limits the number of ser-vices that a network can provide. However, in some of them, the demand for more flexible routing protocols has increased. For example, home and enterprise networks, as well as datacenters, need to support multi-homing and/or role-based access control. This is where two-dimensional forwarding tables step in. In this approach, routing decisions are based on the destination and the source addresses. However, this will increase the lookup time and make the memory use skyrocket if implemented carelessly. In this paper, we evaluate and compare different designs to find the best way to tackle this problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kim, H., Claffy, K., Fomenkov, M., Barman, D., Faloutsos, M., Lee, K.: Internet traffic classification demystified: myths, caveats, and the best practices. In: Porceedings of ACM CoNEXT’08, Madrid, Spain, December 2008
Acharya, S., Wang, J., Ge, Z., Znati, T., Greenberg, A.: Simulation study of firewalls to aid improved performance. In: 39th Annual Simulation Symposium, April 2006
Cisco: Policy-Based Routing (white paper) (1996)
Juniper: Multi-topology Routing (white paper), August 2010
Baker, F.: IPv6 Source/Destination Routing using OSPFv3 Feb 2013. Internet Draft. www.draft-baker-ipv6-ospf-dst-src-routing-00
Lindem, A., Mirtorabi, S., Roy, A., Baker, F.: Ospfv3 LSA Extendibility May 2013. Internet Draft. www.draft-acee-ospfv3-lsa-extend-01
Benson, T., Akella, A., Maltz, D.A.: Mining policies from enterprise network configuration. In: Proceedings of ACM IMC’09, Chicago, IL, November 2009
Gupta, P.: Algorithms for routing lookups and packet classification. Ph.D. thesis, Stanford University (2000)
Baker, F.: Routing a Traffic Class January 2012. Internet Draft. www.draft-baker-fun-routing-class-00
Seehra, A., Naous, J., Walfish, M., Mazires, D., Nicolosi, A., Shenker, S.: A policy framework for the future internet. In: Proceedings of ACM HotNets’09, New York, October 2009
Yang, X., Clark, D., Berger, A.W.: Nira: a new inter-domain routing architecture. IEEE/ACM Trans. Netw. 15(4), 775–788 (2007)
Fu J., Rexford, J.: Efficient ip-address lookup with a shared forwarding table for multiple virtual routers. In: Proceedings of ACM CoNEXT 2008, Madrid, Spain, December 2008
Lamparter, D.: Destination/source Routing Oct 2014. Internet Draft. www.draft-lamparter-rtgwg-dst-src-routing-00.txt
Varghese, G.: Network Algorithmics: An Interdisciplinary Approach to Designing Fast Networked Devices. Morgan Kaufmann, Waltham (2005)
Meiners, C.R., Liu, A.X., Torng, E., Patel, J.: Split: optimizing space, power, and throughput for tcam-based classification. In: Proceedings of ACM/IEEE ANCS 2011, Brooklyn, NY, October 2011
Liu, A., Meiners, C., Torng, E.: Tcam razor: A systematic approach towards minimizing packet classifiers in tcams. Netw., IEEE/ACM Trans. 18(2), 490–500 (2010)
Meiners, C., Liu, A., Torng, E.: Bit weaving: a non-prefix approach to compressing packet classifiers in tcams. In: Proceedings of IEEE ICNP 2009, Orlando, Florida, October 2009
Meiners, C., Liu, A., Torng, E.: Hardware Based Packet Classification for High Speed Internet Routers. Springer, New York (2010)
Ma, Y., Banerjee, S.: A smart pre-classifier to reduce power consumption of tcams for multi-dimensional packet classification. In: Proceedings of ACM SIGCOMM 2012, Helsinki, Finland, August 2012
Lakshman, T.V., Stiliadis, D.: High-speed policy-based packet forwarding using efficient multi-dimensional range matching. SIGCOMM Comput. Commun. Rev. 28(4), 203–214 (1998)
Srinivasan, V., Varghese, G., Suri, S., Waldvogel, M.: Fast and scalable layer four switching. In: Proceeding of ACM SIGCOMM 1998, Vancouver, British Columbia, Canada, August 1998
Chang, Y.-K.: Efficient multidimensional packet classification with fast updates. IEEE Trans. Comput. 58(4), 463–479 (2009)
Qi, Y., Xu, L., Yang, B., Xue, Y., Li, J.: Packet classification algorithms: from theory to practice. In: Proceedings of IEEE Infocom 2009, Rio de Janeiro, Brazil, April 2009
Suri, S., Sandholm, T., Warkhede, P.: Compressing two-dimensional routing tables. Algorithmica 35, 287–300 (2003)
Mishra, T., Sahni, S.: Duos - simple dual tcam architecture for routing tables with incremental update. In: Proceedings of IEEE ISCC 2010, Riccione, Italy, June 2010
Rétvári, G., Tapolcai, J., Kőrösi, A., Majdán, A., Heszberger, Z.: Compressing ip forwarding tables: towards entropy bounds and beyond. In: Proceedings of the ACM SIGCOMM 2013 Conference on SIGCOMM, SIGCOMM 2013 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bayzelon, G., Yang, S., Xu, M., Li, Q. (2015). Multi-dimensional Forwarding Tables. In: Zhang, S., Xu, K., Xu, M., Wu, J., Wu, C., Zhong, Y. (eds) Frontiers in Internet Technologies. ICoC 2014. Communications in Computer and Information Science, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46826-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-46826-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46825-8
Online ISBN: 978-3-662-46826-5
eBook Packages: Computer ScienceComputer Science (R0)