Do you want to publish a course? Click here

Comparison the effectiveness of (Polder Cast) protocol with (Scribe) protocol in peer-to-peer networks in publishing and subscription systems

مقارنة فعالية بروتوكول POLDER CAST بالنسبة لبروتوكول SCRIBE ضمن شبكات الند للند في أنظمة النشر و الاشتراك

1069   0   0   0.0 ( 0 )
 Publication date 2018
and research's language is العربية
 Created by Shamra Editor




Ask ChatGPT about the research

Publish/subscribe (pub/sub) is a popular communication paradigm in the design of largescale distributed systems. We are witnessing an increasingly widespread use of pub/sub networks for a wide array of applications in industry , academia , financial data dissemination , business process management and does not end in social networking sites which takes a large area of user interests and used network baseband . Social network interactions have grown exponentially in recent years to the order of billions of notifications generated by millions of users every day. So It has become very important to access in the field of publishing and subscription networks, especially peerto- peer (P2P) networks that used at first the Scribe data routing protocol. Since then, many developments and improvements have been made to create new designs. One of these designs is the Polder Cast protocol. The research studies most used protocols performance to assess the effectiveness of each in terms of the speed of the publication and subscription of topic , required resources and distribution of load .


Artificial intelligence review:
Research summary
تتناول الورقة البحثية مقارنة فعالية بروتوكول Polder Cast مع بروتوكول Scribe في شبكات الند للند ضمن أنظمة النشر والاشتراك. يعتبر نظام النشر والاشتراك (pub/sub) نموذج التواصل الأكثر شيوعاً في الأنظمة الموزعة على نطاق واسع، حيث يشهد استخداماً متزايداً في مجموعة واسعة من التطبيقات مثل الصناعة، الأكاديمية، الطب، نشر البيانات، وإدارة العمليات التجارية، بالإضافة إلى مواقع التواصل الاجتماعي. يهدف البحث إلى دراسة أداء البروتوكولات الأكثر استخداماً لتقييم فعالية كل منها من حيث سرعة نشر الموضوع وسرعة الاشتراك والموارد اللازمة وتوزيع الحمل في الشبكة. تم تصميم شبكتين للنشر والاشتراك الأولى مكونة من 1000 عقدة والثانية من 10000 عقدة، وتم دراسة التصميمين باستخدام برنامج PeerSim الخاص بنمذجة الشبكات. أظهرت النتائج أن بروتوكول Polder Cast يتفوق على بروتوكول Scribe من حيث سرعة نشر الموضوع وسرعة الاشتراك وتوزيع الحمل ومتطلبات الموارد. يتميز بروتوكول Polder Cast بقدرته على الموازنة في حمل النشر والاشتراك بين جميع المشتركين بنفس الموضوع، مما يجعله أكثر فعالية وأداءً مقارنة ببروتوكول Scribe.
Critical review
دراسة نقدية: على الرغم من أن البحث يقدم مقارنة شاملة بين بروتوكولي Polder Cast و Scribe، إلا أنه يفتقر إلى تحليل أعمق لبعض الجوانب الأخرى مثل الأمان والموثوقية في حالات الفشل المتكررة. كما أن الدراسة تعتمد بشكل كبير على محاكاة باستخدام برنامج PeerSim، مما قد لا يعكس بدقة الأداء الفعلي للبروتوكولات في بيئات حقيقية. كان من الممكن أن تكون الدراسة أكثر شمولية إذا تم تضمين تجارب عملية في بيئات مختلفة. بالإضافة إلى ذلك، لم يتم التطرق بشكل كافٍ إلى تأثير حجم البيانات المتداولة على أداء البروتوكولات، وهو عامل مهم يجب مراعاته في التطبيقات العملية.
Questions related to the research
  1. ما هو الهدف الرئيسي من البحث؟

    الهدف الرئيسي من البحث هو مقارنة فعالية بروتوكول Polder Cast مع بروتوكول Scribe في شبكات الند للند ضمن أنظمة النشر والاشتراك من حيث سرعة نشر الموضوع وسرعة الاشتراك والموارد اللازمة وتوزيع الحمل في الشبكة.

  2. ما هي الأدوات المستخدمة في الدراسة لتقييم أداء البروتوكولات؟

    تم استخدام برنامج PeerSim الخاص بنمذجة الشبكات والذي يعمل ضمن البيئة البرمجية Eclipse لتقييم أداء البروتوكولات.

  3. ما هي النتائج الرئيسية التي توصلت إليها الدراسة؟

    توصلت الدراسة إلى أن بروتوكول Polder Cast يتفوق على بروتوكول Scribe من حيث سرعة نشر الموضوع وسرعة الاشتراك وتوزيع الحمل ومتطلبات الموارد.

  4. ما هي التطبيقات التي تستخدم أنظمة النشر والاشتراك؟

    تستخدم أنظمة النشر والاشتراك في مجموعة واسعة من التطبيقات مثل الأنظمة المالية، الألعاب التفاعلية ذات العدد الهائل من اللاعبين، مواقع التواصل الاجتماعي مثل تويتر وفيسبوك، بالإضافة إلى التطبيقات الأكاديمية والصحية.


