Sciweavers

365 search results - page 68 / 73
» Fast construction of overlay networks
Sort
View
HPCA
2003
IEEE
14 years 11 months ago
A Methodology for Designing Efficient On-Chip Interconnects on Well-Behaved Communication Patterns
As the level of chip integration continues to advance at a fast pace, the desire for efficient interconnects-whether on-chip or off-chip--is rapidly increasing. Traditional interc...
Wai Hong Ho, Timothy Mark Pinkston
ICC
2009
IEEE
127views Communications» more  ICC 2009»
13 years 8 months ago
Starburst SSD: An Efficient Protocol for Selective Dissemination
Abstract--We present Starburst, a routing-based protocol designed to efficiently disseminate data items to small subsets within a sensor network. Starburst constructs a routing hie...
Tahir Azim, Qasim Mansoor, Philip Levis
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 5 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
GLOBECOM
2008
IEEE
13 years 12 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
INFOCOM
2008
IEEE
14 years 5 months ago
Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley