16128 search results - page 2666 / 3226 » Distributed network scheduling |
185
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
159
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—Today most home networks are connected to the Internet via Network Address Translation (NAT) devices. NAT is an obstacle for services that should be accessible from the public I...
198
click to vote
QEST
2009
IEEE
16 years 1 months ago
2009
IEEE
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
165
click to vote
ICNP
2009
IEEE
16 years 1 months ago
2009
IEEE
—We introduce the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the no...
160
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...