Differentiated Bandwidth Allocation with TCP Protection in Core Routers

Abstract

Differentiated Services (DiffServ) networks have received wide attention for several years. They categorize routers into edge routers and core routers. In core routers, one of the technological challenges is to implement differentiated bandwidth allocation and TCP protection with low complexity, where conventional per-flow queueing is costly. In this paper, we present an Active Queue Management (AQM) scheme called CHOKeW, named after previous work CHOKe that is effective to protect TCP flows. A method is borrowed from CHOKe that draws a packet at random from the buffer, compares it with the arriving packet, and drops both if they are from the same flow (we call this “matched drops”). CHOKeW enhances the drawing function by adjusting the maximum number of draws based on the priority of the new arrival and the current status of network congestion. The number of parameters that CHOKeW needs to maintain is determined by the number of priority levels being supported by the network, which usually has a small limited value. With respect to the number of flows (say N) going through the router in the core networks, both the memory-requirement complexity and the per-packet-processing complexity for CHOKeW is O(1), as compared to OðNÞ and usually greater than O(1), respectively, which has been seen in conventional per-flow schemes. In order to explain the features of CHOKeW, an analytical model is used, followed by running a series of simulations to evaluate the performance. We show that under a variety of congestion scenarios, CHOKeW is able to 1) support differentiated bandwidth allocation by affording a larger bandwidth share to higher priority flows, 2) provide the flows in the same priority with better fairness than conventional stateless AQM schemes such as RED and BLUE, 3) maintain high link utilization as well as short queue length, and 4) protect TCP flows by restricting the bandwidth share of high-speed un responsive flows.

Existing System:

In core routers, one of the technological challenges is to implement differentiated bandwidth allocation and TCP protection with low complexity, where conventional per-flow queueing is costly. CHOKe that draws a packet at random from the buffer, compares it with the arriving packet, and drops both if they are from the same flow that is call matched drops. One of the technological challenges is to introduce a reliable and a cost-effective method to support multiple services at different priority levels within core networks that can support thousands of flows

Proposed System:

We present an Active Queue Management (AQM) scheme called CHOKeW. CHOKeW enhances the drawing function by adjusting the maximum number of draws based on the priority of the new arrival and the current status of network congestion edge (boundary) routers and core (interior) routers. Sophisticated operations, such as per-flow classification and marking, are implemented at edge routers. In other words, core routers do not necessarily maintain per-flow states; instead, they only need to forward.

Mainly we concentrate on TCP protection and bandwidth differentiation. More importantly, CHOKeW supports differentiated bandwidth allocation for traffic with different priority CHOKeW updates p0 upon each packet arrival but activates matched drops only when the queue length L is longer than the threshold Lth weights

Requirement Analysis:

    Software Requirements

Java1.5

Java Swing

Sql Server 2000

Windows Xp.

Hardware Requirements

         Hard disk                   :         60GB

         RAM                :        1GB

         Processor                   :         P IV