Analysis of utility-theoretic heuristics for intelligent adaptive network routing

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Utility theory offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive 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. In this paper, we incrementally develop a set of heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. We present an analysis of 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. The paper concludes with a discussion of the relevance of the theoretical results presented in the paper to the design of intelligent autonomous adaptive communication networks and an outline of some directions of future research.

Original languageEnglish (US)
Title of host publicationProceedings of the National Conference on Artificial Intelligence
Editors Anon
PublisherAAAI
Pages96-101
Number of pages6
Volume1
StatePublished - 1996
EventProceedings of the 1996 13th National Conference on Artificial Intelligence, AAAI 96. Part 1 (of 2) - Portland, OR, USA
Duration: Aug 4 1996Aug 8 1996

Other

OtherProceedings of the 1996 13th National Conference on Artificial Intelligence, AAAI 96. Part 1 (of 2)
CityPortland, OR, USA
Period8/4/968/8/96

Fingerprint

Network routing
Telecommunication networks
Dynamic loads
Topology

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Mikler, A. R., Honavar, V., & Wong, J. S. K. (1996). Analysis of utility-theoretic heuristics for intelligent adaptive network routing. In Anon (Ed.), Proceedings of the National Conference on Artificial Intelligence (Vol. 1, pp. 96-101). AAAI.
Mikler, Armin R. ; Honavar, Vasant ; Wong, Johnny S K. / Analysis of utility-theoretic heuristics for intelligent adaptive network routing. Proceedings of the National Conference on Artificial Intelligence. editor / Anon. Vol. 1 AAAI, 1996. pp. 96-101
@inproceedings{4a5fd99984054306850845e3ca08434c,
title = "Analysis of utility-theoretic heuristics for intelligent adaptive network routing",
abstract = "Utility theory offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive 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. In this paper, we incrementally develop a set of heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. We present an analysis of 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. The paper concludes with a discussion of the relevance of the theoretical results presented in the paper 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 = "1996",
language = "English (US)",
volume = "1",
pages = "96--101",
editor = "Anon",
booktitle = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "AAAI",

}

Mikler, AR, Honavar, V & Wong, JSK 1996, Analysis of utility-theoretic heuristics for intelligent adaptive network routing. in Anon (ed.), Proceedings of the National Conference on Artificial Intelligence. vol. 1, AAAI, pp. 96-101, Proceedings of the 1996 13th National Conference on Artificial Intelligence, AAAI 96. Part 1 (of 2), Portland, OR, USA, 8/4/96.

Analysis of utility-theoretic heuristics for intelligent adaptive network routing. / Mikler, Armin R.; Honavar, Vasant; Wong, Johnny S K.

Proceedings of the National Conference on Artificial Intelligence. ed. / Anon. Vol. 1 AAAI, 1996. p. 96-101.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Analysis of utility-theoretic heuristics for intelligent adaptive network routing

AU - Mikler, Armin R.

AU - Honavar, Vasant

AU - Wong, Johnny S K

PY - 1996

Y1 - 1996

N2 - Utility theory offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive 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. In this paper, we incrementally develop a set of heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. We present an analysis of 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. The paper concludes with a discussion of the relevance of the theoretical results presented in the paper to the design of intelligent autonomous adaptive communication networks and an outline of some directions of future research.

AB - Utility theory offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive 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. In this paper, we incrementally develop a set of heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. We present an analysis of 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. The paper concludes with a discussion of the relevance of the theoretical results presented in the paper 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=0030370733&partnerID=8YFLogxK

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

M3 - Conference contribution

AN - SCOPUS:0030370733

VL - 1

SP - 96

EP - 101

BT - Proceedings of the National Conference on Artificial Intelligence

A2 - Anon, null

PB - AAAI

ER -

Mikler AR, Honavar V, Wong JSK. Analysis of utility-theoretic heuristics for intelligent adaptive network routing. In Anon, editor, Proceedings of the National Conference on Artificial Intelligence. Vol. 1. AAAI. 1996. p. 96-101