To avoid the well-known implosion problem, the majority of reliable multicast protocols use hierarchical structures to pass acknowledgment messages back to the sender. In most cases, a technique called expanding ring search (ERS) is used to construct the acknowledgment tree. In this paper we analyse ERS by simulation studies. ERS is a simple and fault tolerant approach, but our simulation resul...

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clu...

In this paper, we investigate random walk based token circulation in dynamic environments subject to failures. We describe hypotheses on the dynamic environment that allow random walks to meet the important property that the token visits any node infinitely often. The randomness of this scheme allows it to work on any topology, and require no adaptation after a topological change, which is a de...

For Orc, a language for orchestrating concurrent computations, a “token semantics” is presented. This semantic model preserves the original program text during evaluation, rather than reducing the given program to its evaluated value.

THIS PAPER PROPOSES PARTIAL ANSWERS TO THE FOLLOWING QUESTIONS: in what senses can fitness differences plausibly be considered causes of evolution?What relationships are there between fitness concepts used in empirical research, modeling, and abstract theoretical proposals? How does the relevance of different fitness concepts depend on research questions and methodological constraints? The pape...

Using the frameworK of cyclic-service systems with a single server, two different token-passing models are investigated. The first model is approximate, obtaining the free-taken's cycle-time distribution on an asymmetric system with infinite capacity buffers and single-token operation. The second model is exact. yielding the cycle-time distribution of the free-token on an asymmetric system with...

Optical burst switching(OBS) is considered as one of preferable network technologies for the next generation Internet. The Internet has two traffic classes, i.e. real-time bursts and reliable bursts. It is an important subject for OBS to achieve cooperated operation of real-time bursts and reliable bursts. In this paper, we proposes a new effective traffic control method named Separate TB+LB (T...

This paper shows the current state of our research into a home network which provides both real-time and non-realtime capabilities for one coherent, distributed architecture. It is based on a new type of real-time token protocol that uses scheduling to achieve optimal token-routing in the network. Depending on the scheduling algorithm, bandwidth utilisations of 100% are possible. Token manageme...

We present a self-stabilizing token circulation protocol on unidirectional anonymous rings. This protocol does not required processor identifiers, no distinguished processor (i.e. all processors perform the same algorithm). The protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), i...