Sciweavers

380 search results - page 69 / 76
» An Empirical Study of Optimization for Maximizing Diffusion ...
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
CN
2008
140views more  CN 2008»
13 years 8 months ago
Congestion control in utility fair networks
This paper deals with a congestion control framework for elastic and real-time traffic, where the user's application is associated with a utility function. We allow users to ...
Tobias Harks, Tobias Poschwatta
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner
INFOCOM
2007
IEEE
14 years 3 months ago
Non-Cooperative Scheduling of Multiple Bag-of-Task Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper we analyze the behavior of K non-cooperative schedu...
Arnaud Legrand, Corinne Touati
DSN
2006
IEEE
14 years 2 months ago
Storage Allocation in Unreliable Peer-to-Peer Systems
Peer-to-peer systems provide the opportunity to pool large amounts of distributed resources to enable internetscale applications. However, the participant nodes are highly dynamic...
John A. Chandy