Advertisement

A Framework and Model for Soft Routing: The Markovian Termite and Other Curious Creatures

  • Martin Roth
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4150)

Abstract

A theoretical framework and model is presented to study the self-organized behavior of probabilistic routing protocols for computer networks. Such soft routing protocols have attracted attention for delivering packets reliably, robustly, and efficiently. The framework supports several features necessary for emergent routing behavior, including feedback loops and indirect communication between peers. Efficient global operating parameters can be estimated without resorting to expensive monte-carlo simulation of the whole system. Key model parameters are routing sensitivity and routing threshold, or noise, which control the “randomness” of packet routes between source and destination, and a metric estimator. Global network characteristics are estimated, including steady state routing probabilities, average path length, and path robustness.

The framework is based on a markov chain analysis. Individual network nodes are represented as states. Standard techniques are used to find primary statistics of the steady state global routing pattern, given a set of link costs. The use of packets to collect information about, or “sample,” the network for new path information is also reviewed. How the network sample rate influences performance is investigated.

Keywords

Particle Swarm Optimization Path Cost Link Cost Link Utility Packet Arrival Rate 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Tannenbaum, A.: Computer Networks. Prentice Hall PTR, Englewood Cliffs (2002)Google Scholar
  2. 2.
    Boyan, J., Littman, M.: Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach. In: Advances in Neural Information Processing Systems, Morgan Kaufmann, San Francisco (1993)Google Scholar
  3. 3.
    Schoonderwoerd, R., Holland, O., Bruten, J., Rothkrantz, L.: Ant-Based Load Balancing In Telecommunications Networks. Adaptive Behavior (1996)Google Scholar
  4. 4.
    Di Caro, G., Dorigo, M.: Mobile Agents for Adaptive Routing. Technical Report, IRIDIA/97-12, Université Libre de Bruxelles, Belgium (1997)Google Scholar
  5. 5.
    Heusse, M., Snyers, D., Guérin, S., Kuntz, P.: Adaptive Agent-Driven Routing and Local Balancing in Communication Networks. ENST de Bretagne Technical Report RR-98001-IASC (1997)Google Scholar
  6. 6.
    Baras, J., Mehta, H.: A Probabilistic Emergent Routing Algorithm for Mobile Ad-hoc Networks. In: WiOpt 2003: Modeling and Optimization in Mobile, Ad-Hoc, and Wireless Networks (2003)Google Scholar
  7. 7.
    Günes, M., Kähmer, M., Bouazizi, I.: Ant Routing Algorithm (ARA) for Mobile Multi-Hop Ad-Hoc Networks - New Features and Results. In: The Second Mediterranean Workshop on Ad-Hoc Networks (2003)Google Scholar
  8. 8.
    Heissenbüttel, M., Braun, T.: Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks. In: Kommunikation in Verteilten Systemen (KiVS) (2003)Google Scholar
  9. 9.
    Sim, K.M., Sun, W.H.: Ant Colony Optimization for Routing and Load-Balancing: Survey and New Directions. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans 33(5) (2003)Google Scholar
  10. 10.
    Roth, M., Wicker, S.: Termite: A Swarm Intelligent Routing Algorithm for Mobile Wireless Ad-Hoc Networks. Springer SCI Series: Swarm Intelligence and Data Mining. Springer, Heidelberg (2005)Google Scholar
  11. 11.
    Rajagopalan, S., Shen, C.: A Routing Suite for Mobile Ad-hoc Networks using Swarm Intelligence (2004) (Unpublished)Google Scholar
  12. 12.
    Ducatelle, F., Di Caro, G., Gambardella, L.M.: Using Ant Agents to Combine Reactive and Proactive Strategies for Routing in Mobile Ad-Hoc Networks. Technical Report No. IDSIA-28-04-2004 (2004)Google Scholar
  13. 13.
    Wedde, H., Farooq, M.: The Wisdom of the Hive Applied to Mobile Ad-hoc Networks. In: IEEE Swarm Intelligence Symposium 2005 (SIS 2005) (2005)Google Scholar
  14. 14.
    Dowling, J., Curran, E., Cunningham, R., Cahill, V.: Using Feedback in Collaborative Reinforcement Learning to Adaptively Optimise MANET Routing. IEEE Transactions on Systems, Man and Cybernetics (Part A), Special Issue on Engineering Self-Orangized Distributed Systems 35(3), 360–372 (2005)Google Scholar
  15. 15.
  16. 16.
    Perkins, P., Royer, E.: Ad-hoc On-demand Distance Vector. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (1999)Google Scholar
  17. 17.
    Subramanian, D., Druschel, P., Chen, J.: Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks. In: Proceedings of the International Joint Conference on Artificial Intelligence (1997)Google Scholar
  18. 18.
    Roth, M., Wicker, S.: Asymptotic Pheromone Behavior in Swarm Intelligent MANETs: An Analytical Analysis of Routing Behavior. In: Sixth IFIP IEEE International Conference on Mobile and Wireless Communications Networks (MWCN) (2004)Google Scholar
  19. 19.
    Meuleau, N., Dorigo, M.: Ant Colony Optimization and Stochastic Gradient Descent. Artificial Life 8 (2002)Google Scholar
  20. 20.
    Dorigo, M., Di Caro, G., Gambardella, L.M.: Ant Algorithms for Discrete Optimization. Artificial Life 5(2) (1999)Google Scholar
  21. 21.
    Eberhart, R., Kennedy, J.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks (1995)Google Scholar
  22. 22.
    Gaertner, D., Clark, K.: On Optimal Parameters for Ant Colony Optimization algorithms. In: The International Conference on Artificial Intelligence (ICAI) (2004)Google Scholar
  23. 23.
    Brockwell, P.J., Davis, R.A.: Introduction to Time Series and Forecasting. Springer-Verlag, Heidelberg (2002)MATHCrossRefGoogle Scholar
  24. 24.
    Norris, J.: Markov Chains. Cambridge University Press, Cambridge (1998)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Martin Roth
    • 1
  1. 1.Deutsche Telekom LaboratoriesBerlinGermany

Personalised recommendations