Sciweavers

812 search results - page 128 / 163
» On the number of distributed measurement points for network ...
Sort
View
ICPADS
2006
IEEE
14 years 2 months ago
Oriented Overlays For Clustering Client Requests To Data-Centric Network Services
Many of the data-centric network services deployed today hold massive volumes of data at their origin websites, and access the data to dynamically generate responses to user reque...
Congchun He, Vijay Karamcheti
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 25 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
INFOCOM
2012
IEEE
11 years 11 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 10 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...
MOBISYS
2009
ACM
14 years 9 months ago
Predictive methods for improved vehicular WiFi access
With the proliferation of WiFi technology, many WiFi networks are accessible from vehicles on the road making vehicular WiFi access realistic. However, several challenges exist: l...
Pralhad Deshpande, Anand Kashyap, Chul Sung, Samir...