Rendezvous in networks in spite of delay faults

Two mobile agents, starting from different nodes of an unknown network, have to meet at a node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Distributed computing Jg. 29; H. 3; S. 187 - 205
Hauptverfasser:	Chalopin, Jérémie, Dieudonné, Yoann, Labourel, Arnaud, Pelc, Andrzej
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2016 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Delay Faults Labels Multiagent Systems Networks Polynomials Rendezvous Software Engineering/Programming and Operating Systems Theory of Computation Trees Mobile agent Rendezvous Deterministic algorithm Delay fault
ISSN:	0178-2770, 1432-0452
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!