We consider the combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) under nonstationary conditions. A fluid flow model in state variable form describes the time ...

In this paper we extend earlier results on combined control problem of connection admission, flow rate, and bandwidth allocation (capacity, service-rate) in ATM based networks under nonstationary conditions to the multiple ...

In current distributed systems, the notion of mobility is emerging in many forms and applications. Mobility arises naturally in wireless computing since the location of users changes as they move. Besides mobility in ...

In this paper we address the congestion control problem in computer networks offering a single class of best effort service. The problem is viewed as a resource allocation problem. The objective is to distribute the available ...

The problem of routing in congested communication networks was studied. A noncooperative network consisting of a set of m parallel links within a game theoretic framework was considered for analysis. A collection of n ...

In this paper we present a new queue length based Internet congestion control protocol which is shown through simulations to work effectively. The control objective is to regulate the queue size at each link so that it ...

In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...

An atomic commit protocol can ensure that all participants in a distributed transaction reach consistent states, whether or not system or network failures occur. The atomic commit protocol used in industry and academia is ...

We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas of all players involve a ground set of ...