Journal ArticleDOI
A taxonomy of distributed termination detection algorithms
Jeff Matocha,Tracy Camp +1 more
Reads0
Chats0
TLDR
This methodology is intended to guide future research in DTD algorithms (since research continues on these algorithms) as well as to provide a classification survey for this area.About:
This article is published in Journal of Systems and Software.The article was published on 1998-11-30. It has received 229 citations till now. The article focuses on the topics: Distributed algorithm & Asynchronous communication.read more
Citations
More filters
Patent
Controlling the spread of interests and content in a content centric network
TL;DR: In this paper, the authors present a system for controlling the spread of interests and content in a content centric network (CCN), which maintains a routing policy for content data and receives a packet associated with a piece of content or an interest for the content.
Patent
Adaptive multi-interface use for content networking
TL;DR: In this article, a hierarchical structured variable-length identifier (HSVLI) is used to indicate a piece of content and indicate a hierarchical structure of contiguous components ordered from a most general level to a most specific level.
Patent
Ordered-element naming for name-based packet forwarding
TL;DR: In this paper, a name-based content-forwarding system generates an ordered-element name for a content item, and can process an interest to identify and perform an action that satisfies the interest.
Journal ArticleDOI
Pursuing scalability for hypre's conceptual interfaces
TL;DR: The data structures, parallel implementation, and resulting performance of the IJ, Struct and semiStruct interfaces are described, which investigates their scalability, presents successes as well as pitfalls of some of the approaches and suggests ways of dealing with them.
Patent
Reputation-based strategy for forwarding and responding to interests over a content centric network
Priya Mahadevan,Glenn C. Scott +1 more
TL;DR: In this paper, a CCN network node uses reputation values for one or more interfaces to determine how to forward an Interest or Content Object via a network interface, and selects a candidate outbound face with a reputation value exceeding a first predetermined threshold.
References
More filters
Book
Introduction to Algorithms
TL;DR: The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures and presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers.
Journal ArticleDOI
Communicating sequential processes
TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.