The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - Sept. (2012 vol.61)
pp: 1284-1295
Tania Banerjee-Mishra , University of Florida, Gainesville
Sartaj Sahni , University of Florida, Gainesville
ABSTRACT
We present a methodology for constructing a consistent sequence of updates to be applied incrementally to packet classifiers when the updates arrive in a cluster, where consistency is with respect to the next hop/action returned from a packet forwarding table/classifier during lookup. The sequence of updates, built using our strategy, is free from redundancies in update operations and produces a near minimal increase in table size. We prove the existence of a consistent update sequence for any given rule table and a cluster of updates. Our experiments validate our methodology and demonstrate a minimal increase in intermediate table size as a cluster of updates is applied.
INDEX TERMS
Packet classifiers, packet forwarding, route updates, table consistency, incremental updates.
CITATION
Tania Banerjee-Mishra, Sartaj Sahni, "Consistent Updates for Packet Classifiers", IEEE Transactions on Computers, vol.61, no. 9, pp. 1284-1295, Sept. 2012, doi:10.1109/TC.2011.137
REFERENCES
[1] W. Lu and S. Sahni, “Low Power TCAMs for Very Large Forwarding Tables,” Proc. INFOCOM, pp. 942-950, 2008.
[2] W. Lu and S. Sahni, “Succinct Representation of Static Packet Classifiers,” Proc. Int'l Conf. Computer Networking, pp. 1119-1124, 2007.
[3] W. Lu and S. Sahni, “Packet Classification Using Pipelined Two-Dimensional Multibit Tries,” Proc. IEEE Symp. Computers and Comm., pp. 808-813, 2006.
[4] BGP Routing Table Analysis Reports, http:/bgp.potaroo.net, 2009.
[5] Routing Information Service, http://www.ripe.net/projects/risrawdata.html , 2009.
[6] Univ. of Oregon Route Views Archive Project, http:/archive. routeviews.org/, 2009.
[7] RFC 4271, A Border Gateway Protocol 4 (BGP-4), http://www.ietf.org/rfcrfc4271.txt, 2006.
[8] Z. Wang, H. Che, M. Kumar, and S.K. Das, “CoPTUA: Consistent Policy Table Update Algorithm for TCAM without Locking,” IEEE Trans. Computers, vol. 53, no. 12, pp. 1602-1614, Dec. 2004.
[9] F. Zane, G. Narlikar, and A. Basu, “CoolCAMs: Power-Efficient TCAMs for Forwarding Engines,” Proc. INFOCOM, pp. 42-52, 2003.
[10] M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, “Scalable High Speed IP Routing Lookups,” Proc. SIGCOMM, pp. 25-36, 1997.
[11] T. Mishra and S. Sahni, “PETCAM—A Power Efficient TCAM for Forwarding Tables,” Proc. IEEE Symp. Computers and Comm., pp. 224-229, 2009.
[12] S. Sikka and G. Varghese, “Memory-Efficient State Lookups with Fast Updates,” Proc. SIGCOMM, pp. 335-347, 2000.
[13] D. Shah and P. Gupta, “Fast Updating Algorithms on TCAMs,” IEEE Micro, vol. 21, no. 1, pp. 36-47, Jan./Feb. 2001.
[14] A. Basu and G. Narlikar, “Fast Incremental Updates for Pipelined Forwarding Engines,” IEEE/ACM Trans. Networking, vol. 13, no. 3, pp. 690-703, June 2005.
[15] V. Srinivasan and G. Varghese, “Faster IP Lookups Using Controlled Prefix Expansion,” Proc. SIGMETRICS Joint Int'l Conf. Measurement and Modeling of Computer Systems, pp. 1-10, 1998.
[16] D.E. Taylor and J.S. Turner, “ClassBench: A Packet Classification Benchmark,” IEEE/ACM Trans. Networking, vol. 15, no. 3, pp. 499-511, June 2007.
[17] G. Wang and N. Tzeng, “TCAM-Based Forwarding Engine with Minimum Independent Prefix Set (MIPS) for Fast Updating,” Proc. IEEE Int'l Conf. Comm., vol. 1, pp. 103-109, June 2006.
[18] T. Mishra and S. Sahni, “DUO-Dual TCAM Architecture for Routing Tables with Incremental Update,” Proc. IEEE Symp. Computers and Comm., pp. 503-508, 2010.
[19] B. Zhang, D. Massey, and L. Zhang, “Destination Reachability and BGP Convergence Time,” Proc. IEEE Global Telecomm. (GLOBECOM), pp. 1383-1389, 2004.
[20] P. Crescenzi, L. Dardini, and R. Grossi, “IP Address Lookup Made Fast and Simple,” Proc. Euopean Symp. Algorithms, pp. 65-76, 1999.
[21] C. Partridge et al., “A Fifty Gigabit per Second IP Router,” IEEE/ACM Trans. Networking, vol. 6, no. 3, pp. 237-248, June 1998.
[22] C. Labovitz, G. Robert Malan, and F. Jahanian, “Internet Routing Instability,” IEEE Trans. Networking, vol. 6, no. 5, pp. 515-528, Oct. 1998.
[23] J. Li, M. Guidero, Z. Wu, E. Purpus, and T. Ehrenkranz, “BGP Routing Dynamics Revisited,” SIGCOMM Computer Comm. Rev., vol. 37, no. 2, pp. 7-16, Apr. 2007.
[24] A. Basu and G. Narlikar, “Method and Apparatus for Reducing the Number of Write Operations during Route Updates in Pipelined Forwarding Engines,” US Patent 7,171,490 B2, 2007.
[25] M. Lad, X. Zhao, B. Zhang, D. Massey, and L. Zhang, “Analysis of BGP Update Surge during Slammer Worm Attack,” Proc. Sixth Int'l Workshop Distributed Computing (IWDC), pp. 833-835, 2003.
[26] S.Y. Hsieh, Y.L. Huang, and Y.C. Yang, “Multi-Prefix Trie: A New Data Structure for Designing Dynamic Routing Tables,” IEEE Trans. Computers, vol. 60, no. 5, pp. 693-706, http://doi. ieeecomputersociety.org/10.1109 TC.2010.133, May 2011.
[27] K. Zhang, A. Yen, X. Zhao, D. Massey, S.F. Wu, and L. Zhang, “On Detection of Anomalous Routing Dynamics in BGP,” Networking, pp. 259-270, Springer, 2004.
[28] John Heasley@Routeviews, from an Email He Sent on Mar. 2009.
[29] T. Mishra and S. Sahni, “CONSIST—Consistent Internet Route Updates,” Proc. IEEE Symp. Computers and Comm., pp. 509-514, 2010.
[30] Y. Rekhter and T. Li, “A Border Gateway Protocol 4 (bgp4),” draftietf-idr-bgp4-09.txt, 1999.
408 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool