Distributed multicast multichannel paths
Supporting multimedia applications in QoS-aware multicast deployment has become an important research dimension in recent years. Future communication networks will face an increase in traffic driven by multimedia applications with stringent requirements in the following important functions: (1) nodes and links used distributing, (2) packets duplication distributing, (3) QoS supporting, (4) multichannel routing. For improving these four functions, in this paper we propose a new polynomial time algorithm, named Nodes Links Distributed-Multicast Multichannel Routing (NLD-MMR), based on the Constraint-Based Routing (CBR) and Linear Programming (LP). The new algorithm by constructing Distributed Multicast Multichannel Paths (DMMCP) can distribute or compact both paths and traffic. Our simulation study shows that the proposed algorithm, as compared to other available algorithms, performs well and constructs a new generation of optimal paths with the best cost and efficiency.
KeywordsMathematical modelling Multicast multichannel path Nodes and links used distributing Packets duplication distributing Quality of Services (QoS)
Unable to display preview. Download preview PDF.
- 1.Agar, D., Grgi, K., & Rimac-Drlje, S. (2007). Security aspects in ipv6 networksimplementation and testing. Computers and Electrical Engineering, 33(5–6), 425–437. Google Scholar
- 6.Hac, A., & Wang, D. (1996). Congestion control with a multicast routing algorithm. In Proceedings of COM’96. First annual conference on emerging technologies and applications in communications (Vol. 1(1), pp. 70–73). Google Scholar
- 14.Stallings, W. (1997). Data and computer communications. New York: Prentice-Hall. Google Scholar
- 18.Yu, Y., Guo, L., Wang, X., & Liu, C. (2009, in press). Routing security scheme based on reputation evaluation in hierarchical ad hoc networks. Computer Networks, available online. Google Scholar