Move-optimal gossiping among mobile agents

  • Authors:

  • Tomoko Suzuki;Taisuke Izumi;Fukuhito Ooshita;Hirotsugu Kakugawa;Toshimitsu Masuzawa

  • Affiliations:

  • Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka, 560-8531, Japan;Graduate School of Engineering, Nagoya Institute of Technology, Gokiso-tyo, Syowa-ku, Nagoya, 466-8555, Japan;Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka, 560-8531, Japan;Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka, 560-8531, Japan;Graduate School of Information Science and Technology, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka, 560-8531, Japan

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

Mobile-agent-based distributed systems are attracting widespread attention because of their adaptability and flexibility; mobile agents traverse the system and carry out a task at each node. In mobile-agent-based systems, gossip is a fundamental task in cooperation among mobile agents. It requires one to accomplish all-to-all information exchange over all agents so that each agent can obtain the information each agent initially has. While rendezvous algorithms, which require that all agents rendezvous on a node at the same time, can achieve this requirement, it takes excessive cost for our objective. In this paper, we introduce the mobile agent gossip problem, in which each agent must obtain the information all other agents have. Each agent p"i can obtain the information of p"j(p"i) by meeting p"j itself or any agent that already has information of p"j. Thus, the gossip is expected to accomplish the all-to-all information exchange with a smaller number of agents' moves than the rendezvous algorithms. In this paper, we investigate the complexity of the mobile agent gossip problem in terms of the total number of moves performed by agents. For several network topologies, we show the asymptotically tight upper and lower bounds for move complexity. This result is obtained from the fact that the mobile agent gossip problem and the node leader election problem is reducible to each other.