We consider resource allocation games with heterogeneous users and identical resources. Most of the previous work considered cost structures with either negative or positive congestion effects. We study a cost structure that encompasses both the resource’s load and the job’s share in the resource’s activation cost. We consider the proportional sharing rule, where the resource’s activation cost ...

In a stochastic roadway congestion and pricing model, one scheme (omniscient pricing) relies on the full knowledge of each individual journey cost and of early and late penalties of the traveler. A second scheme (observable pricing) is based on observed queuing delays only. Travelers are characterized by late-acceptance levels. The effects of various late-acceptance levels on congestion pattern...

In this term paper, we present recent issues on congestion control mechanism for multicast protocol. Multicast is sending packets from one or more senders to a group of receivers, rather than dedicating their resources to only one receiver, and thus utilizing limited bandwidth efficiently. End-to-end multicast is one of the most important research areas in distributed systems because many appli...

to use services transparently in a distributed environment, the utility grids develop a cyber-infrastructure. the parameters of the quality of service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the utility grids. optimization of both target parameters above is a challenge in a distributed environment and may conflict one ano...

CONGESTION CONTROL FOR NETWORKS IN CHALLENGED ENVIRONMENTS GUOHUA ZHANG, Ph.D. The University of Texas at Arlington, 2008 Supervising Professor: Yonghe Liu Congestion occurs when resource demands exceed the capacity of a network. The goal of congestion control is to use the network as efficiently as possible. While extensive efforts have been devoted to providing optimization based, distributed...

| Typical placement objectives involve reducing net-cut cost or minimizing wirelength. Congestion minimization is the least understood, however, it models routability most accurately. In this paper, we study the congestion minimization problem during placement. First, we show that a global placement with minimum wirelength has minimum total congestion. We show that minimizing wirelength may (an...