TY - GEN
T1 - Computing mobile agent routes with node-wise constraints in distributed communication systems
AU - Elalouf, Amir
AU - Levner, Eugene
AU - Cheng, Edwin Tai Chiu
PY - 2011/12/6
Y1 - 2011/12/6
N2 - 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.
AB - 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.
KW - Acceleration technique
KW - Agent routing
KW - FPTAS
KW - Mobile agent
KW - Multi-agent distributed systems
KW - Routing algorithm
UR - http://www.scopus.com/inward/record.url?scp=82555191193&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-25324-9_7
DO - 10.1007/978-3-642-25324-9_7
M3 - Conference article published in proceeding or book
SN - 9783642253232
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 76
EP - 87
BT - Advances in Artificial Intelligence - 10th Mexican International Conference on Artificial Intelligence, MICAI 2011, Proceedings
T2 - 10th Mexican International Conference on Artificial Intelligence, MICAI 2011
Y2 - 26 November 2011 through 4 December 2011
ER -