Sciweavers

9 search results - page 2 / 2
» A Dynamic Binary Hash Scheme for IPv6 Lookup
Sort
View
AINA
2009
IEEE
13 years 11 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
AINA
2004
IEEE
13 years 8 months ago
A Small IP Forwarding Table Using Hashing
As the demand for high bandwidth on the Internet increases, it is required to build next generation routers with the capability of forwarding multiple millions of packets per secon...
Yeim-Kuan Chang, Wen-Hsin Cheng
IPPS
2006
IEEE
13 years 10 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo
TKDE
2008
137views more  TKDE 2008»
13 years 4 months ago
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
Runfang Zhou, Kai Hwang, Min Cai