Please use this identifier to cite or link to this item:
Title: Computing mobile agent routes with node-wise constraints in distributed communication systems
Authors: Elalouf, A
Levner, E
Cheng, TCE 
Keywords: Acceleration technique
Agent routing
Mobile agent
Multi-agent distributed systems
Routing algorithm
Issue Date: 2011
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2011, v. 7094 LNAI, no. PART 1, p. 76-87 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: A basic problem in the quality-of-service (QoS) analysis of multiagent distributed systems is to find optimal routes for the mobile agents that incrementally fuse the data as they visit hosts in the distributed system. The system is modeled as a directed acyclic graph in which the nodes represent hosts and the edges represent links between them. Each edge is assigned a cost (or benefit) and weights that represent link delay, reliability, or other QoS parameters. The agent scheduling problem is viewed as a constrained routing problem in which a maximum-benefit (or minimum-cost) route connecting the source and the destination subject to QoS constraints is to be found. We study approximation algorithms called 'fully polynomial time approximation schemes' (FPTAS) for solving the problem. We suggest an accelerating technique that improves known FPTAS, e.g., Hassin's (1992); Camponogara & Shima's (2010); and Elalouf et al. (2011) algorithms, and present new FPTASs.
Description: 10th Mexican International Conference on Artificial Intelligence, MICAI 2011, Puebla, 26 November-4 December 2011
ISBN: 9783642253232
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-642-25324-9_7
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Oct 5, 2018

Page view(s)

Last Week
Last month
Citations as of Oct 14, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.