Sciweavers

562 search results - page 101 / 113
» How to Optimize Residual Communications
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Adaptive Data Structures for IP Lookups
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...
P2P
2003
IEEE
108views Communications» more  P2P 2003»
14 years 1 months ago
Multicast in DKS(N, k, f) Overlay Networks
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
Luc Onana Alima, Ali Ghodsi, Sameh El-Ansary, Per ...
SIGMETRICS
2003
ACM
113views Hardware» more  SIGMETRICS 2003»
14 years 1 months ago
An empirical evaluation of wide-area internet bottlenecks
Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network – i.e last mile connectivity to users, or access links of s...
Aditya Akella, Srinivasan Seshan, Anees Shaikh
ICS
2010
Tsinghua U.
14 years 1 months ago
Large-scale FFT on GPU clusters
A GPU cluster is a cluster equipped with GPU devices. Excellent acceleration is achievable for computation-intensive tasks (e.g. matrix multiplication and LINPACK) and bandwidth-i...
Yifeng Chen, Xiang Cui, Hong Mei
INFOCOM
2000
IEEE
14 years 18 hour ago
A Predictability Analysis of Network Traffic
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
Aimin Sang, San-qi Li