Distributed network protocols
DOI10.1109/TIT.1983.1056620zbMATH Open0531.94026OpenAlexW2052504823MaRDI QIDQ3313789FDOQ3313789
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
updatingdistributed protocolscommunication systemschangeable net topologiescommunication netsconnectivity testshortest paths search
Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05) Applications of graph theory to circuits and networks (94C15)
Cited In (34)
- The local detection paradigm and its applications to self-stabilization
- The expressive power of snap-stabilization
- Deterministic Leader Election in Programmable Matter
- Efficiency of semisynchronous versus asynchronous networks
- Efficient communication in unknown networks
- ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- A modular framework for verifying versatile distributed systems
- Distributed shortest-path protocols for time-dependent networks
- The power of multimedia: Combining point-to-point and multi-access networks
- Distributed distance computation and routing with small messages
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms
- The wake up and report problem is time-equivalent to the firing squad synchronization problem
- Snap-stabilization and PIF in tree networks
- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages
- On the memory overhead of distributed snapshots
- The first fully polynomial stabilizing algorithm for BFS tree construction
- A new optimal distributed algorithm for the set intersection problem
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- Two distributed problems involving Byzantine processes
- ADAPTIVE DISTRIBUTED MUTUAL EXCLUSION BY DYNAMIC TOPOLOGY SWITCHING
- Termination of amnesiac flooding
- Optimized silent self-stabilizing scheme for tree-based constructions
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST
- Exact communication costs for consensus and leader in a tree
- Self-stabilizing leader election in polynomial steps
- A mechanical proof of Segall's PIF algorithm
- Bounded time-stamps
- A principle for sequential reasoning about distributed algorithms
- On the complexity of global computation in the presence of link failures: the general case
- Performance evaluation of fault-tolerant routing algorithms: an optimization problem
- Petri net based verification of distributed algorithms: An example
- Location of central nodes in time varying computer networks
- Time-Efficient Broadcast in Radio Networks
This page was built for publication: Distributed network protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3313789)
