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...

We study how to spread k tokens of information to every node on an n-node dynamic network, the edges of which are changing at each round. This basic gossip problem can be completed in O(n+k) rounds in any static network, and determining its complexity in dynamic networks is central to understanding the algorithmic limits and capabilities of various dynamic network models. Our focus is on token-...

Schedulers for distributed real-time database systems must satisfy timing constraints of transactions and preserve data consistency. This paper presents a replication control algorithm, which integrates real-time scheduling and replication control. The algorithm adopts a majority consensus scheme for replication control and employs epsilon-serializability, a correctness criterion which is less ...

In this note we discuss the problem of indexing information from the Internet, with the goal of delivering personalized content to users of an Internet-based travel support system. We introduce the form of index tokens that will be stored in the system and describe an agent-based subsystem designed to support the indexing function.

This paper describes the use of statistical language modeling techniques, such as are commonly used for text compression, to extract meaningful, low-level, information about the location of semantic tokens, or “entities,” in text. We begin by marking up several different token types in training documents—for example, people’s names, dates and time periods, phone numbers, and sums of money. We f...

When designing real-time communication protocols, the primary objective is to guarantee the deadlines of synchronous messages while sustaining a high aggregate throughput. In this paper, we study two token ring protocols for their suitability in real-time systems. The priority driven protocol (e.g., IEEE 802.5) allows implementation of a priority based real-time scheduling discipline like the r...

Network services with deterministic guarantees are based on a worst-case description of user-generated traffic. When designing a policing and scheduling algorithm for guaranteed services on the Internet, accuracy of description of the traffic profile has to be traded with simplicity of implementation. The result of this trade off is often expressed as the number of token buckets required by the...

In this paper we propose a delay-constrained distributed multicast routing algorithm based on token passing. This algorithm is fully distributed and generates a multicast routing tree, which not only meets the realtime requirement, but also has a sub-optimal network cost. Simulations have been done and the results have shown that the multicast routing tree generated by our algorithm has better ...

A reliable multicast protocol (RMP) based on a logical token ring approach can achieve agreement of a group of operational processes in distributed systems. The structure of RMP is modulated into component protocols that achieve total ordering, atomicity of multicast messages; dynamic group configuration and fault-tolerance cooperatively. RMP uses a virtual token to order multicast messages in ...

In this paper, we propose a node architecture and a token-based algorithm to access the shared medium in an optical ring network. The algorithm is based on a reservation scheme. However, unlike other reservation schemes which operate in three stages viz. reserve, transmit and release, the proposed scheme operates in two stages viz. reserve and transmit and does not explicitly release the reserv...