Content Details | NUML Online Research Repository

Title Queue assisted congestion avoidance scheme using software defined networks

Author(s) Sobia Bibi

Abstract The internet of belongings is a topic that has gained popularity in recent decades and contains a significant amount of data. Utilizing and storing large amounts of data properly demands control. In this process, a substantial number of statistics is transmitted over the network. There is a chance that data packets will be dropped during transport and that buffer delays will occur. Continuously long delays at the network area can reduce its utility and cause congestion. To avoid this congestion, a hybrid community-managed design is introduced to fully utilize the community. Software Defined Congestion Control Plane is completely based on software-described network in which network statistics are collected by controller and by modifying transport layer parameters, behavior of end to end host are designated. It can also be used to alleviate security problems that could be referred as Feedback based Congestion Avoidance that can maintain a short router queue length with high network utilization. It automatically adjusts the congestion window according to feedback of remote control. The importance of this research study focuses on congestion in thenetwork links which is recognized by the flow table of the OpenFlow enabled switches. Software Defined Network tries to simplify the development and implementation of new congestion control algorithms by centralizing the control of the network in one entity called the controller. This research will lead to the exploitation of software based networks for the further improvement and management of various network components. We suggested a hybrid community-managed design to fully utilize the community in order to avoid this congestion. SDCCP is entirely based on software-described Networks that modifies delivery layer parameters. In this manner, we suggested a set of rules called FCA (comments-based fully Congestion Avoidance) that operates on SDCCP and completely changes the crowding window founded on feedback from the distant supervisor. FCA can maintain a short router queue length due to the threshold checks that are divided in small chunks. After every threshold chunk, average queue length is determined and decision is taken according to the residual buffer capacity. Due to time to time queue length threshold checks, proposed IAGRED schemes perform better results than previous schemes. The main contribution of the IAGRED scheme is towards packet loss and buffer delays. Proposed scheme decreases the packet loss and delays due to early detection which is clear from the results chapter with the help of different graphs. For Example from the Delay graph; at the start of packet arrival delay is tolerable in three schemes but as the time increased, proposed scheme behaves better than previous schemes.

Type Thesis/Dissertation MS

Faculty Engineering and Computer Science

Department Computer Science

Language English

Publication Date 2023-03-09

Subject Computer Science

Publisher

Contributor(s)

Format

Identifier

Source

Relation

Coverage

Rights