Search In this Thesis
   Search In this Thesis  
العنوان
DYNAMIC ROUTE OPTIMIZATION FOR MULTICAST COMMUNICATIONS IN INTERNET PROTOCOL NETWORKS /
المؤلف
Abd El-Haleem, Ahmed Mostafa.
الموضوع
- . communication - Network analysis. Network, Information. communication - Network analysis.
عدد الصفحات
1 VOL. (various paging’s) :
الفهرس
Only 14 pages are availabe for public view

from 126

from 126

Abstract

ABSTRACT
Multicast internet applications, which represent the integration of media such as data, images, audio and video, have high requirements for Quality of Service (QoS) transmission. To support these requirements, an efficient multicast routing algorithm is required. This thesis proposed a new Online QoS Multicast Routing (OQMR) algorithm with minimum interference. The objective of the OQMR algorithm is to construct delay and bandwidth constraints minimum cost multicast tree with minimum interference. The algorithm is used in networks where multicast setup requests arrive one by one and no future demands are known. Minimizing interference is done by updating the weights of network links to reflect their criticality and construct the tree using these weights. The proposed algorithm identifies these critical links as links that can use for future requests and have a positive residual capacity less than the average bandwidth plus the requested bandwidth.
Also the thesis proposed new source specific QoS based Multicast routing protocol for IP network (QoSMIP), which provide services at consistent QoS levels on the internet. In the proposed QoSMIP protocol we modify the Open Shortest Path First (OSPFv3) protocol by replacing the Dijkstra’s algorithm by a new QoS multicast routing algorithm. The idea behind the new algorithm is to construct multicast tree meeting both the requested bandwidth and end to end delay bound. The constructed multicasts tree is a loop free tree with higher network resource utilization and balancing the network load. Also we modify the Multicast Listener Discovery (MLDv2) protocol to be a QoS aware group membership management protocol.
The thesis provides a description of QoS Multicast problems, followed by a discussion of the motivation for the new QoS multicast routing protocol. Then the new source specific QoS based multicast routing for IP networks is discussed.
Quantitative analysis through mathematical model and simulation experiments demonstrates the advantages of the proposed online QoS multicast routing problem, as well as the QoSMIP protocol.
Keywords: Multicast Routing Protocol, Quality of Service, Constrained Steiner Tree, Internet Protocol, QoS Multicast Routing Algorithm.