A Self-adaptable Agent System for Efficient Information Gathering
As networks become all-pervasive the importance of efficient information gathering for purposes such as monitoring, fault diagnosis, and performance evaluation can only increase. Extracting information out of large-scale, dynamic networked systems is becoming increasingly difficult. Distributed monitoring systems based on static object technologies such as CORBA and Java-RMI can cope with scalability problems only to a limited extent. They are not well suited to monitoring systems that are both very large and highly dynamic because the monitoring logic, although distributed, is statically pre-determined at design time. The paper presents an active distributed monitoring system based on mobile agents. Agents act as area managers which are not bound to any particular network node and can sense the network, estimate better locations, and migrate in order to pursue location optimality. Simulations demonstrate the capability of this approach to cope with large-scale systems and changing network conditions. The limitations of our approach are also discussed in comparison to more conventional monitoring systems.
KeywordsSelf-adaptable monitoring Scalable Information Gathering Adaptable Information Gathering Mobile Agents
Unable to display preview. Download preview PDF.
- 1.Y. I. Wijata, D. Niehaus, V. S. Frost, “A Scalable Agent-based Network Measurement Infrastructure”, IEEE Communications Magazine, (September 2000).Google Scholar
- 2.A. Bieszczad, B. Pagurek, T. White, “Mobile Agents for Network Management”, IEEE Communications Survey, Vol.1, N.1, (Fourth Quarter 1998).Google Scholar
- 3.G. Goldszmidt, Y. Yemini, “Delegated Agents for Network Management”. IEEE Communications Magazine, Vol.36 No.3, (March 1998).Google Scholar
- 4.C. Bohoris, A. Liotta, G. Pavlou, “Software Agent Constrained Mobility for Network Performance Monitoring”, Proc. of the 6th IFIP Conference on Intelligence in Networks (SmartNet 2000), Vienna, Austria, ed. H.R. van As, pp. 367–387, Kluwer, (September 2000).Google Scholar
- 5.C. Bohoris. A. Liotta, G. Pavlou, “Evaluation of Constrained Mobility for Programmability in Network Management”, Proc. of DSOM 2000, pp. 243–257 (December, 2000).Google Scholar
- 6.M. Baldi, G. P. Picco, “Evaluating the Tradeoffs of Mobile Code Paradigms in Network Management Applications”, ACM Transactions on Software Engineering and Methodology, 20th International Conference on Software Engineering (ICSE’ 98), Kyoto, Japan, (April 1998).Google Scholar
- 8.M. S. Daskin, “Network and Discrete Location”, Wiley, (1995).Google Scholar
- 9.E.W. Zegura, K.L. Calvert, M.J. Donahoo, “A Quantitative Comparison of Graph-based Models for Internet Topology”, IEEE/ACM Transactions on Networking, (1997).Google Scholar
- 10.E.W. Zegura, K.L. Calvert, S. Bhattacharjee, “How to Model an Internetwork”, IEEE INFOCOM 96, San Francisco, CA, USA, (1996).Google Scholar
- 11.K.L. Calvert, M.B. Doar, E.W. Zegura, “Modeling Internet Topology”, IEEE Communications Magazine, (June, 1997).Google Scholar
- 12.K. Fall, K. Varadhan, “NS Notes and Documents”, UC Berkeley, (http:// www.isi.edu/~salehi/ ns_doc/) (October 1999).
- 13.G. Knight, R. Hazemi, “Mobile Agent based management in the INSERT project”, Journal of Network and System Management (Mobile Agent-based Network and Service Management), Vol. 7(3), (September, 1999).Google Scholar