2926 search results - page 347 / 586 » Partially Optimal Routing |
136
Voted
SIGCOMM
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of routing in a delay tolerant network (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy...
147
Voted
FPGA
2004
ACM
15 years 9 months ago
2004
ACM
The cost functions used to evaluate logic synthesis transformations for FPGAs are far removed from the final speed and routability determined after placement, routing and timing a...
149
Voted
NETWORKING
2010
15 years 5 months ago
2010
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
126
Voted
MASCOTS
2008
15 years 5 months ago
2008
Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-ho...
125
click to vote
NSDI
2004
15 years 5 months ago
2004
Designing a wide-area distributed hash table (DHT) that provides high-throughput and low-latency network storage is a challenge. Existing systems have explored a range of solution...