Amortized efficiency of list update and paging rules
Communications of the ACM
TCP dynamic acknowledgment delay (extended abstract): theory and practice
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Dynamic TCP acknowledgement and other stories about e/(e-1)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Theoretical Computer Science
Bgp
Globally Distributed Content Delivery
IEEE Internet Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A measurement-based analysis of multihoming
Proceedings of the 2003 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
Insight and perspectives for content delivery networks
Communications of the ACM - Personal information management
A Case for Peering of Content Delivery Networks
IEEE Distributed Systems Online
The Akamai network: a platform for high-performance internet applications
ACM SIGOPS Operating Systems Review
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Editorial: Editorial for special issue Internet-based Content Delivery
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimizing server throughput for low-delay live streaming in content delivery networks
Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video
Using batteries to reduce the power costs of internet-scale distributed networks
Proceedings of the Third ACM Symposium on Cloud Computing
Pricing of service in clouds: optimal response and strategic interactions
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
Content Delivery Networks (CDNs) deliver web content to end-users from a large distributed platform of web servers hosted in data centers belonging to thousands of Internet Service Providers (ISPs) around the world. The bandwidth cost incurred by a CDN is the sum of the amounts it pays each ISP for routing traffic from its servers located in that ISP out to end-users. A large enterprise may also contract with multiple ISPs to provide redundant Internet access for its origin infrastructure using technologies such as multihoming and mirroring, thereby incurring a significant bandwidth cost across multiple ISPs. This paper initiates the formal algorithmic study of bandwidth cost minimization in the context of a large enterprise or a CDN, a problem area that is both algorithmically rich and practically very important. First, we model different types of contracts that are used in practice by ISPs to charge for bandwidth usage, including average, maximum, and 95th-percentile contracts. Then, we devise an optimal offline algorithm that routes traffic to achieve the minimum bandwidth cost, when the network contracts charge either on a maximum or on an average basis. Next, we devise a deterministic (resp., randomized) online algorithm that achieves cost that is within a factor of 2 (resp., ee-1) of the optimal offline cost for maximum and average contracts. In addition, we prove that our online algorithms achieve the best possible competitive ratios in both the deterministic and the randomized cases. An interesting theoretical contribution of this work is that we show intriguing connections between the online bandwidth optimization problem and the seemingly-unrelated but well-studied ski rental problem where similar optimal competitive ratios are known to hold. Finally, we consider extensions for contracts with a committed amount of spend (known as committed information rate or CIR) and contracts that charge on a 95th-percentile basis.