Load Distribution among Replicated Web Servers: A QoS-based Approach Marco Conti, Enrico Gregori, Fabio Panzieri WISP99 2000.9.14 KAIST EECSD CALab Hwang.

Slides:



Advertisements
Similar presentations
Inktomi Confidential and Proprietary The Inktomi Climate Lab: An Integrated Environment for Analyzing and Simulating Customer Network Traffic Stephane.
Advertisements

Scheduling in Web Server Clusters CS 260 LECTURE 3 From: IBM Technical Report.
Ningning HuCarnegie Mellon University1 Optimizing Network Performance In Replicated Hosting Peter Steenkiste (CMU) with Ningning Hu (CMU), Oliver Spatscheck.
Consistency and Replication Chapter 7 Part II Replica Management & Consistency Protocols.
LOAD BALANCING IN A CENTRALIZED DISTRIBUTED SYSTEM BY ANILA JAGANNATHAM ELENA HARRIS.
PERSISTENT DROPPING: An Efficient Control of Traffic Aggregates Hani JamjoomKang G. Shin Electrical Engineering & Computer Science UNIVERSITY OF MICHIGAN,
1 Content Delivery Networks iBAND2 May 24, 1999 Dave Farber CTO Sandpiper Networks, Inc.
1 Routing and Scheduling in Web Server Clusters. 2 Reference The State of the Art in Locally Distributed Web-server Systems Valeria Cardellini, Emiliano.
Spring 2003CS 4611 Content Distribution Networks Outline Implementation Techniques Hashing Schemes Redirection Strategies.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
2/23/2004 Load Balancing February 23, /23/2004 Assignments Work on Registrar Assignment.
Peer-to-Peer Based Multimedia Distribution Service Zhe Xiang, Qian Zhang, Wenwu Zhu, Zhensheng Zhang IEEE Transactions on Multimedia, Vol. 6, No. 2, April.
1 A Comparison of Load Balancing Techniques for Scalable Web Servers Haakon Bryhni, University of Oslo Espen Klovning and Øivind Kure, Telenor Reserch.
Kyushu University Graduate School of Information Science and Electrical Engineering Department of Advanced Information Technology Supervisor: Professor.
Fair Scheduling in Web Servers CS 213 Lecture 17 L.N. Bhuyan.
Application-Layer Anycasting: A Server Selection Architecture and Use in a Replicated Web Service IEEE/ACM Transactions on Networking Vol.8, No. 4, August.
Multiple Processor Systems 8.1 Multiprocessors 8.2 Multicomputers 8.3 Distributed systems.
Adaptive Content Delivery for Scalable Web Servers Authors: Rahul Pradhan and Mark Claypool Presented by: David Finkel Computer Science Department Worcester.
Wide Web Load Balancing Algorithm Design Yingfang Zhang.
1 Web Content Delivery Reading: Section and COS 461: Computer Networks Spring 2007 (MW 1:30-2:50 in Friend 004) Ioannis Avramopoulos Instructor:
Peer-to-peer Multimedia Streaming and Caching Service by Won J. Jeon and Klara Nahrstedt University of Illinois at Urbana-Champaign, Urbana, USA.
PCP: Efficient Endpoint Congestion Control To appear in NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of.
DISTRIBUTED COMPUTING
Dynamic Load Balancing on Web-server Systems Valeria Cardellini, Michele Colajanni, and Philip S. Yu Presented by Sui-Yu Wang.
Web Server Load Balancing/Scheduling Asima Silva Tim Sutherland.
Network Simulation Internet Technologies and Applications.
1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.
Active Network Applications Tom Anderson University of Washington.
1 Proceeding the Second Exercises on Computer and Systems Engineering Professor OKAMURA Laboratory. Othman Othman M.M.
Achieving Load Balance and Effective Caching in Clustered Web Servers Richard B. Bunt Derek L. Eager Gregory M. Oster Carey L. Williamson Department of.
Server Load Balancing. Introduction Why is load balancing of servers needed? If there is only one web server responding to all the incoming HTTP requests.
Redirection and Load Balancing
Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.
DNS (Domain Name System) Protocol On the Internet, the DNS associates various sorts of information with domain names. A domain name is a meaningful and.
OPTIMAL SERVER PROVISIONING AND FREQUENCY ADJUSTMENT IN SERVER CLUSTERS Presented by: Xinying Zheng 09/13/ XINYING ZHENG, YU CAI MICHIGAN TECHNOLOGICAL.
Chapter 1: Introduction to Web Applications. This chapter gives an overview of the Internet, and where the World Wide Web fits in. It then outlines the.
CH2 System models.
IT Introduction to Information Technology. The Internet & World Wide Web Began in 1969 with the ARPANET (Advanced Research Project Agency Network)
DIS Project Proposal: Robust Content Distribution Network R 周亦方 R 莊豐源 R 黃世翔 By Software Implementation 資管所 研一.
Module 4: Fundamentals of Communication Technologies.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
An Efficient Approach for Content Delivery in Overlay Networks Mohammad Malli Chadi Barakat, Walid Dabbous Planete Project To appear in proceedings of.
The Inter-network is a big network of networks.. The five-layer networking model for the internet.
TOMA: A Viable Solution for Large- Scale Multicast Service Support Li Lao, Jun-Hong Cui, and Mario Gerla UCLA and University of Connecticut Networking.
1 On the Placement of Web Server Replicas Lili Qiu, Microsoft Research Venkata N. Padmanabhan, Microsoft Research Geoffrey M. Voelker, UCSD IEEE INFOCOM’2001,
Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation.
A Method for Transparent Admission Control and Request Scheduling in E-Commerce Web Sites S. Elnikety, E. Nahum, J. Tracey and W. Zwaenpoel Presented By.
PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System Computer Science Department College of William and Mary Lei Guo, Songqing Chen, and Xiaodong.
11 CLUSTERING AND AVAILABILITY Chapter 11. Chapter 11: CLUSTERING AND AVAILABILITY2 OVERVIEW  Describe the clustering capabilities of Microsoft Windows.
DYNAMIC LOAD BALANCING ON WEB-SERVER SYSTEMS by Valeria Cardellini Michele Colajanni Philip S. Yu.
Push Technology Humie Leung Annabelle Huo. Introduction Push technology is a set of technologies used to send information to a client without the client.
INTERNET PROTOCOLS. Microsoft’s Internet Information Server Home Page Figure IT2031 UNIT-3.
Measuring the Capacity of a Web Server USENIX Sympo. on Internet Tech. and Sys. ‘ Koo-Min Ahn.
PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.
Adaptive Load Sharing for Clustered Digital Library Servers Song, yong-joo System Software Lab, EECS, KAIST 9. 13, 2000.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
Introduction to Networking
On the Placement of Web Server Replicas Yu Cai. Paper On the Placement of Web Server Replicas Lili Qiu, Venkata N. Padmanabhan, Geoffrey M. Voelker Infocom.
Presented by Deepak Varghese Reg No: Introduction Application S/W for server load balancing Many client requests make server congestion Distribute.
PERFORMANCE MANAGEMENT IMPROVING PERFORMANCE TECHNIQUES Network management system 1.
Web Server Load Balancing/Scheduling
Web Server Load Balancing/Scheduling
Mohammad Malli Chadi Barakat, Walid Dabbous Alcatel meeting
Memory Management for Scalable Web Data Servers
A Survey of Routing Techniques for Mobile Communication Networks
Design Unit 26 Design a small or home office network
Capacity Analysis, cont. Realistic Server Performance
ANALYSIS OF TASK ASSIGNMENT POLICIES SCALABLE WEB SERVERS SYSTEMS
HTTP and Abstraction on the Internet / The Need for DNS
Presentation transcript:

