a comparison of load balancing techniques for scalable web servers

24
1 A Comparison of Load Balancing Techniques for Scalable Web Servers Haakon Bryhni, University of Oslo Espen Klovning an d Øivind Kure, Telenor Re serch and Development

Upload: elvis-alexander

Post on 03-Jan-2016

52 views

Category:

Documents


8 download

DESCRIPTION

A Comparison of Load Balancing Techniques for Scalable Web Servers. Haakon Bryhni, University of Oslo Espen Klovning and Ø ivind Kure, Telenor Reserch and Development. Introduction. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: A Comparison of Load Balancing Techniques for Scalable Web Servers

1

A Comparison of Load Balancing Techniques for Scalable Web

Servers

Haakon Bryhni, University of Oslo Espen Klovning and Øivind Kure, Tele

nor Reserch and Development

Page 2: A Comparison of Load Balancing Techniques for Scalable Web Servers

2

Introduction

• In retrieving an object from the Web, a canonical name must be mapped to an IP address, a MAC address and an object locator.

• Each remapping offers an opportunity to redirect the request to the most appropriate machine from a load balancing viewpoint

Page 3: A Comparison of Load Balancing Techniques for Scalable Web Servers

3

Introduction

Page 4: A Comparison of Load Balancing Techniques for Scalable Web Servers

4

Introduction

• The aim of this article is to compare and evaluate different load balancing algorithms for scalable Web servers.– Round-Robin – Connections– Round-trip– Xmitbyte

Page 5: A Comparison of Load Balancing Techniques for Scalable Web Servers

5

Remapping in the Client

• The DNS system provides a distributed database for mapping between CNAME and IP addresses

• These name servers can transparently return the IP address of the available Web servers in the list in a round robin manner.

• Due to the caching strategies with a configurable time to live (TTL) used throughout the Internet in the DNS, performance is influenced by the spatial and temporal distribution of access.

Page 6: A Comparison of Load Balancing Techniques for Scalable Web Servers

6

Remapping in the Client

• Requests from end systems in the same domain will be directed to the same destination since the remote name serer will cache the CANME-to-IP-address mapping.

• This mapping is reported by the rotating name server at the first request, and is cached by the name server in the client’s local domain

Page 7: A Comparison of Load Balancing Techniques for Scalable Web Servers

7

Remapping in the Network

• Remapping at network layer

• Remapping is done between the network layer and link layer

Page 8: A Comparison of Load Balancing Techniques for Scalable Web Servers

8

Remapping at network layer

• Each replicated server has a unique IP address

• All IP packets destined for a logical server are inspected, and the destination address is replaced with the address of the replicated server with the lowest load.

• Figure 3

Page 9: A Comparison of Load Balancing Techniques for Scalable Web Servers

9

Remapping at network layer

Page 10: A Comparison of Load Balancing Techniques for Scalable Web Servers

10

Remapping at network layer

• Disadvantage– The destination IP address is modified, modifyi

ng the IP datagram cyclic redundancy check (CRC) checksum field and IP TTL field incur additional processing cost

Page 11: A Comparison of Load Balancing Techniques for Scalable Web Servers

11

Remapping between the network and link layers

• All replicated servers have the same IP address as the logical server

• Server assignment is done when the IP address is mapped to a link address

• Each replicated server has a unique link address ( MAC address or port number )

Page 12: A Comparison of Load Balancing Techniques for Scalable Web Servers

12

Remapping between the network and link layers

• Advantage– IP packets do not have to be modified

• Disadvantage– All replicated servers must be on the same

subnet

Page 13: A Comparison of Load Balancing Techniques for Scalable Web Servers

13

Load Balancing Algorithms

• Round-robin approach– It distributes requests to the different Web

servers in a round-robin manner independent of the load on each Web server

– Overload a Web server is possible if the sequence of requests is non-optimal

Page 14: A Comparison of Load Balancing Techniques for Scalable Web Servers

14

Load Balancing Algorithms

• Connections– It keep tracks of the number of active

connections to each server and always directs a new connection to the server with least connections

– If two or more servers have the same number of active connections, the load balancer will choose the server with the lowest server identifier ( the servers are numbered )

Page 15: A Comparison of Load Balancing Techniques for Scalable Web Servers

15

Load Balancing Algorithms

• Round-trip scheme– It monitors the request/response phase of each

connection by monitoring the TCP protocol.– For each connection, the elapsed time between

forwarding the first byte of the request to the server and the first byte of the response to the client is calculated

Page 16: A Comparison of Load Balancing Techniques for Scalable Web Servers

16

Load Balancing Algorithms

• Round-trip scheme– The mean elapsed time of all connections

during an averaging window (default value is set to 1 s) is calculated

– At the end of the averaging window, the calculated average will be reset.

– If the mean elapsed time of several servers is the same, the server with the fewest active connections is chosen

Page 17: A Comparison of Load Balancing Techniques for Scalable Web Servers

17

Load Balancing Algorithms

• Xmitbyte– It uses an averaging window as in the round-tri

p scheme– It keeps track of the amount of transmitted byte

s from each Web server since the last averaging reset

– It chooses the server with the fewest active connections, in case two or more servers have transmitted the same number of bytes

Page 18: A Comparison of Load Balancing Techniques for Scalable Web Servers

18

Performance Evaluation by Simulation

• The remapping element and Web servers are connected using a 155Mb.s ATM LAN

• The configurable connection speed to the Web clients is set to 2Mb/s

• Figure 4.

Page 19: A Comparison of Load Balancing Techniques for Scalable Web Servers

19

Performance Evaluation by Simulation

Page 20: A Comparison of Load Balancing Techniques for Scalable Web Servers

20

The Simulation Method

• Trace-driven simulation

• The simulation here are based on several 24-hr traces from the proxy server if a large ISP in Norway. In addition , the simulation was run with traces from a Web server at the University of Oslo Department of Informatics

Page 21: A Comparison of Load Balancing Techniques for Scalable Web Servers

21

Load Balancing with a Rotating Name Server

• Caching in the DNS system will remember CNAME-to-IP mapping such that request coming from the same domain will go to the same server.

• In our trace-driven simulator, we can observe the skewed load

Page 22: A Comparison of Load Balancing Techniques for Scalable Web Servers

22

Load Balancing with a Rotating Name Server

• The rotating naming server with TTL = 1 hr gives connection loads ranging from 10.7 to 15.8 percent with 8 servers. If the TTL value is larger, the load is further skewed.

• A TTL of 24 hr, gives connection loads ranging from 8.1 to 18.5 percent form the same trace.

Page 23: A Comparison of Load Balancing Techniques for Scalable Web Servers

23

Load Balancing with a Rotating Name Server

• A smaller TTL value improves the load balancing. However, there is a lower threshold on the TTL value, since DNS traffic increases with lower TTL values.

• Another observation is that the more servers are used in the cluster, the more uneven the load balancing becomes.

Page 24: A Comparison of Load Balancing Techniques for Scalable Web Servers

24

Load Balancing in a Remapping Network Element

• In our simulation, the round-robin policy provides good load sharing combined with the lowest average response time