Sciweavers

177 search results - page 11 / 36
» Stackelberg Routing in Arbitrary Networks
Sort
View
CCR
2005
96views more  CCR 2005»
13 years 8 months ago
Stability of end-to-end algorithms for joint routing and rate control
Dynamic multi-path routing has the potential to improve the reliability and performance of a communication network, but carries a risk. Routing needs to respond quickly to achieve...
Frank P. Kelly, Thomas Voice
INFOCOM
2008
IEEE
14 years 3 months ago
Reducing Maximum Stretch in Compact Routing
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
Mihaela Enachescu, Mei Wang, Ashish Goel
EUROPAR
2001
Springer
14 years 1 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
LCN
2002
IEEE
14 years 1 months ago
A First Look at Wired Sensor Networks for Video Surveillance Systems
Sensor networks are a major new area of research. Some sensor applications, such as video surveillance, will need to be tethered for reasons of bandwidth and power requirements. T...
Vijay Chandramohan, Kenneth J. Christensen
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
14 years 3 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud