Sciweavers

346 search results - page 34 / 70
» Routing networks for distributed hash tables
Sort
View
INFOSCALE
2009
ACM
14 years 2 months ago
Measuring IP Address Fragmentation from BGP Routing Dynamics
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
Xia Yin, Xin Wu, Zhiliang Wang
JNW
2006
120views more  JNW 2006»
13 years 7 months ago
An EMST Based Look-up Protocol for Peer to Peer Networks
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...
Tarun Bansal, Pankaj Ghanshani
INFOCOM
2008
IEEE
14 years 2 months ago
A Distributed Minimum-Distortion Routing Algorithm with In-Network Data Processing
—In many wired and wireless networks, nodes process input traffic to satisfy a network constraint (e.g. capacity constraints) and to increase the utility of data in the output ...
Ramin Khalili, James F. Kurose
EDCC
2010
Springer
14 years 11 days ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
PPSN
1998
Springer
13 years 11 months ago
Ant Colonies for Adaptive Routing in Packet-Switched Communications Networks
In this paper we present AntNet, a novel adaptive approach to routing tables learning in packet-switched communications networks. AntNet is inspired by the stigmergy model of commu...
Gianni Di Caro, Marco Dorigo