Skip to main content

Optimal Multicast Multichannel Routing in Computer Networks

  • Conference paper
  • 909 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4743))

Abstract

This paper presents a new method for optimal routing and transmitting data in networks with multicast services environment. End to end delay is minimized by the new approach across channels. We entitle this method as Optimal Multicasting Multichannel Routing Algorithm (OMMRA). The new method transfers data from a sender node to the group of receivers using multichannel paths in minimal time. The new method is extention of an available unicast method. Computer examples will show that the new method is more efficient than unicast method.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wang, Z.: Internet QoS: Architectures and Mechanisms for Quality of Service. In: Networking, Morgan Kaufmann, BellLabs, Lucent Technology, San Francisco (2001)

    Google Scholar 

  2. Matrawy, A.: A rate adaption algorithm for multicast sources in priority-based ip networks. IEEE Communication Letters 7 (2003)

    Google Scholar 

  3. Elwalid, A., Jin, C.: Mate: multipath adaptive traffic engineering. Computer Networks 40, 695–709 (2002)

    Article  Google Scholar 

  4. Wang, C.F., Liang, C.T., Jan, R.H.: Heuristic algorithms for packing of multiple-group multicasting. Computers & Operations Research 29, 905–924 (2002)

    Article  MATH  Google Scholar 

  5. Wang, C.F., Lai, B.R., Jan, R.H.: Optimum multicast of multimedia streams. Computers & Operations Research 26, 461–480 (1999)

    Article  MATH  Google Scholar 

  6. Oliveira, C.A.S., Pardalos, P.M.: A survey of combinatorial optimization problems in multicast routing. Computers & Operations Research 32, 1953–1981 (2005)

    Article  MATH  Google Scholar 

  7. Wang, B., Hou, J.C.: An efficient qos routing algorithm for quorumcast communication. Computer Networks 44, 43–61 (2004)

    Article  Google Scholar 

  8. Lim, T.K., Praeger, C.E.: Finding optimal routings in hamming graphs. European Journal of Combinatorics 23, 1033–1041 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. Zhu, X., Setton, E., Girod, B.: Congestion-distortion optimized video transmission over ad hoc networks. Signal Processing: Image Communication 20, 773–783 (2005)

    Article  Google Scholar 

  10. Matrawy, A., Lambadaris, I., Huang, C.: Mpeg4 traffic modeling using the transform expand sample methodology. In: proc. 4th IEEE Int. Workshop on Networked Applications, pp. 249–256. IEEE Computer Society Press, Los Alamitos (2002), amatrawy@sce.carleton.ca

    Chapter  Google Scholar 

  11. van Lunteren, J., Engbersen, T.: Fast and scalable packet classification. IEEE Communication 21, 560–570 (2003)

    Google Scholar 

  12. Khan, S., Watson, R., Shoja, G.C.: Optimal quality of service routing and admission control using the utility model. Future Generation Computer Systems 19, 1063–1073 (2003)

    Article  Google Scholar 

  13. Cova, T.J., Johnson, J.P.: A network flow model for lane-based evacuation routing. Transportation Research Part A: Policy and Practice 37, 579–604 (2003)

    Article  Google Scholar 

  14. Xue, G.L., Sun, S.Z., Rosen, J.B.: Fast data transmission and maximal dynamic flow. Information Proceeding Letters, 127–132 (1998)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  17. Parsa, M., Zhu, Q.: An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE ACM Transactions on Networking, 127–132 (1998)

    Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Parimala Thulasiraman Xubin He Tony Li Xu Mieso K. Denko Ruppa K. Thulasiram Laurence T. Yang

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heydarian, M., Isazadeh, A., Isazadeh, H. (2007). Optimal Multicast Multichannel Routing in Computer Networks. In: Thulasiraman, P., He, X., Xu, T.L., Denko, M.K., Thulasiram, R.K., Yang, L.T. (eds) Frontiers of High Performance Computing and Networking ISPA 2007 Workshops. ISPA 2007. Lecture Notes in Computer Science, vol 4743. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74767-3_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74767-3_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74766-6

  • Online ISBN: 978-3-540-74767-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics