Paper Info
Title
Low-cost itineraries for multi-hop agents designed for scalable monitoring of multiple subnets
Abstract
Mobile agent (MA) technology represents a recent trend for implementing distributed management architectures, as an answer to the flexibility and scalability problems of centralised models. Management scalability limitations though, are not adequately addressed when monitoring tasks requiring the employment of multi-hop agents are considered. This is because agent-based architectures lack mechanisms that guarantee near-optimal agents itineraries so as to minimise the total migration cost in terms of the round-trip latency and the incurred traffic. This is of particular importance when the management of networks spanning multiple subnets is involved. To address these issues, we have adapted an algorithm originally designed to solve network design problems to the specific problematic of MA itinerary planning. The algorithm suggests the optimal number of MAs that minimise the overall cost and also constructs optimal itineraries for each of them. A Java-based implementation of the algorithm has been tested on realistic applications over a laboratory testbed, demonstrating significant cost savings. Simulation tests verified the algorithm's validity and competence over large enterprise networks.
Year
DOI
Venue
2006
10.1016/j.comnet.2005.10.024
Computer Networks
Keywords
DocType
Volume
Mobile agents,Itinerary optimization,Heuristic,Network monitoring,SNMP,Performance evaluation
Journal
50
Issue
ISSN
Citations 
16
Computer Networks
3
PageRank 
References 
Authors
0.41
14
2
Name
Order
Citations
PageRank
Damianos Gavalas197476.93
Christina Tanya Politi273.62