Ant-Based Load Balancing in Telecommunications Networks

@article{Schoonderwoerd1997AntBasedLB,
  title={Ant-Based Load Balancing in Telecommunications Networks},
  author={Ruud Schoonderwoerd and Owen Holland and Janet Bruten and L{\'e}on J. M. Rothkrantz},
  journal={Adaptive Behavior},
  year={1997},
  volume={5},
  pages={169 - 207}
}
This article describes a novel method of achieving load balancing in telecommunications networks. A simulated network models a typical distribution of calls between nodes; nodes carrying an excess of traffic can become congested, causing calls to be lost. In addition to calls, the network also supports a population of simple mobile agents with behaviors modeled on the trail-laying abilities of ants. The ants move across the network between randomly chosen pairs of nodes; as they move, they… Expand
Simulation of Route Optimization with load balancing Using AntNet System
TLDR
This model shows the scenario of Packet distribution between nodes, and if congestion occurs due to traffic then Packet to be failed, and the adaptivity of the system; the nodes are removed from the network, system finds the alternative chosen paths without system degradation and controls the performance of routing. Expand
Minimal Agents for Communications Network Routing: The Social Insect Paradigm
TLDR
Despite their simplicity the ant-like agents are shown to adapt smoothly to the ever-changing and complex behavior of the network, preventing or removing congestion by distributing the load on the network evenly and keeping the average load low. Expand
An ant-based distributed routing algorithm for ad-hoc networks
TLDR
The ADRA system is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control. Expand
An Ant-Assisted Path-Flow Routing Algorithm for Telecommunication Networks
TLDR
A path-flow routing algorithm for the network that is assisted by ant colony behavior, which uses ants' pheromone to monitor and record the network status to avoid delay and packet loss of the traffic. Expand
Adaptive Routing Algorithm for Manet: Termite
Mobile Ad hoc network consists of a set of mobile nodes. This network does not have any infrastructure or central administration, hence it is called infrastructure less network. As the nodes areExpand
A comprehensive review of nature inspired routing algorithms for fixed telecommunication networks
TLDR
A comprehensive survey of existing state-of-the-art Nature inspired routing protocols for fixed telecommunication networks developed by researchers who are trained in novel and different design doctrines and practices is provided. Expand
MANET Link Performance Parameters using Ant Colony Optimization Approach
TLDR
A new routing approach for mobile ad hoc networks (MANETs) is presented which takes into consideration the Ant Colony Optimization (ACO) technique in conjunction with linear programming approach for minimizing the overall delay in networking environment. Expand
Ant agents for hybrid multipath routing in mobile ad hoc networks
TLDR
AntHocNet, an algorithm for routing in mobile ad hoc networks based on ideas from the nature-inspired ant colony optimization framework, outperforms AODV both in terms of end-to-end delay and delivery ratio. Expand
AntNet: Distributed Stigmergetic Control for Communications Networks
TLDR
AntNet is a distributed, mobile agents based Monte Carlo system that was inspired by recent work on the ant colony metaphor for solving optimization problems, and showed superior performance under all the experimental conditions with respect to its competitors. Expand
An Ant-Monitored Path-Flow Routing Algorithm for Next Generation Networks
TLDR
This work uses ants' pheromone to monitor and record the network status to avoid delay and packet loss of the traffic, and proposes a path-flow routing algorithm for the next generation network that is assisted by ant colony behavior. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 38 REFERENCES
Routing in communications networks
I. CIRCUIT-SWITCHING NETWORKS. AT&Ts Dynamic Routing Network, G.R. Ash Dynamic Alternative Routing, R.J. Gibbens, F.P. Kelly, and P.B. Key II. PACKET-SWITCHING NETWORKS. Distance Vector Routing, G.S.Expand
Ant system: optimization by a colony of cooperating agents
TLDR
It is shown how the ant system (AS) can be applied to other optimization problems like the asymmetric traveling salesman, the quadratic assignment and the job-shop scheduling, and the salient characteristics-global data structure revision, distributed communication and probabilistic transitions of the AS. Expand
The Clifford Paterson Lecture, 1995 Modelling communication networks, present and future
  • F. Kelly
  • Computer Science
  • Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
  • 1996
TLDR
Some of the models that have proved useful in the analysis of stability, statistical sharing and pricing, in systems ranging from the telephone networks of today to the information superhighways of tomorrow are described. Expand
Trails and U-turns in the Selection of a Path by the Ant Lasius niger
A series of laboratory experiments show how colonies of the ant Lasius niger systematically select the shorter of two paths of varying length and form between nest and foraging area, and do so with aExpand
Telecommunication networks: protocols, modeling and analysis
TLDR
1. Introduction to Queuing Theory, Layered Architectures in Data Networks, and The Evolution toward Integrated Networks. Expand
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
TLDR
Ant-Q algorithms were inspired by work on the ant system (AS), a distributed algorithm for combinatorial optimization based on the metaphor of ant colonies and are applied to the solution of symmetric and asymmetric instances of the traveling salesman problem. Expand
A note on two problems in connexion with graphs
  • E. Dijkstra
  • Mathematics, Computer Science
  • Numerische Mathematik
  • 1959
TLDR
A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given. Expand
The dynamics of collective sorting robot-like ants and ant-like robots
TLDR
A distributed sorting algorithm, inspired by how ant colonies sort their brood, is presented for use by robot teams, offering the advantages of simplicity, flexibility and robustness. Expand
How Trail Laying and Trail Following Can Solve Foraging Problems for Ant Colonies
TLDR
It is shown that trail laying and trail following behaviour are more than just a means of communicating a food source’s location and can lead to the collective selection of the shortest path or the best food source, despite the fact that individual foragers have no means of making such choices. Expand
A distributed probabilistic system for adaptive regulation of image processing parameters
A distributed optimization framework and its application to the regulation of the behavior of a network of interacting image processing algorithms are presented. The algorithm parameters used toExpand
...
1
2
3
4
...