Directed network protocols

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 01 Jan 1988Publisher:Springer Berlin Heidelberg

Authors: Gerard Tel;

doi: 10.1007/bfb0019791

Directed network protocols

- Summary
- Metrics

Abstract

We present a uniform approach to the description and validation of several known and unknown distributed algorithms for solving control problems in computer networks using unidirectional communication. After introducing two basic protocols, we use these to build algorithms for Resynch [Fi79], Connectivity, Min Hop Routing and Distributed Infimum Approximation [Te86]. All protocols are extended in a uniform way to cope with changing network topology and the failure of nodes and links. The protocols are all optimal in time complexity.

Related Organizations

Utrecht University
Netherlands

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average