2343 search results - page 127 / 469 » The Locomotive Routing Problem |
154
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
169
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
139
click to vote
AINA
2008
IEEE
16 years 16 days ago
2008
IEEE
Motivated by the high cost problem of ternary CAM, we proposed a new technique for providing a compaction routing table. With the comparisons with existing algorithms, our new tec...
164
click to vote
INFOCOM
2007
IEEE
16 years 10 days ago
2007
IEEE
—Providing efficient and reliable communication in wireless sensor networks is a challenging problem. To recover from corrupted packets, previous approaches have tried to use re...
150
click to vote
ETFA
2005
IEEE
15 years 11 months ago
2005
IEEE
Ad hoc networks are characterized by dynamic topology caused by node mobility, multihop wireless connectivity and channel non-deterministic behavior (interference, multipath, hidd...