417 search results - page 71 / 84 » A randomized algorithm for the joining protocol in dynamic d... |
SPAA
2010
ACM
14 years 1 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
—In this paper, we clarify inter-link interference in wireless ad-hoc networks by using link-directional interference graphs (l-graph). Most of the interference graphs in the lit...
DAIS
2003
13 years 10 months ago
2003
Communication in distributed applications across a wide area network needs to cope with heterogenous and constantly changing network conditions. A promising approach to address thi...
HIPC
2007
Springer
14 years 18 days ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
IMC
2006
ACM
14 years 2 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...