Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userFault Tolerance in Application-Level Multicast Networks
سماحية الأعطال في الشبكات التطبيقية متعددة البث
1085
0 121
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
تبني الشبكات التطبيقية متعددة البث شجرة تغطية بث مجموعاتي بين المضيفين النهائيين. على عكس البث المجموعاتي التقليدي حيث تكون عقد الشجرة الداخلية هي موجهات مكرسة، تكون ثابتة و لا تغادر شجرة البث المجموعاتي طوعاً، فإن العقد غير الطرفية في شجرة التغطية هي عبارة عن مضيفين أحرار يمكنهم الانضمام/ المغادرة متى أرادوا ذلك، أو حتى المغادرة دون إخبار أي عقدة بذلك. لذلك، يمكن للعقدة المغادرة فجأة دون إعطاء عقدها الأبناء أو العقدة المركزية الزمن الكافي لإعادة تشكيل شجرة التغطية، لذلك فهناك حاجة لتنفيذ عملية إعادة تشكيل الشجرة بحيث يجب على كل عقدة ابن إعادة الانضمام إلى شجرة التغطية. في هذه الحالة، ستنفصل هذه العقد عن شجرة التغطية و لا يمكنها الحصول على البيانات حتى تنضم من جديد. تسبب هذه الخصائص الديناميكية عدم استقرار شجرة التغطية، و التي يمكن أن تؤثر بشكل كبير على المستخدم. أحد التحديات الرئيسية في بناء بروتوكول شبكة تطبيقية متعدد البث كفوء و فعال هو توفير آلية استعادة البيانات بسرعة عندما يسبب فشل عقد الشجرة تقسيم مسارات تسليم البيانات. سنقوم في هذا البحث بتحليل أداء الحلول المقترحة لإعادة تشكيل شجرة التغطية اعتماداً على عدة بارامترات.
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.
References used
(R.Wittmann and M. Zitterbart. “Multicast Communication Protocols and Applications”. ISBN 1-55860-645-9. Morgan Kaufmann Publishers, (2001
(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
(Ayman El-Sayed. “Application-Level Multicast Transmission Techniques Over The Internet”. PhD thesis, INRIA Rhne Alpes, March (2004
rate research
Read More
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.
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-host
s
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.
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.
In this paper, we introduce a continuous mathematical model to
optimize the compromise between the overhead of fault tolerance
mechanism and the faults impacts in the environment of
execution. The fault tolerance mechanism considered in this
rese
arch is a coordinated checkpoint/recovery mechanism and the
study based on stochastic model of different performance critics of
parallel application on parallel and distributed environment.
In this paper we present a study on the time cost
added to the grid computing as a result of the use of a
coordinated checkpoint / recovery fault tolerance protocol, we aim
to find a mathematical model which determined the suitable time
to save t
he checkpoints for application, to achieve a minimum
finish time of parallel application in grid computing with faults and
fault tolerance protocols, we have find this model by serial
modeling to the goal errors, execution environment and the
chosen fault tolerance protocol all that by Kolmogorov differential
equations.
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
