Stigmergic Techniques for Solving Multi-constraint Routing for Packet Networks

Authors:
T. Michalareas;Lionel Sacks
Affiliations:
-;-
Venue:
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Year:
2001

Citing 5
Cited 0

Ant-based load balancing in telecommunications networks

Adaptive Behavior
QoS routing in networks with uncertain parameters

IEEE/ACM Transactions on Networking (TON)
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.