Translator Disclaimer
25 July 2001 Policy-aware algorithms for proxy placement in the Internet
Author Affiliations +
Proceedings Volume 4526, Scalability and Traffic Control in IP Networks; (2001) https://doi.org/10.1117/12.434392
Event: ITCom 2001: International Symposium on the Convergence of IT and Communications, 2001, Denver, CO, United States
Abstract
Internet has grown explosively for the past few years and has matured into an important commercial infrastructure. The explosive growth of traffic has contributed to degradation of user perceived response times in today's Internet. Caching at the proxy server have emerged as an effective way of reducing the overall latency. The effectiveness of a proxy server is primarily determined by its locality. This locality is affected by factors such as the Internet topology and routing policies. In this paper, we present heuristic algorithms for placing proxies in the Internet by considering both Internet topology and routing policies. In particular, we make use of the logical topology inferred from Autonomous System (AS) relationships to derive the path between a proxy and a client. We present heuristic algorithms for placing proxies and evaluate these algorithms for the Internet logical topology over three years. To the best of our knowledge, this is the first work on placing proxy servers in the Internet that considers logical topology.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Krishnanand Monahar Kamath, Harpal S. Bassali, Rajendraprasad B. Hosamani, and Lixin Gao "Policy-aware algorithms for proxy placement in the Internet", Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); https://doi.org/10.1117/12.434392
PROCEEDINGS
15 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top