Sie sind auf Seite 1von 65

1.

INTRODUCTION
1.1 Introduction
Cloud computing is an attracting technology in the eld of computer science. In
Gartners report, it says that the cloud will bring changes to the IT industry. The cloud is
changing our life by providing users with new types of services. Users get service from a
cloud without paying attention to the details. I!T gave a denition of cloud computing as a
model for enabling ubi"uitous, convenient, on#demand networ$ access to a shared pool of
congurable computing resources %e.g., networ$s, servers, storage, applications, and services&
that can be rapidly provisioned and released with minimal management effort or service
provider interaction. 'ore and more people pay attention to cloud computing.
Cloud computing is efcient and scalable but maintaining the stability of processing
so many (obs in the cloud computing environment is a very comple) problem with load
balancing receiving much attention for researchers. !ince the (ob arrival pattern is not
predictable and the capacities of each node in the cloud differ, for load balancing problem,
wor$load control is crucial to improve system performance and maintain stability.
*oad balancing schemes depending on whether the system dynamics are important
can be either static or dynamic. !tatic schemes do not use the system information and are less
comple) while dynamic schemes will bring additional costs for the system but can change as
the system status changes.
1.2 Proposed System
*oad balancing schemes depending on whether the system dynamics are important
can be either static or dynamic. !tatic schemes do not use the system information and are less
comple) while dynamic schemes will bring additional costs for the system but can change as
the system status changes. + dynamic scheme is used here for its ,e)ibility. The model has a
main controller and balancers to gather and analy-e the information. Thus, the dynamic
control has little in,uence on the other wor$ing nodes. The system status then provides a
basis for choosing the right load balancing strategy.
.
2. LITERATURE SURVE
Cloud computing is an attracting technology in the eld of computer science. In
Gartners report, it says that the cloud will bring changes to the IT industry. The cloud is
changing our life by providing users with new types of services. Users get service from a
cloud without paying attention to the details. I!T gave a denition of cloud computing as a
model for enabling ubi"uitous, convenient, on#demand networ$ access to a shared pool of
congurable computing resources %e.g., networ$s, servers, storage, applications, and services&
that can be rapidly provisioned and released with minimal management effort or service
provider interaction. 'ore and more people pay attention to cloud computing.
Cloud computing is efcient and scalable but maintaining the stability of processing
so many (obs in the cloud computing environment is a very comple) problem with load
balancing receiving much attention for researchers. !ince the (ob arrival pattern is not
predictable and the capacities of each node in the cloud differ, for load balancing problem,
wor$load control is crucial to improve system performance and maintain stability.
*oad balancing schemes depending on whether the system dynamics are important
can be either static or dynamic. !tatic schemes do not use the system information and are less
comple) while dynamic schemes will bring additional costs for the system but can change as
the system status changes. There are several cloud computing categories with this wor$
focused on a public cloud. + public cloud is based on the standard cloud computing model,
with service provided by a service provider. + large public cloud will include many nodes
and the nodes in different geographical locations. Cloud partitioning is used to manage this
large cloud. + cloud partition is a subarea of the public cloud with divisions based on the
geographic locations.
The load balancing strategy is based on the cloud partitioning concept. +fter creating
the cloud partitions, the load balancing then starts/ when a (ob arrives at the system, with the
main controller deciding which cloud partition should receive the (ob. The partition load
balancer then decides how to assign the (obs to the nodes. 0hen the load status of a cloud
partition is normal, this partitioning can be accomplished locally.
1
Good load balance will improve the performance of the entire cloud. 2owever, there
is no common method that can adapt to all possible different situations. 3arious methods
have been developed in improving e)isting solutions to resolve new problems. 4ach
particular method has advantage in a particular area but not in all situations. Therefore, the
current model integrates several methods and switches between the load balance methods
based on the system status.
5
!. SSTE" ANALSIS
!.1 E#istin$ System
Cloud computing is efficient and scalable but maintaining the stability of processing
so many (obs in the cloud computing environment is a very comple) problem with load
balancing receiving much attention for researchers. !ince the (ob arrival pattern is not
predictable and the capacities of each node in the cloud differ, for load balancing problem,
wor$load control is crucial to improve system performance and maintain stability. *oad
balancing schemes depending on whether the system dynamics are important can be either
static or dynamic. !tatic schemes do not use the system information and are less comple)
while dynamic schemes will bring additional costs for the system but can change as the
system status changes. + dynamic scheme is used here for its ,e)ibility.
!.2 Dr%&'%c(s o) t*e E#istin$ System
*oad balancing schemes depending on whether the system dynamics are important
can be either static or dynamic. !tatic schemes do not use the system information and are less
comple).
!.! Proposed System
*oad balancing schemes depending on whether the system dynamics are important can be
either static or dynamic. !tatic schemes do not use the system information and are less
comple) while dynamic schemes will bring additional costs for the system but can change as
the system status changes. + dynamic scheme is used here for its ,e)ibility. The model has a
main controller and balancers to gather and analy-e the information. Thus, the dynamic
control has little in,uence on the other wor$ing nodes. The system status then provides a
basis for choosing the right load balancing strategy. The load balancing model given in this
article is aimed at the public cloud which has numerous nodes with distributed computing
resources in many different geographic locations. Thus, this model divides the public cloud
into several cloud partitions. 0hen the environment is very large and comple), these
divisions simplify the load balancing. The cloud has a main controller that chooses the
suitable partitions for arriving (obs while the balancer for each cloud partition chooses the
best load balancing strategy.
6
!.+ Ad,%nt%$es o) t*e Proposed System
*oad balancing schemes depending on whether the system dynamics are important
can be both static and dynamic. !tatic scheme does use the system information and are less
comple).
!.- So)t&%re De,e.opment Li)e Cyc.e "ode.
Spir%. "ode./ The spiral model is a software development process model combining
elements of both design and prototyping#in#stages, in an effort to combine advantages of top#
down and bottom#up concepts. +lso $nown as the spiral lifecycle model %or spiral
development&, it is a systems development method %!7'& used in information
technology %IT&. This model of development combines the features of the prototyping model
and the waterfall model. The spiral model is intended for large, e)pensive and complicated
pro(ects. This invariant e)cludes 8ha-ardous spiral loo$#ali$e9 processes that use a se"uence
of incremental waterfall passes in settings where the underlying assumptions of the waterfall
model do not apply. :oehm lists these assumptions as follows/
.. The re"uirements are $nown in advance of implementation.
1. The re"uirements have no unresolved, high#ris$ implications, such as ris$s due to
cost, schedule, performance, safety, security, user interfaces, organi-ational impacts,
etc.
5. The nature of the re"uirements will not change very much during development or
evolution.
6. The re"uirements are compatible with all the $ey system sta$eholders e)pectations,
including users, customer, developers, maintainers, and investors.
;. The right architecture for implementing the re"uirements is well understood.
<. There is enough calendar time to proceed se"uentially.
In situations where these assumptions do apply, it is a pro(ect ris$ not to specify the
re"uirements and proceed se"uentially. The waterfall model thus becomes a ris$#driven
special case of the spiral model.
;
Per)orm )our '%sic %cti,ities in e,ery cyc.e
This invariant identifies the four basic activities that must occur in each cycle of the
spiral model/
.. Consider the win conditions of all success#critical sta$eholders.
1. Identify and evaluate alternative approaches for satisfying the win conditions.
5. Identify and resolve ris$s that stem from the selected approaches.
6. =btain approval from all success#critical sta$eholders, plus commitment to pursue the
ne)t cycle.
<
Ris( determines .e,e. o) e))ort
>or any pro(ect activity %e.g., re"uirements analysis, design, prototyping, testing&, the
pro(ect team must decide how much effort is enough. In authentic spiral process cycles, these
decisions are made by minimi-ing overall ris$. >or e)ample, investing additional time testing
a software product often reduces the ris$ due to the mar$etplace re(ecting a shoddy product.
2owever, additional testing time might increase the ris$ due to a competitor?s early mar$et
entry. >rom a spiral model perspective, testing should be performed until the total ris$ is
minimi-ed, and no further. @2a-ardous spiral loo$#ali$es@ that violate this invariant include
evolutionary processes that ignore ris$ due to scalability issues, and incremental processes
that invest heavily in a technical architecture that must be redesigned or replaced to
accommodate future increments of the product.
A

+. SO0T1ARE RE2UIRE"ENT SPECI0ICATION
+.1 0unction%. Re3uirements
User Inter)%ces/ It mainly consists of a form window with menu bar, title bar and toolbar.
In the menu bar we have file, edit, view, options, help where each has their own purpose.
+lso the form consists of button with special functionality. If the pointer is on the button then
it shows the information of the button which will be helpful to the user. The developer
window also will be there where heBshe can perform !C* actions using "ueries.
4%rd&%re Inter)%ces/ The application will be connected to 'y!C* which will be installed
in the system where the application is running.
So)t&%re Inter)%ces/ The product is implemented in 0indows platform and developed in
et beans.
Communic%tions Inter)%ces/ The main controller rst assigns (obs to the suitable cloud
partition and then communicates with the balancers in each partition to refresh this status
information. !ince the main controller deals with information for each partition, smaller data
sets will lead to the higher processing rates. The balancers in each partition gather the status
information from every node and then choose the right strategy to distribute the (obs.
Per)orm%nce Re3uirements/ Good load balance will improve the performance of the entire
cloud. 2owever, there is no common method that can adapt to all possible different
situations. 3arious methods have been developed in improving e)isting solutions to resolve
new problems. 4ach particular method has advantage in a particular area but not in all
situations. Therefore, the current model integrates several methods and switches between the
load balance methods based on the system status.
+.2 Non50unction%. Re3uirements
Security Re3uirements/ 0hen (ob i arrives at the system, the main controller "ueries the
cloud partition where (ob is located. If this locations status is idle or normal, the (ob is
handled locally. If not, another cloud partition is found that is not overloaded.
So)t&%re 2u%.ity Attri'utes/ This pro(ect would be developed completely using open
source software and platforms. !o, anybody can use and enhance the software further without
D
spending money. The cloud partition balancer gathers load information from every node to
evaluate the cloud partition status. This evaluation consists of following attributes
*oad parameter set >
*oad degree %&
*oad degree average
Current node
*oad degree high
+.! So)t&%re Re3uirement Speci)ic%tions
=perating !ystem / 0indowsE;BEDB1FFFBGH
0eb !erver / Tomcat;.FB<.G
Technologies / Iava, I!H, I7:C
0eb services / Iava!cript, 2T'*
J7:'! / 'y!C* ;.F
+.+ 4%rd&%re Re3uirement Speci)ic%tions
Hrocessor / Hentium KIII, ...G2-
J+' / 1;< ':
2ard 7is$ / 1F G:
Ley :oard / !tandard 0indows Leyboard
'ouse / optical
'onitor / .E inches
E
-. SSTE" DESI6N
-.1 System Arc*itecture
The load balance solution is done by the main controller and the balancers. The main
controller rst assigns (obs to the suitable cloud partition and then communicates with the
balancers in each partition to refresh this status information. !ince the main controller deals
with information for each partition, smaller data sets will lead to the higher processing rates.
The balancers in each partition gather the status information from every node and then
choose the right strategy to distribute the (obs. The relationship between the balancers and the
main controller is shown
.F
-.2 D%t% 0.o& Di%$r%ms
The 7>7 is also called as bubble chart. It is a simple graphical formalism that can be
used to represent a system in terms of the input data to the system, various processing carried
out on these data, and the output data is generated by the system.
-.! Desi$n Too. Used
+rgo U'* is an U'* diagramming application written in Iava and released under
the open source 4clipse Hublic *icense. :y virtue of being a Iava application, it is available
on any platform supported by Iava. +rgo U'* was originally developed at UC Irvine by
Iason 4. Jobbins, leading to his Hh.7. It is now an open source pro(ect hosted by Tigris.org.
The +rgo U'* pro(ect now includes more than .E,FFF registered users and over .;F
developers.
User "ode./ +rgo?s user model maintains information about the designer and uses that
information to ma$e the tool more useful. =ne way that it does this is by controlling critics so
that only critics that are timely and relevant to the tas$ at hand can ma$e suggestions. In the
future, the corrective automations and e)planations offered by critics will also be tailored to
the designer.
+rgo?s user model consists of the following parts/
7ecision 'odel/ *ists types of decisions that must be made when doing ob(ect
oriented design. 4ach decision is associated with an level of interest from F to ;. +
critic will not be active if the designer?s interest in the decision that it supports is F.
Goals 'odel %partially implemented&/ Hresents a list of "uestions related to goals for
the design pro(ect. Critics that support active goals may present suggestions.
0or$ :rea$down !tructure %future&/ *ists the tas$s that must be performed when
doing ob(ect oriented design. 4ach tas$ is associated with a level of activity and
several decisions. This model serves the designer as a resource when deciding what
tas$ to do ne)t.
!$ill 'odel %future&/ 4ach designer has their own strengths and wea$nesses. +rgo?s
s$ill model $eeps trac$ of the designer?s self#reported level of $nowledge related to
..
the problem and solution domains. The estimated time to fi) a problem found by a
critic depends on the designer?s $nowledge of domain concepts, design techni"ues,
and tool features.
Ar$o U"L/ +rgo U'* is a Iava based Universal 'odeling *anguage tool. It is able to
create and save all standard U'* diagrams. +rgo U'* also has the ability to reverse
engineer compiling Iava code and generate U'* diagrams for it. +rgo U'* is made
available under the :!7 =pen !ource *icense. +rgo U'* is not production readyM This
means that the things you can?t do will distract you, you will have problems that you won?t
have in commercial U'* tools, and there is no one to blame for this. =n the other hand, this
also means that you have the opportunity to fi) your problems yourself.
-.+ U"L Di%$r%ms
-.+.1 C.%ss Di%$r%m
Class diagram consists of classes, interfaces, associations and collaboration. Class
diagrams basically represent the ob(ect oriented view of a system which is static in nature.
+ctive class is used in a class diagram to represent the concurrency of the system. Class
diagram represents the ob(ect orientation of a system.
user
+id
+name
+user()
Cloud3
+file_name
+file
+category
+selectCloud()
Cloud3
+file_name
+file
+category
+selectCloud()
Cloud3
+file_name
+file
+category
+selectCloud()
server_st at us
+no
+server
+staus
.1
-.+.2 Se3uence Di%$r%m
+ se"uence diagram is an interaction diagram. !e"uence diagram deals with
se"uences, which are the se"uence of messages flowing from one ob(ect to another.
Interaction among the components of a system is important from implementation and
e)ecution perspective. !e"uence diagram is used to visuali-e the se"uence of calls in a
system to perform a specific functionality.
Admin Se3uence/
User Se3uence/
user
videos
clouds
1 : cloud()
2 : watch()
.5
-.+.! Co..%'or%tion Di%$r%m
Collaboration diagram is another form of interaction diagram. It represents the
structural organi-ation of a system and the messages sentBreceived. !tructural organi-ation
consists of ob(ects and lin$s
User Co..%'or%tion/
. The purpose of collaboration diagram is similar to se"uence diagram. :ut the
specific purpose of collaboration diagram is to visuali-e the organi-ation of ob(ects and their
interaction.
Admin Co..%'or%tion/

It represents the structural organi-ation of a system and the messages sentBreceived.
-.+.+ Acti,ity Di%$r%m/
.6
+ctivity diagram describes the flow of control in a system. !o it consists of activities
and lin$s. The flow can be se"uential, concurrent or branched. +ctivities are nothing but the
functions of a system. umbers of activity diagrams are prepared to capture the entire flow in
a system. +ctivity diagrams are used to visuali-e the flow of controls in a system. This is
prepared to have an idea of how the system will wor$ when e)ecuted.
Admin Login
Uload videos
verif y videos
user
through clouds
wat ch videos
Admin Chec!
.;
-.+.- Use c%se Di%$r%m/
Use case diagrams are a set of use cases, actors and their relationships. They represent
the use case view of a system. + use case represents a particular functionality of a system.
Admin
Login
Upload Videos
verify videos
user
wat ch videos
use case diagram is used to describe the relationships among the functionalities and
their internalBe)ternal controllers. These controllers are $nown as actors.
.<
7. I"PLE"ENTATION
7.1 Introduction
Implementation is the stage of the pro(ect when the theoretical design is turned out
into a wor$ing system. Thus it can be considered to be the most critical stage in achieving a
successful new system and in giving the user, confidence that the new system will wor$ and
be effective.
The implementation stage involves careful planning, investigation of the e)isting system and
its constraints on implementation, designing of methods to achieve changeover and
evaluation of change over methods.
7.2 Tec*no.o$y Used
T*e 8%,% Pro$r%mmin$ L%n$u%$e/
The Iava programming language is a high#level language that can be characteri-ed by
all of the following bu--words/
!imple
+rchitecture neutral
=b(ect oriented
Hortable
7istributed
2igh performance
Interpreted
'ultithreaded
Jobust
7ynamic
!ecure
0ith most programming languages, you either compile or interpret a program so that
you can run it on your computer. The Iava programming language is unusual in that a
program is both compiled and interpreted. 0ith the compiler, first you translate a program
.A
into an intermediate language called Java byte codes the platform#independent codes
interpreted by the interpreter on the Iava platform. The interpreter parses and runs each Iava
byte code instruction on the computer. Compilation happens (ust onceN interpretation occurs
each time the program is e)ecuted. The following figure illustrates how this wor$s.
Oou can thin$ of Iava byte codes as the machine code instructions for the
Java Virtual Machine %Iava 3'&. 4very Iava interpreter, whether its a development tool or a
0eb browser that can run applets, is an implementation of the Iava 3'. Iava byte codes help
ma$e 8write once, run anywhere9 possible. Oou can compile your program into byte codes on
any platform that has a Iava compiler. The byte codes can then be run on any implementation
of the Iava 3'. That means that as long as a computer has a Iava 3', the same program
written in the Iava programming language can run on 0indows 1FFF, a !olaris wor$station,
or on an i'ac.
T*e 8%,% P.%t)orm/
.D
+ platform is the hardware or software environment in which a program runs. 0eve
already mentioned some of the most popular platforms li$e 0indows 1FFF, *inu), !olaris,
and 'ac =!. 'ost platforms can be described as a combination of the operating system and
hardware. The Iava platform differs from most other platforms in that its a software#only
platform that runs on top of other hardware#based platforms.
The Iava platform has two components/
The Iava 3irtual 'achine %Iava 3'&
The Iava +pplication Hrogramming Interface %Iava +HI&
Oouve already been introduced to the Iava 3'. Its the base for the Iava platform
and is ported onto various hardware#based platforms.
The Iava +HI is a large collection of ready#made software components that provide
many useful capabilities, such as graphical user interface %GUI& widgets. The Iava +HI is
grouped into libraries of related classes and interfacesN these libraries are $nown as pac$ages.
The ne)t section, 0hat Can Iava Technology 7oP 2ighlights what functionality some of the
pac$ages in the Iava +HI provide.
The following figure depicts a program thats running on the Iava platform. +s the
figure shows, the Iava +HI and the virtual machine insulate the program from the hardware.
ative code is code that after you compile it, the compiled code runs on a specific
hardware platform. +s a platform#independent environment, the Iava platform can be a bit
slower than native code. 2owever, smart compilers, well#tuned interpreters, and (ust#in#time
byte code compilers can bring performance close to that of native code without threatening
portability.

8%,% Tec*no.o$y/
The most common types of programs written in the Iava programming language are
applets and applications. If youve surfed the 0eb, youre probably already familiar with
.E
applets. +n applet is a program that adheres to certain conventions that allow it to run within
a Iava#enabled browser.
2owever, the Iava programming language is not (ust for writing cute, entertaining
applets for the 0eb. The general#purpose, high#level Iava programming language is also a
powerful software platform. Using the generous +HI, you can write many types of programs.
+n application is a standalone program that runs directly on the Iava platform. +
special $ind of application $nown as a server serves and supports clients on a networ$.
4)amples of servers are 0eb servers, pro)y servers, mail servers, and print servers. +nother
speciali-ed program is a servlet. + servlet can almost be thought of as an applet that runs on
the server side. Iava !ervlets are a popular choice for building interactive web applications,
replacing the use of CGI scripts. !ervlets are similar to applets in that they are runtime
e)tensions of applications. Instead of wor$ing in browsers, though, servlets run within Iava
0eb servers, configuring or tailoring the server.
2ow does the +HI support all these $inds of programsP It does so with pac$ages of
software components that provides a wide range of functionality. 4very full implementation
of the Iava platform gives you the following features/
T*e essenti%.s/ =b(ects, strings, threads, numbers, input and output, data structures,
system properties, date and time, and so on.
App.ets/ The set of conventions used by applets.
Net&or(in$/ UJ*s, TCH %Transmission Control Hrotocol&, U7H %User 7ata gram
Hrotocol& soc$ets, and IH %Internet Hrotocol& addresses.
Intern%tion%.i9%tion/ 2elp for writing programs that can be locali-ed for users
worldwide. Hrograms can automatically adapt to specific locales and be displayed in
the appropriate language.
Security/ :oth low level and high level, including electronic signatures, public and
private $ey management, access control, and certificates.
So)t&%re components/ Lnown as Iava:eans, can plug into e)isting component
architectures.
O':ect seri%.i9%tion/ +llows lightweight persistence and communication via Jemote
'ethod Invocation %J'I&.
8%,% D%t%'%se Connecti,ity ;8D<C
T"
=/ Hrovides uniform access to a wide range of
relational databases.
1F
OD<C/
'icrosoft =pen 7atabase Connectivity %=7:C& is a standard programming interface
for application developers and database systems providers. :efore =7:C became a de facto
standard for 0indows programs to interface with database systems, programmers had to use
proprietary languages for each database they wanted to connect to. ow, =7:C has made the
choice of the database system almost irrelevant from a coding perspective, which is as it
should be. +pplication developers have much more important things to worry about than the
synta) that is needed to port their program from one database to another when business needs
suddenly change.
Through the =7:C +dministrator in Control Hanel, you can specify the particular
database that is associated with a data source that an =7:C application program is written to
use. Thin$ of an =7:C data source as a door with a name on it. 4ach door will lead you to a
particular database. >or e)ample, the data source named !ales >igures might be a !C* !erver
database, whereas the +ccounts Hayable data source could refer to an +ccess database. The
physical database referred to by a data source can reside anywhere on the *+.
The =7:C system files are not installed on your system by 0indows E;. Jather, they
are installed when you setup a separate database application, such as !C* !erver Client or
3isual :asic 6.F. 0hen the =7:C icon is installed in Control Hanel, it uses a file called
=7:CI!T.7**. It is also possible to administer your =7:C data sources through a stand#
alone program called =7:C+7'.4G4. There is a .<#bit and a 51#bit version of this
program and each maintains a separate list of =7:C data sources.
>rom a programming perspective, the beauty of =7:C is that the application can be
written to use the same set of function calls to interface with any data source, regardless of
the database vendor. The source code of the application doesnt change whether it tal$s to
=racle or !C* !erver. 0e only mention these two as an e)ample. There are =7:C drivers
available for several do-en popular database systems. 4ven 4)cel spreadsheets and plain te)t
files can be turned into data sources. The operating system uses the Jegistry information
written by =7:C +dministrator to determine which low#level =7:C drivers are needed to
tal$ to the data source %such as the interface to =racle or !C* !erver&. The loading of the
=7:C drivers is transparent to the =7:C application program. In a clientBserver
environment, the =7:C +HI even handles many of the networ$ issues for the application
programmer.
1.
The advantages of this scheme are so numerous that you are probably thin$ing there
must be some catch. The only disadvantage of =7:C is that it isnt as efficient as tal$ing
directly to the native database interface. =7:C has had many detractors ma$e the charge that
it is too slow. 'icrosoft has always claimed that the critical factor in performance is the
"uality of the driver software that is used. In our humble opinion, this is true. The availability
of good =7:C drivers has improved a great deal recently. +nd anyway, the criticism about
performance is somewhat analogous to those who said that compilers would never match the
speed of pure assembly language. 'aybe not, but the compiler %or =7:C& gives you the
opportunity to write cleaner programs, which means you finish sooner. 'eanwhile,
computers get faster every year.
8D<C/
In an effort to set an independent database standard +HI for IavaN !un 'icrosystems
developed Iava 7atabase Connectivity, or I7:C. I7:C offers a generic !C* database access
mechanism that provides a consistent interface to a variety of J7:'!s. This consistent
interface is achieved through the use of 8plug#in9 database connectivity modules, or drivers.
If a database vendor wishes to have I7:C support, he or she must provide the driver for each
platform that the database and Iava run on.
To gain a wider acceptance of I7:C, !un based I7:Cs framewor$ on =7:C. +s
you discovered earlier in this chapter, =7:C has widespread support on a variety of
platforms. :asing I7:C on =7:C will allow vendors to bring I7:C drivers to mar$et much
faster than developing a completely new connectivity solution.
I7:C was announced in 'arch of .EE<. It was released for a EF day public review
that ended Iune D, .EE<. :ecause of user input, the final I7:C v..F specification was
released soon after. The remainder of this section will cover enough information about I7:C
for you to $now what it is about and how to use it effectively. This is by no means a complete
overview of I7:C.
8D<C 6o%.s/
>ew software pac$ages are designed without goals in mind. I7:C is one that, because
of its many goals, drove the development of the +HI. These goals, in con(unction with early
reviewer feedbac$, have finali-ed the I7:C class library into a solid framewor$ for building
database applications in Iava.
11
The goals that were set for I7:C are important. They will give you some insight as to why
certain classes and functionalities behave the way they do. The eight design goals for I7:C
are as follows/
S2L Le,e. API/
The designers felt that their main goal was to define a !C* interface for Iava. +lthough
not the lowest database interface level possible, it is at a low enough level for higher#level
tools and +HIs to be created. Conversely, it is at a high enough level for application
programmers to use it confidently.
S2L Con)orm%nce/
!C* synta) varies as you move from database vendor to database vendor. In an effort to
support a wide variety of vendors, I7:C will allow any "uery statement to be passed
through it to the underlying database driver. This allows the connectivity module to
handle non#standard functionality in a manner that is suitable for its users.
.. 8D<C must 'e imp.ement%. on top o) common d%t%'%se inter)%ces
The I7:C !C* +HI must 8sit9 on top of other common !C* level +HIs. This
goal allows I7:C to use e)isting =7:C level drivers by the use of a software interface.
This interface would translate I7:C calls to =7:C and vice versa.
2. Pro,ide % 8%,% inter)%ce t*%t is consistent &it* t*e rest o) t*e 8%,% system
:ecause of Iavas acceptance in the user community thus far, the designers
feel that they should not stray from the current design of the core Iava system.
!. >eep it simp.e
This goal probably appears in all software design goal listings. I7:C is no
e)ception. !un felt that the design of I7:C should be very simple, allowing for only
one method of completing a tas$ per mechanism. +llowing duplicate functionality
only serves to confuse the users of the +HI.
+. Use stron$? st%tic typin$ &*ere,er possi'.e
!trong typing allows for more error chec$ing to be done at compile timeN also, less
error appear at runtime.
-. >eep t*e common c%ses simp.e
:ecause more often than not, the usual !C* calls used by the programmer are
simple !4*4CTs, I!4JTs, 74*4T4s and UH7+T4s, these "ueries should be
simple to perform with I7:C. 2owever, more comple) !C* statements should also be
possible.
15
Compilation happens (ust onceN interpretation occurs each time the program is
e)ecuted. The figure illustrates how this wor$s.
Oou can thin$ of Iava byte codes as the machine code instructions for the Iava
3irtual 'achine %Iava 3'&. 4very Iava interpreter, whether its a Iava development
tool or a 0eb browser that can run Iava applets, is an implementation of the Iava
3'. The Iava 3' can also be implemented in hardware.
Iava byte codes help ma$e 8write once, run anywhere9 possible. Oou can
compile your Iava program into byte codes on my platform that has a Iava compiler.
The byte codes can then be run any implementation of the Iava 3'. >or e)ample,
the same Iava program can run 0indows T, !olaris, and 'acintosh.
16
8%,%
Pro$r%m
Compi.ers
Interpreter
"y Pro$r%m
Net&or(in$/
The TCHBIH stac$ is shorter than the =!I one/
TCH is a connection#oriented protocolN U7H %User 7atagram Hrotocol& is a connectionless
protocol.
IP d%t%$r%m@s/
The IH layer provides a connectionless and unreliable delivery system. It considers
each datagram independently of the others. +ny association between datagram must be
supplied by the higher layers. The IH layer supplies a chec$sum that includes its own header.
The header includes the source and destination addresses. The IH layer handles routing
through an Internet. It is also responsible for brea$ing up large datagram into smaller ones for
transmission and reassembling them at the other end.
UDP/
U7H is also connectionless and unreliable. 0hat it adds to IH is a chec$sum for the
contents of the datagram and port numbers.
TCP/
TCH supplies logic to give a reliable connection#oriented protocol above IH. It
provides a virtual circuit that two processes can use to communicate.
1;
Internet %ddresses/
In order to use a service, you must be able to find it. The Internet uses an address
scheme for machines so that they can be located. The address is a 51 bit integer which gives
the IH address. This encodes a networ$ I7 and more addressing. The networ$ I7 falls into
various classes according to the si-e of the networ$ address.
Net&or( %ddress/
Class + uses D bits for the networ$ address with 16 bits left over for other addressing.
Class : uses .< bit networ$ addressing. Class C uses 16 bit networ$ addressing and class 7
uses all 51.
Su'net %ddress/
Internally, the UIG networ$ is divided into sub networ$s. :uilding .. is currently
on one sub networ$ and uses .F#bit addressing, allowing .F16 different hosts.
4ost %ddress/
D bits are finally used for host addresses within our subnet. This places a limit of 1;<
machines that can be on the subnet.
Tot%. %ddress/
The 51 bit address is usually written as 6 integers separated by dots.
1<
Port %ddresses/
+ service e)ists on a host, and is identified by its port. This is a .< bit number. To
send a message to a server, you send it to the port for that service of the host that it is running
on. This is not location transparencyM Certain of these ports are @well $nown@.
Soc(ets/
+ soc$et is a data structure maintained by the system to handle networ$ connections.
+ soc$et is created using the call soc$et. It returns an integer that is li$e a file descriptor. In
fact, under 0indows, this handle can be used with Jead >ile and 0rite >ile functions.
Qinclude RsysBtypes.hS
Qinclude RsysBsoc$et.hS
int soc$et%int family, int type, int protocol&N
2ere @family@ will be +>TI4T for IH communications, protocol will be -ero, and type will
depend on whether TCH or U7H is used. Two processes wishing to communicate over a
networ$ create a soc$et each. These are similar to two ends of a pipe # but the actual pipe
does not yet e)ist.
80ree C*%rt/
I>ree Chart is a free .FFU Iava chart library that ma$es it easy for developers to display
professional "uality charts in their applications. I>ree Chart?s e)tensive feature set includes/
+ consistent and well#documented +HI, supporting a wide range of chart typesN + fle)ible
design that is easy to e)tend, and targets both server#side and client#side applicationsN
!upport for many output types, including !wing components, image files %including HG and
IH4G&, and vector graphics file formats %including H7>, 4H! and !3G&N
I>ree Chart is @open source@ or, more specifically, free software. It is distributed under the
terms of the GU *esser General Hublic *icense %*GH*&, which permits use in proprietary
applications.
1A
1. "%p Visu%.i9%tions/
Charts showing values that relate to geographical areas. !ome e)amples include/ %a&
population density in each state of the United !tates, %b& income per capita for each country
in 4urope, %c& life e)pectancy in each country of the world. The tas$s in this pro(ect include/
!ourcing freely redistributable vector outlines for the countries of the world,
statesBprovinces in particular countries %U!+ in particular, but also other areas&N Creating an
appropriate dataset interface %plus default implementation&, a rendered, and integrating this
with the e)isting GOHlot class in I>ree Chart.
2. Time Series C*%rt Inter%cti,ity/
Implement a new %to I>ree Chart& feature for interactive time series charts ### to
display a separate control that shows a small version of +** the time series data, with a
sliding @view@ rectangle that allows you to select the subset of the time series data to display
in the main chart.
!. D%s*'o%rds/
There is currently a lot of interest in dashboard displays. Create a fle)ible dashboard
mechanism that supports a subset of I>reeChart chart types %dials, pies, thermometers, bars,
and linesBtime series& that can be delivered easily via both Iava 0eb !tart and an applet.
+. Property Editors/
The property editor mechanism in I>ree Chart only handles a small subset of the
properties that can be set for charts. 4)tend %or reemployment& this mechanism to provide
greater end#user control over the appearance of the charts.
Tomc%t 7.A &e' ser,er/
Tomcat is an open source web server developed by +pache Group. +pache Tomcat is
the servlet container that is used in the official Jeference Implementation for the Iava !ervlet
and Iava !erver Hages technologies. The Iava !ervlet and Iava !erver Hages specifications
are developed by !un under the Iava Community Hrocess. 0eb !ervers li$e +pache Tomcat
support only web components while an application server supports web components as well
1D
as business components %:4+s 0eblogic, is one of the popular application server&.To
develop a web application with (spBservlet install any web server li$e IJun, Tomcat etc to run
your application.
>ig Tomcat 0eb server
7.! Codin$ st%nd%rds
St%nd%rds )or "em'er 0unctions/
If +ccount has an attribute called balance and you needed to pass a parameter
representing a new value for it the parameter would be called balance The field would be
referred to as this. balance in the code and the parameter would be referred as balance
!. 1 N%min$ mem'er )unctions/
'ember functions should be named using a full 4nglish description, using mi)ed case
with the first letter of any non#initial word capitali-ed. The first word of the member function
should be a verb.
4)amples
open+ccount%&
print'ailing*ist%&
save%&
delete%&
This results in member functions whose purpose can be determined (ust by loo$ing at its
name.
1E
7.!.1 N%min$ Accessor "em'er 0unctions
6etters/ member functions that return the value of a field B attribute B property of an
ob(ect.
Use prefi) 8get9 to the name of the field B attribute B property if the field in not boolean
Use prefi) 8is9 to the name of the field B attribute B property if the field is :oolean
+ viable alternative is to use the prefi) Vhas or Vcan instead of Vis for boolean getters.
4)amples
get>irstame%&
isHersistent%&
7.!.2 Setters/ 'ember functions that modify the values of a field.
Use prefi) Vset to the name of the field.
4)amples
set>irstame%&
7.!.! Constructors/ 'ember functions that perform any necessary initiali-ation when an
ob(ect is created. Constructors are always given the same name as their class.
4)amples
Customer%&
!avings+ccount%&
7.!.+ "em'er 0unction Visi'i.ity/ + good design re"uires minimum coupling between the
classes. The general rule is to be as restrictive as possible when setting the visibility of a
member function. If member function doesnt have to be public then ma$e it protected, and if
it doesnt have to be protected than ma$e it private.
5F
7.!.- "em'er 0unction 4e%der/
0hen a member function updates a fieldBattributeBproperty, of a class that
implements the runnable interface, is not synchroni-ed then it should be documented why it
is unsynchroni-ed. If a member function is overloaded or overridden or synchroni-ation
changed, it should also be documented.
Note/ Its not necessary to document all the factors described above for each and every
member function because not all factors are applicable to every member function.
Use C style comments to document out lines of unneeded code.
Use single#line comments for business logic.
Tec*ni3ues )or 1ritin$ C.e%n Code/
7ocument the code already discussed above
HaragraphBIndent the code/ +ny code between the W and X should be properly indented
Haragraph and punctuate multi#line statements
4)ample
*ine . :an$ +ccountnewHersonal+ccount Y +ccount>actory
*ine 1 create:an$+ccount>or%currentCustomer, start7ate,
*ine 5 initial7eposit, branch&
*ines 1 Z 5 have been indented by one unit %hori-ontal tab&
Use white space
+ few blan$ lines or spaces can help ma$e the code more readable.
!ingle blan$ lines to separate logical groups of code, such as control structures
Two blan$ lines to separate member function definitions
!pecify the order of =perations/ Use e)tra parenthesis to increase the readability of
the code using +7 and =J comparisons. This facilitates in identifying the e)act
order of operations in the code
0rite short, single command lines Code should do one operation per line !o only one
statement should be there per line
7.!.B N%min$ 0ie.ds/
Use a >ull 4nglish 7escriptor for >ield ames
>ields that are collections, such as arrays or vectors, should be given names that are
plural to indicate that they represent multiple values.
5.
E#%mp.es/
firstame
orderItems
If the name of the field begins with an acronym then the acronym should be completely in
lower case
E#%mp.e/
s"l7atabase
Use full 4nglish descriptor postfi)ed by the widget type. This ma$es it easy for a developer
to identify the purpose of the components as well as its type.
E#%mp.e/
o$:utton
customer*ist
file'enu
new>ile'enuItem
7.!.C N%min$ Const%nts/
In Iava, constants, values that do not change, are typically implemented as static final
fields of classes. The convention is to use full 4nglish words, all in upper case, with
underscores between the words
E#%mp.e/
'II'U'T:+*+C4
'+GT3+*U4
51
7.+ "odu.es
User modu.e/
In this module, Users are having authentication and security to access the detail which
is presented in the ontology system. :efore accessing or searching the details user should
have the account in that otherwise they should register first.
System modu.e/
There are several cloud computing categories with this wor$ focused on a public
cloud. + public cloud is based on the standard cloud computing model, with service provided
by a service provider. + large public cloud will include many nodes and the nodes in
different geographical locations. Cloud partitioning is used to manage this large cloud. +
cloud partition is a subarea of the public cloud with divisions based on the geographic
locations. 0ith the main controller deciding which cloud partition should receive the (ob. The
partition load balancer then decides how to assign the (obs to the nodes. 0hen the load status
of a cloud partition is normal, this partitioning can be accomplished locally. If the cloud
partition load status is not normal, this (ob should be transferred to another partition.
"%in contro..er %nd '%.%ncers/
The load balance solution is done by the main controller and the balancers. The main
controller rst assigns (obs to the suitable cloud partition and then communicates with the
balancers in each partition to refresh this status information. !ince the main controller deals
with information for each partition, smaller data sets will lead to the higher processing rates.
The balancers in each partition gather the status information from every node and then choose
the right strategy to distribute the (obs.
55
SSTE" TESTIN6
D.1 Testin$
Testing is the debugging program is one of the most critical aspects of the computer
programming triggers, without programming that wor$s, the system would never produce an
output of which it was designed. Testing is best performed when user development is as$ed to
assist in identifying all errors and bugs. The sample data are used for testing. It is not "uantity
but "uality of the data used the matters of testing. Testing is aimed at ensuring that the system
was accurately an efficiently before live operation commands.
Testin$ o':ecti,es/
The main ob(ective of testing is to uncover a host of errors, systematically and
with minimum effort and time. !tating formally, we can say, testing is a process of e)ecuting
a program with intent of finding an error.
. + successful test is one that uncovers an as yet undiscovered error.
1 + good test case is one that has probability of finding an error, if it e)ists.
T*e '%sic .e,e.s o) Testin$/
Client needs acceptance testing

Je"uirements system testing
7esign integration testing
Code unit testing
56
D.1.1 Code testin$/
This e)amines the logic of the program. >or e)ample, the logic for updating various
sample data and with the sample files and directories were tested and verified.
D.1.2 Speci)ic%tion Testin$/
4)ecuting this specification starting what the program should do and how it should
performed under various conditions. Test cases for various situation and combination of
conditions in all the modules are tested.
D.1.! Unit testin$/
In the unit testing we test each module individually and integrate with the overall
system. Unit testing focuses verification efforts on the smallest unit of software design in the
module. This is also $nown as module testing. The module of the system is tested separately.
This testing is carried out during programming stage itself. In the testing step each module is
found to wor$ satisfactorily as regard to e)pected output from the module. There are some
validation chec$s for fields also. >or e)ample the validation chec$ is done for varying the
user input given by the user which validity of the data entered. It is very easy to find error
debut the system.
4ach 'odule can be tested using the following two !trategies/
.. :lac$ :o) Testing
1. 0hite :o) Testing
<.%c( 'o# testin$/
:lac$ bo) testing is a software testing techni"ues in which )unction%.ity o) t*e
so)t&%re under test ;SUT= is tested &it*out .oo(in$ %t t*e intern%. code structure,
implementation details and $nowledge of internal paths of the software. This type of testing
is based entirely on the software re"uirements and specifications.
In <.%c( <o# Testin$ &e :ust )ocus on inputs %nd output o) t*e so)t&%re system without
bothering about internal $nowledge of the software program.
5;

The above :lac$ :o) can be any software system you want to test. >or e)ample / an
operating system li$e 0indows, a website li$e Google ,a database li$e =racle or even your
own custom application. Under :lac$ :o) Testing , you can test these applications by (ust
focusing on the inputs and outputs without $nowing their internal code implementation.
<.%c( <o# Testin$ 5 Steps
2ere are the generic steps followed to carry out any type of :lac$ :o) Testing.
Initially re"uirements and specifications of the system are e)amined.
Tester chooses valid inputs %positive test scenario& to chec$ whether !UT processes
them correctly. +lso some invalid inputs %negative test scenario& are chosen to verify
that the !UT is able to detect them.
Tester determines e)pected outputs for all those inputs.
!oftware tester constructs test cases with the selected inputs.
The test cases are e)ecuted.
!oftware tester compares the actual outputs with the e)pected outputs.
7efects if any are fi)ed and re#tested.
Types o) <.%c( <o# Testin$
There are many types of :lac$ :o) Testing but following are the prominent ones #
0unction%. testin$ K This blac$ bo) testing type is related to functional re"uirements
of a systemN it is done by software testers.
Non5)unction%. testin$ K This type of blac$ bo) testing is not related to testing of a
specific functionality, but non#functional re"uirements such as performance,
scalability, usability.
5<
Re$ression Testin$ K Jegression testing is done after code fi)es , upgrades or any
other system maintenance to chec$ the new code has not affected the e)isting code.
1*ite <o# testin$/
0hite :o) Testing is the testing of a software solution?s internal coding and
infrastructure. It focuses primarily on strengthening security, the flow of inputs and outputs
through the application, and improving design and usability. 0hite bo) testing is also $nown
as c.e%r? open? structur%.? %nd $.%ss 'o# testin$.
It is one of two parts of the E'o# testin$E %ppro%c* of software testing. Its counter#
part, blac$ bo) testing, involves testing from an e)ternal or end#user type perspective. =n the
other hand, 0hite bo) testing is based on the inner wor$ings of an application and revolves
around internal testing. The term @white bo)@ was used because of the see#through bo)
concept. The clear bo) or white bo) name symboli-es the ability to see through the software?s
outer shell %or @bo)@& into its inner wor$ings. *i$ewise, the @blac$ bo)@ in @blac$ bo) testing@
symboli-es not being able to see the inner wor$ings of the software so that only the end#user
e)perience can be tested
0hite bo) testing involves the testing of the software code for the following/
Internal security holes
:ro$en or poorly structured paths in the coding processes
The flow of specific inputs through the code
4)pected output
The functionality of conditional loops
Testing of each statement, ob(ect and function on an individual basis.
The testing can be done at system, integration and unit levels of software development. =ne
of the basic goals of white bo) testing is to verify a wor$ing flow for an application. It
involves testing a series of predefined inputs against e)pected or desired outputs so that when
a specific input does not result in the e)pected output, you have encountered a bug.
5A
To per)orm 1*ite <o# Testin$/
To give you a simplified e)planation of white bo) testing, we have divided it into t&o
'%sic steps. This is what testers do when testing an application using the white bo) testing
techni"ue/
Step 1= Underst%nd t*e Source Code/
The first thing a tester will often do is learn and understand the source code of the
application. !ince white bo) testing involves the testing of the inner wor$ings of an
application, the tester must be very $nowledgeable in the programming languages used in the
applications they are testing. +lso, the testing person must be highly aware of secure coding
practices. !ecurity is often one of the primary ob(ectives of testing software. The tester
should be able to find security issues and prevent attac$s from hac$ers and naive users who
might in(ect malicious code into the application either $nowingly or un$nowingly.
Step 2= Cre%te t*e Test C%ses %nd Source Code/
The second basic step to white bo) testing involves testing the applications source
code for proper flow and structure. =ne way is by writing more code to test the applications
source code. The tester will develop little tests for each process or series of processes in the
application. This method re"uires that the tester must have intimate $nowledge of the code
and is often done by the developer. =ther methods include manual testing, trial and error
testing and the use of testing tools as we will e)plain further on in this article.
D.1.+ System Testin$/
=nce the individual module testing is completed, modules are assembled and
integrated to perform as a system. The top down testing, which began from upper level to
lower level module, was carried out to chec$ whether the entire system is performing
satisfactorily.
5D
D.2. Test C%ses
Test c%se
ID
Test
DescriptionFscen
%rio
Test steps E#pected
Resu.t
Actu%.
Resu.t
st%tus
Tit.e G A1 !uccessful User
3erification
The login to the
system should be
tried with the login
assigned by the
admin and the correct
password
*ogin should
be successful
and the user
should enter in
to the system
*ogin is
successful
and the user
enter into the
system
Hassed
Tit.e5 A2 Unsuccessful
User 3erification
due to wrong
password
*ogin to the system
with a wrong
password
*ogin should
fail with an
error VInvalid
Hassword
*ogin fails
with an error
VInvalid
Hassword
Hassed
Tit.e G A! Unsuccessful
User 3erification
due to invalid
login id
*ogin to the system
with a invalid login id
*ogin should
fail with an
error VInvalid
user id
*ogin fails
with an error
VInvalid user
id
Hassed
Tit.e G A+ 3erification of a
particular record
If a particular record
already e)ists it
displays a message
This type of
test in WverifyX
procedure in
every Isp file
where a record
is inserted via
an interface
7isplays a
message
passed
Tit.e G A- Updating of a
particular record
+ll the details should
not be updated.
This type of
test is covered
in all the +sp
files where
updations are
made.
Updating of
a particular
record
passed
5E
D.7 <u$ Reports
<u$s Identi)ied/
<u$5Id <u$ N%me
:JTFF. Tomcat server not found
:JTFF1 3erification of registered user
:J TFF5 3erifying entered "uery
:JTFF6 3erify the "uery by date
:JTFF; 3erification of the home page
<u$ Report/
6F
<u$ Id/ :JTFF.
<u$ Description/ Tomcat server not found
Steps to reproduce/ .. =pen web browser entered local host address
E#pected Resu.t/ Tomcat web server home page will be appears
Actu%. Resu.t/ Can load the code into the web server
St%tus / Hass
Priority/ *i$*
Se,erity/ *i$*
<u$ Id/ :JTFF1
<u$ Description/ 3erification of registered user
Steps to reproduce/ .. User logs in with hisBher credentials.
1. If the password and username matches logs in successful.
E#pected Resu.t/ user home page opens
Actu%. Resu.t/ user home page opens
St%tus / Hass
Priority/ *i$*
Se,erity/ *i$*
B. RESULT SCREENS
D.. + screen shot for home page.
6.
<u$ Id/ :JTFF5
<u$ Description/ 3erifying entered "uery
Steps to reproduce/ ..=pen the application.
1. 4nter a "uery which is to be searched.
E#pected Resu.t/ Information about the given "uery is displayed.
Actu%. Resu.t/ Information about the given "uery is displayed.
St%tus / Hass
Priority/ *i$*
Se,erity/ *i$*
<u$ Id/ :JTFF6
<u$ Description/ 3erify the "uery by date
Steps to reproduce/ ..=pen the application
1. *ogin with your credentials.
5. 4nter a date in the provided "uery bo).
E#pected Resu.t/ 2istory of a particular user will be displayed as per the given date.
Actu%. Resu.t/ 2istory of a particular user will be displayed as per the given date.
St%tus / >ail
Priority/ 4i$*
Se,erity/ 4i$*
<u$ Id/ :JTFF;
<u$ Description/ 3erification of the home page
Steps to reproduce/ .. =pen the application 8=rgani-ing User !earch 2istories9
E#pected Resu.t/ 2ome page should be opened and it should contain all fields %i.e.
trace bug&
Actu%. Resu.t/ 2ome page has been opened with all fields
St%tus / Hass
Priority/ *i$*
Se,erity/ *i$*
N%,i$%tion%. Steps/
.. Jun the Tomcat server 8 C/HTomc%t 7.AH'inHtomc%t78 %!ervice Junner&
1. 7ouble clic$ on 8tomc%t7 Ser,ice Runner8
5. +pache Tomcat !erver gets started
61
D.1 + screen shot for admin login.
N%,i$%tion%. Steps/
.. 4nter the username
1. 4nter the password
5. Clic$ submit button
65
B.! A screen s*ot t*%t disp.%ys ser,er st%tus.
N%,i$%tion%. Steps/
.. Chec$ the server status
1. Chec$ the available connections
66
D.6 + screen shot that displays the active status of clouds.
N%,i$%tion%. Steps/
.. Chec$ing the status of clouds.
6;
D.; + screen shot to choose filename.
N%,i$%tion%. Steps/
.. 4nter a file name
1. Choose the file from any location
5. 4nter the category of the file
6<
D.< + screen shot that displays a message 8video has been uploaded9.
N%,i$%tion%. Steps/
.. The chosen file is uploaded
1. 'essage is displayed
6A
D.A + screen shot for user login.
N%,i$%tion%. Steps/
.. Clic$ the enter button
6D
D.D + screen shot that displays 8redirecting to cloud .9.
N%,i$%tion%. Steps/
.. The user is redirected to cloud..
1. + message is displayed.
6E
D.E + screen shot for selection to watch videos.
N%,i$%tion%. Steps/
.. The user can select the videos from the list
1. 0atch the videos
;F
D..F + screen shot watching a video.
N%,i$%tion%. Steps/
.. 0atching the selected video.
;.
D... + screen shot that displays active status of cloud ..
N%,i$%tion%. Steps/
.. server is active in cloud 1.
;1
D..1 + screen shot that displays server status.
N%,i$%tion%. Steps/
.. +vailable connections in cloud 1 are 1
1. +vailable connections in cloud 5 are 5.
;5
D..5 + screen shot that displays active status lo cloud 1.
N%,i$%tion%. Steps/
.. 1 servers are active in cloud 1.
;6
D..5 + screen shot that displays cloud . is in overloaded status.
N%,i$%tion%. Steps/
.. Cloud 1 is in normal state.
1. Cloud 5 is in idle state.
;;
D..6 + screen shot that displays all the connections are overloaded.
N%,i$%tion%. Steps/
.. all the clouds are overloaded