Load Distribution among Replicated Web Servers: A QoS-based Approach Marco Conti, Enrico Gregori, Fabio Panzieri WISP KAIST EECSD CALab Hwang In-Chul

2/15 Contents n Introduction n Load Distribution Strategies n A QoS-Based Architecture n Work in Progress n Critique

3/15 Introduction(1/2) n A practical approach to the provision of web services –Replicate Web servers(WSs) at distinct sites –Each client select the “most convenient” WS replica n The success of this approach –To bind dynamically a client to the most convenient replica –To maintain data consistency among the WS replicas

4/15 Introduction(2/2) n In this paper –Load distribution strategy Mirror-based strategy DNS-based strategy QoS-based strategy –To minimize the URT(User Response Time)

5/15 Load Distribution Strategies n Mirror-based strategy –The user manually selects a replica n DNS-based strategy –“Ideal” round-robin assignment of clients to WS replicas n QoS-based strategy –DNS : all addresses of replica WSs –Browser selects a replica with satisfactory URT by sending probe

6/15 Load Distribution Strategies - Performance Comparison n Simulation scenario Inter area network transfer delay Intra area network transfer delay Area 1 Area 4Area 3 Area 2 Area 1 Network Delay Area 4 Network Delay Area 3 Network Delay Area 2 Network Delay Web Server replica 1 Web Server replica 2 Web Server replica 3 Web Server replica 4 Internet Browsers Access line to a Web Server Simulation scenario

7/15 Load Distribution Strategies - Performance Comparison n Simulation environment –Network delay model Intra-area delays –The minimum area round trip time –The queuing delays in the area router –The packet transmission time Inter-area delays –Random variables –Other factors Consecutive queryIndependent and exponential distributed Each queryAccess a geometrically distributed number of pages Web page sizeAvg bytes Dummy req.1000 bytes Server capacity200 request per second(FIFO queue)

8/15 Load Distribution Strategies - Performance Comparison n Impact of intra-area network congestion –Results Utilization of each replica –QoS-based strategy : (0.58, 0.91, 0.92, 0.92) –Other strategies : uniformly 0.80 Area 1 Routers0.98 Util. Other Areas RoutersMax. 0.8 Util.

9/15 Load Distribution Strategies - Performance Comparison n A heavily loaded area –Results Area 1 User-Query Generation0.98 of Server Capacity Other Areas0.8 of ServerCapacity

10/15 Load Distribution Strategies - Performance Comparison n Symmetric case –All Areas The most congested router : 0.80 utilization The user-query generation rate : 0.80 of server capacity –Results

11/15 Load Distribution Strategies - Performance Comparison n A realistic scenario –Four distinct areas USA, Europe, Asia, Australia –Daily different loads in different periods of time –Results

12/15 A QoS-Based Architecture n Do not require modification of any software n Architecture

13/15 A QoS-Based Architecture n Drawback –URT estimation : Single measure –Polling overhead DNS Replicated Server 1 Replicated Server 2 Replicated Server N... Browser DNS Request All Replica’s IP Address Probe Request DNS Replicated Server 1 Replicated Server 2 Replicated Server N... Browser DNS Request One Replica’s IP Address Probe Reply Broadcast Poll Request Poll Reply Poll Request Poll Reply (All Replica’s IP Address)

14/15 Work in Progress n Load Distribution(LD) service –To overcome the main limitations –Responsible for distributing the browsers’ requests –Maintain for each WS replica the WS response time –Continuous monitoring of the response time

15/15 Critiques n Contribution in this paper –QoS-based approach: Minimize URT –Load distribution considering network delay n Simulation with realistic workload n Not Scalable n More research on LD –How to evaluate the accurate WS response time

16/15