Data distribution algorithms for load balanced fault-tolerant Web access

Narendran, B.; Rangarajan, Sampath; Yajnik, S.

doi:10.1109/reldis.1997.632803

Cited by 27 publications

(24 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We can formally state the problem with context to replication as [42]: "Given N various objects of different sizes, partition them into the minimum number of disjoint sets such that the cumulative size of each set does not exceed a certain threshold." This approach was first studied in [46], wherein the authors formulated the problem over a cluster of web-servers and reduced the server loads by using dummy replicas. However, their approach performs well only for small networks.…”

Section: Capacity-constrained Optimizationmentioning

confidence: 99%

See 1 more Smart Citation

Comparison and analysis of ten static heuristics-based Internet data replication techniques

Khan

Ahmad

2008

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Section: Capacity-constrained Optimizationmentioning

confidence: 99%

“…Many researchers [46] have used the partial replication technique with the support of content-aware distributors. The primary usage of content-aware distributors is to redirect the client's request to the server that has the copy of the document requested [48].…”

Section: Capacity-constrained Optimizationmentioning

confidence: 99%

Comparison and analysis of ten static heuristics-based Internet data replication techniques

Khan

Ahmad

2008

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…It is another style of load balancing, which does not exist in the literature [4,12,14], as far as we know.…”

Section: Our Contributionmentioning

confidence: 99%

“…There are some different types of approximate solutions for load balancing. A common one is to bound the load of each entity by a limit [4,12,14]. Its variant is to set the limit according to the capacity of each individual entity [3].…”

Section: Introductionmentioning

confidence: 99%

Online Balancing Two Independent Criteria

Tse

2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We study the online bicriteria load balancing problem in this paper. We choose a system of distributed homogeneous file servers located in a cluster as the scenario and propose two online approximate algorithms for balancing their loads and required storage spaces.We first revisit the best existing solution for document placement, and rewrite it in our first algorithm by imposing some flexibilities. The second algorithm bounds the load and storage space of each server by less than three times of their trivial lower bounds, respectively; and more importantly, for each server, the value of at least one parameter is far from its worst case. The time complexities for both algorithm are O(log M ).

show abstract

“…It has been shown that this problem is NP-hard. (2) Bin Packing [19]: Bin packing is commonly used to model load balancing problems. (3) File Allocation [3,12]: File allocation is used to allocate the objects to sites to optimize a performance parameter.…”

Section: Related Workmentioning

confidence: 99%

Dynamically Selecting Distribution Strategies for Web Documents According to Access Pattern

et al. 2004

Parallel and Distributed Computing: Applications and Technologies

View full text Add to dashboard Cite

SummaryWeb caching and replication are efficient techniques for reducing Web traffic, user access latency, and server load. In this paper, we first propose an improved GreedyDual* (GD*) cache replacement algorithm, which considers update frequency as a factor in its utility function. Second, we present a group-based method for dynamically selecting distribution strategies for web documents according to access patterns. The documents are divided into groups according to access patterns and the documents in each group are assigned to the same distribution strategy. Our group-based model combines performance metrics with the different weights assigned to each of them. Finally, we use both trace data and statistical data to simulate our methods. The experimental results show that our improved GD*algorithm can outperform the existing GD* algorithm over the performance metrics considered, and our group-based method for document distribution strategy selection can improve several performance metrics, while keeping others almost the same.

show abstract

Data distribution algorithms for load balanced fault-tolerant Web access

Cited by 27 publications

References 13 publications

Comparison and analysis of ten static heuristics-based Internet data replication techniques

Comparison and analysis of ten static heuristics-based Internet data replication techniques

Online Balancing Two Independent Criteria

Dynamically Selecting Distribution Strategies for Web Documents According to Access Pattern

Contact Info

Product

Resources

About