@inproceedings{70d51f23ca86461d8b8dd429633a9aa2,
title = "Computing mobile agent routes with node-wise constraints in distributed communication systems",
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.",
keywords = "Acceleration technique, Agent routing, FPTAS, Mobile agent, Multi-agent distributed systems, Routing algorithm",
author = "Amir Elalouf and Eugene Levner and Cheng, {T. C.Edwin}",
year = "2011",
doi = "https://doi.org/10.1007/978-3-642-25324-9_7",
language = "الإنجليزيّة",
isbn = "9783642253232",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 1",
pages = "76--87",
booktitle = "Advances in Artificial Intelligence - 10th Mexican International Conference on Artificial Intelligence, MICAI 2011, Proceedings",
edition = "PART 1",
note = "10th Mexican International Conference on Artificial Intelligence, MICAI 2011 ; Conference date: 26-11-2011 Through 04-12-2011",
}