Low-cost itineraries for multi-hop agents designed for scalable monitoring of multiple subnets

Gavalas, D; Politi, CT

dc.contributor.author	Gavalas, D	en
dc.contributor.author	Politi, CT	en
dc.date.accessioned	2014-03-01T01:24:34Z
dc.date.available	2014-03-01T01:24:34Z
dc.date.issued	2006	en
dc.identifier.issn	1389-1286	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17337
dc.subject	Heuristic	en
dc.subject	Itinerary optimization	en
dc.subject	Mobile agents	en
dc.subject	Network monitoring	en
dc.subject	Performance evaluation	en
dc.subject	SNMP	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Algorithms	en
dc.subject.other	Computer architecture	en
dc.subject.other	Distributed computer systems	en
dc.subject.other	Heuristic methods	en
dc.subject.other	Network protocols	en
dc.subject.other	Software agents	en
dc.subject.other	Itinerary optimization	en
dc.subject.other	Mobile agents	en
dc.subject.other	Network monitoring	en
dc.subject.other	Performance evaluation	en
dc.subject.other	Computer networks	en
dc.title	Low-cost itineraries for multi-hop agents designed for scalable monitoring of multiple subnets	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comnet.2005.10.024	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comnet.2005.10.024	en
heal.language	English	en
heal.publicationDate	2006	en
heal.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. (c) 2005 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Networks	en
dc.identifier.doi	10.1016/j.comnet.2005.10.024	en
dc.identifier.isi	ISI:000240820000002	en
dc.identifier.volume	50	en
dc.identifier.issue	16	en
dc.identifier.spage	2937	en
dc.identifier.epage	2952	en