A Unified Unicast and Multicast Routing and Forwarding Algorithm for Software-Defined Datacenter Networks

In this article, we consider a scalability problem associated with software-defined datacenter, of which the unicast/multicast routing states is proven to be NP-complete. We introduce an efficient multiple membership query algorithm, called Scalar-pair Vectors Routing and Forwarding (SVRF), based on the prime theory such as Chinese Remainder Theorem (CRT). Our proposed algorithm simply calculates corresponding output ports of each multicast group by dividing a common scalar-pair with a group-specific key, within pseudo-polynomial time. The result is then used to make a forwarding decision within few cycles through a hardware accelerator. Compared to Bloom filter, our algorithm can achieve remarkable performance in terms of memory consumption, processing time, hardware cost, and 100% delivery accuracy, while applying for a large number of large-scale distinct flows (including unicast and multicast) in a large-scale datacenter networks. Our work may be applied to various research areas of computer science and networking.

[1]  George Varghese,et al.  Beyond bloom filters: from approximate membership checks to approximate state machines , 2006, SIGCOMM.

[2]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[3]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[4]  Jie Wu,et al.  The Dynamic Bloom Filters , 2010, IEEE Transactions on Knowledge and Data Engineering.

[5]  Kang G. Shin,et al.  Stochastic fair blue: a queue management algorithm for enforcing fairness , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM.

[7]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[8]  Dan Li,et al.  ESM: Efficient and Scalable Data Center Multicast Routing , 2012, IEEE/ACM Transactions on Networking.

[9]  George Varghese,et al.  Scalable packet classification , 2001, SIGCOMM '01.

[10]  Ross W. Callon,et al.  A Framework for Layer 3 Provider-Provisioned Virtual Private Networks (PPVPNs) , 2005, RFC.

[11]  Yoav Tock,et al.  Dr. multicast: Rx for data center communication scalability , 2010, EuroSys '10.

[12]  A. Salomaa,et al.  Chinese remainder theorem: applications in computing, coding, cryptography , 1996 .

[13]  Hong Jiang,et al.  Supporting Scalable and Adaptive Metadata Management in Ultralarge-Scale File Systems , 2011, IEEE Transactions on Parallel and Distributed Systems.

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[15]  Brad Cain,et al.  Using Internet Group Management Protocol Version 3 (IGMPv3) and Multicast Listener Discovery Protocol Version 2 (MLDv2) for Source-Specific Multicast , 2006, RFC.

[16]  Anatolij A. Karatsuba,et al.  Multiplication of Multidigit Numbers on Automata , 1963 .

[17]  Fang Hao,et al.  Fast Multiset Membership Testing Using Combinatorial Bloom Filters , 2009, IEEE INFOCOM 2009.

[18]  Fang Hao,et al.  IPv6 Lookups using Distributed and Load Balanced Bloom Filters for 100Gbps Core Router Line Cards , 2009, IEEE INFOCOM 2009.

[19]  Paul Francis,et al.  Fast routing table lookup using CAMs , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[20]  Sarang Dharmapurikar,et al.  Longest prefix matching using bloom filters , 2006, IEEE/ACM Transactions on Networking.

[21]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[22]  Andrea Bianco,et al.  NXG07-3: Multicast Support for a Storage Area Network Switch , 2006, IEEE Globecom 2006.

[23]  Fang Hao,et al.  Incremental Bloom Filters , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[24]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.

[25]  Yu Hua,et al.  Using Parallel Bloom Filters for Multiattribute Representation on Network Services , 2010, IEEE Transactions on Parallel and Distributed Systems.

[26]  Abderrahim Benslimane.  Multimedia Multicast on the Internet , 2006 .

[27]  Victor Shoup,et al.  A computational introduction to number theory and algebra , 2005 .

[28]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.

[29]  Paramvir Bahl,et al.  Flyways To De-Congest Data Center Networks , 2009, HotNets.

[30]  Bernard Chazelle,et al.  The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.

[31]  Supratik Bhattacharyya,et al.  An Overview of Source-Specific Multicast (SSM) , 2003, RFC.

[32]  Michael Mitzenmacher,et al.  Distance-Sensitive Bloom Filters , 2006, ALENEX.

[33]  Yossi Matias,et al.  Spectral bloom filters , 2003, SIGMOD '03.

[34]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[35]  David Thaler,et al.  On the aggregatability of multicast forwarding state , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[36]  Albert G. Greenberg,et al.  VL2: a scalable and flexible data center network , 2009, SIGCOMM '09.

[37]  Mi Lu.  Arithmetic and Logic in Computer Systems: Lu/Arithmetic and Logic in Computer Systems , 2005 .

[38]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM '93.

[39]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[40]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[41]  Jie Wu,et al.  Theory and Network Applications of Dynamic Bloom Filters , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[42]  Isaac Keslassy,et al.  The Variable-Increment Counting Bloom Filter , 2012, IEEE/ACM Transactions on Networking.

[43]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[44]  Mi Lu.  Arithmetic and logic in computer systems , 2004 .

[45]  Björn Grönvall.  Scalable multicast forwarding , 2002, CCRV.

[46]  A. Kumar,et al.  Space-code bloom filter for efficient per-flow traffic measurement , 2004, IEEE INFOCOM 2004.

[47]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[48]  Raouf Boutaba,et al.  Network virtualization: state of the art and research challenges , 2009, IEEE Communications Magazine.

[49]  Hisatada Miyatake,et al.  A design for high-speed low-power CMOS fully parallel content-addressable memory macros , 2001 .

[50]  Otto Carlos Muniz Bandeira Duarte,et al.  A Generalized Bloom Filter to Secure Distributed Network Applications , 2011, Comput. Networks.

[51]  C. G. Sodini,et al.  A ternary content addressable search engine , 1989 .

[52]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[53]  Michael Mitzenmacher,et al.  Compressed bloom filters , 2001, PODC '01.

[54]  Srinivasan Keshav,et al.  Issues and trends in router design , 1998, IEEE Commun. Mag..