Sciweavers

632 search results - page 8 / 127
» On Routing in Circulant Graphs
Sort
View
HUMAN
2003
Springer
14 years 17 days ago
A Graph-Based Approach to Compute Multiple Paths in Mobile Ad Hoc Networks
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
Gunyoung Koh, Duyoung Oh, Heekyoung Woo
INFOCOM
2009
IEEE
14 years 2 months ago
Hyperbolic Embedding and Routing for Dynamic Graphs
—We propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-...
Andrej Cvetkovski, Mark Crovella
SIROCCO
2001
13 years 8 months ago
Competitive Online Routing in Geometric Graphs
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
Prosenjit Bose, Pat Morin
ISPD
1999
ACM
89views Hardware» more  ISPD 1999»
13 years 11 months ago
VIA design rule consideration in multi-layer maze routing algorithms
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
Jason Cong, Jie Fang, Kei-Yong Khoo
PC
2000
96views Management» more  PC 2000»
13 years 7 months ago
Multicast communication in wormhole-routed star graph interconnection networks
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu