Skip to main content

Agent-Based Distance Vector Routing

  • Conference paper
  • First Online:
Mobile Agents for Telecommunication Applications (MATA 2001)

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

Abstract

Mobile Agents are being proposed for an increasing variety of applications. Distance Vector Routing (DVR) is an example of one application that can benefit from an agent-based approach. DVR algorithms, such as RIP, have been shown to cause considerable network resource overhead due to the large number of messages generated at each host/router throughout the route update process. Many of these messages are wasteful since they do not contribute to the route discovery process. However, in an agent-based solution, the number of messages is bounded by the number of agents in the system. In this paper, we present an agent-based solution to DVR. In addition, we will describe agent migration strategies that improve the performance of the route discovery process, namely Random Walk and Structured Walk.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. S. Malkin and M. E. Steenstrup. Distance-vector routing. In M. E. Steenstrup, editor, Routing in Communications Networks, pages 83–98. Prentice Hall, 1995.

    Google Scholar 

  2. G. Di Caro and M. Dorigo, AntNet: Distributed stigmergetic control for communications networks, Technical Report 98-01, IRIDIA, Universite Libre de Bruxelles, 1998, (Accepted for publication in the Journal of Artificial Intelligence Research (JAIR)).

    Google Scholar 

  3. D. P. Bertsekas and R. G. Gallaher, Data Networks, Prentice-Hall, Englewood Cliffs, N.J., 1987.

    Google Scholar 

  4. J. F. Kurose and K. W. Ross. Computer Networking, A Top Down Approach Featuring the Internet, Addison-Wesley, 2001.

    Google Scholar 

  5. RFC 1058

    Google Scholar 

  6. N. Minar, K. H. Kramer and P. Maes, Cooperating Mobile Agents for Mapping Networks, Proceedings of the First Hungarian National Conference on Agent Based Computing.1998.

    Google Scholar 

  7. N. Minar, K. H. Kramer and P. Maes, Cooperating Mobile Agents for Dynamic Network Routing, Software Agents for Future Communications Systems, Springer-Verlag, 1999, ISBN 3-540-65578-6.

    Google Scholar 

  8. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.

    Google Scholar 

  9. The Mechanics of Routing Protocols, CISCO Press. http://www.cisco.com/cpress/cc/td/cpress/fund/iprf/ip2907.htm

  10. M. Bui, S. K. Das, A. K. Datta and D. T. Nguyen, Randomized Mobile Agent Based Routing in Wireless Networks

    Google Scholar 

  11. A. Fugetta, G. P. Picco, G. Vigna, Understanding Code Mobility, IEEE Trans. Softw. Eng. 24(5), 342–361, 1998

    Article  Google Scholar 

  12. J. M. Bradshaw Software Agents. AAAI Press, Menlo Park, California/The MIT Press.

    Google Scholar 

  13. A. R. Mikler, J. S. K. Wong and V. G. Honovar, An Object-Oriented Approach to Simulate Large Communication Networks. The Journal of Systems and Software. Volume 40, No.2. pp.61–73.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amin, K.A., Mayes, J.T., Mikler, A.R. (2001). Agent-Based Distance Vector Routing. In: Pierre, S., Glitho, R. (eds) Mobile Agents for Telecommunication Applications. MATA 2001. Lecture Notes in Computer Science, vol 2164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44651-6_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-44651-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42460-4

  • Online ISBN: 978-3-540-44651-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics