0% found this document useful (0 votes)
62 views4 pages

Network Load Balance: Abstract

The document discusses various link cost functions for multicast routing algorithms that construct multicast trees from senders to receivers. It finds that when network state information is accurate, the choice of link cost function has a negligible effect on routing performance. However, when state information is stale, cost functions that are less sensitive to load perform better, especially under higher loads and denser multicast groups.

Uploaded by

Rasa Govindasmay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
62 views4 pages

Network Load Balance: Abstract

The document discusses various link cost functions for multicast routing algorithms that construct multicast trees from senders to receivers. It finds that when network state information is accurate, the choice of link cost function has a negligible effect on routing performance. However, when state information is stale, cost functions that are less sensitive to load perform better, especially under higher loads and denser multicast groups.

Uploaded by

Rasa Govindasmay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

Network Load Balance

Abstract:
Many distributed real-time applications, such as audio- and video-conferencing, require the network to
construct a multicast path (tree) from a sender to multiple receivers. Furthermore, real-time applications
have Quality-of-Service (QoS) requirements (e.g. bandwidth). The objective of the routing protocol is to
build a tree that is both feasible (i.e. satisfies the requested QoS) and least costly. The cost of a tree
depends on the costs of its links. The cost of a link should reflect the effect of allocating resources to the
new connection on existing and future connections. Many studies have proposed multicast algorithms to
construct low-cost QoS-constrained trees. However, these studies assume that some cost is given for
each link, and they do not examine the effect of the link cost function. In this paper, we examine the effect
of various link cost functions on the performance of two classes of multicast routing algorithms under both
uniform and skewed real-time workload. We also investigate the impact of inaccurate network state
information. Our simulation results show that when network state information is accurate (most up-to-date)
at each router, the choice of the link cost function only has a negligible effect, if any, on the routing
performance. More interestingly, we find that, a link cost function that is more sensitive to load performs
better when link state information is relatively accurate, while when link state information is more stale, a
link cost function that is less sensitive to load performs better. This is more pronounced under higher load
and when multicast groups are denser.
EXISTING SYSTEM

In existing system, they have used to develop the project using Round Robin [RR] model and
SSL_with_Session model. Those models are not effective. Those models are not able to give the
out put in time and the thorough put also lesser than that their expected output.

These models had made the Latency problem and minimal through put. For this problem they
introduced the SSL_with_bf (Backend forwarding) model is to overcome the existing problems.
We going to implement SSL_with_Backend Forwarding model in our proposed system.

PROPOSED SYSTEM

In our Proposed System, We are going to implement the SSL_with_Backend Forwarding model
(Algorithm) is to overcome the problem of existing system.

This model will reduce the latency and increase the throughput than the existing system (Round
Robin model and SSL_with_Session).

The Secure Socket Layer_with_BF model is very helpful for load balancing of the server. This will
reduce the load of the server while the server is being busy. These are the advantages of our
proposed system.

The ssl_with_bf scheme can minimize the average latency by about 40 percent and improve
throughput across a variety of workloads.

Modules
1. Authentication Module.
2. IP Address Representation Module.
3. Load Servers Module.
4. Load Balancing Module.
5. Report Module
Authentication Module:
The authentication module is to register the new users and previously registered users can enter into our
project. The admin only can enter and do the uploading files into the servers. After login by every user
and the admin the sql server checks the login id and password is valid or not. If the login is not valid it
displays that the login is not correct.
IP Address Representation Module:
The IP Address Representation module is to give the IP addresses which we are going to assign those as
servers. We can enter and view IP addresses from this module. In load balancing system we can connect
the three servers [system]. The connection has to be represented by the IP Address representation only.
Load Servers Module:

The Load Servers module has the authentication for the administrator only can enter into this module. The
administrator will do the encryption of the text file and store into the servers which we are assigned in IP
representation module. This module will make the both public and private key for the cryptography.
Load Balancing Module:
The Load Balancing module has the authentication for users can enter into the upload page and can view
the file name which the administrator stored into the servers. The user can select the file from the list and
can download from the server which is in idle state. We will get the response time and from which server
we are getting the file. Finally we can get the decrypted file from the key pair.
Report Module:
We will get the response time and from which server we are getting the file. From the response time
produce the chart report here. It compares the response time between the servers and downloads the
given file in the better performance response time server.
Hardware Requirements:
The hardware used for the development of the project is:
PROCESSOR

PENTIUM III 866 MHz

RAM

128 MD SD RAM

MONITOR

15 COLOR

HARD DISK

20 GB

FLOPPY DRIVE

1.44 MB

CDDRIVE

LG 52X

KEYBOARD

STANDARD 102 KEYS

MOUSE

3 BUTTONS

Software Requirements:
The Software used for the development of the project is:
OPERATING SYSTEM

Windows XP

ENVIRONMENT

Visual Studio .NET 2005

.NET FRAMEWORK

Version 2.0

LANGUAGE

VB.NET

BACK END

SQL SERVER 2000

You might also like