Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCheating Impact on Overlay Tree Construction Algorithms in Application-Level Multicast Networks
تأثير الغش على خوارزميات بناء أشجار التغطية في الشبكات التطبيقية متعددة البث
1168
0 39
0
(
0
)
Authors
مثنى القبيلي( باحث )
Created by
Shamra Editor
Ask ChatGPT about the research
تم اقتراح الشبكات التطبيقية متعددة البث كحل فعال لتجاوز مشكلة انتشار نموذج اتصال البث المجموعاتي. تبني هذه الشبكة شجرة تغطية مؤلفة من اتصالات نهاية إلى نهاية أحادية البث اعتماداً على تعاون أعضاء المجموعة مع بعضهم البعض. و تعتمد فعالية الشجرة المبنية بشكل أساسي على صدق و تعاون كل الأعضاء المشكلين لها، لكن من الصعب ضمان مثل هذا السلوك عموماً، حيث يمكن أن تستفيد بعض العقد الأنانية و غير المتعاونة من إخلاص العقد الأخرى ضمن الشجرة. حديثاً، درس العديد من الباحثين تأثير العقد الأنانية في الشبكات التطبيقية متعددة البث. تم في هذا البحث وصف تفصيلي للخوارزميات الأساسية المستخدمة في بناء شجرة التغطية، و تقييم تأثير العقد الغشاشة على استقرار و أداء شجرة التغطية المبنية باستخدام هذه الخوارزميات.
Application-Level Multicast (ALM) has been proposed as an alternative solution to overcome the lack of deployment of the IP Multicast group communication model. It builds an overlay tree consisting of end-to-end unicast connections between end-hosts based on the collaboration of group members with each other. The efficiency of the constructed overlay tree depends entirely on the honesty and on the cooperation of all participating members. However such behaviour can not be guaranteed and some selfish and non-cooperative nodes may take profit from the honesty of other members in the overlay. Recently, many researchers have been investigating the impact of selfishness of nodes in the overlay multicast. Our contribution in this paper is to describe in detail the basic algorithms used to construct the overlay tree, and evaluate the impact of cheating nodes on the stability and on the performance of constructed overlay tree using these algorithms.
References used
(Ayman El-Sayed. “Application-Level Multicast Transmission Techniques Over The Internet”. PhD thesis, INRIA Rhne Alpes, March (2004
(C. Diot, B.N. Levine, B. Lyles, H. Kassem, and D. Balensiefen. “Deployment issues for the IP multicast service and architecture”. IEEE Network, 14:78-88, February (2000
Zhiye Huang, Jinxiang Peng and Jian Zhang, “The application level Multicast Technique Algorithms Oriented to P2P video”, Applied Mechanics and Material, vol.8, no. 303-306, pp: 2260-2264, January 2013
rate research
Read More
Recent researches consecrate their efforts to overcome multicast network problems by moving all the multicast functions and responsibilities from network layer (routers) to application layer ( terminal nodes (Users)).
Most of Application-Level Multi
cast (ALM)protocols rely on the idea that when a parent node leaves the overlay tree, all itspredecessors should re-join the tree again,which cause several re-organization operations in addition to the interruption of communication frequently. Membership Duration Aware ALM (MDA-ALM) protocol was suggested to solve this problem, it depends on the announcement of the expected membership duration for each new user in order to build a stable and efficient tree.
Although the performance of MD-ALM protocol is good, but it is based on membership duration parameter and this makes it more sensitive for the cheating and non-cooperative nodes. The main goal for the cheating nodes is to improve its position in the tree by trying to get the nearest position to the source node and to avoid having any children’s in order to relieve its load by manipulating the membership duration information.
Our research aims to find the best solution to detect the cheating nodes and cancel its affects in order to improve the performance of MDA against cheating. The simulation results improve that the proposed method detects effectively the cheating nodes.
Overlay multicast (Application-Level Multicast (ALM)) constructs a multicast delivery tree among end hosts. Unlike traditional IP multicast where the internal tree nodes are dedicated routers which are relatively stable and do not leave the multicast
tree voluntarily, the non-leaf nodes in the overlay tree are free end hosts which can join/leave the overlay at will, or even crash without notification. So, the leaving node can leave suddenly and cannot give its descendants (and the Rendez-vous Point (RP)) the time to prepare the recovering (the reconnection) of the overlay tree, and so there is a need to trigger a rearrangement process in which each one of its descendants should rejoin the overlay tree. In this case, all of its downstream nodes are partitioned from the overlay tree and cannot get the multicast data any more. These dynamic characteristics cause the instability of the overlay tree, which can significantly impact the user.
A key challenge in constructing an efficient and resilient ALM protocol is to provide fast data recovery when overlay node failures partition the data delivery paths. In this paper, we analyze the performance of the ALM tree recovery solutions using different metrics.
Application-Level Multicast Networks are easy to deployment, it does not require
any change in the network layer, where data is sent to the network via the built-up
coverage of the tree using a single-contact transmission of the final contract, who
are the
hosts are free can join / leave whenever they want it, or even to leave without telling any
node so. Causing the separation of the children of the leaved node from the tree, and the
request for rejoin, in other words, these nodes will be separated from the overlay tree and
cannot get the data even rejoin. This causes the distortion of the constructed tree, and the
loss of several packets which can significantly impact the user.
One of the key challenges in building a multi-efficiently and effectively overlay
multicast protocol is to provide a robust mechanism to overcome the sudden departure of a
node from the overlay tree without a significant impact on the performance of the
constructed tree. In this research, we propose a new protocol to solve problems presented
previously.
Computer networks have evolved considerably in the past few years of big increases
in mutual amounts of data across the network hand because of the increasing number of
interconnected devices, which can exchange data as part of the network and this
is what led
to the emergence of what is known as the problems of congestion Studies showed about
some of these problems that the largest reason is involved in the implementation of the
transmission rules, and this led to the urgent of multiple types of protocols in the computer
networks that needs to deal with different computer and communication systems, and
many other applications, which often causes errors at the level of the bit and level of the
packets, missing packets, duplicate packets, randomly received packets, and most
importantly the appeared congestion in the network.
This research aims to determine how to improve the performance of the network to
get rid of the congestion by using advantages of the algorithms used to avoid congestion
that may occur in the networks that rely TCP protocol . The goals of these algorithms is to
reach stability in the network by working to achieve the principle of package saving.
Also within this scope it has been studied, and compared some of the algorithms that
used to avoid congestion in general, without relying on a specific protocol or specific
service category.
Due to the large increase in the use of data communication and information exchange
services of different types in different environments, the standard and the programming
had to be a language of characterization is ideal for scalability and develo
pment that serve
the growing needs in the best form and in the shortest possible time and was the most
widely used language and the most widely used XML language.
he adoption of graphics architecture sometimes created a problem affecting the
performance of information transmission networks due to the large volume of data
exchanged as well as the need for large storage capacity at both ends of the transmission
and reception.
Effective ways of reducing the amount of data exchanged through the network had to
be found.
There have been many scientific researches and practical experiments on finding
effective ways to reduce the actual size of the data and by adopting different parameters
that affect the process of compressing the files so as to achieve better results by reducing
the volumes of files exchanged with attention to times of compression and decompression
of files.
In this research, we focused on the study and comparison of some compression
algorithms for files and their effect on data communication in networks.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
