On the Impact of Fault-Tolerance Mechanisms in a Peer-to-Peer Middleware

نویسندگان

  • Rolando Martins
  • Priya Narasimhan
  • Fernando Silva
چکیده

We address the problem of integrating real-time fault-tolerance mechanisms into peer-to-peer systems, with specific architecture and deployment constraints. For this purpose we implemented a prototype hierarchical peer-to-peer framework in which the leaf peers are sensors that generate different kinds of traffic such as mesh management, events, video and audio. We evaluate the framework by measuring packet loss, response time, jitter and mesh overhead for each type of traffic under peer failure. We report significant gains in QoS for all types of traffic, when using the fault-tolerance mechanisms, with minimal response time and mesh management overhead. Abstract— We address the problem of integrating real-time fault-tolerance mechanisms into peer-to-peer systems, with specific architecture and deployment constraints. For this purpose we implemented a prototype hierarchical peer-to-peer framework in which the leaf peers are sensors that generate different kinds of traffic such as mesh management, events, video and audio. We evaluate the framework by measuring packet loss, response time, jitter and mesh overhead for each type of traffic under peer failure. We report significant gains in QoS for all types of traffic, when using the fault-tolerance mechanisms, with minimal response time and mesh management overhead. We address the problem of integrating real-time fault-tolerance mechanisms into peer-to-peer systems, with specific architecture and deployment constraints. For this purpose we implemented a prototype hierarchical peer-to-peer framework in which the leaf peers are sensors that generate different kinds of traffic such as mesh management, events, video and audio. We evaluate the framework by measuring packet loss, response time, jitter and mesh overhead for each type of traffic under peer failure. We report significant gains in QoS for all types of traffic, when using the fault-tolerance mechanisms, with minimal response time and mesh management overhead.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Peer-to-Peer and fault-tolerance: Towards deployment-based technical services

For effective components, non-functional aspects must be added to the application functional code. Likewise enterprise middleware and component platforms, in the context of Grids, services must be deployed at execution in the component containers in order to implement those aspects. This paper proposes an architecture for defining, configuring, and deploying such Technical Services in a Grid pl...

متن کامل

P2P-MapReduce: Parallel data processing in dynamic Cloud environments

MapReduce is a programming model for parallel data processing widely used in Cloud computing environments. Current MapReduce implementations are based on centralized master-slave architectures that do not cope well with dynamic Cloud infrastructures, like a Cloud of clouds, in which nodes may join and leave the network at high rates. We have designed an adaptive MapReduce framework, called P2P-...

متن کامل

A Middleware for Job Distribution in Peer-to-Peer Networks

Recently, Peer-to-Peer (P2P) technology has become important in designing (desktop) grids for large-scale distributed computing over the Internet. We present a middleware for distributed computing based on Peer-to-Peer systems. When combining public-resource computation ideas with concepts of P2P networks, new challenges occur due to the lack of global knowledge as there is no central administr...

متن کامل

MPIgnite: An MPI-Like Language and Prototype Implementation for Apache Spark

Scale-out parallel processing based on MPI is a 25-year-old standard with at least another decade of preceding history of enabling technologies in the High Performance Computing community. Newer frameworks such as MapReduce, Hadoop, and Spark represent industrial scalable computing solutions that have received broad adoption because of their comparative simplicity of use, applicability to relev...

متن کامل

Dynamically-Fulfilled Application Constraints through Technical Services Towards Flexible Component Deployments

We propose in this paper, a mechanism for Grid computing frameworks, for specifying environmental requirements that may set and be optimized by deployers. Specified by designers by parameterizing deployment abstractions, the constraints can be dynamically mapped onto the infrastructure. This work is integrated in the ProActive middleware with the concept of technical services. We illustrate thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010