Sciweavers

36 search results - page 5 / 8
» High Entropy Random Selection Protocols
Sort
View
ICNP
1997
IEEE
15 years 1 months ago
Balanced Routing
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
Jorge Arturo Cobb, Mohamed G. Gouda
INFOCOM
2005
IEEE
15 years 3 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
ICDCS
2012
IEEE
12 years 12 months ago
DARD: Distributed Adaptive Routing for Datacenter Networks
Datacenter networks typically have many paths connecting each host pair to achieve high bisection bandwidth for arbitrary communication patterns. Fully utilizing the bisection ban...
Xin Wu, Xiaowei Yang
JSAC
2011
115views more  JSAC 2011»
14 years 4 months ago
Scalable Cross-Layer Wireless Access Control Using Multi-Carrier Burst Contention
Abstract—The increasing demand for wireless access in vehicular environments (WAVE) supporting a wide range of applications such as traffic safety, surveying, infotainment etc.,...
Bogdan Roman, Ian J. Wassell, Ioannis Chatzigeorgi...
IACR
2011
73views more  IACR 2011»
13 years 9 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr