Skip to main content
SpringerLink
Log in

Distributed multicast multichannel paths

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

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.

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. 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. Baltatu, M., Lioy, A., Maino, F., & Mazzocchi, D. (2000). Security issues in control, management and routing protocols. Computer Networks, 34(6), 881–894.

    Article  Google Scholar 

  3. Chen, S., & Shavitt, Y. (2008). Somr: a scalable distributed qos multicast routing protocol. Journal of Parallel and Distributed Computing, 68(2), 137–149.

    Article  Google Scholar 

  4. Ford, L. R., & Fulkerson, D. R. (1958). Constructing maximal dynamic flows from static flows. Operation Research, 6, 419–433.

    Article  Google Scholar 

  5. Ford, L. R., & Fulkerson, D. R. (1958). A suggested computation for maximal multi-commodity network flows. Management Science, 5(1), 97–101.

    Article  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).

  7. Isazadeh, A., & Heydarian, M. (2008). Optimal multicast multichannel routing in computer networks. Computer Communications, 31(17), 4149–4161.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  10. Medhi, D., & Huang, D. (2008). Secure and resilient routing: building blocks for resilient network architectures. Information Assurance, 2(3), 417–448.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  13. Simha, R., & Narahari, B. (1992). Single path routing with delay considerations. Computer Networks and ISDN Systems, 24(5), 405–419.

    Article  Google Scholar 

  14. Stallings, W. (1997). Data and computer communications. New York: Prentice-Hall.

    Google Scholar 

  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.

    Article  Google Scholar 

  16. Xue, G. L. (2003). Optimal multichannel data transmission in computer networks. Computer Communications, 26, 759–765.

    Article  Google Scholar 

  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.

    Article  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.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tabriz University, Tabriz, Iran

    Ayaz Isazadeh & Mohsen Heydarian

Authors
  1. Ayaz Isazadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohsen Heydarian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ayaz Isazadeh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Isazadeh, A., Heydarian, M. Distributed multicast multichannel paths. Telecommun Syst 50, 55–70 (2012). https://doi.org/10.1007/s11235-010-9385-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-010-9385-0

Keywords

Search

Navigation