Modeling and Analysis of Active Messages in Volatile Networks

Interest in and development of mobile agent software systems has burgeoned in the past ve years. Code mobility has many attractive attributes for performance and dynamic deployment of new distributed computing and information management applications. An active message is a datagram encapsulated as a mobile agent. The agent is persistent in the network, moving from node to node under its own internal routing logic and control at the application layer. Active messages are particularly attractive in networks that have very unreliable links such as wireless networks in which the nodes are mobile. Such networks experience frequent link failures and other changes in topology. Active messages allow data to propagate between nodes that may never have viable TCP/IP type connections. In spite of the growing implementation interest in mobile agents and active messaging, there are essentially no analytic models or results dealing with their performance. This paper presents a simple model for active messages in a network with frequent link failures. Using this model, we develop expressions for the expected delivery time of an active message along one path as well as expected delivery time for duplicated messages traversing disjoint paths between source and destination nodes.

[1]  E. Gilbert Capacity of a burst-noise channel , 1960 .

[2]  Nicholas F. Maxemchuk,et al.  DISPERSITY ROUTING IN STORE-AND-FORWARD NETWORKS. , 1975 .

[3]  Michele Zorzi,et al.  Performance of TCP on wireless fading links with memory , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[4]  Ellen W. Zegura,et al.  Active networking and the end-to-end argument , 1997, Proceedings 1997 International Conference on Network Protocols.

[5]  L. B. Milstein,et al.  On the accuracy of a first-order Markov model for data transmission on fading channels , 1995, Proceedings of ICUPC '95 - 4th IEEE International Conference on Universal Personal Communications.

[6]  Victor O. K. Li,et al.  An optimal two-copy routing scheme in a communication network , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[7]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[8]  Matthias Klusch,et al.  Intelligent Information Agents: Agent-Based Information Discovery and Management on the Internet , 1999 .