This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Cost-Effective Flow Table Designs for High-Speed Routers: Architecture and Performance Evaluation
September 2002 (vol. 51 no. 9)
pp. 1089-1099

Abstract—Provision of QoS-related router functions such as traffic regulation, policy routing, and usage-based accounting requires that a flow table store state information for active flows. The design of such a flow table is not trivial for a high-speed Internet router (e.g., 100+ Gbps) with a large number of active flows (e.g., tens of millions) and a high packet arrival rate (e.g., tens of millions of packets per second). Targeting two different models (centralized and distributed) of router design, we propose a software-based design to be implemented on individual line cards, which is suitable for the distributed model, and a hardware-based design to be implemented in the main forwarding engine of a router, which is suitable for the centralized model. The software-based design, adapted from the hash table data structure, employs a practical and effective technique to solve the garbage collection problem caused by the expired flows. The hardware-based design, adapted from the architecture of an N-way set-associative cache, employs a novel dynamic set-associative scheme to reduce the overflow ratio that a traditional set-associative scheme incurs, by a high percentage, and a pipelined design to achieve a throughput of 100+ Gbps. The performance evaluation results from both trace-driven simulation and statistical analysis demonstrate that both designs are cost-effective for their targeted router models.

[1] R. Edell, N. Mckeown, and P. Varaiya, “Billing Users and Pricing for TCP,” IEEE J. Selected Areas in Comm., vol. 13, no. 7, pp. 1162-1175, Sept. 1995.
[2] S. Shenker and J. Wroclawski, “General Characterization Parameters for Integrated Services Network Elements,” RFC 2215, Sept. 1997
[3] P. Gupta and N. McKeown,"Packet Classification on Multiple Fields," Proc. ACM Sigcomm, ACM Press, 1999, pp. 147-160.
[4] T.V. Lakshman and D. Stiliadis, "High-Speed Policy-Based Packet Forwarding Using Efficient Multidimensional Range Matching," Proc. ACM SIGCOMM 1998, pp. 191-202.
[5] V. Srinivasan et al., "Fast and Scalable Layer-4 Switching," Proc. ACM SIGCOMM 1998, ACM Press, New York, 1998, pp. 203-214.
[6] J. Xu, M. Singhal, and J. Degroat, “A Novel Cache Architecture to Support Layer-Four Packet Classification at Memory Access Speeds,” Proc. Infocom 2000, Mar. 2000.
[7] H. Chan, H. Alnuweiri, and V. Leung, “A Framework for Optimizing the Cost and Performance of Next-Generation IP Routers,” IEEE J. Selected Areas in Comm., vol. 17, no. 6, pp. 1013-1029, June 1999.
[8] RAMBUS Inc., RAMBUS Technology Overview, Feb. 1999.
[9] J. Xu and M. Singhal, “Cost-Effective Flow Table Designs for High-Speed Internet Routers: Architecture and Performance Evaluation,” technical report, Ohio State Univ., Nov. 1999.
[10] K. Claffy, “Internet Workload Characterization,” PhD thesis, Univ. of California at San Diego, June 1994.
[11] W. Leland et al., "On the Self-Similar Nature of Ethernet Traffic (Extended Version)," IEEE/ACM Trans. Networking, Vol. 2, No. 1, Feb. 1994, pp. 1-15.
[12] V. Paxson and S. Floyd, “Wide Area Traffic: The Failure of Poisson Modeling,” IEEE/ACM Trans. Networking, Apr. 1995.
[13] A. Feldmann, A. Gilbert, and W. Willinger, “Data Networks as Cascades: Investigating the Multifractal Nature of Internet WAN Traffic,” Proc. ACM SIGCOMM '98, pp. 42-55, Sept. 1998.
[14] J. Cao, W. Cleveland, D. Lin, and D. Sun, “On the Nonstationarity of Internet Traffic,” Proc. ACM Sigmetrics '01, pp. 102-112, June 2001.
[15] K. Thompson, G.J. Miller, and R. Wilder, “Wide-Area Internet Traffic Patterns and Characteristics,” IEEE Network, vol. 11, no. 6, pp. 10-23, Nov./Dec. 1997.
[16] D. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973.
[17] R. Nelson, Probability, Stochastic Processes, and Queueing Theory. New York: Springer-Verlag, 1995.
[18] NLANR, “Fixwest Backbone Traces,” http://moat.nlanr.netTraces, 1998.
[19] J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach. Morgan Kaufmann, 1995.
[20] J. Carter and M. Wegman, “Universal Classes of Hash Functions,” J. Computer and System Sciences, vol. 18, no. 2, pp. 143-154, 1979.
[21] Cisco Inc., NetFlow Services and Applications, Aug. 1999, http:/www.cisco.com.
[22] P. Wilson, “Uniprocessor Garbage Collection Techniques,” ACM Computing Surveys, submitted 2001.
[23] A. Broder and A. Karlin, “Multilevel Adaptive Hashing,” Proc. First Symp. Discrete Algorithms, pp. 43-53, 1990.
[24] E. Goto, T. Ida, and T. Gunji, “Parallel Hashing Algorithms,” Information Processing Letters, vol. 6, no. 1, Feb. 1977.
[25] K. Hiraki, K. Nishida, and T. Shimada, “Evaluation of Associative Memory Using Parallel Chained Hashing,” IEEE Trans. Computers, vol. 33, no. 9, pp. 851-855, Sept. 1984.
[26] P. McKenney, “High-Speed Event Counting and Classification Using a Dictionary Hash Technique,” Proc. Int'l Conf. Parallel Processing (ICPP '89), pp. 71-75, 1989.
[27] M. Dietzfelbinger et al., "Dynamic Perfect Hashing: Upper and Lower Bounds," SIAM J. Computing, vol. 23, no. 4, 1994, pp. 738-761.
[28] B.H. Bloom, “Space/Time Trade-Offs in Hash Coding with Allowable Errors,” Comm. ACM, vol. 13, no. 7, pp. 422-426, July 1970.
[29] F. Bodin and A. Seznec, “Skewed Associativity Improves Program Performance and Enhances Predictability,” IEEE Trans. Computers, vol. 46, no. 5, pp. 530-544, May 1997.

Index Terms:
Flow table, performance analysis, router architecture, universal hashing.
Citation:
Jun Xu, Mukesh Singhal, "Cost-Effective Flow Table Designs for High-Speed Routers: Architecture and Performance Evaluation," IEEE Transactions on Computers, vol. 51, no. 9, pp. 1089-1099, Sept. 2002, doi:10.1109/TC.2002.1032627
Usage of this product signifies your acceptance of the Terms of Use.