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

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 subje...

Full description

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 27; no. 3; pp. 93 - 96
Main Author Woeginger, Gerhard J.
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.10.2000
Subjects
Caching
Dynamic programming
Internet
Monge property
Optimization
Web proxy
Web server
Monge property
Dynamic programming
Internet
Caching
Web server
Optimization
Online AccessGet full text
ISSN0167-6377
1872-7468
DOI10.1016/S0167-6377(00)00041-9

Cover

More Information
Summary: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 2 m) 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).
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(00)00041-9