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
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 2011
الحدث10th Mexican International Conference on Artificial Intelligence, MICAI 2011 - Puebla, المكسيك
المدة: ٢٦ نوفمبر ٢٠١١٤ ديسمبر ٢٠١١

سلسلة المنشورات

الاسمLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
الرقمPART 1
مستوى الصوت7094 LNAI

!!Conference

!!Conference10th Mexican International Conference on Artificial Intelligence, MICAI 2011
الدولة/الإقليمالمكسيك
المدينةPuebla
المدة٢٦/١١/١١٤/١٢/١١

All Science Journal Classification (ASJC) codes

  • !!Theoretical Computer Science
  • !!Computer Science (all)

بصمة

أدرس بدقة موضوعات البحث “Computing mobile agent routes with node-wise constraints in distributed communication systems'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا