Scalable multicasting with multiple shared trees in software defined networking

详细信息    查看全文

• 作者：Ying-Dar Lin^a ; Yuan-Cheng Lai^b ; Hung-Yi Teng^a ; ^{marstwng@gmail.com} ; Chun-Chieh Liao^a ; Yi-Chih Kao^c
• 关键词：Software defined networking ; Multiple shared trees ; Locality-aware ; Multicast clustering ; Rendezvous point
• 刊名：Journal of Network and Computer Applications
• 出版年：2017
• 出版时间：15 January 2017
• 年：2017
• 卷：78
• 期：Complete
• 页码：125-133
• 全文大小：1469 K
• 卷排序：78

文摘

With Software Defined Networking (SDN), IP multicast becomes promising again. For IPTV applications over SDN, existing works would not scale well since they are based on per-source trees. As control-plane in SDN is logically centralized, constructing multiple shared trees is more feasible than that in traditional IP networks. Thus, in this work, we present a locality-aware multicast approach (LAMA) to construct multi-group shared trees in SDN, where each shared tree covers multiple multicast groups. In LAMA, the controller first clusters the multicast sources located in the vicinity into the same multicast cluster. For each multicast cluster, the controller selects the center switch which has the minimum distance to all multicast sources as its rendezvous point (RP) and then constructs a shortest-path multicast tree from the RP to its hosts. Finally, based on the multi-group shared trees, the controller can establish coarse-grained flow entries into on-tree switches to reduce the number of installed flow entries. Emulations on the Ryu controller and the Mininet emulator show that only 2–5 shared trees would suffice. The computation time in the controller using LAMA is around 70 ms, much less than hundreds ms required for per-source trees. Moreover, LAMA only establishes 2300 flow entries, 4% of that with per-source trees in a large topology.