661 search results - page 89 / 133 » On Distributed Computation in Noisy Random Planar Networks |
100
click to vote
IMC
2006
ACM
15 years 3 months ago
2006
ACM
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
NOCS
2010
IEEE
14 years 8 months ago
2010
IEEE
A new asynchronous interconnection network is introduced for globally-asynchronous locally-synchronous (GALS) chip multiprocessors. The network eliminates the need for global cloc...
ICNP
1997
IEEE
15 years 1 months ago
1997
IEEE
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...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— We define “random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random wa...
ADHOCNOW
2005
Springer
15 years 3 months ago
2005
Springer
The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with variable transmission ranges. It was introduced and analyzed by Meyer auf der He...