In this paper we illustrate a novel Wireless Local Area Network Multiple Access Control (WLAN MAC) protocol whose allocation policy adopts a strategy similar to the token ring: the mobile stations access the channel upon receiving the token and release the channel by passing the token to the next user. The traffic is divided in two classes: Guaranteed Bandwidth (GB) and Best Effort (BE). The ba...

Girard’s Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming languages. One way is to use abstract machines that pass a token in a fixed graph, along a path indicated by the GoI. These token-passing abstract machines are space efficient, because they handle duplicated computation by repeating the same moves of a token on...

The problems of Permutation Routing via Matching and Token Swapping are reconfiguration problems on graphs. This paper is concerned with the complexity of those problems and a colored variant. For a given graph where each vertex has a unique token on it, those problems require to find a shortest way to modify a token placement into another by swapping tokens on adjacent vertices. While all pair...

In this paper, we describe systems for automatic labeling of time expressions occurring in English and Chinese text as specified in the ACE Temporal Expression Recognition and Normalization (TERN) task. We cast the chunking of text into time expressions as a tagging problem using a bracketed representation at token level, which takes into account embedded constructs. We adopted a left-to-right,...

The Token Passing MAC protocol for Ad Hoc networks (T-MAH), discussed in this paper, is a distributed medium access protocol designed for wireless multi-hop networks. With T-MAH access scheme the network is organized in clusters (called Token Groups) with a Token Group Head as the leader of the group. In each single cluster is used a token based technique, i.e. each node in the cluster is allow...

This paper presents the design and first experimental results of VTPE (Virtual Token-passing Ethernet). VTPE is a deterministic protocol for real-time applications based on shared Ethernet, aimed to be used either in small processing power processors or in powerful ones. It is based on implicit token rotation similar to the virtual token-passing used in the P-NET protocol. The VTPE implementati...

Our protocol is a randomized self-stabilizing, meaning that starting from an arbitrary configuration (in response to an arbitrary perturbation modifying the memory state), it reaches (with probability 1) a legitimate configuration (i.e. a configuration with only one token in the network). Once the system is stabilized the circulation of the sole token is 1-fair (i.e. in every round, every proce...

This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate upto k site/link failures. The algorithm uses many features of the token based algorithm by Raymond 5] and inherits many of its advantages , viz. simplicity of the token message and the local data structure at each site. Correctness proofs of the algorithm and complexity analysis are included.

that there is no stabilizing token ring whose processes are all identical and where the number of processes in the ring is a composite number. The problem can be solved, however, in some special cases. In particular, Burns and Pachl have shown in [BP89] that problem (i) can be solved if the number of processes is a prime number. Their solution still suffers from problems (ii) and (iii). Problem...

We design two mutual exclusion algorithms for wireless networks. Our mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages is exploited. The design goal is to decrease th...