89 search results - page 10 / 18 » On the computational complexity and effectiveness of N-hub s... |
PERCOM
2006
ACM
14 years 7 months ago
2006
ACM
Routing in multi-hop wireless networks is typically greedy, with every connection attempting to establish a path that minimizes its number of hops. However, interference plays a m...
DAC
2008
ACM
14 years 8 months ago
2008
ACM
Due to recent advances in microfluidics technology, digital microfluidic biochips and their associated CAD problems have gained much attention, most of which has been devoted to d...
DAC
1995
ACM
13 years 11 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
SIGMETRICS
2004
ACM
14 years 29 days ago
2004
ACM
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
ICDCS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv...