LITERATURE SURVEY:

Title:

An Extension-based Dynamic Load Balancing

Model of Heterogeneous Server Cluster

Authors:

Zhang Xiayu, Yu Yongquan, Chen Baixing, Ye Feng, Tan Xingxing

Faculty of computer, Guangdong University of Technology

Abstract:

Load balancing is a classical problem and a research hotspot of web intelligence. DNS load
balancing is the pioneer load balancing technology. But the existing DNS dynamic load
balancing strategies have shortages. This paper puts forward a new load balancing method,
which is to connect extension theory with load balancing. Extension engineering method is
initially proposed by Prof. Cai Wen. It has been successfully used in various applications. In this
paper, we use the operation of matter-element theory, extension set, and dependent function in
extension theory as well as the membership degree of fuzzy math to set up an extension-based
dynamic load balancing model of heterogeneous server cluster. It is proved by experiment that
the load balancing strategy is more effective, dynamic, steady going and in real time by using
this new model.

Keywords: Load balancing, DNS, extension theory, fuzzy math

Introduction:

With the increase of the internet technology and the network service, using server cluster to offer
network service has been a trend. There are two kinds of server cluster, one is homogeneous and
the other is heterogeneous. The load balancing strategy and control of the heterogeneous server
cluster is now the research hotspot. The existing networks scale is increasing day by day and the
load of the networks is being heavier and heavier. Suppose there is only one web server in an
intranet, the networks will run normally at usual. If the number of the visitors is increased to
thousand even ten thousands, the capability of the server will be overly bad. How to solve this
problem? The method is to utilize DNS load balancing to control. In this paper we will introduce
a load balancing based on extension theory. Extension engineering method initial proposed by
Prof. Cai Wen. It has been successfully used in various applications. The control method based
on extension set is presented by Wang Shienyu. The method use the extension set to measure if
the control process is effective and give the extension range of control status. In this paper, we
will analyze the existing load balancing technology and then connect load balancing control with
extension theory. In a word, it is a new application in network intelligence.

Back Ground:

Load Sharing in Distributed Web-server Systems Using Redirection

