000 03969nam a22005415i 4500
001 978-3-031-01999-9
003 DE-He213
005 20240730164929.0
007 cr nn 008mamaa
008 220601s2010 sz | s |||| 0|eng d
020 _a9783031019999
_9978-3-031-01999-9
024 7 _a10.1007/978-3-031-01999-9
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aCOM000000
_2bisacsh
072 7 _aUY
_2thema
082 0 4 _a004
_223
100 1 _aKranakis, Evangelos.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_930615
245 1 4 _aThe Mobile Agent Rendezvous Problem in the Ring
_h[electronic resource] /
_cby Evangelos Kranakis, Danny Krizanc, Euripides Marcou.
250 _a1st ed. 2010.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2010.
300 _aXVI, 106 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Distributed Computing Theory,
_x2155-1634
505 0 _aModels 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 _aMobile 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.
650 0 _aComputer science.
_99832
650 0 _aCoding theory.
_94154
650 0 _aInformation theory.
_914256
650 0 _aData structures (Computer science).
_98188
650 1 4 _aComputer Science.
_99832
650 2 4 _aCoding and Information Theory.
_986720
650 2 4 _aData Structures and Information Theory.
_931923
700 1 _aKrizanc, Danny.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_986723
700 1 _aMarcou, Euripides.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_986725
710 2 _aSpringerLink (Online service)
_986727
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031008719
776 0 8 _iPrinted edition:
_z9783031031274
830 0 _aSynthesis Lectures on Distributed Computing Theory,
_x2155-1634
_986729
856 4 0 _uhttps://doi.org/10.1007/978-3-031-01999-9
912 _aZDB-2-SXSC
942 _cEBK
999 _c85997
_d85997