Ant-Based Data Traffic Splitting for Application-Based Routing

  • Jörg Schulz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3473)


This conceptual paper presents the Ant-based Data Traffic Splitting (ADTS) that uses self-organizing nodes with peer-to-peer properties. ADTS is an addition to the conventional ant-based routing, which belongs to the new defined application-based routing class, whose prime importance is showed by this paper, too. The publication transforms latest biological test results by Dirk Helbing et al. [1] into the field of computer science: If a main path of walking ants is narrowed, natural ants will chose a second path on a given fork. Therefore, if no transmission capacity is available, ADTS nodes will split the data traffic autonomously. Local algorithms realize an interaction of a node only with its direct neighbors inside an ADTS system; this new approach facilitates the organization of large distributed networks. ADTS offers an opportunity to increase the data throughput in nets by automatic path splitting, too. ADTS is divided into two variants, which this paper shortly describes: the Preventive ADTS (PADTS) and the Stream-oriented ADTS (SADTS).


application-based routing ants data traffic splitting 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dussutoura, A., Fourcassié, V., Helbing, D., Deneubourg, J.L.: Optimal traffic organisation in ants under crowded conditions. Nature 428, 70–73 (2004)CrossRefGoogle Scholar
  2. 2.
    Steinmetz, R., Wehrle, K.: Peer-to-Peer Networking & Computing. In: Informatik Spektrum, Organ der Gesellschaft für Informatik und mit ihr assoziierter Organisationen, vol. 27, pp. 51–54. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Hadenius, P.: Relieving peer-to-peer pressure. In: Technology Review. Technology Review, Inc., One Main Street, 7th Floor, Cambridge, MA, 02142, USA (2004) MIT’s Magazine of Innovation Google Scholar
  4. 4.
    Caro, G.D., Dorigo, M.: Antnet: A mobile agents approach to adaptive routing. Technical Report 12, IRIDIA, Université Libre de Bruxelles, 50, av. F. Roosevelt, CP 194/6, 1050 Brussels, Belgium (1997)Google Scholar
  5. 5.
    Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetics 26, 29–41 (1996)CrossRefGoogle Scholar
  6. 6.
    Schoder, D., Fischbach, K.: Peer-to-Peer, Anwendungsbereiche und Herausforderungen. In: Schoder, D., Fischbach, K., Teichmann, R. (eds.) Peer-to-Peer, pp. 3–19. Springer, Berlin (2002)Google Scholar
  7. 7.
    Minar, N., Hedlund, M.: In: Oram, A. (ed.) Peer-to-Peer: Harnessing the Power of Disruptive Technologies, 1st edn., O’Reilly & Associates, Inc., 1005 Gravenstein Highway North (2001)Google Scholar
  8. 8.
    Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking up data in P2P systems. Communications oft the ACM 46, 43–48 (2003)CrossRefGoogle Scholar
  9. 9.
    Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Castro, M., Costa, M., Kermarrec, A.M., Rowstron, A., Druschel, P., Iyer, S., Mislove, A., Nandi, A., Post, A., Singh, A., Wallach, D., Hu, Y.C., Jones, M., Theimer, M., Wolman, A., Mahajan, R.: Pastry - A scalable, decentralized, selforganizing and fault-tolerant substrate for peer-to-peer applications. Microsoft Research, Cambridge, UK; Rice University, USA; Purdue University, USA; Microsoft Research, Redmond, USA; University of Washington, USA (2004)Google Scholar
  11. 11.
    Hildrum, K., Kubiatowicz, J.D., Rao, S., Zhao, B.Y.: Distributed object location in a dynamic network. In: Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), Session 2, Winnipeg, Manitoba, Canada, pp. 41–52. ACM Press, New York (2002)CrossRefGoogle Scholar
  12. 12.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for Internet applications. IEEE/ACM Transactions on Networking 11, 17–32 (2003)CrossRefGoogle Scholar
  13. 13.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for Internet applications. In: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM (ACM Special Interest Group on Data Communication), San Diego, California, USA, pp. 149–160. ACM Press, New York (2001)CrossRefGoogle Scholar
  14. 14.
    Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable contentaddressable network. In: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM (ACM Special Interest Group on Data Communication), San Diego, California, USA, pp. 161–172. ACM Press, New York (2001)CrossRefGoogle Scholar
  15. 15.
    Bonabeau, E., Henaux, F., Guérin, S., Snyers, D., Kuntz, P., Thraulaz, G.: Routing in telecommunication networks with smart ant-like agents. In: Albayrak, Ş., Garijo, F.J. (eds.) IATA 1998. LNCS (LNAI), vol. 1437, pp. 60–71. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  16. 16.
    Marwaha, S., Tham, C.K., Srinivasan, D.: A novel routing protocol using mobile agents and reactive route discovery for ad-hoc wireless networks. In: Towards Network Superiority, Proceedings of 10th IEEE International Conference on Networks 2002 (ICON 2002), Singapore, pp. 311–316. IEEE, Los Alamitos (2002)CrossRefGoogle Scholar
  17. 17.
    Kropf, P., Unger, H., Babin, G.: WOS: an Internet computing environment. In: IEEE International Conference on Parallel Architectures and Compilation Techniques, Philadelphia, PA, USA, pp. 14–22 (2000)Google Scholar
  18. 18.
    Stieler, W.: Stau-Vermeidung im Schwarm. c’t – Magazin für Computertechnik, 58 (2004)Google Scholar
  19. 19.
    SPIEGEL ONLINE: Stau-Stress. Wenn Ameisen zu Verkehrsrowdys werden (2004) Google Scholar
  20. 20.
    Helbing, D.: Traffic Regulation in Ants: How to Maintain Efficient Infrastructures by the Right Balance Between Conflict and Cooperation. Press Release. Institute for Economics and Traffic, Traffic Science Faculty ‘Friedrich List’, Dresden University of Technology, Andreas-Schubert-Str. 23, A-Building, Room No. 420, D-01062 Dresden, Germany (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jörg Schulz
    • 1
  1. 1. PotsdamGermany

Personalised recommendations