Distributed network protocols

DOI10.1109/TIT.1983.1056620zbMath0531.94026OpenAlexW2052504823MaRDI QIDQ3313789

Adrian Segall

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1983.1056620

zbMATH Keywords

updatingcommunication systemsdistributed protocolschangeable net topologiescommunication netsconnectivity testshortest paths search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Communication theory (94A05)

Related Items (34)

The expressive power of snap-stabilization ⋮ A principle for sequential reasoning about distributed algorithms ⋮ A mechanical proof of Segall's PIF algorithm ⋮ Petri net based verification of distributed algorithms: An example ⋮ Efficiency of semisynchronous versus asynchronous networks ⋮ The local detection paradigm and its applications to self-stabilization ⋮ Termination of amnesiac flooding ⋮ Distributed distance computation and routing with small messages ⋮ An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages ⋮ Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms ⋮ Snap-stabilization and PIF in tree networks ⋮ On the complexity of global computation in the presence of link failures: the general case ⋮ Distributed shortest-path protocols for time-dependent networks ⋮ The wake up and report problem is time-equivalent to the firing squad synchronization problem ⋮ A new optimal distributed algorithm for the set intersection problem ⋮ ADAPTIVE DISTRIBUTED MUTUAL EXCLUSION BY DYNAMIC TOPOLOGY SWITCHING ⋮ Two distributed problems involving Byzantine processes ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Efficient communication in unknown networks ⋮ Self-stabilizing leader election in polynomial steps ⋮ Performance evaluation of fault-tolerant routing algorithms: an optimization problem ⋮ A modular framework for verifying versatile distributed systems ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ A distributed dual ascent algorithm for Steiner problems in multicast routing ⋮ The power of multimedia: Combining point-to-point and multi-access networks ⋮ On the memory overhead of distributed snapshots ⋮ Bounded time-stamps ⋮ Deterministic Leader Election in Programmable Matter ⋮ Time-Efficient Broadcast in Radio Networks ⋮ Optimized silent self-stabilizing scheme for tree-based constructions ⋮ Exact communication costs for consensus and leader in a tree ⋮ ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS ⋮ Location of central nodes in time varying computer networks

This page was built for publication: Distributed network protocols