A new algorithm has been designed for providing optimal allocation of tokens for TCP traffic in DiffServ networks, which is aimed at minimizing the packet losses of the individual flows. The optimality in token allocation is achieved using optimization technique employing Genetic Algorithm (GA). The transient performance of the proposed algorithm has been evaluated through Matlab simulation. It...

Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding ...

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

In this paper, an attempt has been made to design an algorithm that provides optimal allocation of tokens to the individual long live TCP flows in Differentiated Services (DiffServ) networks. The optimality in token allocation is achieved using an optimization technique that employs Genetic Algorithm (GA). The trial performance of the proposed algorithm has been evaluated through C++ simulation...

Given a graph G = (V,E) with V = {1, . . . , n}, we place on every vertex a token T1, . . . , Tn. A swap is an exchange of tokens on adjacent vertices. We consider the algorithmic question of finding a shortest sequence of swaps such that token Ti is on vertex i. We are able to achieve essentially matching upper and lower bounds, for exact algorithms and approximation algorithms. For exact algo...

Given a graph G = (V,E) with V = {1, . . . , n}, we place on every vertex a token T1, . . . , Tn. A swap is an exchange of tokens on adjacent vertices. We consider the algorithmic question of finding a shortest sequence of swaps such that token Ti is on vertex i. We are able to achieve essentially matching upper and lower bounds, for exact algorithms and approximation algorithms. For exact algo...