Monge strikes again: optimal placement of web proxies in the internet

Authors:
Gerhard J. Woeginger
Affiliations:
Institut für Mathematik B, TU Graz, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
2000

Citing 7
Cited 9

The concave least-weight subsequence problem revisited

Journal of Algorithms
Sequence comparison with mixed convex and concave costs

Journal of Algorithms
On-line dynamic programming with applications to the prediction of RNA secondary structure

Journal of Algorithms
A caching relay for the World Wide Web

Selected papers of the first conference on World-Wide Web
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
Internet Web servers: workload characterization and performance implications

IEEE/ACM Transactions on Networking (TON)
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology

HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking

The k-Median Problem for Directed Trees

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
World Wide Wait: A Study of Internet Scalability and Cache-Based Approaches to Alleviate It

Management Science
Designing cost-effective content distribution networks

Computers and Operations Research
Exact algorithms for the joint object placement and request routing problem in content distribution networks

Computers and Operations Research
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity

ACM Transactions on Algorithms (TALG)
A fully polynomial approximation algorithm for collaborative relaying in sensor networks under finite rate constraints

DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
A dynamic programming approach to length-limited Huffman coding: space reduction with the Monge property

IEEE Transactions on Information Theory
New algorithms for 1-D facility location and path equipartition problems

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Online dynamic programming speedups

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.06

Visualization

Abstract

In a recent paper (Proceedings of IFIP'98), Li et al. study the problem of placing m web proxies in the internet under a given traffic pattern. They consider the special case of a linear net topology with n nodes. Their goal is to minimize the overall latency of accessing the target web server subject to the network resources and traffic pattern. They show how this problem can be solved in O(n^2m) time. In this short note, we observe that one of the underlying cost functions in this problem carries a Monge structure. By exploiting this structure and by applying some well-known results from the literature, we get a faster algorithm with time complexity O(nm).