;<
D..; + screen shot that displays all servers are in active status.
N%,i$%tion%. Steps/
.. +ll the three servers in three clouds are in active state.
;A
D..< + screen shot that displays a message 8ma)imum connections crossed9.
N%,i$%tion%. Steps/
.. 'a)imum connections are crossed.
1. Hress o$.
;D
C.CONCLUSION AND 0UTURE SCOPE
Till now we have discussed on basic concepts of Cloud Computing and *oad
balancing. In addition to that, the load balancing techni"ue that is based on !warm
intelligence has been discussed. 0e have discussed how the mobile agents can balance the
load of a cloud using the concept of +nt colony =ptimi-ation.
The limitation of this techni"ue is that it will be more efficient if we form cluster in
our cloud. !o, the research wor$ can be proceeded to implement the total solution of load
balancing in a complete cloud environment. =ur ob(ective for this paper is to develop an
effective load balancing algorithm using +nt colony optimi-ation techni"ue to ma)imi-e or
minimi-e different performance parameters li$e CHU load, 'emory capacity, 7elay or
networ$ load for the clouds of different si-es.
;E
1A. <I<LIO6RAP4IES
[.\ '. +rmbrust et al., 8+bove the clouds/ + ber$eley view of cloud computing,9
University of California, :er$eley, Tech. Jep., >eb 1FFE.
[1\ *. !iegele, 8*et it rise/ + special report on corporate IT,9 in The 4conomist, =ct.
1FFD.
[5\ H. :arham, :. 7ragovic, L. >raser, !. 2and, T. 2arris, +. 2o,J. eugebauer, I. Hratt,
and +. 0arfield, 8Gen and the art of virtuali-ation,9 in Hroc. of the +C' !ymposium on
=perating !ystems Hrinciples %!=!HF5&, =ct. 1FF5.
[6\ 8+ma-on elastic compute cloud %+ma-on 4C1&,http/BBaws.ama-on.comBec1B.9
[;\ C. Clar$, L. >raser, !. 2and, I. G. 2ansen, 4. Iul, C. *impach,I. Hratt, and +.
0arfield, 8*ive migration of virtual machines,9 in Hroc. of the !ymposium on etwor$ed
!ystems 7esign and Implementation %!7IF;&, 'ay 1FF;.
[<\ '. elson, :.#2. *im, and G. 2utchins, 8>ast transparent migration for virtual
machines,9 in Hroc. of the U!4IG +nnual Technical Conference, 1FF;.
Re)erences
www.wi$ipedia.orgBwi$iBcloudcomputing.
www.ama-on web services.
http/BB(ava.sun.com
http/BBwww.(ava1s.comB
<F
11. APPENDII
S%mp.e code/
RU] page importY@(ava.s"l.^@ US
RUM
int iFYF,iYF,i1YF,i5YFN
US
RU
Class.forame%@com.mys"l.(dbc.7river@&N
Connection
conY7river'anager.getConnection%@(dbc/mys"l/BBlocalhost/55F<Bloadbal@,@root@,@root@&N
!tatement stYcon.create!tatement%&N
tryW
iF Y st.e)ecuteUpdate%@delete from serverTstatus @&N
X
catch%4)ception eF&W!ystem.out.println%@e)e F@&NX
tryW
i Y st.e)ecuteUpdate%@delete from user@&N
X
catch%4)ception e&W!ystem.out.println%@e)e 1@&NX
tryW
i5 Y st.e)ecuteUpdate%@create table user%id '47IU'IT =T U**
+UT=TICJ4'4T, name 3+JC2+J%5F& =T U**, HJI'+JO L4O %id&&@&N
X
catch%4)ception e&W!ystem.out.println%e&NX
<.
!ystem.out.println%i5&N
catch%4)ception eF&W!ystem.out.println%@e)e F@&NX
tryW
tryW
iF Y st.e)ecuteUpdate%@delete from serverTstatus @&N
X
i Y st.e)ecuteUpdate%@delete from user@&N
X
catch%4)ception e&W!ystem.out.println%@e)e .@&NX
tryW
i1 Y st.e)ecuteUpdate%@drop table user@&N
X
RU
!tring unYre"uest.getHarameter%@uid@&N
!tring pwdYre"uest.getHarameter%@pwd@&N
if%un.e"uals%@admin@&ZZpwd.e"uals%@admin@&&
W
response.sendJedirect%@admin.(sp@&N
X
elseW
response.sendJedirect%@inde).(spPmessegeY4JJ=J@&N
X
US
<1
<5
<6
<;

Das könnte Ihnen auch gefallen