Sciweavers

661 search results - page 62 / 133
» Bandwidth Sharing: Objectives and Algorithms
Sort
View
INFOSCALE
2006
ACM
15 years 11 months ago
Analysis and comparison of P2P search methods
The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Inte...
Dimitrios Tsoumakos, Nick Roussopoulos
GCC
2005
Springer
15 years 10 months ago
Coordinated Placement and Replacement for Grid-Based Hierarchical Web Caches
Web caching has been well accepted as a viable method for saving network bandwidth and reducing user access latency. To provide cache sharing on a large scale, hierarchical web cac...
Wenzhong Li, Kun Wu, Xu Ping, Ye Tao, Sanglu Lu, D...
GLOBECOM
2007
IEEE
15 years 9 months ago
mQMA: Multi-Constrained QoS Multicast Aggregation
Traditional IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although this proposition has been well studie...
Naouel Ben Ali, Joanna Moulierac, Abdelfattah Belg...
133
Voted
CCS
2010
ACM
15 years 5 months ago
CRAFT: a new secure congestion control architecture
Congestion control algorithms seek to optimally utilize network resources by allocating a certain rate for each user. However, malicious clients can disregard the congestion contr...
Dongho Kim, Jerry T. Chiang, Yih-Chun Hu, Adrian P...
129
Voted
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 3 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan