Results 1 
7 of
7
UtilityTheoretic Heuristics for Intelligent Adaptive Routing in Large Communication Networks
 Proceedings of the Thirteenth National Conference on Artificial Intelligence
, 1996
"... 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 realtime instance of a multicriterion quasioptimization problem in a dynamic and uncertain environment. In thi ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
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 realtime instance of a multicriterion quasioptimization problem in a dynamic and uncertain environment. In this paper, we examine several heuristic decision functions that can be used to guide messages along a nearoptimal (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. In particular, we identify the conditions under which one such utilitytheoretic heuristic function is guaranteed to route messages along an optimal (minimum delay) path in a network with uniform load except This paper has been submitted to: Journal of Heuristics. y Armin Mikler is currently a postdoctoral fellow at the Scalable Computing Laboratory of the Ames Laboratory (U.S. Department of ...
Analysis of UtilityTheoretic Heuristics for Intelligent Adaptive Network Routing
 in Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI96
, 1996
"... 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 realtime instance of a multicriterion optimization problem in a dynamic and uncertain environment. In this pape ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
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 realtime instance of a multicriterion 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 nearoptimal (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. Introduction With the unprecedented growth in size and and ...
An ObjectOriented Approach to Modeling and Simulation of Routing in Large Communication Networks
 IN LARGE COMMUNICATION NETWORKS.” IASTATECS//TR9509
, 1995
"... The complexity (number of entities, interactions between entities, and resulting emergent dynamic behavior) of large communication environments which contain hundreds of nodes and links make simulation an important tool for the study of such systems. Given the difficulties associated with comple ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
The complexity (number of entities, interactions between entities, and resulting emergent dynamic behavior) of large communication environments which contain hundreds of nodes and links make simulation an important tool for the study of such systems. Given the difficulties associated with complete analytical treatment of complex dynamical systems, it is often the only practical tool that is available. This paper presents an example of a flexible, modular, objectoriented toolbox designed to support modeling and experimental analysis of a large family of heuristic knowledge representation and decision functions for adaptive selfmanaging communication networks with particular emphasis on routing strategies. It discusses in detail, the design, implementation, and validation of the toolbox using the discrete event simulation paradigm. It addresses several major practical design challenges presented by potentially large computational time and memory requirements of simulation...
Autonomous Agents for Coordinated Distributed Parameterized Heuristic Routing in Large Dynamic Communication Networks
, 2001
"... 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 realtime instance of a multicriterion optimization problem in a dynamic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
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 realtime instance of a multicriterion 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 nearoptimal (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, ...
heuristic routing in large dynamic communication networks
, 1999
"... Autonomous agents for coordinated distributed parameterized ..."
(Show Context)
Parameterized Heuristics for Intelligent Adaptive Network Routing in Large Communication Networks
"... Parameterized heuristics offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive communication networks. Routing of messages in such networks presents a realtime instance of a multicriterion optimization problem in a dynamic and uncertain environment. Thi ..."
Abstract
 Add to MetaCart
Parameterized heuristics offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive communication networks. Routing of messages in such networks presents a realtime instance of a multicriterion optimization problem in a dynamic and uncertain environment. This paper describes a framework for heuristic routing in large networks. The effectiveness of the heuristic routing mechanism upon which Quo Vadis is based is described as part of a simulation study within a network with grid topology. A formal analysis of the underlying principles is presented through the incremental design of a set of heuristic decision functions that can be used to guide messages along a nearoptimal (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 Object Oriented Approach to Simulating Large Communication Networks
, 1998
"... The complexity of modern communication systems in terms of the number of entities, their interaction, and the resulting dynamics make an analytical study often impossible. Their analysis may require the experimental study through simulation. A simulation environment for large network infrastructures ..."
Abstract
 Add to MetaCart
(Show Context)
The complexity of modern communication systems in terms of the number of entities, their interaction, and the resulting dynamics make an analytical study often impossible. Their analysis may require the experimental study through simulation. A simulation environment for large network infrastructures must be carefully designed since the simulator performance becomes a critical issue as the model complexity increases. Our effort to design such a simulation environment were driven by the need to evaluate heuristic routing strategies for very large communication networks through experimental studies. We have chosen to employ the object oriented paradigm in our approach. In addition, critical issues such as the choice of prescheduling versus postscheduling and the generation of a priori service time had to be considered during the design. In this paper we give an overview of the design of an object oriented simulation tool for large networks and discuss some of the issues that are pertine...