A modular multicasting algorithm with a contour discovery approach.
Item
-
Title
-
A modular multicasting algorithm with a contour discovery approach.
-
Identifier
-
AAI3232036
-
identifier
-
3232036
-
Creator
-
Aponte, Alberto.
-
Contributor
-
Adviser: Tarek Saadawi
-
Date
-
2006
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Engineering, Electronics and Electrical
-
Abstract
-
This thesis presents an innovative approach to multicasting algorithms design. Our approach herein is based on two main components; the first is our proposed contour discovery algorithm, while the second is the proposed multicasting algorithm that is based on the contour discovery algorithm.;We develop an algorithm for finding the shortest distance - in terms of the number of hops - from a node identified as a source to unknown nodes located by the outskirts of a network. Several distances are found through each neighbor of the source node to determine the contour of the network. The accuracy of the found contour relies on our outward propagation mechanism which propagates discovery packets strictly in an outward direction relative to the source node. This algorithm is based on the deployment and return of discovery packets.;Based on the found contour we develop a Distributed Multicast Algorithm which uses that information to create modules on appropriate regions of a network. This algorithm deals with the following issues: (a) neighbor discovery, (b) neighborhood exchange, (c) multicast advertisement, (d) multicast registration, and (e) data distribution. The main goal of this algorithm is to minimize the multicast delivery delay, that is, the time between the beginning of the reception of a packet by the first group member and the end of the reception of the same packet by the last member.;Performance metrics covered include coverage time, multicast delivery delay, and network congestion. Performance evaluation through simulation observations show that the probability of missing a node during the discovery process is near zero for several topologies with different network sizes and different origination points. It is also shown that the multicast delivery delay in our distributed multicasting decreases on the average by a factor of 0.6 compared to that in non-distributed multicasting when the two algorithms are tested on the same topologies and network sizes. On the other hand, the packet delivery ratio, that is, the number of multicasting packets delivered versus the number of multicasting packets supposed to be received is near one for moderate multicast group sizes and data rates. Other outcomes achieved by the implementation of modularity are: Distribution of acknowledgement implosion among several nodes in the network, obtain multicast source registration, and avoid broadcast storming.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
