Sciweavers

312 search results - page 16 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
JSAC
2006
117views more  JSAC 2006»
13 years 8 months ago
A scalable network resource allocation mechanism with bounded efficiency loss
The design of pricing mechanisms for network resource allocation has two important objectives: 1) a simple and scalable end-to-end implementation and 2) efficiency of the resulting...
Ramesh Johari, John N. Tsitsiklis
ECIS
2003
13 years 10 months ago
A multi-model algorithm for the cost-oriented design of the information technology infrastructure
Multiple combinations of hardware and network components can be selected to design an information technology (IT) infrastructure that satisfies performance requirements. The profe...
Danilo Ardagna, Chiara Francalanci, Marco Trubian
STACS
2009
Springer
14 years 3 months ago
The Price of Anarchy in Cooperative Network Creation Games
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid M...
IPSN
2004
Springer
14 years 2 months ago
The impact of spatial correlation on routing with compression in wireless sensor networks
The efficacy of data aggregation in sensor networks is a function of the degree of spatial correlation in the sensed phenomenon. While several data aggregation (i.e., routing with...
Sundeep Pattem, Bhaskar Krishnamachari, Ramesh Gov...
EJC
2008
13 years 8 months ago
Expansion properties of a random regular graph after random vertex deletions
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
Catherine S. Greenhill, Fred B. Holt, Nicholas C. ...