Software Defined Mobile Multicast

Mobile multicast has been deployed in telecommunication networks for information dissemination applications such as IPTV and video conferencing. Recent studies of mobile multicast focused on fast handover protocols, and algorithms for multicast tree management have witnessed little improvement over the years. Shortest path trees represent the status quo of multicast topology in real-world systems. Steiner trees were investigated extensively in the theory community and are known to be bandwidth efficient, but come with an associated complexity. Recent developments in the Software Defined Networking (SDN) paradigm have shed light on implementing more sophisticated protocols for better routing performance. We propose an SDN-based design to combat the complexity vs. Performance dilemma in mobile multicast. We construct low-cost Steiner trees for multicastin a mobile network, employing an SDN controller for coordinating tree construction and morphing. Highlights of our design include a set of efficient online algorithms for tree adjustment when nodes arrive and depart on the fly, and an SDN rule update framework based on constraints expressed by boolean logic to ensure loop free rule updates. The algorithms are proven to achieve a constant competitive ratio against the offline optimal Steiner tree, with an amortized constant number of edge swaps per adjustment. Mininet-based implementation and evaluation further validate the efficacy of our design.

[1]  Pawel Winter,et al.  Steiner problem in networks: A survey , 1987, Networks.

[2]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

[4]  Vijay Mann,et al.  Avalanche: Data center Multicast using software defined networking , 2014, 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS).

[5]  Chak-Kuen Wong,et al.  A faster approximation algorithm for the Steiner problem in graphs , 1986, Acta Informatica.

[6]  Martin Skutella,et al.  The Power of Recourse for Online MST and TSP , 2012, SIAM J. Comput..

[7]  Xiaozhou Li,et al.  Scaling IP multicast on datacenter topologies , 2013, CoNEXT.

[8]  Kurt Mehlhorn,et al.  A Faster Approximation Algorithm for the Steiner Problem in Graphs , 1988, Inf. Process. Lett..

[9]  Alex Zelikovsky,et al.  Tighter Bounds for Graph Steiner Tree Approximation , 2005, SIAM J. Discret. Math..

[10]  Makoto Imase,et al.  Dynamic Steiner Tree Problem , 1991, SIAM J. Discret. Math..

[11]  Amit Kumar,et al.  The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online , 2016, SIAM J. Comput..

[12]  David Thaler,et al.  Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification , 1997, RFC.

[13]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[14]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[15]  Amit Kumar,et al.  The power of deferral: maintaining a constant-competitive steiner tree online , 2013, STOC '13.

[16]  Amit Kumar,et al.  Online Steiner Tree with Deletions , 2013, SODA.

[17]  Fabrizio Grandoni,et al.  An improved LP-based approximation for steiner tree , 2010, STOC '10.

[18]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[19]  Carey L. Williamson,et al.  Mobile multicast (MoM) protocol: multicast support for mobile hosts , 1997, MobiCom '97.

[20]  César A. C. Teixeira,et al.  CastFlow: Clean-slate multicast approach using in-advance path processing in programmable networks , 2012, 2012 IEEE Symposium on Computers and Communications (ISCC).

[21]  Marek Karpinski,et al.  New Approximation Algorithms for the Steiner Tree Problems , 1997, J. Comb. Optim..