TY - GEN
T1 - Proxy location problems and their generalizations
AU - Choi, Sumi
AU - Shavitt, Y.
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2003
Y1 - 2003
N2 - In this paper we suggest a new angle to look on proxy location problems. We view the proxy as a service and generalize the problem of optimally placing proxies to optimally placing any service in the network. We differentiate between two cases: transparent services, such as transparent caches (TERCs), and non-transparent services where the end stations, such as hosts using a cache, need to be configured with respect to the service locations. This formulation enables us to study in a unified framework the location problems related to active networks, overlay peer-to-peer networks, as well as, CDNs and caching. For both cases we formalize the problem of optimally placing network servers and introduce approximation algorithms. We present simulation results of approximations and heuristics. We also present an optimal solution for the location problem for a special topology. We show, through a series of examples, that our approach can be applied to a variety of different services.
AB - In this paper we suggest a new angle to look on proxy location problems. We view the proxy as a service and generalize the problem of optimally placing proxies to optimally placing any service in the network. We differentiate between two cases: transparent services, such as transparent caches (TERCs), and non-transparent services where the end stations, such as hosts using a cache, need to be configured with respect to the service locations. This formulation enables us to study in a unified framework the location problems related to active networks, overlay peer-to-peer networks, as well as, CDNs and caching. For both cases we formalize the problem of optimally placing network servers and introduce approximation algorithms. We present simulation results of approximations and heuristics. We also present an optimal solution for the location problem for a special topology. We show, through a series of examples, that our approach can be applied to a variety of different services.
KW - Approximation algorithms
KW - Authentication
KW - Computer science
KW - Costs
KW - Network servers
KW - Network topology
KW - Peer to peer computing
KW - Telecommunication traffic
KW - Traffic control
KW - Web server
UR - http://www.scopus.com/inward/record.url?scp=84943518525&partnerID=8YFLogxK
U2 - 10.1109/ICDCSW.2003.1203665
DO - 10.1109/ICDCSW.2003.1203665
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84943518525
T3 - Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003
SP - 898
EP - 904
BT - Proceedings - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 23rd International Conference on Distributed Computing Systems Workshops, ICDCSW 2003
Y2 - 19 May 2003 through 22 May 2003
ER -