A QOS Based Load Balanced Switch

Abstract

The simple architecture with high forwarding capacity bandwidth is load balancing switch is build with two stage switch fabric to eliminate the mis sequencing problems and kept packets of the same flow in the order of load balanced two stage switch. Before load balancing two stages has perform with the Full frame first algorithm and use centralized scheduler to eliminate those mis sequencing problemsand getting the 100% throughput result. There comes at some additional cost and needs costly online scheduling algorithms and need for a complex scheduler and quality being reduced. In this paper we introduce the two stage switch fabric with round robin scheduling algorithmis used to solve mis sequencing problems and two maximum weight matching algorithms Longest queue first(LQF) and Oldest cell first(OCF) to achieve 100% throughput results. Theoretical analysis and simulation results shows that using these algorithms, achieve all the possible outcome results in the switch. � The simple architecture with the load balancing scheme perform with interesting two different stage switch fabric to eliminate the mis sequencing problems and kept packets of the same flow to the destination path in the order of load balanced two stage switch fabric. The two stage load balancing switch is more scalable than the any other switch in the network architecture. Hardly load balanced switch got some problem with that, on sending and receiving the data in wired or wireless networks(8), the major problem with that is mis sequencing problems has arised to loss of data packets or mis matched data formats. Somehow in earlier they are tired to clear those problems with the algorithms named, Full frame first algorithm to get mis sequencing problems and they put the centralized schedular to achieve the 100% throughput results(4)(2) in their data packets.Oftenly they got the perfect data packets arrival in destination, but the problem with that methodology is the quality of data is reduced to lower. And manually they they need costly online scheduling algorithms to rectify the mis matching of data and need more complex schedular to achieve the 100% throughput result of outcome data. We introduce in this paper to rectify the mis sequencing problems(1) and avoid the costly online scheduling algorithms, we use Round robin scheduling algorithms(RRS) to rectify the mis matching of data packets in the tcp applications and two maximum weight matching algorithms namely, Longest queue first(LOQ) and Oldest cell first(OCF) to achieve 100% throughput result for all independent arrival packets.(11)These algorithms are used to eliminate the complex schedular and needs of online costly scheduling algorithm to schedule the data packets in the destination node. The another approach of this proposed is to get the high quality of data packets in destination node which is the data which is send by sender, the receiver also got the same quality of data(9) without defragmentation and reduction of quality. We observed that in the algorithms and methodolgy of using those above like, RRS, LOQ and OCF, not only to solve mis sequencing problems and also get quality of data packets service of the same aaplication(10). Yet we are consider more algorithm to get the quality of data packets. Our idea is to just keep packets