부산대학교 도서관

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.comnet.2008.08.017 Byline: Vijay K. Verma (a), Ramesh C. Joshi (a), Bin Xie (b), Dharma P. Agrawal (b) Keywords: Bloated state; Cloning; Itinerary partitioning; Mobile agent; Network management; Simple network management protocol (SNMP) Abstract: As computer networks increase in size, it is critical to provide efficient and scalable network management. Integration of mobile agents (MAs) with simple network management protocol (SNMP) provides a decentralized network management architecture that overcomes the limitations of the legacy SNMP client/server structure. However, as an MA travels through its itinerary, acquiring the network state at each managed node, its size linearly increases node-by-node and it may be unexpectedly bloated. As a result, a bloated MA will have difficulty in migrating from one node to another. We show that the network response time grows exponentially as the MA size increases linearly. In this paper, we propose a new strategy called itinerary partitioning approach (IPA) that exploits cloning capability of MAs to effectively address this bloated state phenomenon. The analytical model shows the effectiveness of our proposed IPA in terms of network response time. We have implemented the IPA in a practical test-bed network and the results seem to be very encouraging. Author Affiliation: (a) Department of Electronics and Computer Science, Indian Institute of Technology (IIT) - Roorkee, Roorkee, India (b) OBR Center of Distributed and Mobile Computing, Department of Computer Science, University of Cincinnati, Cincinnati, OH 45221, United States Article History: Received 15 August 2006; Revised 9 April 2008; Accepted 4 August 2008