Skip to main content
SpringerLink
Log in

Uncertain multicast under dynamic behaviors

  • Research Article
  • Published:
Frontiers of Computer Science Aims and scope Submit manuscript

Abstract

Multicast transfer can efficiently save the bandwidth consumption and reduce the load on the source node than a series of independent unicast transfers. Nowadays, many applications employ the content replica strategy to improve the robustness and efficiency; hence each file and its replicas are usually distributed among multiple sources. In such scenarios, the traditional deterministic multicast develops into the Uncertain multicast, which has more flexibility in the source selection. In this paper, we focus on building and maintaining a minimal cost forest (MCF) for any uncertain multicast, whose group members (source nodes and destination nodes) may join or leave after constructing a MCF. We formulate this dynamic minimal cost forest (DMCF) problem as a mixed integer programming model. We then design three dedicated methods to approximate the optimal solution. Among them, our a-MCF aims to efficiently construct an MCF for any given uncertain multicast, without dynamic behaviors of multicast group members. The d-MCF method motivates to slightly update the existing MCF via local modifications once appearing a dynamic behavior. It can achieve the balance between the minimal cost and the minimal modifications to the existing forest. The last r-MCF is a supplement method to the d-MCF method, since many rounds of local modifications may make the resultant forest far away from the optimal forest. Accordingly, our r-MCF method monitors the accumulated degradation and triggers the rearrangement process to reconstruct an new MCF when necessary. The comprehensive evaluation results demonstrate that our methods can well tackle the proposed DMCF problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Mahimkar A A, Ge Z, Shaikh A, Wang J, Yates J, Zhang Y. Towards automated performance diagnosis in a large IPTV network. In: Proceedings of ACM SIGCOMM Conference on Data Communication. 2009, 231–242

    Google Scholar 

  2. Li D, Li Y, Wu J, Su S, Yu J. ESM: efficient and scalable data center multicast routing. IEEE/ACM Transactions on Networking, 2012, 20(3): 944–955

    Article  Google Scholar 

  3. Li D, Xu M, Liu Y, Xie X, Cui Y, Wang J. Reliable multicast in data center networks. IEEE Transactions on Computers, 2014, 63(8): 2011–2024

    Article  MathSciNet  Google Scholar 

  4. Robins G, Zelikovsky A. Tighter bounds for graph steiner tree approximation. Siam Journal on Discrete Mathematics, 2005, 19(1): 122–134

    Article  MathSciNet  Google Scholar 

  5. Ghemawat S, Gobioff H, Leung S T. The Google file system. ACM Sigops Operating Systems Review, 2003, 37(5): 29–43

    Article  Google Scholar 

  6. Chun B G, Wu P, Weatherspoon H, Kubiatowicz J. ChunkCast: an anycast service for large content distribution. In: Proceedings of Peer–to–Peer Systems. 2006

    Google Scholar 

  7. Habib M F, Tornatore M, Leenheer M D, Dikbiyik F, Mukherjee B. A disaster–resilient multi–content optical datacenter network architecture. In: Proceedings of the International Conference on Transparent Optical Networks. 2011, 29(1): 1–4

    Google Scholar 

  8. Hu Z, Guo D, Xie J, Ren B. Multicast routing with uncertain sources in software–defined network. In: Proceedings of the International Symposium on Quality of Service. 2016, 1–6

    Google Scholar 

  9. Dalal Y K, Metcalfe R M. Reverse path forwarding of broadcast packets. Communications of the ACM, 1978, 21(12): 1040–1048

    Article  Google Scholar 

  10. Ballardie T, Francis P, Crowcroft J. Core based trees (CBT). ACM Sigcomm Computer Communication Review, 1993, 23(4): 85–95

    Article  Google Scholar 

  11. Wa xman, Bernard M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 2002, 6(9): 1617–1622

    Google Scholar 

  12. Hong S P, Lee H, Park B H. An efficient multicast routing algorithm for delay–sensitive applications with dynamic membership. In: Proceedings of Joint Conference of the IEEE Computer and Communications Societies. 1998, 1433–1440

    Google Scholar 

  13. Feng G, Yum T P. Efficient multicast routing with delay constraints. International Journal of Communication Systems, 2015, 12(3): 181–195

    Article  Google Scholar 

  14. Mohan C, Haderle D, Lindsay B, Pirahesh H, Schwarz P. ARIES: a transaction recovery method supporting fine–granularity locking and partial rollbacks using write–ahead logging. ACM Transactions on Database Systems, 1992, 17(1): 94–162

    Article  Google Scholar 

  15. Raghavan S, Manimaran G, Siva R M C. A rearrangeable algorithm for the construction of delay–constrained dynamic multicast trees. IEEE/ACM Transactions on Networking, 1999, 7(4): 514–529

    Article  Google Scholar 

  16. Doar M, Leslie I. How bad is naive multicast routing? In: Proceedings of Joint Conference of the IEEE Computer and Communications Societies. 1993, 82–89

    Google Scholar 

  17. Bauer F, Varma A. Degree–constrained multicasting in point–to–point networks. In: Proceedings of Joint Conference of the IEEE Computer and Communication Societies. 1995, 369

    Google Scholar 

  18. Bauer F, Varma A. Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking, 1996, 4(2): 181–191

    Article  Google Scholar 

  19. Kompella V P, Pasquale J C, Polyzos G C. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking, 1993, 1(3): 286–292

    Article  Google Scholar 

Download references

Acknowledgements

This work is partially supported by the National Natural Science Foundation for Outstanding Excellent young scholars of China (61422214), the National Natural Science Foundation of China (Grant No. 61772544), National Basic Research Program (973 program) (2014CB347800), the Hunan Provincial Natural Science Fund for Distinguished Young Scholars (2016JJ1002), and the Guangxi Cooperative Innovation Center of cloud computing and Big Data (YD16507 and YD17X11).

Author information

Authors and Affiliations

  1. Science and Technology on Information System Engineering Laboratory, National University of Defense Technology, Changsha, 410073, China

    Yudong Qin, Deke Guo, Zhiyao Hu & Bangbang Ren

Authors
  1. Yudong Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deke Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zhiyao Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bangbang Ren
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deke Guo.

Additional information

Yudong Qin received the BS degree in management science and engineering from National University of Defense Technology, China in 2016. He is currently working towards the MS degree in College of Systems Engineering, National University of Defense Technology, China. His research interests include data centers and software-defined networks.

Deke Guo received the BS degree in industry engineering from the Beihang University, China in 2001, and the PhD degree in management science and engineering from the National University of Defense Technology, China in 2008. He is currently a professor with the College of Systems Engineering, National University of Defense Technology, China. His research interests include distributed systems, software-defined networking, data center networking, wireless and mobile systems, and interconnection networks. He is a member of the ACM.

Zhiyao Hu received the MS degree in management science and engineering from National University of Defense Technology, China in 2017. He is currently working toward the PhD degree in College of Computer, National University of Defense Technology, China. His research interests include distributed computing, data center networking and machine learning.

Bangbang Ren received the BS degree in management science and engineering from National University of Defense Technology, China in 2015. He is currently working toward the MS degree in College of Information System and Management, National University of Defense Technology, China. His research interests include software-defined networking, data center networking.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qin, Y., Guo, D., Hu, Z. et al. Uncertain multicast under dynamic behaviors. Front. Comput. Sci. 14, 130–145 (2020). https://doi.org/10.1007/s11704-018-7429-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-018-7429-x

Keywords

Search

Navigation