Abstract
In this paper we describe how stigmergic techniques can be used in packet networks that offer soft QoS services. The problem we are interested is the on-line version of computing routes to be established over a packet network, and the number of constraints imposed by the service is more that one. We investigate the scheme of the algorithm, the issues around the characteristics of the constraints and we give some simulation evidence of the working algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Schoonderwoerd, R., O. Holland, J. Bruten and L. Rothkrantz. “Ant-based Load Balancing in Telecommunications Networks.”, Adapt. Behav. 5 (1996),pp169–207.
Di Caro, G., and M. Dorigo. “AntNet: Distributed Stigmergetic Control for Communication Networks.”, Journal of Artificial Intelligence Research, in press.
Heusse, M., S. Guerin, D. Snyers and P. Kuntz. “Adaptive Agent-Driven Routing and Load Balancing in Communication Networks.”, Technical Report RR-98001-IASC, ENST Bretagne, Brest, France, 1998.
Grasse, P. “La reconstruction du nid et les coordinations interindividuelles chez belicositermes natalensins et cubitermes sp. La theorie de la stigmergie: essai d’ interpretation du comportement des termites constructeurs.”, Insectes Sociaux, 6:41–81,1959.
Dorigo, M., and L. M. Gambardella. “Ant Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem.”, IEEE Trans. Evol. Comp. 1 (1997): pp 53–66.
Wang, Z., and Jon Crowcroft, “Quality of Service Routing for Supporting Multimedia Applications.”, IEEE JSAC, 14(7): pp. 1288–1234, Sep. 1996.
G. Apostolopoulos, et. al., “QoS Routing Mechanism and OSPF Extensions.”, IETF RFC 2676, Aug. 1999, http://www.ietf.org/rfc/rfc2676.txt.
Dean H. Lorenz, Ariel Orda, “QoS Routing in Networks with Uncertain Parameters.”, IEEE/ACM Transactions on Networking, Vol. 6, No. 6, Dec. 1998,pp.768–778
Michalareas, T., “Stigmergy for Routing and NetworkManagement.”, Transfer Thesis for Ph.D. at EE Department, UCL, London, August 2000.
Vern Paxson, “Empirically-Derived Analytic Models of Wide-Area TCP Connections: Extended Report”, June 1993, UC, Lawrence Berkeley Laboratory
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michalareas, T., Sacks, L. (2001). Stigmergic Techniques for Solving Multi-constraint Routing for Packet Networks. In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_67
Download citation
DOI: https://doi.org/10.1007/3-540-47728-4_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42302-7
Online ISBN: 978-3-540-47728-0
eBook Packages: Springer Book Archive