Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPerformance Evaluation of Algorithms of Dynamic Rendezvous Point Relocation
تقييم أداء خوارزميات إعادة تموضع نقطة المركز للشبكات متعددة المستقبلات ديناميكيا
2297
0 90
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
إن زيادة الطلب على تطبيقات المجموعات الموجهه، مثل إرسال الصوت و الصورة و استقبالهما عن طريق الانترنت، لا يمكن تحقيقه بشكل فعال و أمثل عن طريق استخدام أنظمة اتصال نقطة إلى نقطة. (Point-to-Point) و لهذا السبب تَستَخدِم معظم التطبيقات المكونة من مرسل واحد يقوم بإرسال البيانات نفسها إلى مجموعة من المستقبلات ذات عنوان انترنت واحد متعدد الأهداف أنظمة الاتصالات المتعددة الأهداف. حيث يتم بناء ما يسمى بشجرة التوزيع لهذا الغرض و ذلك من أجل وصل جميع المستقبلات بالمرسل. يعد البروتوكول (PIM-SM) من بروتوكولات المسار المتعددة الأهداف، الذي يَسْتَخدِم مركز واحد و الذي سنشير إليه لاحقا بنقطة الالتقاء (RP) لجميع المرسلات ضمن المجموعة المتعددة الأهداف. يقوم البروتوكول (PIM-SM) بتوزيع البيانات المرسلة من قبل المرسلات بواسطة ما يسمى شجرة التوزيع المشتركة ذات مركز محدد مسبقا و الذي يدعى بنقطة الالتقاء (RP). كما يقوم هذا البروتوكول ببناء شجرة توزيع خاصة تدعى (source-specific tree) لجميع المرسلات التي يتخطى معدل إرسالها للبيانات حدا مسموحا به.تم انجاز العديد من الأبحاث العلمية و الموجودة في المراجع من أجل تحسين أداء هذا البروتوكول و الوصول إلى آلية فعالة و مناسبة من أجل عملية إعادة تموضع نقطة الالتقاء (RP) ديناميكيا بالاعتماد على المرسلات، و المستقبلات ضمن المجموعة المتعددة الأهداف. في هذا المقال تم توسيع دراسة الخوارزميات الثلاثة المستخدم من أجل إيجاد الموقع الأمثل لنقطة الالتقاء و المقترحة ضمن مقالتنا السابقة[ 12 ]، كما تم استخدام طريقتين لاختيار موقع نقطة الالتقاء (تكلفة الشجرة المقدرة ETC بالإضافة إلى تكلفة الشجرة المقدرة المحسنة EETC) من أجل تقييم أداء هذه الخوارزميات. حيث قمنا بمقارنة الطرق المقترحة في المراجع العلمية و اختيار الطريقة الأفضل من حيث إيجاد نقطة الالتقاء الأفضل لتقييم خوارزميات البحث بالإضافة إلى الطريقة المحسنة المقترحة في هذه المقالة. لقد قمنا باستخدام الخوارزمية (Hill-Climbing), بالإضافة إلى البروتوكول الأساسي (PIM-SM) المُعتَمِد على الطريقة الساكنة لاختيار موقع المركز بوصفه مرجعا أساسا من أجل المقارنة و التقييم. أظهرت نتائج الدراسة أن الخوارزميات المقترحة في هذا المقال لإعادة تموضع نقطة الالتقاء ديناميكيا أعطت نتائج أفضل من حيث تخفيض حمل الشبكة مقارنة بخوارزمية تحديد موقع نقطة الالتقاء الساكنة و لكن هذه الخوارزميات تحتاج إلى بعض رسائل التحكم الإضافية.
The Protocol Independent Multicast - Sparse Mode (PIM-SM) uses one center (referred here as the Rendezvous Point “RP”) for all sources in a multicast group. PIM-SM distributes the multicast traffic of a source through a so-called shared distribution tree, whose root is at a predefined core called Rendezvous Point (RP). It also builds source-specific trees to the sources whose data rates exceed a defined threshold. In the literature, several investigations are done to improve and provide an efficient mechanism for the dynamic relocation of the RP depending on the sources or the members of the multicast group. In this paper, we extend the investigation of three search algorithms used to find the optimal RP position. To evaluate the performance of these algorithms, Estimated Tree Cost (ETC) and our improvement Enhanced Estimated Tree Cost (EETC), are used. The reason behind our choice these two methods is a comparative investigation of the RP-selection methods proposed in the literature. From the comparison we can see that ETC finds the most optimal position of the rendezvous point. The Hill-Climbing algorithm and the standard PIM-SM protocol with static RP-selection are used as a reference for comparison. Our algorithms result in a lower network load compared to RP-selection algorithm. However, they need additional control messages.
References used
Wei, L., Estrin, D. A Comparison Of Multicast Trees And Algorithms. Technical Report Usc-Cs-93-560, 1994
Williamson, B. Developing Ip Multicast Networks, Volume I. Cisco Press, 1999
Waitzman, D., Partridge, C., Deering, S. Distance Vector Multicast Routing Protocol. Rfc1075, 1988
Fenner, B., Handley, M., Holbrook, H., Kouvelas, I. Protocol Independent Multicast - Sparse Mode (Pim-Sm): Protocol Specification. Rfc4601, 2006
Filali, F., Dabbous, W. A Qos-Aware Switching Mechanism Between The Two Modes Of Pim-Sm Multicast Routing Protocol. In Proceedings Of Itc15 Specialist Seminar, Wuerzburg (Germany), 2002
rate research
Read More
The location of wireless sensor nodes located in the center is necessary for applications
where information about the site is important information such as security, protection,
object tracking and other applications.
localization algorithms are c
lassified into two types: Range-based and Range-free. The
study focused on Range-free localization algorithms because they are less expensive in
terms of hardware requirements.
The MATLAB was used to simulate the algorithms, whose performance was evaluated by
changing the number of network nodes, the number of Anchor nodes, and the contract area
of communication in order to illustrate performance differences in terms of localization
error.
The results showed the superiority of the amorphous algorithm, achieving high localization
accuracy and lower cost for the number of Anchor nodes needed to achieve a small error.
In this paper, we compare the performance of sporadic tasks scheduler algorithms on
a multi-core platform in order to determine the best algorithm in terms of a set of
parameters adopted by researchers in this field, which in turn gives us accurate
details
about the quality of such algorithms when applied to a set of sporadic tasks generated
according to uniformed Logarithmic probability distribution.
The simulation is done using Simso simulator, which proved the reliability of high
performance by the testimony of many researchers in this field, as it provides the
possibility of generating tasks according to specific probability distributions, and simulates
accurate details related to the characteristics of random tasks.
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.
Molecular docking is a hard optimization problem that has been
tackled in the past, demonstrating new and challenging results when
looking for one objective . However, only a few papers can be
found in the literature that deal with this problem by
means of a
multi-objective approach, and no experimental comparisons have
been made in order to clarify which of them has the best overall
performance. In this research, we use and compare, a set of
representative multi-objective optimization algorithms. The
approach followed is focused on optimizing the inter-molecular and
intra-molecular energies as two main objectives to minimize.
The research presents molding and analytical study of several scheduling algorithms
types in real-time multiprocessor systems. The performance of three scheduling algorithms
have been analyzed : Earliest Deadline First Scheduling (EDF) , Least Laxi
ty First
Scheduling (LLF), and Earliest Deadline First until Zero Laxity Scheduling (EDZL). This
paper considers the scheduling of n periodic, independed, and preempted tasks with
implicit deadlines on a platform of m homogenous multiprocessor. It has compared in
terms of the load on the processor (processor's busyness) , the number of migrations, and
the number of preemptions and the number of times in which these algorithms did not
succeed in achieving the time limits for tasks where the latter is considered the most
important criterion in real time scheduling. It also considers scheduling growing task sets
of periodic tasks starting from 4 task set up to 64 task set, in order to study the effect of
increasing the number of tasks and processors also on the performance of the scheduling
algorithms. As a result of research, the strengths and weaknesses in the performance of
these three algorithms have presented. It is proposed the best type of real-time system to
apply each algorithm according to the strengths of its performance.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
