Sciweavers

632 search results - page 102 / 127
» On Routing in Circulant Graphs
Sort
View
IPPS
1998
IEEE
14 years 21 days ago
Hyper Butterfly Network: A Scalable Optimally Fault Tolerant Architecture
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
Wei Shi, Pradip K. Srimani
CN
2004
114views more  CN 2004»
13 years 8 months ago
Representing the Internet as a succinct forest
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
Jim Gast, Paul Barford
IV
2010
IEEE
196views Visualization» more  IV 2010»
13 years 7 months ago
3D Edge Bundling for Geographical Data Visualization
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
Antoine Lambert, Romain Bourqui, David Auber
WIOPT
2010
IEEE
13 years 6 months ago
Effect of limited topology knowledge on opportunistic forwarding in ad hoc wireless networks
—Opportunistic forwarding is a simple scheme for packet routing in ad hoc wireless networks such as duty cycling sensor networks in which reducing energy consumption is a princip...
Prithwish Basu, Saikat Guha
TIT
2010
146views Education» more  TIT 2010»
13 years 3 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis