A TRAFFIC ENGINEERING APPROACH FOR PLACEMENT AND SELECTION OF NETWORK SERVICES

A TRAFFIC ENGINEERING APPROACH FOR PLACEMENT AND SELECTION OF NETWORK SERVICES

Abstract:

           

Ø Network services are provided by means of dedicated service gateways, through which traffic flows are directed.

Ø  Existing work on service gateway placement has been primarily focused on minimizing the length of the routes through these gateways.

Ø Only limited attention has been paid to the effect these routes have on overall network performance.

Ø We propose a novel approach for the service placement problem, which takes into account traffic engineering considerations. Rather than trying to minimize the Length of the traffic flow routes, we take advantage of these routes in order to enhance the overall network performance.

Ø We divide the problem into two sub problems:

·        finding the best location for each service gateway,

·         Selecting the best service gateway for each flow.

Ø We propose efficient algorithms for both problems and study their performance.

Ø  Our main contribution is showing that placement and selection of network services can be used as effective tools for traffic engineering.

EXISTING SYSTEM

Existing work on service gateway placement has been primarily focused on minimizing the length of the routes through these gateways. Only limited attention has been paid to the effect these routes have on overall network performance. Existing system refers to the system that is being followed till now.

DISADVANTAGE

v Wastage of time to send file or data

v Poor quality of service to one gateway to another gateway

v Traffic is very high.

PROPOSED SYSTEM

We propose to facilitate traffic engineering in such networks by judiciously placing the service gateways in the network and selecting the gateways to be traversed by each flow.

ADVANTAGE

v Traditional traffic engineering schemes are usually based on the deployment of an underlying virtual circuit technology.

v The effectiveness of traditional traffic engineering schemes is limited if the gateways are located very close to each other.

We address the problem by dividing it into the following two sub problems:

v The service placement problem: finding the best location for each service gateway,

v The gateway selection problem: selecting the best service gateway to accommodate each flow.

The service placement problem is addressed in the offline context by considering the long-term average distribution of the source–destination traffic for each service type, which can be obtained using traffic matrix estimation. We use this information to decide on the best location for each service gateway.

HARDWARE AND SOFTWARE SPECIFICATIONS

HARDWARE REQUIREMENTS:

·        PIV 2.8 GHz Processor and Above

·        RAM 512MB and Above

·        HDD 20 GB Hard Disk Space and Above

SOFTWARE REQUIREMENTS:

·        WINDOWS OS (XP / 2000 / 200 Server / 2003 Server)

·        Visual Studio .Net 2005 Enterprise Edition

·        Internet Information Server 5.0 (IIS)

·        Visual Studio .Net Framework (Minimal for Deployment)

·        SQL Server 2000 Enterprise Edition

ANALYSIS AND DESIGN:

a.     Use Case Diagram (UML):

b.     Description of modules:

Modules:

There are three Main modules consider here:

  

·        Sender

·        Gateway

·        Receiver

        Sender:

                  

In sender part, first upon we collect destination address before we send files. The files may contain data’s, or audio file. We will send specified file here. Then we select appropriate network service (i.e., Gateway) before we sending files.

       Gateway:

                  

 Then important thing is considered as Network service (i.e., Gateway).It achieves load balancing, traffic flow controls, dynamically adjusting to the network load. Through this gateway, minimizing service latency and improving resiliency.

     Receiver:

                  

Finally we face receiver part. In the state we perform receiving files from respected source. The receiver may know who send the files. 

c.      DATA Flow Diagram (DFD) :