2149 search results - page 99 / 430 » Distributed Algorithms for Approximating Wireless Network Ca... |
CN
2006
15 years 1 months ago
2006
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
EURONGI
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
131
click to vote
PDP
2006
IEEE
15 years 7 months ago
2006
IEEE
Peer-to-Peer computing is mainly based on the virtual overlay network constructed in the application layer. Often, there is topology mismatching between the overlay network and th...
106
click to vote
ESA
2007
Springer
15 years 7 months ago
2007
Springer
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
100
click to vote
MSWIM
2004
ACM
15 years 6 months ago
2004
ACM
— Providing delay guarantees to time-sensitive traffic in future wireless multimedia networks is a challenging issue. This is due to the time-varying link capacities and the vari...