414 search results - page 16 / 83 » Minimizing Routing State for Light-Weight Network Simulation |
89
Voted
NETWORKING
2004
15 years 1 months ago
2004
This paper presents an analytical methodology to obtain steady state throughput of a uniformly and fully loaded regular network. The network operates using deflection routing under...
100
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
TON
2010
14 years 6 months ago
2010
In this paper, we present a novel multiperiod spraying algorithm for routing in delay-tolerant networks (DTNs). The goal is to minimize the average copy count used per message unti...
PADS
2004
ACM
15 years 5 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
ICC
2011
IEEE
13 years 11 months ago
2011
IEEE
—In this work we propose anycast routing methods to improve the performance of reconfigurable WDM networks under the variations in the IP traffic. We first investigate anycast...