Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-perfect token distribution problem redistributes the tokens in a minimum number of steps, so that, at the end, no more than O(l) tokens reside at each node. (In perfect distribution, at the end, exactly one token resid...

Suppose that we are given two independent sets I0 and Ir of a graph such that |I0| = |Ir|, and imagine that a token is placed on each vertex in I0. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms I0 into Ir so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This ...

We address the problem of building and maintaining a forest of spanning trees in highly dynamic networks, in which topological events can occur at any time and any rate, and no stable periods can be assumed. In these harsh environments, we strive to preserve some properties such as cycle-freeness or existence of a unique root in each fragment regardless of the events, so as to keep these fragme...

Passive RFID systems used for list organization and benefit tracking normally use contention-based MAC protocols, such as the normal C1G2 protocol. Although the C1G2 protocol has the benefit that it is easy to apply, it suffers from wrongness and relatively low throughput when the number of tags in the network increases. It proposes a token-based MAC protocol called Token-MAC for passive RFID s...

By run-time characteristic analysis of parallel workloads, we found that a majority of shared data accesses of parallel workload has temporal locality. Based on this characteristic, we present a sharing relation cache (SRC for short) based CMP architecture, saving recently used sharing relations to provide destination set information for following cache-to-cache miss requests. Token-SRC protoco...

This paper describes a new mechanism to garantee quality of service for multimedia streams in low-cost home networks. Quality of service is based on a token, of which the route in the network is determined by a distributed scheduler. The network node that has the token –the active node– can send its data during a predetermined period. The length of this period and which node gets the token next...

We study a new network architecture based on standard FDDI networks. This network, called FDDI-based reconfigurable network (FBRN), is constructed using multiple FDDI token rings and has the ability to reconfigure itself in the event of extensive damage to the network. Thus, an FBRN has the potential to provide high available bandwidth even in the presence of numerous faults. Realization of thi...

This paper concerns two fundamental problems in distributed computing—mutual exclusion and mobile object tracking. For a variant of the mutual exclusion problem where the network topology is taken into account, all existing distributed solutions make use of tokens. It turns out that these token-based solutions for mutual exclusion can also be adapted for object tracking, as the token behaves ve...

This article presents a description and performance evaluation of an efficient distributed dynamic channels allocation (DDCA) scheme, which can be used for channel allocation in cellular communication networks (CCNs), such as the global system for mobile communication (GSM). The scheme utilizes a well-known distributed artificial intelligence (DAI) algorithm, namely, the asynchronous weak-commi...