Earticle

초록

영어

This paper studies the problem of optimal multicast routing with multiple Quality-of- Service (QoS) constrains (OMRMC), which is regarded as a critical component in networks. However, it is not very efficient and effective for the existing algorithms. An undirected and connected graph G with m edges and n nodes is modeled to find a multicast routing tree from source to destination subset D in this paper, and a novel approximation algorithm called APP-OMRMC is proposed for OMRMC. The theoretical validations for the proposed method are presented to show its efficiency. After that, the different networks with different types of service are evaluated. Experimental results show that the proposed method APP-OMRMC is capable of finding the optimal (or minimum-cost) multicast routing tree with the approximation factor (1+ε) and time complexity of O(mτK-1).

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1. Problem Formulation
  2.2. Deterministic Algorithm with Auxiliary Graph
 3. The Proposed APP-OMRMC
  3.1. An Approximation for Optimal Multicast Routing with Multiple Constrains
  3.2. The Analysis of APP-OMRMC
 4. Simulation and Performance Evaluation
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Weijun Yang [ Faculty of Automation, Guangdong University of Technology, China, Guangzhou City Polytechnic, China ]
• Yun Zhang [ Faculty of Automation, Guangdong University of Technology, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Future Generation Communication and Networking

• 간기

  격월간

• pISSN

  2233-7857

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605