Frequency : 12 issues per year
Subject : Computer Applications and Technology
ISSN : 2319–8656 (Online)
IJCATR Volume 5 Issue 4
A Survey of Packets Scheduling Congestion Control Algorithms in Internet Protocol Storage Area Networks
Joseph Kithinji
10.7753/IJCATR0504.1008
keywords : Congestion control, packet scheduling, QOS, prioritization, fiber channel.
Several approaches have been proposed to empower communication systems with quality of service (QoS) capabilities. In general, their main goal is to coherently support the end-to-end performance needs of applications, based on the establishment of, and agreement on, a set of concepts, policies and mechanisms. The fiber channel is the standard technology used in storage are network communications but it does not have mechanisms for providing QOS guarantees. However the increasing use of transmission control/internet protocol based network storage has introduced the possibility of using already existing techniques and tools to achieve to achieve QOS guarantees in Internet protocol Storage Area Networks. Due to the existence of other competing traffic in internet protocol networks it is necessary to provide storage input/output traffic with guaranteed network bandwidth. This paper discusses the available packet scheduling mechanisms pin pointing their advantages and disadvantages. The main goal is to combine two packets scheduling mechanisms and come up with a hybrid that assure a given storage QOS requirement between a storage client and internet protocol storage.
@artical{j542016ijcatr05041008,
Title = "A Survey of Packets Scheduling Congestion Control Algorithms in Internet Protocol Storage Area Networks",
Journal ="International Journal of Computer Applications Technology and Research(IJCATR)",
Volume = "5",
Issue ="4",
Pages ="218 - 225",
Year = "2016",
Authors ="Joseph Kithinji"}
The paper discusses various packet scheduling algorithms that are used in IP Networks.
The paper proposes the use of hybrid congestion control algorithms to improve performance.
The paper identifies the strengths and weaknesses of each scheduling algorithm.
In the future work, the paper proposes design of packet scheduling algorithms that reduce jitter.