Bandwidth Recycling in IEEE 802.

16 Networks
Role of Bandwidth There is not enough bandwidth in use nowadays and it seems that as the more of it comes into use, the more of it could be used. Of course the performace level arises all the time, but with quality of service development the bandwidth that is in hand can be used a lot better and better applications and services can be developed for the customers. Even if everyone knew that in a known period of time, the performace of the communications systems would grow enough for the services that one would like to implement, the developed services could already be developed and tested in the old systems with more optimal usage of the resources in hand. Surely this kind of an approach would lead to an advantage in the field of competition in data communications business, especially for the service providers

Reliability of the transmission media plays an important role in the developed data communications equipment and in the transmission protocols. Reliability is one of the most important things when it comes to the services too. n many services, the low level of reliability makes them unusable. n a way, reliability is a component of quality of service ! the more reliable the system, the higher the level of "oS. What is IEEE 802.16 EEE #$%.&' standard was designed to support the bandwidth demanding applications with quality of service ("oS). *andwidth is reserved for each application to ensure the "oS. +or this effectively reducing the dropping rate of package can help the multimedia to be played more perfectly and it can achieve the "oS of multimedia service that is e,pected by users. This stable data transmission relies on the scheduling mechanism of -./ layer for EEE #$%.&',. There are four classes of service defined in the specification of EEE #$%.&', and they are 0nsolicited 1rant Service (01S), real!time 2olling Service (rt2S), non!real!time 2olling Service (nrt2S) and *est Effort (*E), respectively ( EEE Std #$%.&'!%$$3, %$$34 EEE Std #$%.&'e!%$$5, %$$54 6air et al., %$$3).

Aim:-

To improve the bandwidth utili7ation while maintaining the same "oS guaranteed services. Our research ob8ective is two old 9 ! The e,isting bandwidth reservation is not changed to maintain the same "oS guaranteed services. our research work focuses on increasing the bandwidth utili7ation by utili7ing the unused bandwidth

Abstract EEE #$%.&' standard was designed to support the bandwidth demanding applications with quality of service ("oS). *andwidth is reserved for each application to ensure the "oS.+or variable bit rate (:*R) applications, however, it is difficult for the subscriber stations (SSs) to predict the amount of incoming data. To ensure the "oS guaranteed services, the SS may reserve bandwidth more than the amount of its transmitting data.s a result, the reserved bandwidth may not be fully utili7ed all the time.we propose a scheme, named *andwidth Recycling, to recycle the unused bandwidth without changing the e,isting bandwidth reservation.The idea of our scheme is to allow other SSs to utili7e the unused bandwidth when it is availableThus, not only the same "oS guaranteed services can be provided but also the system throughput can be improved.

E istin! "#stem mportant part in bringing out the network services lies in e,isting technology. Routing and switching are the main methods of delivering the data through the network. *oth have their disadvantages and benefits and there are many variations of them applying in different ways to different situations. .nother big issue is the resource handling with "oS. n 2 world, there are a few proposals to resource handling problems and besides that there are a few technologies providing different approaches to "oS problems. These include for instance .T- and 1igabit Ethernet.

"witchin! ;ata transmission by purely switching the traffic through the network is the method used traditionally in telecommunications systems. Essentially switching means that a constant bandwidth is allocated from the total bandwidth of the transmission medium and the whole allocated bandwidth is used for data interchange for the time that the bandwidth allocation is taking

place. 6ormally, this kind of bandwidth usage is connection oriented and requires the interchange to contain different phases including connection establishment, data interchange and connection closing. n fact this kind of a switching is normally accomplished at OS protocol stack layer %, which is the link layer. Throughout this te,t this kind of a switching is regarded as layer % switching. .ctually, layer % switching can simply be considered bridging and in this logic, layer < switching is routing . Ro$tin! n turn, routing is the the main method used in T/2= 2 networks nowadays. Routing uses the bandwidth in a different way. t does not allocate constant bandwidth. nstead, in routing, the data is transported in packages that are delivered through the network by searching for the right directions in network nodes that are called routers. Therefore routing is regarded as connectionless and it does not require the data interchange phases that are needed in switching. Routing could be thought as a way of optimi7ing the bandwidth usage. %ro&osed "#stem

