The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Ant-Based Load Balancing in Telecommunications Networks
Abstract
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 deposit simulated pheromone as a function of their distance from their source node and the congestion encountered on their journey. They select their path at each intermediate node according to the distribution of simulated pheromone at each node. Calls between nodes are routed as a function of the pheromone distributions at each intermediate node. The performance of the network is measured by the proportion of calls that are lost. The results of using ant-based control (ABC) are compared with those achieved by using fixed shortest-path routes, and also those achieved by using an alternative algorithmically based type of mobile agent previously proposed for use in network management. The ABC system is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonparametric Statistics for the Behavioral Sciences
Guitton, H., & Siegel, S. (1958) · Revue économique · doi:10.2307/3498751 · Cited by 35,245
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Nonparametric Statistics for the Behavioral Sciences.
Whitfield, J. W., & Siegel, S. (1957) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342828 · Cited by 7,947
IEEE Transactions on Systems, Man, and Cybernetics
(2021) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.21 · Cited by 1,280
Grassé, P.-P. (1959) · Insectes Sociaux · doi:10.1007/bf02223791 · Cited by 1,236
Telecommunication networks: protocols, modeling and analysis
Schwartz, M. (1986) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 897
The Dynamics of Collective Sorting: Robot-Like Ants and Ant-Like Robots
Deneubourg, J. L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., & Chrétien, L. (1991) · From Animals to Animats · doi:10.7551/mitpress/3115.003.0048 · Cited by 889
Collective patterns and decision-making
Deneubourg, J. L., & Goss, S. (1989) · Ethology Ecology & Evolution · doi:10.1080/08927014.1989.9525500 · Cited by 672
Ant-Q: A Reinforcement Learning approach to the traveling salesman problem
Gambardella, L. M., & Dorigo, M. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50039-6 · Cited by 605
Cited by
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
Ant Algorithms for Discrete Optimization
Dorigo, M., Caro, G. D., & Gambardella, L. M. (1999) · Artificial Life · doi:10.1162/106454699568728 · Cited by 2,808
Ant colony optimization: a new meta-heuristic
Dorigo, M., & Di Caro, G. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.782657 · Cited by 2,137
Dorigo, M., Birattari, M., & Stutzle, T. (2006) · IEEE Computational Intelligence Magazine · doi:10.1109/ci-m.2006.248054 · Cited by 1,880
Metadata
- Authors
- Schoonderwoerd, R., Holland, O. E., Bruten, J. L., & Rothkrantz, L. J. M.
- Venue
- Adaptive Behavior
- Publisher
- SAGE Publications
- Published
- 1997-01
- Volume
- 5
- Issue
- 2
- Pages
- 169-207
- ISSN
- 1059-7123 (ISSN-L)
- 1741-2633
- OpenAlex
- W2089670420
- Cited by
- 739
- References
- 22
- FWCI
- 18.07
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Ant-Based Load Balancing in Telecommunications Networks. https://app.cochat.ai/papers/10.1177/105971239700500203
- The paper
- Schoonderwoerd, R., Holland, O. E., Bruten, J. L., & Rothkrantz, L. J. M. (1997). Ant-Based Load Balancing in Telecommunications Networks. Adaptive Behavior. https://doi.org/10.1177/105971239700500203
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.