Autonomous agents for coordinated distributed parameterized heuristic routing in large dynamic communication networks

Armin R. Mikler, Vasant Honavar, Johnny S K Wong

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Parameterized heuristics offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive traffic management agents in communication networks. Routing of messages in such networks presents a real-time instance of a multi-criterion optimization problem in a dynamic and uncertain environment. This paper describes the analysis of the properties of heuristic routing agents through a simulation study within a large network with grid topology. A formal analysis of the underlying principles is presented through the incremental design of a set of autonomous agents that realize heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. This paper carefully derives the properties of such heuristics under a set of simplifying assumptions about the network topology and load dynamics and identify the conditions under which they are guaranteed to route messages along an optimal path, so as to avoid hotspots in the load landscape of the network. The paper concludes with a discussion of the relevance of the theoretical results to the design of intelligent autonomous adaptive communication networks and an outline of some directions of future research.

Original languageEnglish (US)
Pages (from-to)231-246
Number of pages16
JournalJournal of Systems and Software
Volume56
Issue number3
DOIs
StatePublished - Mar 15 2001

Fingerprint

Autonomous agents
Telecommunication networks
Topology
Dynamic loads

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

@article{3933c6e840af4787aa9b469d174c928d,
title = "Autonomous agents for coordinated distributed parameterized heuristic routing in large dynamic communication networks",
abstract = "Parameterized heuristics offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive traffic management agents in communication networks. Routing of messages in such networks presents a real-time instance of a multi-criterion optimization problem in a dynamic and uncertain environment. This paper describes the analysis of the properties of heuristic routing agents through a simulation study within a large network with grid topology. A formal analysis of the underlying principles is presented through the incremental design of a set of autonomous agents that realize heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. This paper carefully derives the properties of such heuristics under a set of simplifying assumptions about the network topology and load dynamics and identify the conditions under which they are guaranteed to route messages along an optimal path, so as to avoid hotspots in the load landscape of the network. The paper concludes with a discussion of the relevance of the theoretical results to the design of intelligent autonomous adaptive communication networks and an outline of some directions of future research.",
author = "Mikler, {Armin R.} and Vasant Honavar and Wong, {Johnny S K}",
year = "2001",
month = "3",
day = "15",
doi = "10.1016/S0164-1212(00)00100-X",
language = "English (US)",
volume = "56",
pages = "231--246",
journal = "Journal of Systems and Software",
issn = "0164-1212",
publisher = "Elsevier Inc.",
number = "3",

}

Autonomous agents for coordinated distributed parameterized heuristic routing in large dynamic communication networks. / Mikler, Armin R.; Honavar, Vasant; Wong, Johnny S K.

In: Journal of Systems and Software, Vol. 56, No. 3, 15.03.2001, p. 231-246.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Autonomous agents for coordinated distributed parameterized heuristic routing in large dynamic communication networks

AU - Mikler, Armin R.

AU - Honavar, Vasant

AU - Wong, Johnny S K

PY - 2001/3/15

Y1 - 2001/3/15

N2 - Parameterized heuristics offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive traffic management agents in communication networks. Routing of messages in such networks presents a real-time instance of a multi-criterion optimization problem in a dynamic and uncertain environment. This paper describes the analysis of the properties of heuristic routing agents through a simulation study within a large network with grid topology. A formal analysis of the underlying principles is presented through the incremental design of a set of autonomous agents that realize heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. This paper carefully derives the properties of such heuristics under a set of simplifying assumptions about the network topology and load dynamics and identify the conditions under which they are guaranteed to route messages along an optimal path, so as to avoid hotspots in the load landscape of the network. The paper concludes with a discussion of the relevance of the theoretical results to the design of intelligent autonomous adaptive communication networks and an outline of some directions of future research.

AB - Parameterized heuristics offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive traffic management agents in communication networks. Routing of messages in such networks presents a real-time instance of a multi-criterion optimization problem in a dynamic and uncertain environment. This paper describes the analysis of the properties of heuristic routing agents through a simulation study within a large network with grid topology. A formal analysis of the underlying principles is presented through the incremental design of a set of autonomous agents that realize heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. This paper carefully derives the properties of such heuristics under a set of simplifying assumptions about the network topology and load dynamics and identify the conditions under which they are guaranteed to route messages along an optimal path, so as to avoid hotspots in the load landscape of the network. The paper concludes with a discussion of the relevance of the theoretical results to the design of intelligent autonomous adaptive communication networks and an outline of some directions of future research.

UR - http://www.scopus.com/inward/record.url?scp=0035868306&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035868306&partnerID=8YFLogxK

U2 - 10.1016/S0164-1212(00)00100-X

DO - 10.1016/S0164-1212(00)00100-X

M3 - Article

AN - SCOPUS:0035868306

VL - 56

SP - 231

EP - 246

JO - Journal of Systems and Software

JF - Journal of Systems and Software

SN - 0164-1212

IS - 3

ER -