*andwidth reservation allows EEE #$%.&' networks to provide "oS guaranteed services. The SS reserves the required bandwidth before any data transmissions. ;ue to the nature of :*R applications, it is very difficult for the SS to make the optimal bandwidth reservation. t is possible that the amount of reserved bandwidth is more than the demand. Therefore, the reserved bandwidth cannot be fully utili7ed. .lthough the reserved bandwidth can be ad8usted via *Rs, however, the updated reserved bandwidth is applied as early as to the ne,t coming frame and there is no way to utili7e the unused bandwidth in the current frame. n our scheme, the SS releases its unused bandwidth in the current frame and another SS pre! assigned by the *S has opportunities to utili7e this unused bandwidth. This improvesthe bandwidth utili7ation. -oreover, since the e,isting bandwidth reservation is not changed, the same "oS guaranteed services are provided without introducing any e,tra delay

Al!orithm:

'#namic bandwidth re($est-allocation al!orithm and %riorit#-based "ched$lin! Al!orithm . dynamic bandwidth request!allocation algorithm for real!time services is proposed in . The authors predict the amount of bandwidth to be requested based on the information of the backlogged amount of traffic in the queue and the rate mismatch between packet arrival and service rate to improve the bandwidth utili7ation. The research works listed above improve the performance by predicting the traffic coming in the future. nstead of prediction, our scheme can allow SSs to accurately identify the portion of unused bandwidth and provides a method to recycle the unused bandwidth. t can improve the utili7ation of bandwidth while keeping the same "oS guaranteed services and introducing no e,tra delay

)od$les:
1. Bandwidth $tili*ation )od$le:

*andwidth utili7ation improvements have been proposed in the literature. n, a dynamic resource reservation mechanism is proposed. t can dynamically change the amount of reserved resource depending on the actual number of active connections. The investigation of dynamic bandwidth reservation for hybrid networks is presented in. Evaluated the performance and

effectiveness for the hybrid network, and proposed efficient methods to ensure optimum reservation and utili7ation of bandwidth while minimi7ing signal blocking probability and signaling cost. n, the enhanced the system throughput by using concurrent transmission in mesh mode

2. Packet creation Module:

n this module we split the ;ata in to 6 number of +i,ed si7e packet with -a,imum length of 3# /haracters.

+. Bandwidth rec#clin! )od$le:

The complementary station (/S). >aits for the possible opportunities to recycle the unused bandwidth of its corresponding TS in this frame. The /S information scheduled by the *S is resided in a list, called complementary list (/?). The /? includes the mapping relation between each pair of pre! assigned / and TS.

,. -o" !$aranteed ser.ices )od$le

t is different from the bandwidth ad8ustment in which the ad8usted bandwidth is enforced as early as in the ne,t coming frame. -oreover, the

unused bandwidth is likely to be released temporarily (i.e., only in the current frame) and the e,isting bandwidth reservation does not change. Therefore, our scheme improves the overall throughput while providing the same "oS guaranteed services.

/. 0raffic and %ac1et %erformance:

The 2acket mean data rate of each application but make the mean packet si7e randomly selected from 5&% to &$%3 bytes. Thus, the mean packet arrive rate can be determined based on the corresponding mean packet si7e. .s mentioned earlier, the si7e of each packet is modeled as 2oisson distribution .nd the packet arrival rate is modeled as e,ponential distribution. The other factor that may affect the performance of bandwidth recycling is the probability of the R- to be received by the /S successfully.

Dataflow diagram

Node2

E! RR
Node1

RR E!

EP RR
RR E!
Node3

RR EP

Node4

2oncl$sion:

>e proposed bandwidth recycling to recycle the unused bandwidth once it occurs. t allows the *S to schedule a complementary station for each transmission stations. Each complementary station monitors the entire 0? transmission interval of its corresponding TS and standby for any opportunities to recycle the unused bandwidth. *esides the naive priority! based scheduling algorithm, three additional algorithms have been proposed to improve the recycling effectiveness. Our mathematical and simulation results confirm that our scheme can not only improve the throughput but also reduce the delay with negligible overhead and satisfy the "oS requirements.

"#stem Re($irements
3ardware Re($irements:
2RO/ESSOR R.-O6 TOR @.R; ; SB +?O22C ;R :E /;;R :E BEC*O.R; -O0SE 9 2E6T 0- : %.' 1@7 9 9 9 9 9 9 9 5&% -* ;; R.&5A /O?OR %$ 1* &.33 -* ?1 5%D ST.6;.R; &$% BECS < *0TTO6S

"oftware Re($irements:
+ront End *ack End Tools 0sed 9 Eava, Swing 9 -S .ccess 9 Eclipse <.<

Operating System 9 >indowsD2=F