Sciweavers

346 search results - page 33 / 70
» Routing networks for distributed hash tables
Sort
View
JSA
2006
113views more  JSA 2006»
13 years 7 months ago
A power-efficient TCAM architecture for network forwarding tables
Stringent memory access and search speed requirements are two of the main bottlenecks in wire speed processing. Most viable search engines are implemented in content addressable m...
Taskin Koçak, Faysal Basci
SIGOPSE
2004
ACM
14 years 1 months ago
The lonely NATed node
In this paper we take the position that current research in the area of distributed systems has all but forgotten about one of the largest collective Internet resources - the NATe...
Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S...
ISPAN
2005
IEEE
14 years 1 months ago
A Self-stabilizing Link-Cluster Algorithm in Mobile Ad Hoc Networks
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
Doina Bein, Ajoy Kumar Datta, Chakradhar R. Jaggan...
SASO
2008
IEEE
14 years 1 months ago
Using Global Information for Load Balancing in DHTs
Distributed Hash Tables (DHT) with order-preserving hash functions require load balancing to ensure an even item-load over all nodes. While previous item-balancing algorithms only...
Mikael Högqvist, Seif Haridi, Nico Kruber, Al...
COORDINATION
2007
Springer
14 years 1 months ago
Requirements for Routing in the Application Layer
In the application layer of networks, many application servers are middleboxes in the paths of messages from source to destination. Applications require, as a basic coordination me...
Pamela Zave