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, and 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:

This system finding the best location for each service gateway, and selecting the best service gateway for each flow. 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.  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, the gateway selection problem is addressed in the online setting. That is, each flow is associated with a service gateway, which is determined by current network conditions.

 

Proposed System:

This System proposes efficient algorithms for both problems and studies their performance. Our main contribution is showing that placement and selection of network services can be used as effective tools for traffic engineering. An approach for the service placement problem, which takes into account traffic engineering considerations. We presented a probabilistic approximation algorithm (Prob) and an efficient heuristic (Max-BW). For the selection problem, we presented an algorithm whose competitive ratio is bounded (Exp) as well as a simpler heuristic (Est-Opt).

Requirement Analysis:

    Software Requirements

                   Operating System     -           Windows XP Professional

                       Platform                      -           Visual Studio .Net 2005 & Above

                       Database                     -           SQL Server 2000 & Above

                       Languages                   -           C#.Net

Hardware Requirements

                   Hard disk                   :           60GB

                        RAM                            :          1GB

                       Processor                    :           P IV