Approximation algorithms
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement-based analysis of multihoming
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic engineering with estimated traffic matrices
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Guidelines for interdomain traffic engineering
ACM SIGCOMM Computer Communication Review
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Optimizing cost and performance for multihoming
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Geographic locality of IP prefixes
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Improving the reliability of internet paths with one-hop source routing
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Practical guide to controlled experiments on the web: listen to your customers not to the hippo
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Evaluation and characterization of available bandwidth probing techniques
IEEE Journal on Selected Areas in Communications
Content delivery networks: a bridge between emerging applications and future IP networks
IEEE Network: The Magazine of Global Internetworking
Exploiting locality of interest in online social networks
Proceedings of the 6th International COnference
Contribution to content delivery network analysis
AIKED'11 Proceedings of the 10th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Declarative automated cloud resource orchestration
Proceedings of the 2nd ACM Symposium on Cloud Computing
Towards a cost model for network traffic
ACM SIGCOMM Computer Communication Review
Cologne: a declarative distributed constraint optimization platform
Proceedings of the VLDB Endowment
Distributed wide-area traffic management for cloud services
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
LIFEGUARD: practical repair of persistent route failures
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
LIFEGUARD: practical repair of persistent route failures
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Jetway: minimizing costs on inter-datacenter video traffic
Proceedings of the 20th ACM international conference on Multimedia
FireCol: a collaborative protection network for the detection of flooding DDoS attacks
IEEE/ACM Transactions on Networking (TON)
The internet-wide impact of P2P traffic localization on ISP profitability
IEEE/ACM Transactions on Networking (TON)
Understanding the latency benefits of multi-cloud webservice deployments
ACM SIGCOMM Computer Communication Review
Joint Server Selection and Routing for Geo-replicated Services
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
We present a method to jointly optimize the cost and the performance of delivering traffic from an online service provider (OSP) network to its users. Our method, called Entact, is based on two key techniques. First, it uses a novel route-injection mechanism to measure the performance of alternative paths that are not being currently used, without disturbing current traffic. Second, based on the cost, performance, traffic, and link capacity information, it computes the optimal cost vs. performance curve for the OSP. Each point on the curve represents a potential operating point for the OSP such that no other operating point offers a simultaneous improvement in cost and performance. The OSP can then pick the operating point that represents the desired trade-off (e.g., the "sweet spot"). We evaluate the benefit and overhead of Entact using trace-driven evaluation in a large OSP with 11 geographically distributed data centers. We find that by using Entact this OSP can reduce its traffic cost by 40% without any increase in path latency and with acceptably low overheads.