Optimal placement of Web proxies for tree networks

Li, K.; Shen, Hong

doi:10.1109/eee.2004.1287350

Cited by 12 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When hotlinks are allowed to start in the root only, then it is known that the problem is solvable in polynomial time (cf. [14]). We have shown in this paper that there also is an efficient algorithm when hotlinks may start in any node, but may only end in leaves.…”

Section: Resultsmentioning

confidence: 99%

On the Complexity of Optimal Hotlink Assignment

Jacobs

2011

Algorithmica

View full text Add to dashboard Cite

The concept of hotlink assignment aims at reducing the navigation effort for users of a web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. Given an access probability distribution of the leaves of the tree representing the web site, the goal of hotlink assignment algorithms is to minimize the expected path length between the root and the leaves.We prove that this optimization problem is NP-hard, even if only one outgoing hotlink is allowed for each node. This answers a question that has been open since the first formulation of the problem in Bose et al. (Proceedings of 11th International Symposium on Algorithms and Computation (ISAAC), 2000) nine years ago.In this work we also investigate the model where hotlinks are only allowed to point at the leaves of the tree. We demonstrate that for this model optimal solutions can be computed in O(n 2 ) time. Our algorithm L-OPT also operates in a more general setting, where the maximum number of outgoing hotlinks is specified individually for each node. The runtime is then O(n 3 ). Experimental evaluation shows that L-OPT terminates within less than one second on problem instances having up to half a million nodes.

show abstract

Section: Resultsmentioning

confidence: 99%

On the Complexity of Optimal Hotlink Assignment

Jacobs

2011

Algorithmica

View full text Add to dashboard Cite

show abstract

“…The authors compared the proposed algorithm with multi-objective GA, two single-objective algorithms namely bin packing, and MMAS; the outcome of the experiment proved that the proposed algorithm is much efficient than the algorithm it was compared to. The authors [16,17] explain the placement problem based on the proxy method. Ant colony optimisation can be used to solve multi-objective optimisation problems to optimise total processing resource wastage and memory resource wastage [18].…”

Section: Ant Colony Algorithmmentioning

confidence: 99%

Energy-efficient virtual machine placement using enhanced firefly algorithm

Barlaskar

Singh

Issac

2016

MGS

View full text Add to dashboard Cite

The consolidation of the virtual machines (VMs) helps to optimise the usage of resources and hence reduces the energy consumption in a cloud data centre. VM placement plays an important part in the consolidation of the VMs. The researchers have developed various algorithms for VM placement considering the optimised energy consumption. However, these algorithms lack the use of exploitation mechanism efficiently. This paper addresses VM placement issues by proposing two meta-heuristic algorithms namely, the enhanced modified firefly algorithm (MFF) and the hierarchical cluster based modified firefly algorithm (HCMFF), presenting the comparative analysis relating to energy optimisation. The comparisons are made against the existing honeybee (HB) algorithm, honeybee cluster based technique (HCT) and the energy consumption results of all the participating algorithms confirm that the proposed HCMFF is more efficient than the other algorithms. The simulation study shows that HCMFF consumes 12% less energy than honeybee algorithm, 6% less than HCT algorithm and 2% less than original firefly. The usage of the appropriate algorithm can help in efficient usage of energy in cloud computing.

show abstract

“…Li et al [23] proposed an algorithm for finding the optimal placement of multiple web proxies among potential sites the trees. The algorithm obtains the optimal solution for the tree topology using O(N 3 M 2 ) time.…”

Section: B Location Assignment Algorithmsmentioning

confidence: 99%

Mediating Multimedia Traffic with Strict Delivery Constraints

Karl

Polishchuk

Herfet

et al. 2012

2012 IEEE International Symposium on Multimedia

View full text Add to dashboard Cite

Abstract-Internet multimedia traffic currently occupies more than half of the total Internet traffic and it continues to expand tremendously. Targeting to meet strict constraints imposed by the requirements of real-time multimedia applications appropriate error correction techniques should be implemented within the data dissemination network. We propose to introduce multipurpose relay nodes called Mediators into several positions within the tree networks typical for multicasting and broadcasting scenarios. By utilizing the error-correction domain separation paradigm in combination with selective insertion of the supplementary data from parallel networks, when the corresponding content is available, the proposed mechanism reduces the total network load and improves scalability of multicast/broadcast transmission. We share our view on how the existing application frameworks could benefit from the incremental deployment of the proposed mechanism. Experimental results confirm suitability and applicability of our assumptions.

show abstract

Optimal placement of Web proxies for tree networks

Cited by 12 publications

References 14 publications

On the Complexity of Optimal Hotlink Assignment

On the Complexity of Optimal Hotlink Assignment

Energy-efficient virtual machine placement using enhanced firefly algorithm

Mediating Multimedia Traffic with Strict Delivery Constraints

Contact Info

Product

Resources

About