Proceedings Article10.1109/ICDCSW.2003.1203665
Proxy location problems and their generalizations
Sumi Choi,Yuval Shavitt +1 more
- 19 May 2003
- pp 898-904
15
TL;DR: The proxy is viewed as a service and generalize the problem of optimally placing proxies to optimally placed any service in the network to study in a unified framework the location problems related to active networks, overlay peer-to-peer networks, as well as, CDNs and caching.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Survey on Replica Server Placement Algorithms for Content Delivery Networks
TL;DR: A comprehensive survey of replica server placement algorithms in traditional and emerging paradigm-based CDNs is presented in this paper, where the authors categorize the algorithms and provide a summary of their characteristics.
91
•Posted Content
A Survey on Replica Server Placement Algorithms for Content Delivery Networks
TL;DR: This paper presents a comprehensive survey of replica server placement algorithms in traditional and emerging paradigm-based CDNs, categorizing the algorithms and providing a summary of their characteristics.
66
On the placement of infrastructure overlay nodes
TL;DR: It is concluded that a hybrid approach combining greedy and random approaches provides the best tradeoff between computational efficiency and accuracy and a simple unified algorithm is proposed to achieve both reliability and TCP performance.
37
A traffic engineering approach for placement and selection of network services
Rami Cohen,Gabi Nakibly +1 more
TL;DR: This work proposes a novel approach for the service placement problem, which takes into account traffic engineering considerations and divides the problem into two subproblems: finding the best location for each service gateway, and selecting the best service gateway for each flow.
A Traffic Engineering Approach for Placement and Selection of Network Services
Rami Cohen,Gabi Nakibly +1 more
- 01 May 2007
TL;DR: This work proposes a novel approach for the service placement problem, which takes into account traffic engineering considerations, and takes advantage of these routes in order to enhance the overall network performance.
References
Diameter of the World-Wide Web
TL;DR: The World-Wide Web becomes a large directed graph whose vertices are documents and whose edges are links that point from one document to another, which determines the web's connectivity and consequently how effectively the authors can locate information on it.
4.7K
Web caching and Zipf-like distributions: evidence and implications
Lee Breslau,Pei Cao,Li Fan,G. Phillips,Scott Shenker +4 more
- 21 Mar 1999
TL;DR: This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
The diameter of the world wide web
TL;DR: In this article, the authors use local connectivity measurements to construct a topological model of the world wide web, allowing them to explore and characterize its large scale properties, such as the topology of the Web.
2.6K
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
2.5K
Topology of Evolving Networks: Local Events and Universality
TL;DR: In this paper, the authors show that depending on the frequency of local events, two topologically different networks can emerge, the connectivity distribution following either a generalized power law or an exponential.