Sciweavers

236 search results - page 34 / 48
» Increasing the determinism of network emulation to evaluate ...
Sort
View
MP
2010
119views more  MP 2010»
13 years 7 months ago
Efficient and fair routing for mesh networks
Inspired by the One Laptop Per Child project, we consider mesh networks that connect devices that cannot recharge their batteries easily. We study how the mesh should retransmit in...
Andrea Lodi, Enrico Malaguti, Nicolás E. St...
JWSR
2006
139views more  JWSR 2006»
13 years 8 months ago
Supporting Predictable Service Provision in MANETs Via Context-Aware Session Management
: The increasing ubiquity of wireless mobile devices is promoting unprecedented levels of electronic collaboration among devices interoperating to achieve a common goal. Issues rel...
Radu Handorean, Rohan Sen, Gregory Hackmann, Gruia...
INFOCOM
2003
IEEE
14 years 1 months ago
A Framework for Reliable Routing in Mobile Ad Hoc Networks
— Mobile ad hoc networks consist of nodes that are often vulnerable to failure. As such, it is important to provide redundancy in terms of providing multiple nodedisjoint paths f...
Zhenqiang Ye, Srikanth V. Krishnamurthy, Satish K....
GLOBECOM
2007
IEEE
14 years 2 months ago
Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...
INFOCOM
2005
IEEE
14 years 2 months ago
Fairness in MIMD congestion control algorithms
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu