The Experts below are selected from a list of 44799 Experts worldwide ranked by ideXlab platform
Xianbing Wang - One of the best experts on this subject based on the ideXlab platform.
-
a framework of using cooperating Mobile Agents to achieve load sharing in distributed web server groups
Future Generation Computer Systems, 2004Co-Authors: Xianbing WangAbstract:This paper studies the issues of using Mobile Agents to achieve load sharing for network services in a wide-area network environment such as the Internet. Traditionally, load sharing algorithms are based on the message-passing paradigm. In this paper, we propose the use of Mobile Agents as an aid to design fully distributed and dynamic load-sharing mechanisms for wide-area network services, which provide several advantages over the pure message-passing-based approach. A framework (called MALS--Mobile agent-enabled load-sharing) for structuring and designing load sharing in wide-area network services is presented. In particular, we describe the design of a Mobile agent-enabled distributed dynamic load-sharing scheme within the MALS framework. A simulation environment of the load-sharing protocol is being implemented using AgletTM, a Java-compliant Mobile agent platform from IBM. Preliminary experimental results demonstrated that the proposed framework is effective.
-
a framework of using cooperating Mobile Agents to achieve load sharing in distributed web server groups
International Conference on Algorithms and Architectures for Parallel Processing, 2002Co-Authors: Xianbing WangAbstract:This paper studies the issues of using Mobile Agents to achieve load sharing for network services in a wide-area network environment such as the Internet. Traditionally, load sharing algorithms are based on the message-passing paradigm. In this paper, we propose the use of Mobile Agents as an aid to design fully distributed and dynamic load-sharing mechanisms for wide-area network services, which provide several advantages over the pure message passing-based approach. A framework (called MALS-Mobile agent-enabled load sharing) for structuring and designing load sharing in wide-area network services is presented. In particular, we describe the design of a Mobile agent-enabled distributed dynamic load sharing scheme within the MALS framework. A simulation environment of the load sharing protocol is being implemented using Aglet/spl trade/, a Java-compliant Mobile agent platform from IBM. Preliminary experimental results demonstrated that the proposed framework is effective.
Andrzej Pelc - One of the best experts on this subject based on the ideXlab platform.
-
decidability classes for Mobile Agents computing
Journal of Parallel and Distributed Computing, 2017Co-Authors: Pierre Fraigniaud, Andrzej PelcAbstract:Abstract We establish a classification of decision problems that are to be solved by Mobile Agents operating in unlabeled graphs, using a deterministic protocol. The classification is with respect to the ability of a team of Agents to solve decision problems, possibly with the aid of additional information. In particular, our focus is on studying differences between the decidability of a decision problem by Agents and its verifiability when a certificate for a positive answer is provided to the Agents (the latter is to the former what NP is to P in the framework of sequential computing). We show that the class MAV of Mobile Agents verifiable problems is much wider than the class MAD of Mobile Agents decidable problems. Our main result shows that there exist natural MAV-complete problems: the most difficult problems in this class, to which all problems in MAV are reducible via a natural Mobile computing reduction. Beyond the class MAV we show that, for a single agent, three natural oracles yield a strictly increasing chain of relative decidability classes.
-
tree exploration by a swarm of Mobile Agents
International Conference on Principles of Distributed Systems, 2012Co-Authors: Jurek Czyzowicz, Andrzej Pelc, Melanie RoyAbstract:A swarm of Mobile Agents starting at the root of a tree has to explore it: every node of the tree has to be visited by at least one agent. In every round, each agent can remain idle or move to an adjacent node. In any round all Agents have to be at distance at most d, where d is a parameter called the range of the swarm. The goal is to explore the tree as fast as possible.
-
decidability classes for Mobile Agents computing
Latin American Symposium on Theoretical Informatics, 2012Co-Authors: Pierre Fraigniaud, Andrzej PelcAbstract:We establish a classification of decision problems that are to be solved by Mobile Agents operating in unlabeled graphs, using a deterministic protocol. The classification is with respect to the ability of a team of Agents to solve the problem, possibly with the aid of additional information. In particular, our focus is on studying differences between the decidability of a decision problem by Agents and its verifiability when a certificate for a positive answer is provided to the Agents. Our main result shows that there exists a natural complete problem for Mobile agent verification. We also show that, for a single agent, three natural oracles yield a strictly increasing chain of relative decidability classes.
-
decidability classes for Mobile Agents computing
arXiv: Distributed Parallel and Cluster Computing, 2010Co-Authors: Pierre Fraigniaud, Andrzej PelcAbstract:We establish a classification of decision problems that are to be solved by Mobile Agents operating in unlabeled graphs, using a deterministic protocol. The classification is with respect to the ability of a team of Agents to solve the problem, possibly with the aid of additional information. In particular, our focus is on studying differences between the decidability of a decision problem by Agents and its verifiability when a certificate for a positive answer is provided to the Agents. We show that the class MAV of Mobile Agents verifiable problems is much wider than the class MAD of Mobile Agents decidable problems. Our main result shows that there exist natural MAV-complete problems: the most difficult problems in this class, to which all problems in MAV are reducible. Our construction of a MAV-complete problem involves two main ingredients in Mobile Agents computability: the topology of the quotient graph and the number of operating Agents. Beyond the class MAV we show that, for a single agent, three natural oracles yield a strictly increasing chain of relative decidability classes.
Yusuke Kobayashi - One of the best experts on this subject based on the ideXlab platform.
-
fence patrolling by Mobile Agents with distinct speeds
Distributed Computing, 2015Co-Authors: Akitoshi Kawamura, Yusuke KobayashiAbstract:Suppose we want to patrol a fence (line segment) using $$k$$k Mobile Agents with given speeds $$v _1$$v1, ..., $$v _k$$vk so that every point on the fence is visited by an agent at least once in every unit time period. Czyzowicz et al. conjectured that the maximum length of the fence that can be patrolled is $$(v _1 + \cdots + v _k)/2$$(v1+?+vk)/2, which is achieved by the simple strategy where each agent $$i$$i moves back and forth in a segment of length $$v _i / 2$$vi/2. We disprove this conjecture by a counterexample involving $$k = 6$$k=6 Agents. We also show that the conjecture is true for $$k \le 3$$k≤3.
-
fence patrolling by Mobile Agents with distinct speeds
arXiv: Computational Geometry, 2014Co-Authors: Akitoshi Kawamura, Yusuke KobayashiAbstract:Suppose we want to patrol a fence (line segment) using k Mobile Agents with given speeds v_1, ..., v_k so that every point on the fence is visited by an agent at least once in every unit time period. Czyzowicz et al. conjectured that the maximum length of the fence that can be patrolled is (v_1 + ... + v_k)/2, which is achieved by the simple strategy where each agent i moves back and forth in a segment of length v_i/2. We disprove this conjecture by a counterexample involving k = 6 Agents. We also show that the conjecture is true for k = 2, 3.
-
fence patrolling by Mobile Agents with distinct speeds
International Symposium on Algorithms and Computation, 2012Co-Authors: Akitoshi Kawamura, Yusuke KobayashiAbstract:Suppose we want to patrol a fence (line segment) using k Mobile Agents with speeds v 1, …, v k so that every point on the fence is visited by an agent at least once in every unit time period. Czyzowicz et al. conjectured that the maximum length of the fence that can be patrolled is (v 1 + … + v k ) / 2, which is achieved by the simple strategy where each agent i moves back and forth in a segment of length v i / 2. We disprove this conjecture by a counterexample involving k = 6 Agents. We also show that the conjecture is true for k ≤ 3.
Rafael Alonso - One of the best experts on this subject based on the ideXlab platform.
-
profile based security against malicious Mobile Agents
Lecture Notes in Computer Science, 2006Co-Authors: Glena Greene, Rafael AlonsoAbstract:In this paper we describe a security system against malicious Agents in a wireless ad hoc network. This system monitors the activities of Mobile Agents. By mining the log data, the system builds dynamic behavioral profiles for each class of Agents. The profiles are then used to classify each agent instance and detect anomalous Agents. The malicious nature of identified anomalous Agents are further determined by a threat assessment module. For Mobile agent profiling, we presented two approaches: one based on rule-learning and another on histograms of features related each agent class. We have implemented a prototype system using the histogram-based approach. The prototype is also described in the paper.
Tony White - One of the best experts on this subject based on the ideXlab platform.
-
Mobile Agents for network management
IEEE Communications Surveys and Tutorials, 1998Co-Authors: Andrzej Bieszczad, B Pagurek, Tony WhiteAbstract:In this article we discuss the potential uses of Mobile Agents in network management and define software Agents and a navigation model that determines agent mobility. We list a number of potential advantages and disadvantages of Mobile Agents and include a short commentary on the ongoing standardization activity. The core of this article comprises descriptions of several actual and potential applications of Mobile Agents in the five OSI functional areas of network management. A brief review of other research activity in the area and prospects for the future conclude the presentation.
