Sciweavers

346 search results - page 23 / 70
» Routing networks for distributed hash tables
Sort
View
CAL
2007
13 years 7 months ago
Logic-Based Distributed Routing for NoCs
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
José Flich, José Duato
P2P
2006
IEEE
148views Communications» more  P2P 2006»
14 years 1 months ago
eQuus: A Provably Robust and Locality-Aware Peer-to-Peer System
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
Thomas Locher, Stefan Schmid, Roger Wattenhofer
ACSAC
2004
IEEE
13 years 11 months ago
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
1 A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement...
Mudhakar Srivatsa, Ling Liu
CONEXT
2009
ACM
13 years 8 months ago
BUFFALO: bloom filter forwarding architecture for large organizations
In enterprise and data center networks, the scalability of the data plane becomes increasingly challenging as forwarding tables and link speeds grow. Simply building switches with...
Minlan Yu, Alex Fabrikant, Jennifer Rexford
COLCOM
2007
IEEE
14 years 1 months ago
Kademlia for data storage and retrieval in enterprise networks
— Centralized organization of current enterprise networks doesn’t represent an ideal solution in terms of information security and reliability. Denial of service, packet filter...
Natalya Fedotova, Stefano Fanti, Luca Veltri