Sciweavers

824 search results - page 149 / 165
» Robust Distributed Routing in Dynamical Flow Networks
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 6 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
CONEXT
2009
ACM
13 years 7 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
PROCEDIA
2010
116views more  PROCEDIA 2010»
13 years 5 months ago
Towards fully autonomic peer-to-peer systems
Large-scale distributed applications are becoming more and more demanding in terms of efficiency and flexibility of the technological infrastructure, for which traditional soluti...
Michele Amoretti
EDCC
2010
Springer
13 years 11 months 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 ...
IPPS
2007
IEEE
14 years 1 months ago
Gossip-based Reputation Aggregation for Unstructured Peer-to-Peer Networks
: Peer-to-Peer (P2P) reputation systems are needed to evaluate the trustworthiness of participating peers and to combat selfish and malicious peer behaviors. The reputation system ...
Runfang Zhou, Kai Hwang