Computing mobile agent routes with node-wise constraints in distributed communication systems

Amir Elalouf, Eugene Levner, T. C.Edwin Cheng

פרסום מחקרי: פרק בספר / בדוח / בכנספרסום בספר כנסביקורת עמיתים

תקציר

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.

שפה מקוריתאנגלית
כותר פרסום המארחAdvances in Artificial Intelligence - 10th Mexican International Conference on Artificial Intelligence, MICAI 2011, Proceedings
עמודים76-87
מספר עמודים12
מהדורהPART 1
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 2011
אירוע10th Mexican International Conference on Artificial Intelligence, MICAI 2011 - Puebla, מקסיקו
משך הזמן: 26 נוב׳ 20114 דצמ׳ 2011

סדרות פרסומים

שםLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
מספרPART 1
כרך7094 LNAI

כנס

כנס10th Mexican International Conference on Artificial Intelligence, MICAI 2011
מדינה/אזורמקסיקו
עירPuebla
תקופה26/11/114/12/11

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1700???

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Computing mobile agent routes with node-wise constraints in distributed communication systems'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי