Sciweavers

15782 search results - page 668 / 3157
» Network Optimization and Control
Sort
View
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 7 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
ICMCS
2005
IEEE
70views Multimedia» more  ICMCS 2005»
16 years 1 months ago
Cross-layer optimization for wireless video streaming-performance and cost
Cross-Layer Design (CLD) is a new paradigm for network architecture that allows us to make better use of network resources by optimizing across the boundaries of traditional netwo...
Shoaib Khan, Marco Sgroi, Eckehard G. Steinbach, W...
ESA
2005
Springer
108views Algorithms» more  ESA 2005»
16 years 28 days ago
Bootstrapping a Hop-Optimal Network in the Weak Sensor Model
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
Martin Farach-Colton, Rohan J. Fernandes, Miguel A...
SPAA
1996
ACM
15 years 11 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
189
Voted
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
16 years 2 months ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu