Scalable Steiner Tree for Multicast Communications in Software-Defined Networking

@article{Huang2014ScalableST,
  title={Scalable Steiner Tree for Multicast Communications in Software-Defined Networking},
  author={Liang-Hao Huang and Hui-Ju Hung and Chih-Chung Lin and De-Nian Yang},
  journal={CoRR},
  year={2014},
  volume={abs/1404.3454}
}
Software-Defined Networking (SDN) enables flexible network resource allocations for traffic engineering,but at the same time the scalability problem becomes more serious since traffic is more difficult to be aggregated. Those crucia l issues in SDN have been studied for unicast but have not been explored for multicast traffic, and addressing those is sues for multicast is more challenging since the identities and t he number of members in a multicast group can be arbitrary. In this paper… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Approximation and Online Algorithms for NFV-Enabled Multicasting in SDNs

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) • 2017
View 14 Excerpts
Highly Influenced

Dynamic routing for network throughput maximization in software-defined networks

IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications • 2016
View 6 Excerpts
Highly Influenced

Towards Efficient Multicast Communication in Software-Defined Networks

2016 IEEE 36th International Conference on Distributed Computing Systems Workshops (ICDCSW) • 2016
View 1 Excerpt

Update consistency in software-defined networking based multicast networks

2015 IEEE Conference on Network Function Virtualization and Software Defined Network (NFV-SDN) • 2015
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Note on hamilton circuits

O. Ore
American Mathematical Monthly , vol. 67, no. 1, p. 55, 1960. • 1960
View 6 Excerpts
Highly Influenced

Traffic engineering in software defined networks

2013 Proceedings IEEE INFOCOM • 2013
View 5 Excerpts
Highly Influenced

An approximate solution f r the Steiner problem in graphs

H. Takahashi, A. Matsuyama
Mathematica Japonicae , vol. 24, pp. 571– 577, 1980. • 1980
View 3 Excerpts
Highly Influenced

Sca lable Steiner tree for multicast communications in software-defi ned networking

L.-H. Huang, H.-J. Hung, C.-C. Lin, D.-N. Yang
CoRR, vol. abs/1404.3219, 2014. • 2014
View 1 Excerpt

An efficient flow cache algorithm with improved fairness in Software-Defined Data Center Networks

2013 IEEE 2nd International Conference on Cloud Networking (CloudNet) • 2013
View 1 Excerpt

Similar Papers

Loading similar papers…