Content-access QoS in peer-to-peer networks using a fast MDS erasure code

This paper describes an enhancement of content access Quality of Service in peer to peer (P2P) networks. The main idea is to use an erasure code to distribute the information over the peers. This distribution increases the users’ choice on disseminated encoded data and therefore statistically enhances the overall throughput of the transfer. A performance evaluation based on an original model using the results of a measurement campaign of sequential and parallel downloads in a real P2P network over Internet is presented. Based on a bandwidth distribution, statistical content-access QoS are guaranteed in function of both the content replication level in the network and the file dissemination strategies. A simple application in the context of media streaming is proposed. Finally, the constraints on the erasure code related to the proposed system are analysed and a new fast MDS erasure code is proposed, implemented and evaluated

Application of JXTA-overlay platform for secure robot control

In this paper, we present the evaluation and experimental results of secured robot control in a P2P system. The control system is based on JXTA-Overlay platform. We used secure primitives and functions of JXTA-Overlay for the secure control of the robot motors. We investigated the time of robot control for some scenarios with different number of peers connected in JXTA-Overlay network. All experiments are realised in a LAN environment. The experimental results show that with the join of other peers in the network, the average time of robot control is increased, but the difference between the secure and unsecure robot control average time is nearly the samePeer ReviewedPostprint (published version

Survey on Mobile Social Cloud Computing (MSCC)

Due to enhancement in technology the use of mobile devices increases with time. Now mobile devices (mobiles, PDA, Laptops etc.) became an essential part of mankind’s life. With the ease of Internet the popularity of Social Networking Services (SNS) among people increases. With the sharp drops in the prices, the working of mobile devices including smart phones and laptops is rising steadily. So due to this, mobile devices are now used as a provider of computing resources and services instead of requester. For this concept of Cloud Computing (CC) is merged with the mobile computing and SNS which is known as MSCC. MSCC is technology of future and it enables users/consumers to access the services in a fast and efficient manner. MSCC is the integration of three different technologies 1) Mobile Computing 2) SNS 3) Cloud Computing. Here mobile devices are (those have moments) using SNS (Both as a provider or requester) in Cloud Computing (CC) environment. In such environment, a user through mobile devices canparticipate in a social network through relationships which are based on trust. Units of the identical or alike social network can share services or data of cloud with other users of that social network without any authentication by using their mobile device as they be members of the identical social network. Various techniques are revised and improved to achieve good performance in a cloud computing network environment. In this work, there is a detailed survey of existing social cloud and mobile cloud techniques and their application areas. The comparative survey tables can be used as a guideline to select a technique suitable for different applications at hand. This survey paper reports the results of a survey of Mobile Social Cloud Computing (MSCC) regarding the importance of security of MSCC. Here we compare the works of different researcher in the field of MSCC on the basis of some essential features like security algorithm used, Qos and Fault tolerant strategy used, ease of proposed algorithm, space complexity etc. Considering all the limitations of the existing social cloud and mobile cloud techniques, an adaptive MSCC framework of Fault tolerance for future research is proposed

Pando: Personal Volunteer Computing in Browsers

The large penetration and continued growth in ownership of personal electronic devices represents a freely available and largely untapped source of computing power. To leverage those, we present Pando, a new volunteer computing tool based on a declarative concurrent programming model and implemented using JavaScript, WebRTC, and WebSockets. This tool enables a dynamically varying number of failure-prone personal devices contributed by volunteers to parallelize the application of a function on a stream of values, by using the devices' browsers. We show that Pando can provide throughput improvements compared to a single personal device, on a variety of compute-bound applications including animation rendering and image processing. We also show the flexibility of our approach by deploying Pando on personal devices connected over a local network, on Grid5000, a French-wide computing grid in a virtual private network, and seven PlanetLab nodes distributed in a wide area network over Europe.Comment: 14 pages, 12 figures, 2 table

Peer-to-Peer Networks and Computation: Current Trends and Future Perspectives

This research papers examines the state-of-the-art in the area of P2P networks/computation. It attempts to identify the challenges that confront the community of P2P researchers and developers, which need to be addressed before the potential of P2P-based systems, can be effectively realized beyond content distribution and file-sharing applications to build real-world, intelligent and commercial software systems. Future perspectives and some thoughts on the evolution of P2P-based systems are also provided

A Taxonomy of Data Grids for Distributed Data Sharing, Management and Processing

Data Grids have been adopted as the platform for scientific communities that need to share, access, transport, process and manage large data collections distributed worldwide. They combine high-end computing technologies with high-performance networking and wide-area storage management techniques. In this paper, we discuss the key concepts behind Data Grids and compare them with other data sharing and distribution paradigms such as content delivery networks, peer-to-peer networks and distributed databases. We then provide comprehensive taxonomies that cover various aspects of architecture, data transportation, data replication and resource allocation and scheduling. Finally, we map the proposed taxonomy to various Data Grid systems not only to validate the taxonomy but also to identify areas for future exploration. Through this taxonomy, we aim to categorise existing systems to better understand their goals and their methodology. This would help evaluate their applicability for solving similar problems. This taxonomy also provides a "gap analysis" of this area through which researchers can potentially identify new issues for investigation. Finally, we hope that the proposed taxonomy and mapping also helps to provide an easy way for new practitioners to understand this complex area of research.Comment: 46 pages, 16 figures, Technical Repor