Browsing by Subject "Congestion control (communication)"
Now showing items 21-37 of 37
-
Conference Object
Integrated control of connection admission, flow rate, and bandwidth for ATM based networksAAA
(1996)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 ...
-
Conference Object
Integrated switching strategy for ABR traffic control in ATM networks
(1997)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 ...
-
Conference Object
Integrated switching strategy for ABR traffic control in ATM networksAAA
(1997)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 ...
-
Conference Object
Intelligent control techniques for efficient regulation of ABR queue length in ATM switches
(1997)Designing effective congestion control strategies for broadband networks is known to be difficult because of the variety of dynamic parameters involved such as link speeds, burstiness of the traffic, the distances between ...
-
Article
Locating objects in mobile computing
(2001)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 ...
-
Article
A new estimation scheme for the effective number of users in internet congestion control
(2011)Many congestion control protocols have been recently proposed in order to alleviate the problems encountered by TCP in high-speed networks and wireless links. Protocols utilizing an architecture that is in the same spirit ...
-
Conference Object
On a hybrid model for max-min congestion controllers
(2004)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 ...
-
Conference Object
On a hybrid model for max-min congestion controllersAAA
(2004)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 ...
-
Conference Object
The price of selfish routing
(2001)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 ...
-
Conference Object
Queue length based internet congestion control
(2007)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 ...
-
Conference Object
Queue length based internet congestion control123
(2007)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 ...
-
Conference Object
Queue length based internet congestion controlAAA
(2007)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 ...
-
Article
The structure and complexity of Nash equilibria for a selfish routing game
(2009)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 ...
-
Conference Object
A Study on Workload Characterization for a Web Proxy Server
(2003)The popularity of the World-Wide-Web has increased dramatically in the past few years. Web proxy servers have an important role in reducing server loads, network traffic, and client request latencies. This paper presents ...
-
Article
Two-phase commit optimizations in a commercial distributed environment
(1995)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 ...
-
Conference Object
Universal bufferless routing
(2005)Given an arbitrary network, and a routing problem with congestion C and dilation D, a long standing open problem is to show the existence of bufferless routing algorithms with optimal performance guarantees (routing time ...
-
Article
Weighted boolean formula games
(2007)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 ...