NDLI: Convergence results for ant routing algorithms via stochastic approximation and optimization

Content Provider	IEEE Xplore Digital Library
Author	Purkayastha, P. Baras, J.S.
Copyright Year	2007
Description	Author affiliation: Univ. of Maryland, College Park (Purkayastha, P.; Baras, J.S.)
Abstract	Ant algorithms" have been proposed to solve a variety of problems arising in optimization and distributed control. They form a subset of the larger class of "swarm intelligence" algorithms. The central idea is that a 'swarm' of relatively simple agents can interact through simple mechanisms and collectively solve complex problems. Instances that exemplify the above idea abound in nature. The abilities of ant colonies to collectively accomplish complex tasks have served as sources of inspiration for the design of "ant algorithms". Examples of "ant algorithms" are "ant routing" algorithms that have been proposed for communication networks. We analyze in this paper an ant-based routing algorithm for packet-switched wireline networks. The algorithm is an attractive multiple path probabilistic routing scheme, that is fully adaptive and distributed. Using methods from adaptive algorithms and stochastic approximation, we show that the evolution of the link delay estimates can be closely tracked by a deterministic ODE system. A study of the equilibrium points of the ODE then gives us the equilibrium behavior of the routing algorithm, in particular, the equilibrium routing probabilities, and mean delays in the links under equilibrium. We also show that the fixed-point equations that the equilibrium probabilities satisfy are actually the necessary and sufficient conditions of an appropriate optimization problem. Simulations supporting the analytical results are provided.
Starting Page	340
Ending Page	345
File Size	273741
Page Count	6
File Format	PDF
ISBN	9781424414970
ISSN	01912216
DOI	10.1109/CDC.2007.4434982
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-12-12
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Convergence Routing Approximation algorithms Stochastic processes Algorithm design and analysis Delay estimation Ant colony optimization Distributed control Particle swarm optimization Communication networks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Study on QoS Multicast Routing Based on ACO-PSO Algorithm

Genetically optimized ACO inspired PSO algorithm for DTNs

Convergence results for ant routing algorithms via stochastic approximation and optimization.

Enhanced clustering ant colony routing algorithm based on swarm intelligence in wireless sensor network

Different Types of Swarm Intelligence Algorithm for Routing

Coupling ant colony optimization and discrete-event simulation to solve a stochastic location-routing problem

Performance analysis of PBANT (PBANT: Position based ANT Colony Routing algorithm for MANETs)

RAAM: Routing algorithm using ant agents for manets

A Survey of Ant-Based Routing Algorithms for Mobile Ad-hoc Networks

Convergence results for ant routing algorithms via stochastic approximation and optimization

Similar Documents

Study on QoS Multicast Routing Based on ACO-PSO Algorithm

Genetically optimized ACO inspired PSO algorithm for DTNs

Convergence results for ant routing algorithms via stochastic approximation and optimization.

Enhanced clustering ant colony routing algorithm based on swarm intelligence in wireless sensor network

Different Types of Swarm Intelligence Algorithm for Routing

Coupling ant colony optimization and discrete-event simulation to solve a stochastic location-routing problem

Performance analysis of PBANT (PBANT: Position based ANT Colony Routing algorithm for MANETs)

RAAM: Routing algorithm using ant agents for manets

A Survey of Ant-Based Routing Algorithms for Mobile Ad-hoc Networks

Convergence results for ant routing algorithms via stochastic approximation and optimization