Efficient Routing of Mobile Agents for Agent-Based Integrated Enterprise Management: A General Acceleration Technique

Elalouf, Amir; Levner, Eugene; Cheng, T.C.E.

doi:10.1007/978-3-642-24175-8_1

Cited by 9 publications

(19 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…N the context of distributed computer communication networks, we define an agent as "a human or software system that communicates and cooperates with other human or software systems to solve a complex problem that is beyond the capability of each individual system" [1]. This definition is compatible with the definitions given by Jennings and Wooldridge [2], Shen et al [3][4][5], and Peng et al [6].…”

Section: Introductionsupporting

confidence: 60%

“…This technique is similar to that presented by Elalouf et al [1]. Note, however, that the type of problem treated in the present paper is more practical than that in [1].…”

Section: A General Description Of the Fptassupporting

confidence: 46%

“…Note, however, that the type of problem treated in the present paper is more practical than that in [1]. First, the problem considered here is of a stochastic nature, so it is described by a non-linear constraint.…”

Section: A General Description Of the Fptasmentioning

confidence: 90%

“…To maximize the total benefit generated from agent travel, subject to the condition that the total travel time (sometimes called "delay") does not exceed a given threshold. Such a problem has been studied by Camponogara and Shima [12] and by Elalouf and Levner [1].…”

Section: Related Workmentioning

confidence: 99%

“…The interval partitioning technique was originally proposed by Sahni [24] for the Knapsack problem and was later improved by Gens and Levner [21], Levner et al [25], and Elalouf et al [1]. We suggest a scheme that consists of three main stages:…”

Section: A General Description Of the Fptasmentioning

confidence: 99%

See 4 more Smart Citations

Efficient Routing of Mobile Agents in a Stochastic Network

Elalouf¹,

Levner²,

Cheng³

2013

Polibits

Self Cite

View full text Add to dashboard Cite

Abstract-Mobile agents are autonomous programs that may be dispatched through computer networks. Using a mobile agent is a potentially efficient method to perform transactions and retrieve information in networks. Unknown congestion in a network causes uncertainty in the routing times of mobile agents so the routing of mobile agents cannot rely solely on the average travel time. In this paper we deal with a given stochastic network in which the mobile agent routing time is a random variable. Given pre-specified values R and PR, the objective is to find the path with the minimum expected time under the constraint that the probability that the path time is less than R is at least PR. We show that this problem is NP-hard, and construct an exact pseudo-polynomial algorithm and an ε-approximation algorithm (FPTAS) for the problem.Index Terms-Agent-based architecture, fast routing algorithm, FPTAS, stochastic routing.

show abstract

Section: Introductionsupporting

confidence: 60%

“…This technique is similar to that presented by Elalouf et al [1]. Note, however, that the type of problem treated in the present paper is more practical than that in [1].…”

Section: A General Description Of the Fptassupporting

confidence: 46%

Section: A General Description Of the Fptasmentioning

confidence: 90%

Section: Related Workmentioning

confidence: 99%

Section: A General Description Of the Fptasmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Routing of Mobile Agents in a Stochastic Network

Elalouf¹,

Levner²,

Cheng³

2013

Polibits

Self Cite

View full text Add to dashboard Cite

show abstract

A Multi-agent Scheduling Model for Maximizing Agent Satisfaction

Levner

Elalouf

Tang

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Fast approximation algorithms for routing problems with hop-wise constraints

Elalouf

2013

Ann Oper Res

Self Cite

View full text Add to dashboard Cite

Given a graph G(N, A) with a cost (or benefit) and a delay on each arc, the constrained routing problem (CRP) aims to find a minimum-cost or a maximum-benefit path from a given source to a given destination node, subject to an end-to-end delay constraint. The problem (with a single constraint) is NP-hard, and has been studied by many researchers who found fully polynomial approximation schemes (FPAS) for this problem. The current paper focuses on a generalized CRP version, CRP with hop-wise constraints (CRPH). In the generalized version, instead of one constraint there are up to n − 1 special-type constraints, where n is the number of nodes. An FPAS based on interval partitioning is proposed for both the minimization and the maximization versions of CRPH. For G(N, A) with n nodes and m arcs, the complexity of the algorithm is O(mn 2 /ε).

show abstract

Efficient Routing of Mobile Agents for Agent-Based Integrated Enterprise Management: A General Acceleration Technique

Cited by 9 publications

References 15 publications

Efficient Routing of Mobile Agents in a Stochastic Network

Efficient Routing of Mobile Agents in a Stochastic Network

A Multi-agent Scheduling Model for Maximizing Agent Satisfaction

Fast approximation algorithms for routing problems with hop-wise constraints

Contact Info

Product

Resources

About