Data replication is used extensively in wide-area distributed systems to achieve low data-access latency. A large number of heuristics have been proposed to perform replica placement. Practical experience indicates that the choice of heuristic makes a big difference in terms of the cost of required

and experimentally validate the "engineering " of a scalable, high-quality asynchronous placement heuristic (which is moreover easily parallelizable) for DNA array design. Our heuristic is enabled by a novel approach for simultaneous re-placement and optimal reembedding of an "independent set

Abstract not found

Algorithms (RPAs) that are specifically designed for CDNs. But they do not consider the special features of wireless networks. In this paper, we propose a new heuristic called MP-DNA (Multiple Partitions per Delegate Node Assignment). We study the problem of optimal content replication and placement in WMNs

on equipment placement with a goal of minimizing Installed First Cost. This paper reports on a heuristic approach we have implemented for this problem that has evolved out of real network design projects. A tool with both a Solution Engine and an intuitive Graphical User Interface has been developed

This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier’s archiving and manuscript policies are encouraged to visit:

Abstract not found

All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

both graph theoretic methods and ad hoc heuristics for instrumenting the Internet to obtain distance maps. We evaluate the efficacy of the resulting distance maps by comparing the determinations of closest replica using known topology against those obtained from the distance maps. I. INTRODUCTION

A major factor affecting the clarity of graphical displays that include text labels is the degree to which labels obscure display features (including other labels) as a result of spatial overlap. Point-feature label placement (PFLP) is the problem of placing text labels adjacent to point features