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

Abstract

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.