OST : A transaction based online social trust model for social network and file sharing security

The continuous growth of the users pool of Social Networking web sites such as Facebook and MySpace, and their incessant augmentation of services and capabilities will in the future, meet and compare in contrast with today\u27s Content distribution Networks (CDN) and Peer-to-Peer File sharing applications such as Kazaa and BitTorrent, but how can these two main streams applications, that already encounter their own security problems cope with the combined issues, trust for Social Networks, content and index poisoning in CDN? We will address the problems of Social Trust and File Sharing with an overlay level of trust model based on social activity and transactions, this can be an answer to enable users to increase the reliability of their online social life and also enhance the content distribution and create a better file sharing example. The aim of this research is to lower the risk of malicious activity on a given Social Network by applying a correlated trust model, to guarantee the validity of someone\u27s identity, privacy and trustfulness in sharing content

Reducing upload and Download Time on Cloud using Content Distribution Algorithm

Cloud computing is a term, which involves virtualization, distributed computing, networking, software and web services. Cloud services provide resources efficiently based on demand. Central of these lies in the establishment of an effective algorithm to Achieve minimum distribution time (MDT). Achieving MDT is crucial for bulk-synchronous applications, when every client in the set to finish their download before being able to make use of the downloaded content. In this paper, we propose the use of dedicated Servers to accelerate peer - assisted content distribution using content distribution algorithm. Downloading time is reduced using BitTorrent application and Steiner tree algorithm. BitTorrent , a popular Peer-to -Peer file sharing protocol for mass distributions. Steiner tree algorithm, a star based protocol to effectively reduce the distribution time

The ViP2P Platform: XML Views in P2P

The growing volumes of XML data sources on the Web or produced by enterprises, organizations etc. raise many performance challenges for data management applications. In this work, we are concerned with the distributed, peer-to-peer management of large corpora of XML documents, based on distributed hash table (or DHT, in short) overlay networks. We present ViP2P (standing for Views in Peer-to-Peer), a distributed platform for sharing XML documents based on a structured P2P network infrastructure (DHT). At the core of ViP2P stand distributed materialized XML views, defined by arbitrary XML queries, filled in with data published anywhere in the network, and exploited to efficiently answer queries issued by any network peer. ViP2P allows user queries to be evaluated over XML documents published by peers in two modes. First, a long-running subscription mode, when a query can be registered in the system and receive answers incrementally when and if published data matches the query. Second, queries can also be asked in an ad-hoc, snapshot mode, where results are required immediately and must be computed based on the results of other long-running, subscription queries. ViP2P innovates over other similar DHT-based XML sharing platforms by using a very expressive structured XML query language. This expressivity leads to a very flexible distribution of XML content in the ViP2P network, and to efficient snapshot query execution. ViP2P has been tested in real deployments of hundreds of computers. We present the platform architecture, its internal algorithms, and demonstrate its efficiency and scalability through a set of experiments. Our experimental results outgrow by orders of magnitude similar competitor systems in terms of data volumes, network size and data dissemination throughput.Comment: RR-7812 (2011

Video streaming with quality adaption using collaborative active grid networks

Due to the services and demands of the end users, Distributed Computing (Grid Technology, Web Services, and Peer-to-Peer) has been developedrapidJy in thelastyears. Theconvergence of these architectures has been possible using mechanisms such as Collaborative work and Resources Sharing. Grid computing is a platform to enable flexible, secure, controlled, scalable, ubiquitous and heterogeneous services. On the other hand, Video Streaming applications demand a greater deployment over connected Internet users. The present work uses the Acti ve Grid technology as a fundamental platform to give a solution of multimediacontentrecovery. This solution takes into account the following key concepts: collaborative work, multi-source recovery and adapti ve quality. A new archi tecture is designed to deliver video content over a Grid Network. The acti ve and passi ve roles of the nodes are important to guarantee a high quality and efficiency for the video streaming system. The acti ve sender nodes are the content suppliers, while the passive sender nodes wiU perform the backup functions, based on global resource control policies. The aim of the backup node is minirnize the time to restore the systemin caseoffailures. In this way, all participant peers work in a collaborati ve manner following a mul ti -source recovery scheme. Furthermore, Video La yered Encoding is used to manage the video data in a high scalable way, di viding the video in multiple layers. This video codification scheme enables thequality adaptation according to the availability of system resources. In addition, a buffer by sender peer and by layer is needed for an effecti ve control ofthe video retrieve. The QoS will fit considering the state of each buffer and the measurement tools provide by the Acti ve Grid on the network nodes. Ke ywords: Peer -to-Peer Grid Architecture, Services for Active Grids, Streaming Media, Layered Coding, Quality Adaptation, CoUaborative Work.Peer Reviewe

FOSP: Towards a Federated Object Sharing Protocol that Unifies Operations on Social Content

Years ago, the World Wide Web (WWW) began as a system for publishing interlinked hypertext documents. While the protocols on top of which the WWW is built are almost still the same, the usage, as well as the content has changed significantly. Simple delivery of hypertext documents has been expanded by operations, such as uploading, sharing, and commenting on pieces of content. Online Social Networks (OSNs) and other IT services provide aggregated views on these pieces of content. However, the services are often implemented as vendor specific applications on top of common web technologies, such as HTTP, HTML, JavaScript and CSS. Moreover, users are locked into these applications of dedicated providers, which prevents sharing of content across applications and limits the control users have over their data. Most existing approaches that overcome these issues focus on defining a common HTTP API or prefer solutions based on peer-to-peer networks. In this paper, we start by discussing related work and identifying essential requirements for an appropriate solution. Furthermore, we outline the concept and implementation of a Federated Object Sharing Protocol (FOSP), i.e, a different approach to support todays common operations on social content already on a protocol level. We show that services built on top of this protocol can be federated by default, i.e., users registered with different providers can easily interact with each other. Finally, we provide an evaluation and discussion on the proposed approach