References used
NAKAMURA.S ; OGIELA.L ; ONIKEDO.T. Evaluation of protocols to prevent illegal information flow in peer to peer publish/ subscribe systems. In : Proc. Of IEEE THE 31ST International Conference on Advanced Information Networking and Applications (AINA- 2017), PP. 631-638
NAKAYAMA.H; DUOLIKUN.D; ENOKIDO.T. Reduction of unnecessarily ordered event massages in peer to peer model of topic based publish/ subscribe systems. In : Proc. Of IEEE THE 30ST International Conference on Advanced Information Networking and Applications (AINA-2016), PP. 1160-1167
NAKAMURA.S; ONIKEDO.T; TAKIZAWA.M. Topic based synchronization (TBS) protocols to prevent illegal information flow in peer-to-peer publish/subscribe systems. In: Proceedings Of THE 11th International Conference on Broad Band and Wireless Computing, Communication and Applications (BWCCA-2016), pp. 57-68
rate research

Read More

The advantage of peer-to-peer (P2P) paradigm relies on two main concepts: cooperation among users and resource sharing. There are many applications based on peer-to-peer paradigm, but the most popular one is the file sharing. We can classify the fi le sharing application into centralized systems, (having a central server), and decentralized systems. Another classification would be structured and unstructured systems, based on the way of managing the indexing information. In this paper, we have implemented a centralized peer-to-peer application for file sharing. Then we evaluated the performance of the system by means of simulation.
Publish/Subscribe Systems become increasingly important, mainly because they provide a full decoupling between the publishers and the subscribers, with respect to space, time, and synchronization. This research presents an overview of publish/subsc ribe systems and epidemic algorithms (especially the directed ones), and studies the performance of directed epidemic algorithms used to ensure the reliability of publish/subscribe systems. Adopting Scribe system and simulation using OMNET++, the paper evaluates different directed epidemic algorithms by considering many factors: targeted range width, number of rounds, number of nodes, and packet loss rate, on each of: the reliability, overhead, and mean latency.
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.
Routing protocols play an essential role in meeting the quality of service requirements in the network, but achieving these requirements may require frequent send and receive operations to build and maintain routing tables, which consume sensors r esource If we take into consideration the limitations of wireless sensor networks in terms of the amount of available energy and storage capacity. In this research a performance comparison of the on-demand Distance Vector Routing protocol AODV and Hierarchical Routing protocolHR was carried out in terms of the packet delivery and loose rate, delay and jitter, and the amount of expended energy in the Wireless sensor network operates according to IEEE802.15.4 standard in cases where some of sensors get out of work for limited periods of time. The results showed that the hierarchical routing protocols perform better in terms of delay time and transfer rate and the amount of consumed energy than on-demand Distance Vector Routing protocol routing protocol, but suffer larger packet loss due to routing path corruption as a result of sensors crashes.
Mobile wireless sensor network (MWSN) is a wireless ad hoc network that consists of avery large number of tiny sensor nodes communicating with each other in which sensornodes are either equipped with motors for active mobility or attached to mobile objectsfor passive mobility. A real-time routing protocol for MWSN is an exciting area of research because messages in the network are delivered according to their end-to-end deadlines (packet lifetime) while sensor nodes are mobile. This paper proposes an enhanced realtime with load distribution (ERTLD) routing protocol for MWSN which is based on our previousrouting protocol RTLD. ERTLD utilized corona mechanism and optimal forwardingmetrics to forward the data packet in MWSN. It computes the optimal forwarding nodebased on RSSI, remaining battery level of sensor nodes and packet delayover one-hop. ERTLDensures high packet delivery ratio and experiences minimum end-to-end delay in WSNand MWSN compared to baseline routing protocol. . In this paper we consider a highly dynamic wireless sensor network system in which the sensor nodes and the base station(sink) are mobile.ERTLD has been studied and verified and compared with baseline routing protocols RTLD,MM-SPEED , RTLCthrough Network Simulator- 2(NS2)

suggested questions

comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا