Redirection algorithms for load sharing in distributed Web-server systems

Cardellini, Valeria; Colajanni, Michele; Yu, Philip S.

doi:10.1109/icdcs.1999.776555

Cited by 65 publications

(34 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Amongst the work on load distribution strategies across geographically distributed Web servers, efforts by Conti et al [11] and Cardellini et al [8] could be adverted. The first is targeted to a QoS-based architecture for load distribution among replicated Web servers.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Resource discovery and request-redirection for dynamic load sharing in multi-provider peering content delivery networks

Pathan

Buyya

2009

Journal of Network and Computer Applications

View full text Add to dashboard Cite

A constellation of Content Delivery Networks (CDNs), termed as peering CDNs, endeavors to guarantee adequate delivery performance when the incoming request load is overwhelming for a single provider alone. Each user is served by an optimal Web server in terms of network cost, even under heavy load conditions. Before it could be comprehended, appropriate resource discovery and request-redirection mechanisms, coupled with an optimal server selection strategy, should be in place to perform the distribution of highly skewed loads. In this paper, we devise an effective load distribution strategy by adopting distributed resource discovery and dynamic request-redirection mechanisms, taking traffic load and network proximity into account. The load distribution strategy reacts to overload conditions, at a time instance, in any primary CDN server(s) and instantly distributes loads to the target servers, minimizing network cost and observing practical constraints. In this context, we exercise an asynchronous resource discovery protocol, reminiscent of the public/subscribe notion, and formulate the resulting redirection scheme. Extensive simulation analyses demonstrate the novelty of our approach. In particular, we show that our approach is effective to handle high load skews by preserving locality, and thus achieve service "responsiveness". We also perform a sensitivity analysis to reveal that our redirection scheme outperforms other alternatives to handle peak loads.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Redirected entities (what) End-user requests Table 2 summarizes the properties of the redirection scheme, according to the classifications presented by Cardellini et al [8]. The first property specifies the mechanism in which redirection is activated and where the activation decision process is made.…”

Section: Redirection Policymentioning

confidence: 99%

Resource discovery and request-redirection for dynamic load sharing in multi-provider peering content delivery networks

Pathan

Buyya

2009

Journal of Network and Computer Applications

View full text Add to dashboard Cite

show abstract

“…Network level support enables client requests to be redirected to appropriate servers in a quick and efficient manner. In [12] the authors focus on an alternative architecture that integrates DNS dispatching mechanism with a HTTP redirection technique carried out by Web servers. In the following sections we describe in details the main request-redirection mechanisms.…”

Section: Request-redirection Mechanismsmentioning

confidence: 99%

A Walk through Content Delivery Networks

Bartolini

Casalicchio

Tucci

2004

Performance Tools and Applications to Networked Systems

View full text Add to dashboard Cite

Abstract. Content Delivery Networks (CDN) aim at overcoming the inherent limitations of the Internet. The main concept at the basis of this technology is the delivery at edge points of the network, in proximity to the request areas, to improve the user's perceived performance while limiting the costs. This paper focuses on the main research areas in the field of CDN, pointing out the motivations, and analyzing the existing strategies for replica placement and management, server measurement, best fit replica selection and request redirection.

show abstract

“…The LL algorithm attempts to balance the load between servers by assigning incoming jobs to the least-loaded server [1,12] . In server packing, an existing server with a high utilization is packed into a destination server with a low utilization [11] .…”

Section: Least Loaded Algorithmmentioning

confidence: 99%

Server Optimization Using Heuristic Algorithms for Dynamic-Split-and-Merge Scheme in Wireless Multicast

Sukumar¹,

Vasudevan²

2009

J. of Computer Science

View full text Add to dashboard Cite

Problem statement:In order to minimize the overall network traffic in a multiserver system, the number of users served by each server (and hence the group size) should remain constant. As the underlying traffic fluctuates, a split and merge scheme is implemented in a physical server to achieve load balancing. Approach: Minimizing the number of servers during the merge operation is NP hard and to achieve these two algorithms namely FFD bin packing algorithm and LL algorithm were proposed to find the near optimal values of destination servers. Results: The performance of these algorithms were analyzed and compared based on several parameters. Conclusion: Results showed that LL algorithm outperforms FFD algorithm.

show abstract

Redirection algorithms for load sharing in distributed Web-server systems

Cited by 65 publications

References 12 publications

Resource discovery and request-redirection for dynamic load sharing in multi-provider peering content delivery networks

Resource discovery and request-redirection for dynamic load sharing in multi-provider peering content delivery networks

A Walk through Content Delivery Networks

Server Optimization Using Heuristic Algorithms for Dynamic-Split-and-Merge Scheme in Wireless Multicast

Contact Info

Product

Resources

About