Algorithms:
A common approach adopted by popular Web sites to handle millions of accesses per day is to
preserve one virtual URL interface and use a distributed server architecture which is hidden from
the user. This system provides scalability and transparency, but requires some internal
mechanism that dynamically assigns client requests to the Web server that can offer the best
service. The assignment decision can be taken at the IP level through some address packet
rewriting mechanism, or at the Domain Name System (DNS) level through the mapping of the
URL-name to the IP-address of one of the servers in the cluster .Both choices have some
drawbacks. The IP-dispatcher based systems have full control on the incoming requests, but they
can be applied only to locally clustered Web servers. (The exception is the Network Dispatcher
approach which can support multiple Network Dispatchers. Moreover, the task of rewriting all
packets can cause the IP-dispatcher to become a bottleneck when the system is subject to heavy
request load. The DNS dispatcher based clusters do not present risks of bottleneck, and can
easily scale from locally to geographically distributed Web- server systems. The main problem of
scheduling through the DNS is due to the IP-address caching mechanism that lets the DNS
control only a very small fraction of the user requests. The limited control and the high non
uniformity of the load from different client domains require sophisticated DNS scheduling
policies to avoid Web server overload. In this paper, we will focus on an alternative architecture
that integrates the DNS dispatching mechanism with a redirection technique carried out by the
Web servers through the redirection mechanism provided by HTTP. Such redirection is
transparent to the users that at most perceive a small increase in the response time. Unlike the IP-
dispatcher based solutions, the HTTP redirection does not require the modification of the IP-
address of the packets reaching or leaving the Web-server cluster. We propose and evaluate a
large set of alternative redirection schemes. We demonstrate that the DNS-dispatcher combined
with suitable redirection mechanisms provides excellent load control that minimizes server
overload. the system model and the design space for the redirection schemes. various policies in
which redirection decisions are periodically taken by the DNS or asynchronously activated by
the Web servers, respectively. the experimental results and related work. concludes the paper
with some final remarks

Replication of information among multiple Web servers is necessary to support high request rates
to popular Web sites. In this paper, we have studied Web cluster architectures in which the DNS
dispatcher function is integrated with some redirection mechanism carried out by the servers. We
have compared various alternative mechanisms with synchronous or asynchronous activation,
and centralized or distributed decision on redirection. Our performance results demonstrate that
the DNS scheduling policies integrated with some redirection mechanisms are effective, even in
the presence of highly skewed load. The experiments indicate that the most useful status
information to decide about reassignment is a combination of domain load and server load.
Moreover, the redirection of individual client connections is necessary to balancing the load
better than domain reassignment alone. However, there are significant differences between
asynchronous and synchronous schemes. Individual client redirection is sufficient to achieve
acceptable performance for asynchronous schemes, whereas it works less well for synchronous
algorithms unless it is combined with domain redirection. The centralized synchronous algorithm
gives the best results for a wide set of system parameters. However, the performance difference
with distributed asynchronous policies is not appreciable unless the Web-server cluster is subject
to very heavy load. Moreover, the intra-cluster communication overhead of synchronous
algorithms is typically higher than that introduced by asynchronous policies

Scalable Web Server Clustering Technologies

In traditional custom-built solutions to clustering, transparent server clustering technologies have

emerged that allow the use of commodity systems in server roles. We broadly classified
transparent server clustering into three categories: L4/2, L4/3, and L7.these technologies as well
as their advantages and disadvantages. Each approach discussed has bottlenecks that limit
scalability. For L4/2 dispatchers, system performance is constrained by the ability of the
dispatcher to set up, look up, and tear down entries. Thus, the most telling performance metric is
the sustainable request rate. L4/3dispatchers are more immediately limited by their ability to
rewrite and recalculate the checksums for the massive numbers of packets they must process.
Thus, in the absence of dedicated check summing hardware, the Cost telling performance metric
is the throughput of the dispatcher. Finally, L7solutions are limited by the complexity of their
content- based routing algorithm and the size of their cache (for those that support caching).
However, by localizing the request space each server must service and caching the results, L7
dispatching should provide higher performance for a given number of back-end servers than
L4/2 or L4/3 dispatching alone. It seems clear that in the future, L7 hardware solutions such as
the Arrow Point switches will continue to dominate software products in terms of performance.
The question one must ask is, how much performance is needed from the Web server for a given
application and network configuration. The L4/2 switch LSMAC — a software application
running in user-space on COTS hardware and software — is capable of saturating an OC-3 (155
Mb/s) link. Apart from the Internet backbone itself, few sites have wide area connectivity at or
above this level. In boosting server performance to the levels supported by L7 hardware
solutions (e.g., Arrow Point switches), the bottleneck is no longer the ability of the server to
generate data, but rather the ability of the network to get that data from the server to the client.
New research on scalable Web servers must take into account wide area network bandwidth as
well as server performance. Industry and academic researchers have just begun to examine this
problem. Cisco’s Distributed Director is an early example of a product that exploits geographic
distribution of servers to achieve high aggregate bandwidth with low latency over the wide area
in addition to a greater degree of fault tolerance.

Comparison of Load Balancing Strategies on Cluster-based Web Servers:

The exponential growth of the Internet and its applications in the recent years has created the
need for faster web servers to reduce the response time and provide better service to the users.
An alternative to a powerful mainframe would be a cluster of processors as web server. A survey
of scalable web server clustering architectures is discussed in this. An important issue is the load
balancing scheme adopted, which influenced the performance and scalability of such
architectures. A load balancing scheme in a cluster-based web server can be divided into two
parts. This consists of the entity that performs the load-balancing task, and the algorithm used to
make decision in distributing HTTP requests among the servers. Based on the entities that
perform the load balancing, Cardellini et al. classify load balancing schemes into four main
approaches: client-based, DNS-based, and dispatcher-based and server based. In this we focus
on dispatcher-based clusters, where one of the processors (the dispatcher) receives all incoming
requests and distributes them among the servers. Dispatcher-based web-server cluster systems
include IBM Network Dispatcher, Cisco Local Director, and Linux Virtual Server Project. The
SWEB architecture proposes a round-robin DNS policy as a first-level load balancing, and a
second-level asynchronous scheme based on redirection. The main disadvantages of DNS-based
schemes are that it controls only part of the incoming requests. It is reported that DNS caching
introduces skewed load on a clustered server by an average of 40 percent of the total load. In
addition, HTTP redirection increases user’s response time, since each redirected request requires
a new client-server connection. Round-robin DNS was found to be of limited value and the
research described in quantifies these limitations. To alleviate the performance loss due to
redirection of HTTP requests at the DNS, Bryhni et al. proposed redirection of request in the
network. The four load balancing algorithms used in their simulation study are round robin, least
connection, round trip time based on an average window size of one second, and Xmitbyte that is
similar to round trip but is based on the amount of bytes transmitted. However, the study is
limited to a small cluster of 4 servers. Many cluster-based web-server architectures employ a
simple Round-Round (RR) job (client HTTP requests) scheduling algorithm, which is simple to
implement, but it is often inefficient. A better approach would be to weight the server workload
in the scheduling scheme. For instance, the dispatcher may assign the next request to the least
loaded (LL) server or to the server with the least connections (LC). As it will be discussed in the
next section, the LL algorithm (referred to as the baseline algorithm) provides the best
performance but it requires detailed information about the workload and often cannot be used in
practice. The aim of this investigation is to study the performance and scalability of dispatcher-
based web server clusters

A NEW KNOWLEDGE REPRESENTATION BASED MATTER ELEMENT

SYSTEM AND THE RELATED EXTENSION REASONING
Knowledge representation and the reasoning based on it are key parts of the present AI research,
the level of which directly affects the intelligence of AI system. Knowledge in the world is of
various types and so is true of knowledge representation and the reasoning based on it. Presently
the usual methods used for knowledge representation in AI system are the predicate formula,
productive method, state space, semantics net, frame system, object-oriented method. Each
representation method and relevant reasoning has its own advantages and disadvantages, but
what is common among them is that the creative thinking [1] (often known as flexibility and
sudden enlightenment) and the natural connection between data are not fully expressed.
Moreover because of the application of computer integrated manufacturing system , office
information system, space data, and huge complicated database and the new requirements of the
traditionally object-oriented technology by some applied areas such as computer-aided software
engineering and multi-media system[2], it is of great practical significance for us to improve the
present knowledge representation methods, especially object-oriented representation method,
heighten their creative representation ability, and further study the reasoning principles based on
them. Based on the matter element system theory[3-6], this paper gives the knowledge
representation methods of matter element system extension AND/OR net, improves the
knowledge representation ability of frame system and the traditionally object-oriented
knowledge representation method. Meanwhile, this paper supplies rich extension reasoning
based on matter element system extension AND/OR net, so as to enrich the reasoning of the
traditionally object-oriented knowledge representation and frame system knowledge
representation and creative reasoning of machine learning. Wide application of these reasoning
can be foreseen in areas such as intelligence system design, intelligence diagnosis and control

Conclusion:

This article puts forward a new load balancing method, which is to connect extension theory and
fuzzy mathematics with load balancing and construct an extension-based DNS dynamic load
balancingmodel of heterogeneous server cluster. By using this new method, the traditional
strategy’s shortages can be conquered. The arithmetic is simple, strong, and easier to carry out.
The maneuverability is enhanced. In addition, the method is multipurpose, fit much computation,
such as granularity computation, fit to the people logical way of thinking. Thus this extension
base DNS dynamic load balancing model has a bright future for application.

References:

[1] Cardellini V, Colajanni M, P.S.Yu, "Redirection Algorithms for Load Sharing in

Distributed Web Server
Systems", Proceedings of 19th IEEE International Conference on Distributed
Computing Systems, 1999.
pp: 528- 535.

[2] Cardellini V, Colajanni M, "Dynamic Load Balancing on Web Server Systems",

IEEE International
Computing May/June 1999, pp: 28-39.

[3] T Schroeder, S Goddard, B Ramamurthy, "Scalable Web Server Clusterint

Technologies", IEEE Network, May/June 2000, pp: 38- 45.

[4] H.Bryhni, E.Klovning, O.Kure, "A Comparison of Load Balancing Techniques for
Scalable Web Servers", IEEE Network, July/August 2000,pp: 58- 64.

[5] Cai Wen, Yang Chunyan, Lin Weichu, Extension engineer method (M), Beijing,
Science Press, 1999,
pp:95~101.

[6] Cai Wen , "Extension theory and its application" [J], Chinese Science Bulletin,
1999．44(17): 1538~1548.

[7] Yang Guowei, Zhou Xianpu, Tu Xuyan, "Tensibility of the Matter Element System
and its Applications",Advances in Modelling＆Analysis A，2003，40 (1) ：pp:23~39.

[8] Yu Yongquan, Zeng Bi, Microcontroller Fuzzy Logic Control, Beijing Aerospace
University Press,1997, pp:23-45.

[9] Yu Yongquan ,Huang Ying , Wang Minghui, "The Related Matter-Elements in

Extension Detecting and
Application"，Third International Conference on Information Technology and
Applications (ICITA'05) July
2005，pp. 411-414.

RELATED WORKS:
A new knowledge representation based matter element
system and the related extension reasoning
Guowei Yang; Xinghua Lu; Xuyan Tu
Natural Language Processing and Knowledge Engineering, 2003. Proceedings 2003
International Conference on
Volume , Issue , 26-29 Oct. 2003 Page(s): 89 - 94
Digital Object Identifier 10.1109/NLPKE.2003.1275874

Summary: A matter element system extension AND/OR net is proposed, which has
the representation ability of object-oriented knowledge representation, and the
representation ability of creative thinking procedure as well. Moreover the matter
element system extension AND/OR net can greatly increase data searching, data
mining routes of object-oriented intelligent system. Meanwhile the rich reasoning
based on matter element system extension AND/OR net are given, which enrich the
contents of creative reasoning of machine learning

SWEB: towards a scalable World Wide Web server on

multicomputers
Andresen, D. Tao Yang Holmedahl, V. Ibarra, O.H.
Dept. of Comput. Sci., California Univ., Santa Barbara, CA
This paper appears in: Parallel Processing Symposium, 1996., Proceedings of
IPPS '96, The 10th International
Publication Date: 15-19 Apr 1996
On page(s): 850-856
Meeting Date: 04/15/1996 - 04/19/1996
Location: Honolulu, HI, USA
ISBN: 0-8186-7255-2
References Cited: 11
INSPEC Accession Number: 5309812
Digital Object Identifier: 10.1109/IPPS.1996.508191
Current Version Published: 2002-08-06

Summary: We investigate the issues involved in developing a scalable World Wide Web
(WWW) server on a cluster of workstations and parallel machines. The objective is to strengthen
the processing capabilities of such a server by utilizing the power of multicomputer to match
huge demands in simultaneous access requests from the Internet. We have implemented a system
called SWEB on a distributed memory machine, the Meiko CS-2, and networked workstations.
The scheduling component of the system actively monitors the usages of CPU, I/O channels and
the interconnection network to effectively distribute HTTP requests across processing units to
exploit task and I/O parallelism. We present the experimental results on the performance of this
system

Load balancing a cluster of web servers: using distributed

packetrewriting
Aversa, L.; Bestavros, A.
Performance, Computing, and Communications Conference, 2000. IPCCC apos;00.
Conference Proceeding of the IEEE International
Volume , Issue , Feb 2000 Page(s):24 - 29
Digital Object Identifier 10.1109/PCCC.2000.830297

Summary: We present and evaluate an implementation of a prototype scalable

web server consisting of a load-balanced cluster of hosts that collectively accept
and service TCP connections. The host IP addresses are advertised using round
robin DNS (RR-DNS) technique, allowing any host to receive requests from any
client. Once a client attempts to establish a TCP connection with one of the hosts, a
decision is made as to whether or not the connection should be redirected to a
different host-namely, the host with the lowest number of established connections.
We use the low-overhead Distributed Packet Rewriting (DPR) technique to redirect
TCP connections. In our prototype, each host keeps information about the remaining
hosts in the system. Load information is maintained using periodic multicast
amongst the cluster hosts. Performance measurements suggest that our prototype
outperforms both pure RR-DNS and the stateless DPR solutions

A comparison of load balancing techniques for scalable

Web servers
Bryhni, H.; Klovning, E.; Kure, O.
Network, IEEE
Volume 14, Issue 4, Jul/Aug 2000 Page(s):58 - 64
Digital Object Identifier 10.1109/65.855480

Summary: Scalable Web servers can be built using a network of workstations

where server capacity can be extended by adding new workstations as the workload
increases. The topic of our article is a comparison of different method to do load-
balancing of HTTP traffic for scalable Web servers. We present a classification
framework the different load-balancing methods and compare their performance. In
addition, we evaluate in detail one class of methods using a prototype
implementation with instruction-level analysis of processing overhead. The
comparison is based on a trace driven simulation of traces from a large ISP (Internet
Service Provider) in Norway. The simulation model is used to analyze different load-
balancing schemes based on redirection of request in the network and redirection in
the mapping between a canonical name (CNAME) and IP address. The latter is
vulnerable to spatial and temporal locality, although for the set of traces used, the
impact of locality is limited. The best performance is obtained with redirection in the
network