The performance of an FDDI LAN depends upon configuration and workload parameters such as the extent of the ring, the number of stations on the ring, the number of stations that are waiting to transmit, and the frame size. In addition, one key parameter that network managers can control to improve performance is the target token rotation time (TTRT). Analytical modeling and simulation methods w...

Abstract In this paper we focus on the behavior of the token leaky bucket mechanism with respect to second-order statistics of the departure process under various correlated cell arrival and deterministic token arrival distributions. We derive expressions for the lag-k auto-correlation of the inter-departure times for the token leaky bucket cell departure stream and we produce numerical example...

We derive the maximum entropy of a flow (information utility) which conforms to traffic constraints imposed by a generalized token bucket regulator, by taking into account the side information present in the randomness of packet lengths. Under constraints of maximum aggregate tokens and maximum aggregate bucket depth, information utility is maximized only if the generalized token bucket regulat...

Based on the framework of employing traffic shaping at the UE and policing at the RNC, we propose a local and global QoS-aware token bucket parameter determination technique for traffic conditioning in 3G wireless networks in this paper. The local QoS-awareness is achieved by the tradeoff between the shaping delay and the out-ofprofile probability at the token bucket traffic shaper, and the glo...

A semaphore is a data structure designed to track how many units of some resource are available. It also provides operations to increase or decrease the number, representing the creation or the consumption of that resource, respectively. A process that wishes to consume one unit of the resource, when none are available, will be blocked until one new unit of the resource is created. Semaphores a...

Self-stabilization was rst introduced by Dijkstra Dij74]: it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. In its pioneering paper, Dijkstra proposed three algorithms for token ring systems. Such systems are very useful to solve distributed mutual exclusion. Using the token deenition introduced by Dijkstra, i.e. t...

In a clustered wireless sensor network, multiple accesses at a time lead to collision. This could cause retransmit of lost packets. It increases power consumption, decreases sensor lifetime and delay in packet transmission. Basically sensors are not always need to send data. Suppose if an event occurs, then every sensor automatically accesses their base station simultaneously. It causes multipl...

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

This paper presents three distributed and decentralized strategies used for token traversal in spanning forest over Mobile Ad Hoc Delay Tolerant Networks. Such networks are characterized by behaviors like disappearance of mobile devices, connection disruptions, network partitioning, etc. Techniques based on tree topologies are well known for increasing the efficiency of network protocols and/or...