Sciweavers

5658 search results - page 225 / 1132
» An Efficient Counting Network
Sort
View
AINA
2007
IEEE
16 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
192
Voted
AINA
2008
IEEE
15 years 8 months ago
UTAPS: An Underlying Topology-Aware Peer Selection Algorithm in BitTorrent
BitTorrent is one of the most well known peer-topeer file sharing applications, accounting for a significant proportion of Internet traffic. Current BitTorrent system builds its o...
Wei Li, Shanzhi Chen, Tao Yu
HT
2011
ACM
14 years 10 months ago
Social capital increases efficiency of collaboration among Wikipedia editors
In this study we measure the impact of pre-existing social capital on the efficiency of collaboration among Wikipedia editors. To construct a social network among Wikipedians we l...
Keiichi Nemoto, Peter A. Gloor, Rob Laubacher
WSC
2004
15 years 8 months ago
New Event-driven Sampling Techniques for Network Reliability Estimation
Exactly computing network reliability measures is an NPhard problem. Therefore, Monte Carlo simulation has been frequently used by network designers to obtain accurate estimates. ...
Abdullah Konak, Alice E. Smith, Sadan Kulturel-Kon...
CN
2010
121views more  CN 2010»
15 years 3 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...