Telecommunication Systems

, Volume 50, Issue 1, pp 55–70 | Cite as

Distributed multicast multichannel paths

Article

Abstract

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.

Keywords

Mathematical modelling Multicast multichannel path Nodes and links used distributing Packets duplication distributing Quality of Services (QoS) 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Baltatu, M., Lioy, A., Maino, F., & Mazzocchi, D. (2000). Security issues in control, management and routing protocols. Computer Networks, 34(6), 881–894. CrossRefGoogle Scholar
  3. 3.
    Chen, S., & Shavitt, Y. (2008). Somr: a scalable distributed qos multicast routing protocol. Journal of Parallel and Distributed Computing, 68(2), 137–149. CrossRefGoogle Scholar
  4. 4.
    Ford, L. R., & Fulkerson, D. R. (1958). Constructing maximal dynamic flows from static flows. Operation Research, 6, 419–433. CrossRefGoogle Scholar
  5. 5.
    Ford, L. R., & Fulkerson, D. R. (1958). A suggested computation for maximal multi-commodity network flows. Management Science, 5(1), 97–101. CrossRefGoogle Scholar
  6. 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
  7. 7.
    Isazadeh, A., & Heydarian, M. (2008). Optimal multicast multichannel routing in computer networks. Computer Communications, 31(17), 4149–4161. CrossRefGoogle Scholar
  8. 8.
    Isazadeh, A., & Heydarian, M. (2010). Traffic distribution for end-to-end qos routing with multicast multichannel services. The Journal of Supercomputing, 52(1), 47–81. CrossRefGoogle Scholar
  9. 9.
    Kim, J., & Bahk, S. (2009). Design of certification authority using secret redistribution and multicast routing in wireless mesh networks. Computer Networks, 53(1), 98–109. CrossRefGoogle Scholar
  10. 10.
    Medhi, D., & Huang, D. (2008). Secure and resilient routing: building blocks for resilient network architectures. Information Assurance, 2(3), 417–448. CrossRefGoogle Scholar
  11. 11.
    Oliveira, C. A. S., & Pardalos, P. M. (2005). A survey of combinatorial optimization problems in multicast routing. Computers & Operations Research, 32(8), 1953–1981. CrossRefGoogle Scholar
  12. 12.
    Quintero, A., Pierre, S., & MacabTo, B. (2004). A routing protocol based on node density for ad hoc networks. Ad Hoc Networks, 2(3), 335–349. CrossRefGoogle Scholar
  13. 13.
    Simha, R., & Narahari, B. (1992). Single path routing with delay considerations. Computer Networks and ISDN Systems, 24(5), 405–419. CrossRefGoogle Scholar
  14. 14.
    Stallings, W. (1997). Data and computer communications. New York: Prentice-Hall. Google Scholar
  15. 15.
    Wen, U. P., Wang, W. C., & Yang, C. B. (2007). Traffic engineering and congestion control for open shortest path. Omega, 35(1), 671–682. CrossRefGoogle Scholar
  16. 16.
    Xue, G. L. (2003). Optimal multichannel data transmission in computer networks. Computer Communications, 26, 759–765. CrossRefGoogle Scholar
  17. 17.
    Xue, G. L., Sun, S. Z., & Rosen, J. B. (1998). Fast data transmission and maximal dynamic flow. Information Proceeding Letters, 66(3), 127–132. CrossRefGoogle Scholar
  18. 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

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Department of Computer ScienceTabriz UniversityTabrizIran

Personalised recommendations