Sciweavers

2808 search results - page 181 / 562
» Routing betweenness centrality
Sort
View
ICC
2007
IEEE
140views Communications» more  ICC 2007»
16 years 26 days ago
Performance Analysis of Adaptively-Routed Wormhole-Switched Networks with Finite Buffers
—The use of adaptively-routed wormhole switched k-ary n-cubes has been motivated by the high path diversity provided by the rich topology of this family of interconnection networ...
Nasser Alzeidi, Mohamed Ould-Khaoua, Lewis M. Mack...
IPPS
2007
IEEE
16 years 25 days ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
INFOCOM
2005
IEEE
16 years 3 days ago
A cost-based analysis of overlay routing geometries
— In this paper, we propose a cost-based model to evaluate the resources that each node has to contribute for participating in an overlay network. Such a cost model allows to gau...
Nicolas Christin, John Chuang
INFOCOM
1999
IEEE
15 years 10 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
CGF
2010
112views more  CGF 2010»
15 years 6 months ago
Winding Roads: Routing edges into bundles
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
A. Lambert, Romain Bourqui, David Auber