research-article

Multicast routing tree for sequenced packet transmission in software-defined networks

Authors:

Hao ZhongAuthors Info & Claims

Internetware '16: Proceedings of the 8th Asia-Pacific Symposium on Internetware

Pages 27 - 35

https://doi.org/10.1145/2993717.2993721

Published: 18 September 2016 Publication History

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.

References

[1]

S. Agarwal, M. Kodialam, and T. Lakshman. Traffic engineering in software defined networks. In INFOCOM, 2013 Proceedings IEEE, pages 2211--2219. IEEE, 2013.

[2]

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.

Digital Library

[3]

R. S. Cahn. Wide area network design: concepts and tools for optimization. Morgan Kaufmann, 1998.

Digital Library

[4]

T. H. Cormen. Introduction to algorithms. MIT press, 2009.

Digital Library

[5]

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.

Digital Library

[6]

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.

Digital Library

[7]

E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische mathematik, 1(1):269--271, 1959.

Digital Library

[8]

L. R. Ford Jr and D. R. Fulkerson. Flows in networks. Princeton university press, 2015.

Digital Library

[9]

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.

Digital Library

[10]

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.

Digital Library

[11]

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.

[12]

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.

Digital Library

[13]

F. K. Hwang, D. S. Richards, and P. Winter. The Steiner tree problem, volume 53. Elsevier, 1992.

[14]

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.

[15]

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.

Digital Library

[16]

L. Kou, G. Markowsky, and L. Berman. A fast algorithm for Steiner trees. Acta informatica, 15(2):141--145, 1981.

Digital Library

[17]

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.

[18]

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.

[19]

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.

Digital Library

[20]

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.

Digital Library

[21]

J. Moy. Multicast extensions to ospf. 1994.

[22]

ns-3 OpenFlow switch support. https://www.nsnam.org/docs/release/3.25/models/html/openflow-switch.html.

[23]

ns-3. https://www.nsnam.org/wiki/Main_Page.

[24]

Open Networking Foundation. OpenFlow Switch Specification V1.4.0, 2013.

[25]

R. C. Prim. Shortest connection networks and some generalizations. Bell system technical journal, 36(6):1389--1401, 1957.

[26]

Software-defined networking (SDN) definition. https://www.opennetworking.org/sdn-resources/sdn-definition.

[27]

D. Waitzman, C. Partridge, and S. E. Deering. Distance vector multicast routing protocol. Technical report, 1988.

Digital Library

Cited By

Tan YVeeraraghavan MLee HEmmerson SDavidson J(2022)High-performance reliable network-multicast over a trial deploymentCluster Computing10.1007/s10586-021-03519-625:4(2931-2952)Online publication date: 4-Feb-2022
https://doi.org/10.1007/s10586-021-03519-6
Tan YVeeraraghavan MLee HEmmerson SDavidson J(2020)A Trial Deployment of a Reliable Network-Multicast Application across Internet22020 IEEE/ACM Innovating the Network for Data-Intensive Science (INDIS)10.1109/INDIS51933.2020.00008(22-32)Online publication date: Nov-2020
https://doi.org/10.1109/INDIS51933.2020.00008

Index Terms

Multicast routing tree for sequenced packet transmission in software-defined networks
1. 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 Conference

Multicast 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

Information & Contributors

Information

Published In

cover image ACM Other conferences

Internetware '16: Proceedings of the 8th Asia-Pacific Symposium on Internetware

September 2016

118 pages

ISBN:9781450348294

DOI:10.1145/2993717

Conference Chairs:
Hong Mei,
Jian Lv,
Zhi Jin,
Xuandong Li

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 September 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

973 Program in China
National Nature Science Foundation of China
863 Program in China

Conference

Internetware '16

Internetware '16: The Eighth Asia-Pacific Symposium on Internetware

September 18, 2016

Beijing, China

Acceptance Rates

Overall Acceptance Rate 55 of 111 submissions, 50%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
154
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tan YVeeraraghavan MLee HEmmerson SDavidson J(2022)High-performance reliable network-multicast over a trial deploymentCluster Computing10.1007/s10586-021-03519-625:4(2931-2952)Online publication date: 4-Feb-2022
https://doi.org/10.1007/s10586-021-03519-6
Tan YVeeraraghavan MLee HEmmerson SDavidson J(2020)A Trial Deployment of a Reliable Network-Multicast Application across Internet22020 IEEE/ACM Innovating the Network for Data-Intensive Science (INDIS)10.1109/INDIS51933.2020.00008(22-32)Online publication date: Nov-2020
https://doi.org/10.1109/INDIS51933.2020.00008

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents