Recent studies on the practice of shaping subscribers’ traffic by Internet service providers (ISPs) give a new insight into the actual performance of broadband access networks at a packet level. Unlike metro and backbone networks, however, access networks directly interface with end-users, so it is important to base the study and design of access networks on the behaviors of and the actual perf...

A simple and cheap algorithm is presented to allow prioritized mutual exclusion. There are several groups. All the members of a same group have the same level priority. Our algorithm is a token-based algorithm. Each group of participants (site) is represented by a tree structure. Inside a group, the requests are recorded in a global queue which circulates simultaneously and together with the to...

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

Efficient coordination among large numbers of heterogeneous agents promises to revolutionize the way in which some complex tasks, such as responding to urban disasters can be performed. Token-based approaches have shown to be a novel and promising way for such coordination. However, previous token-based algorithms were built on heuristics and did not explicitly consider utilities related to tok...

We analyze a simple random process in which a token is moved in the interval A = [0, n]: Fix a probability distribution µ over [1, n]. Initially, the token is placed in a random position in A. In round t, a random value d is chosen according to µ. If the token is in position a ≥ d, then it is moved to position a−d. Otherwise it stays put. Let T be the number of rounds until the token reaches po...

Computer networks can be built using either wired or wireless technology. Although wired network has been the traditional choice, wireless technologies are becoming more popular. The primary purpose of this paper is to analyze the impact of a wired access method Carrier Sense Multiple Access with Collision Detection (CSMA/CD) protocol and Token Ring protocol on the performance of an integrated ...

Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n) token swaps, and thus focus on the problem of minimizing the number of token swaps to reach the target tok...

We analyze a simple random process in which a token is moved in the interval A = {0, . . . , n}: Fix a probability distribution μ over {1, . . . , n}. Initially, the token is placed in a random position in A. In round t, a random value d is chosen according to μ. If the token is in position a ≥ d, then it is moved to position a − d. Otherwise it stays put. Let T be the number of rounds until th...

This paper presents solutions based on request based token control strategy for controlling the allocation of a single shared resource in logically interconnected networks such as single side wrap around mesh and regular mesh. In this strategy, a processor which is in need of the shared resource, sends a request to inform the token of the access request. Token, on receipt of a request, continue...

In this paper, a new hybrid algorithm that combines both token-based and character-based approaches is presented. The basic Levenshtein approach also has been extended to the token-based distance metric. The distance metric is enhanced to set the proper granularity level behavior of the algorithm. It smoothly maps a threshold of misspelling differences at the character level and the importance ...