Sciweavers

1815 search results - page 341 / 363
» Path Planning for Network Performance
Sort
View
MOBICOM
2012
ACM
11 years 10 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
HPDC
2010
IEEE
13 years 8 months ago
Detouring and replication for fast and reliable internet-scale stream processing
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
Christopher McConnell, Fan Ping, Jeong-Hyon Hwang
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
INFOCOM
2007
IEEE
14 years 2 months ago
A Framework for Measuring and Predicting the Impact of Routing Changes
— Routing dynamics heavily influence Internet data plane performance. Existing studies only narrowly focused on a few destinations and did not consider the predictability of the...
Ying Zhang, Zhuoqing Morley Mao, Jia Wang
WIMOB
2009
IEEE
14 years 2 months ago
Multipath Routing in MANETs Using Multiple Description Coding
—Routing in ad hoc networks is a well known issue. Most of the previous propositions to route data between two nodes aimed to define a path (sometimes several ones) on which pac...
Eddy Cizeron, Salima Hamma