The Mobile Agent Rendezvous Problem in the Ring (Record no. 85997)

000 -LEADER
fixed length control field 03969nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-01999-9
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730164929.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2010 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031019999
-- 978-3-031-01999-9
082 04 - CLASSIFICATION NUMBER
Call Number 004
100 1# - AUTHOR NAME
Author Kranakis, Evangelos.
245 14 - TITLE STATEMENT
Title The Mobile Agent Rendezvous Problem in the Ring
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2010.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XVI, 106 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Distributed Computing Theory,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Models for Mobile Agent Computing -- Deterministic Rendezvous in a Ring -- Multiple Agent Rendezvous in a Ring -- Randomized Rendezvous in a Ring -- Other Models -- Other Topologies.
520 ## - SUMMARY, ETC.
Summary, etc Mobile agent computing is being used in fields as diverse as artificial intelligence, computational economics and robotics. Agents' ability to adapt dynamically and execute asynchronously and autonomously brings potential advantages in terms of fault-tolerance, flexibility and simplicity. This monograph focuses on studying mobile agents as modelled in distributed systems research and in particular within the framework of research performed in the distributed algorithms community. It studies the fundamental question of how to achieve rendezvous, the gathering of two or more agents at the same node of a network. Like leader election, such an operation is a useful subroutine in more general computations that may require the agents to synchronize, share information, divide up chores, etc. The work provides an introduction to the algorithmic issues raised by the rendezvous problem in the distributed computing setting. For the most part our investigation concentrates on the simplest case oftwo agents attempting to rendezvous on a ring network. Other situations including multiple agents, faulty nodes and other topologies are also examined. An extensive bibliography provides many pointers to related work not covered in the text. The presentation has a distinctly algorithmic, rigorous, distributed computing flavor and most results should be easily accessible to advanced undergraduate and graduate students in computer science and mathematics departments. Table of Contents: Models for Mobile Agent Computing / Deterministic Rendezvous in a Ring / Multiple Agent Rendezvous in a Ring / Randomized Rendezvous in a Ring / Other Models / Other Topologies.
700 1# - AUTHOR 2
Author 2 Krizanc, Danny.
700 1# - AUTHOR 2
Author 2 Marcou, Euripides.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-01999-9
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2010.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Coding theory.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Information theory.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data structures (Computer science).
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer Science.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Coding and Information Theory.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Data Structures and Information Theory.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2155-1634
912 ## -
-- ZDB-2-SXSC

No items available.