A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Approximation algorithms
Reclaiming Space from Duplicate Files in a Serverless Distributed File System
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Sourcebook of parallel computing
Sourcebook of parallel computing
Connections: using context to enhance file search
Proceedings of the twentieth ACM symposium on Operating systems principles
The dynamics of viral marketing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Single instance storage in Windows® 2000
WSS'00 Proceedings of the 4th conference on USENIX Windows Systems Symposium - Volume 4
I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Measurement and analysis of online social networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Avoiding the disk bottleneck in the data domain deduplication file system
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Ostra: leveraging trust to thwart unwanted communication
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Geometry, flows, and graph-partitioning algorithms
Communications of the ACM
The structure of information pathways in a social communication network
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
The Design of the SEER Predictive Caching System
WMCSA '94 Proceedings of the 1994 First Workshop on Mobile Computing Systems and Applications
Unveiling facebook: a measurement study of social network based applications
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Comparison of online social relations in volume vs interaction: a case study of cyworld
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Behavioral profiles for advanced email features
Proceedings of the 18th international conference on World wide web
A measurement-driven analysis of information propagation in the flickr social network
Proceedings of the 18th international conference on World wide web
TailGate: handling long-tail content with a little help from friends
Proceedings of the 21st international conference on World Wide Web
Evolution of a location-based online social network: analysis and models
Proceedings of the 2012 ACM conference on Internet measurement conference
Proceedings of the sixth ACM international conference on Web search and data mining
FENNEL: streaming graph partitioning for massive scale graphs
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise data centers. In both cases we observe that the pattern of e-mails between employees of an enterprise forms an implicit social graph. Hermes tracks this implicit social graph, periodically identifies clusters of strongly connected users within the graph, and co-locates such users on the same server. Co-locating the users reduces storage requirements: senders and recipients who reside on the same server can share a single copy of an e-mail. Co-location also reduces inter-server bandwidth usage. We evaluate Hermes using a trace of all e-mails within a major corporation over a five month period. The e-mail service supports over 120,000 users on 68 servers. Our evaluation shows that using Hermes results in storage savings of 37% and bandwidth savings of 50% compared to current approaches. The overheads are low: a single commodity server can run the optimization for the entire system.