Peng Yu
Hao Zhong
ABSTRACT
Multicast denotes an idea of sending data to numbers of receivers from one source in one transmission. It has been widely applied in group communication (e.g., media streaming, multi-point video conferencing). Multicast routing tree (MRT) is usually built to keep the right paths to transmit data, where data copies are created in parent nodes and then forwarded to child nodes. However, constructing an MRT is usually difficult for a given network topology; finding an optimal multicast routing tree with the minimal cost is a proven NP-complete problem. Moreover, multicast applications usually run in local or small networks due to the limitations in flexibility, scalability, and security.
In this paper, we solve a sequenced packet transmission problem of building MRT in Software-Defined Networking (SDN). In sequenced packet transmission, nodes only send the next packet when the previous packet is received by the node on the other side of link. We found this scenario in a popular open source network simulator ns-3 when looking into the runtime behavior of OpenFlow switches simulated by ns-3. We also found this problem is not limited to the ns-3 scenario.
We prove that a routing path with less path cost does not correspond to less time cost when it is used to transmit multiple packets sequentially. We extend Dijkstra's shortest path algorithm with our new cost models. We construct the MRT as a sequenced packet shortest-path tree (SPSPT). Simulation results show that our SPSPT can save at least 10% of the multicast time for sequenced packet transmission.
- S. Agarwal, M. Kodialam, and T. Lakshman. Traffic engineering in software defined networks. In INFOCOM, 2013 Proceedings IEEE, pages 2211--2219. IEEE, 2013.Google Scholar
Cross Ref
- T. Ballardie, P. Francis, and J. Crowcroft. Core based trees (CBT). In Proceedings of the ACM SIGCOMM '93 Conference on Communications Architectures, Protocols and Applications, San Francisco, CA, USA, September 13-17, 1993, pages 85--95, 1993. Google ScholarDigital Library
- R. S. Cahn. Wide area network design: concepts and tools for optimization. Morgan Kaufmann, 1998. Google ScholarDigital Library
- T. H. Cormen. Introduction to algorithms. MIT press, 2009. Google ScholarDigital Library
- S. Deering, D. L. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei. The PIM architecture for wide-area multicast routing. IEEE/ACM Transactions on Networking (ToN), 4(2):153--162, 1996. Google ScholarDigital Library
- S. E. Deering and D. R. Cheriton. Multicast routing in datagram internetworks and extended lans. ACM Transactions on Computer Systems (TOCS), 8(2):85--110, 1990. Google ScholarDigital Library
- E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269--271, 1959. Google ScholarDigital Library
- L. R. Ford Jr and D. R. Fulkerson. Flows in networks. Princeton university press, 2015. Google ScholarDigital Library
- M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics, 32(4):826--834, 1977.Google ScholarDigital Library
- A. Hac. Distributed multicasting algorithm in a wide area network. In Proceedings of the 1990 ACM annual conference on Cooperation, pages 37--42. ACM, 1990. Google ScholarDigital Library
- L.-H. Huang, H.-J. Hung, C.-C. Lin, and D.-N. Yang. Scalable and bandwidth-efficient multicast for software-defined networks. In 2014 IEEE Global Communications Conference, pages 1890--1896. IEEE, 2014.Google ScholarCross Ref
- T.-L. Huang and D. Lee. A distributed multicast routing algorithm for real-time applications in wide area networks. Journal of Parallel and Distributed Computing, 67(5):516--530, 2007. Google ScholarDigital Library
- F. K. Hwang, D. S. Richards, and P. Winter. The Steiner tree problem, volume 53. Elsevier, 1992.Google Scholar
- A. Iyer, P. Kumar, and V. Mann. Avalanche: Data center multicast using software defined networking. In 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS), pages 1--8. IEEE, 2014.Google ScholarCross Ref
- X. Jia. A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking (TON), 6(6):828--837, 1998. Google ScholarDigital Library
- L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta informatica, 15(2):141--145, 1981. Google ScholarDigital Library
- J. B. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society, 7(1):48--50, 1956.Google ScholarCross Ref
- R. Malli, X. Zhang, and C. Qiao. Benefits of multicasting in all-optical networks. In Photonics East (ISAM, VVDC, IEMB), pages 209--220. International Society for Optics and Photonics, 1998.Google Scholar
- N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. Openflow: enabling innovation in campus networks. ACM SIGCOMM Computer Communication Review, 38(2):69--74, 2008. Google ScholarDigital Library
- A. Medina, A. Lakhina, I. Matta, and J. W. Byers. BRITE: an approach to universal topology generation. In 9th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS 2001), 15-18 August 2001, Cincinnati, OH, USA, page 346, 2001. Google ScholarDigital Library
- J. Moy. Multicast extensions to ospf. 1994.Google Scholar
- ns-3 OpenFlow switch support. https://www.nsnam.org/docs/release/3.25/models/html/openflow-switch.html.Google Scholar
- ns-3. https://www.nsnam.org/wiki/Main_Page.Google Scholar
- Open Networking Foundation. OpenFlow Switch Specification V1.4.0, 2013.Google Scholar
- R. C. Prim. Shortest connection networks and some generalizations. Bell system technical journal, 36(6):1389--1401, 1957.Google Scholar
- Software-defined networking (SDN) definition. https://www.opennetworking.org/sdn-resources/sdn-definition.Google Scholar
- D. Waitzman, C. Partridge, and S. E. Deering. Distance vector multicast routing protocol. Technical report, 1988. Google ScholarDigital Library
Index Terms
- Multicast routing tree for sequenced packet transmission in software-defined networks
Recommendations
Efficient multicast tree algorithm in ATM networks
Many applications of ATM networks require the multicast function, which sends the same packet to a group of destinations. This paper proposes an algorithm for multicast routing in ATM networks. We define the network cost of a routing as the combination ...
Tagging based Packet Loss Detection and Recovery of IP Multicast in SDN
AINTEC '19: Proceedings of the 15th Asian Internet Engineering ConferenceMulticast is a one-to-many communication model that is important for video streaming like IPTV. However, multicast does not guarantee the reliability of data transfer, and packet loss beyond the performance of error correction mechanism introduce ...
Contention resolution considering multicast traffic in optically burst-switched WDM networks
This paper proposes a contention resolution scheme considering multicast traffic in optical burst switching (OBS) networks. In OBS networks, for unicast bursts, contention can be avoided by deflection routing. However, deflection routing cannot be ...
Comments