1,848 research outputs found

    A schema-based P2P network to enable publish-subscribe for multimedia content in open hypermedia systems

    No full text
    Open Hypermedia Systems (OHS) aim to provide efficient dissemination, adaptation and integration of hyperlinked multimedia resources. Content available in Peer-to-Peer (P2P) networks could add significant value to OHS provided that challenges for efficient discovery and prompt delivery of rich and up-to-date content are successfully addressed. This paper proposes an architecture that enables the operation of OHS over a P2P overlay network of OHS servers based on semantic annotation of (a) peer OHS servers and of (b) multimedia resources that can be obtained through the link services of the OHS. The architecture provides efficient resource discovery. Semantic query-based subscriptions over this P2P network can enable access to up-to-date content, while caching at certain peers enables prompt delivery of multimedia content. Advanced query resolution techniques are employed to match different parts of subscription queries (subqueries). These subscriptions can be shared among different interested peers, thus increasing the efficiency of multimedia content dissemination

    H-P2PSIP: Interconnection of P2PSIP domains for Global Multimedia Services based on a Hierarchical DHT Overlay Network

    Get PDF
    The IETF P2PSIP WG is currently standardising a protocol for distributed mul- timedia services combining the media session functionality of SIP and the decentralised distribution and localisation of resources in peer-to-peer networks. The current P2PSIP scenarios only consider the infrastructure for the connectivity inside a single domain. This paper proposes an extension of the current work to a hierarchical multi-domain scenario: a two level hierarchical peer-to-peer overlay architecture for the interconnection of diïŹ€erent P2PSIP domains. The purpose is the creation of a global decentralised multimedia services in enterprises, ISPs or community networks. We present a study of the Routing Performance and Routing State in the particular case of a two-level Distributed Hash Table Hierarchy that uses Kademlia. The study is supported by an analytical model and its validation by a peer-to-peer simulator.En prens

    A Voice for the Voiceless: Peer-to-peer Mobile Phone Networks for a Community Radio Service

    Get PDF
    We propose a new application for mobile ad-hoc networks (MANETs) – community radio. We argue how MANETS help overcome important limitations in how community radio is currently operationalized. We identify critical design elements for a MANET based community radio service and propose a broad architecture for the same. We then investigate a most critical issue– the choice of the network wide broadcast protocol for the audio content. We identify desired characteristics of a community radio broadcasting service. We choose and evaluate eight popular broadcasting protocols on these characteristics, to find the protocols most suited for our application.

    A comparison study for two fuzzy-based systems: improving reliability and security of JXTA-overlay P2P platform

    Get PDF
    This is a copy of the author's final draft version of an article published in the journal Soft computing.The reliability of peers is very important for safe communication in peer-to-peer (P2P) systems. The reliability of a peer can be evaluated based on the reputation and interactions with other peers to provide different services. However, for deciding the peer reliability there are needed many parameters, which make the problem NP-hard. In this paper, we present two fuzzy-based systems (called FBRS1 and FBRS2) to improve the reliability of JXTA-overlay P2P platform. In FBRS1, we considered three input parameters: number of interactions (NI), security (S), packet loss (PL) to decide the peer reliability (PR). In FBRS2, we considered four input parameters: NI, S, PL and local score to decide the PR. We compare the proposed systems by computer simulations. Comparing the complexity of FBRS1 and FBRS2, the FBRS2 is more complex than FBRS1. However, it also considers the local score, which makes it more reliable than FBRS1.Peer ReviewedPostprint (author's final draft
    • 

    corecore