Search In this Thesis
   Search In this Thesis  
العنوان
Applications of Random Early Detection Algorithm in Queuing Mechanisms for Video’s Quality of Service Properties \
المؤلف
Abd El-Malk, Fady Victor Mikhael.
هيئة الاعداد
باحث / فادي فيكتور ميخائيل عبد الملك
Fady_victor1986@hotmail.com
مشرف / محمد رزق محمد رزق
مشرف / نهى عثمان قرنى
nokorany@hotmail.com
مناقش / محمد السعيد نصر
مناقش / السيد احمد يوسف
الموضوع
Algorithms.
تاريخ النشر
2014.
عدد الصفحات
91 p. :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
الهندسة الكهربائية والالكترونية
تاريخ الإجازة
1/12/2014
مكان الإجازة
جامعة الاسكندريه - كلية الهندسة - الهندسة الكهربائية
الفهرس
Only 14 pages are availabe for public view

from 107

from 107

Abstract

Improving the quality of service (QoS) of Internet traffic is widely recognized as a critical issue for next-generation networks.QoS is more sensitive to delay and packet loss (PL) than other factors. The objective of this thesis is studying the effect of Random Early Detection (RED) algorithm on different queuing mechanisms. Simulation tool is ’’OPNET IT Guru Academic Edition 9.1’’. This thesis analyses QoS through measuring the major factors that affect the QoS for video streaming according to international telecommunication union (ITU) standards. A congestion avoidance scheme allows a network to operate in the region of low delay and high throughput. Such scheme prevents a network from entering into congested state. RED is one such congestion avoidance mechanism used for effectively control of congestion. This thesis presents RED gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset threshold, the gateway drops or marks each arriving packet with ascertain probability. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection’s share of the bandwidth through the gateway. RED gateways are designed to accompany atransport-layer congestion control protocol such as Transmission Control Protocol (TCP).The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. This thesis discusses the effect of RED algorithm on different queuing profile like First-in First- out queuing (FIFO), priority queuing (PQ), Custom Queuing (CQ), and weighted-fair queuing (WFQ).