Sciweavers

2861 search results - page 275 / 573
» The multi-layered network design problem
Sort
View
P2P
2006
IEEE
16 years 20 days ago
Route Fingerprinting in Anonymous Communications
Peer discovery and route set-up are an integral part of the processes by which anonymizing peer-to-peer systems are made secure. When systems are large, and individual nodes only ...
George Danezis, Richard Clayton
AUTOMATICA
2010
218views more  AUTOMATICA 2010»
15 years 6 months ago
Gossip consensus algorithms via quantized communication
This paper considers the average consensus problem on a network of digital links, and proposes algorithms based on pairwise "gossip" communications and updates. Through ...
Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro...
JUCS
2008
135views more  JUCS 2008»
15 years 6 months ago
Approximation to a Behavioral Model for Estimating Traffic Aggregation Scenarios
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
Alberto E. Garcia, Klaus D. Hackbarth
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
COR
2007
109views more  COR 2007»
15 years 6 months ago
Assessing performance and uncertainty in developing carpet reverse logistics systems
TheUScarpetindustryisstrivingtoreacha40%diversionratefromlandfillsby2012,accordingtoamemorandum of understanding signed by industry and government officials in 2002. As a result...
Markus Biehl, Edmund Prater, Matthew J. Realff