Share Email Print

Proceedings Paper

Policy-aware algorithms for proxy placement in the Internet
Author(s): Krishnanand Monahar Kamath; Harpal S. Bassali; Rajendraprasad B. Hosamani; Lixin Gao
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 25 July 2001
PDF: 15 pages
Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); doi: 10.1117/12.434392
Show Author Affiliations
Krishnanand Monahar Kamath, Univ. of Massachusetts/Amherst (United States)
Harpal S. Bassali, Univ. of Massachusetts/Amherst (United States)
Rajendraprasad B. Hosamani, Univ. of Massachusetts/Amherst (United States)
Lixin Gao, Univ. of Massachusetts/Amherst (United States)

Published in SPIE Proceedings Vol. 4526:
Scalability and Traffic Control in IP Networks
Sonia Fahmy; Kihong Park, Editor(s)

© SPIE. Terms of Use
Back to Top