632 search results - page 63 / 127 » On Routing in Circulant Graphs |
DAC
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
IPPS
2006
IEEE
15 years 4 months ago
2006
IEEE
Fault-tolerant Beacon Vector Routing (FBVR) is an efficient technique for routing in the presence of node failures. Several common wireless topologies exist that can be used with...
NETWORKING
2008
14 years 11 months ago
2008
Abstract. To support large-scale live Internet broadcasting services efficiently in content delivery networks (CDNs), it is essential to exploit peer-to-peer capabilities among end...
107
click to vote
HICSS
2008
IEEE
14 years 10 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
ISCC
2005
IEEE
15 years 3 months ago
2005
IEEE
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...