Route Reinforcement for Efficient QoS Routing Based on Ant Algorithm | SpringerLink
Skip to main content
Springer Nature Link
Log in

Route Reinforcement for Efficient QoS Routing Based on Ant Algorithm

  • Conference paper
Information Networking. Networking Technologies for Broadband and Mobile Networks (ICOIN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3090))

Included in the following conference series:

Abstract

In this paper, we present a new method to calculate reinforcement value in QoS routing algorithm for real-time multimedia based on Ant algorithm to efficiently and effectively reinforce ant-like mobile agents to find the best route toward destination in a network. Simulation results show that the proposed method realizes QoS routing more efficiently and more adaptively than those of the existing method thereby providing better solutions for the best route selection.

This work was supported by the Brain Korea 21 Project in 2003.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Zhang, S., Liu, Z.: A QoS Routing Algorithm Based on Ant Algorithm. In: 25th Annual IEEE Conference on Local Computer Networks, pp. 574–578 (2000)

    Google Scholar 

  2. Dorigo, M., Di Caro, G.: AntNet: Distributed Stigmergetic Control for Communications Networks. Journal of Artificail Intelligence Research 9, 317–365 (1999)

    Google Scholar 

  3. Quadros, G., Monteiro, E., Boavida, F.: A QoS Metric for Packet Networks. In: Proc. of SPIE International Symposium on Voice, Video, and Data Communications Conference (1998)

    Google Scholar 

  4. Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Trans. on Evolutionary Computation, 53–66 (1997)

    Google Scholar 

  5. Stutzle, T., Dorigo, M.: ACO algorithms for the quadratic assignment problem. New Ideas in Optimization, pp. 33–50. McGraw Hill, New York (1999)

    Google Scholar 

  6. Chu, C., Gu, J., Hou, X., Gu, Q.: A Heuristic Ant Algorithm for Solving QoS Multicast Routing Problem. In: Proceedings of the 2002 Congress on Evolutionary Computatioin, CEC 2002, vol. 2, pp. 12–17 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical and Electronic Engineering, Yonsei University, 132 Shinchon-Dong, Seodaemoon-Gu, 120-749, Seoul, Korea

    Jae Seuk Oh, Sung-il Bae, Jin-ho Ahn & Sungho Kang

Authors
  1. Jae Seuk Oh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sung-il Bae
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jin-ho Ahn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sungho Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electronics Information Engineering, Korea University, Seoul, Korea

    Hyun-Kook Kahng

  2. Waseda University, 3-4-1 Ohkubo, Shinjuku, 169-8555, Tokyo, Japan

    Shigeki Goto

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oh, J.S., Bae, Si., Ahn, Jh., Kang, S. (2004). Route Reinforcement for Efficient QoS Routing Based on Ant Algorithm. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25978-7_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23034-2

  • Online ISBN: 978-3-540-25978-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation