2419 search results - page 234 / 484 » Modeling Spatio-temporal Network Computations: A Summary of ... |
247
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
206
click to vote
ICTAI
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper tackles the problem of analyzing the correctness and performance of a computer network protocol. Given the complexity of the problem, no currently used technique is abl...
165
click to vote
ICPADS
2007
IEEE
16 years 27 days ago
2007
IEEE
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...
152
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
Autonomous routing algorithms, such as BGP, are intended to reach a globally consistent set of routes after nodes iteratively and independently collect, process, and share network...
191
click to vote
PODC
2004
ACM
16 years 11 hour ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...