17,635 research outputs found

    A Robust Algorithm for the Membership Management of Super-peer Overlay

    Get PDF
    Abstract. Peer-to-Peer technologies have been widely applied for multimedia applications. The super-peer based approach provides an efficient way to run applications by exploring nodes' heterogeneity. In P2P live video streaming, even though the number of stable nodes is small, they have significant impact on the performance of the network. Thus, we present a super-peer-based overlay design, where stable nodes are assigned as super-peers that organize client nodes. A gossip-based super-peer selection algorithm (GSPS) is proposed to identify the stable nodes to be chosen as super-peers and to manage the client nodes (namely the membership management). The basic idea of the GSPS is: first, a set of super-peer candidates for a node is built based on the gossip, then the role of this node is identified and the corresponding operations are executed. Simulation results show that the GSPS is efficient in managing the super-peer overlay and robust to the failure of super-peers. Keywords: Peer-to-Peer, super-peer, gossip, robustness. Introduction The peer-to-peer (P2P) paradigm provides an effective approach to construct largescale systems with high robustness, mainly due to their inherent decentralization and redundant structures In these research studies, Random walk and Graph theory are utilized for the construction of the overlay. For the management of the overlay, the diameter, and the degree are two important qualities to consider. The super-peer-based overlay (such as Gnutell

    On The Feasibility Of Centrally-Coordinated Peer-To-Peer Live Streaming

    Get PDF
    In this paper we present an exploration of central coordination as a way of managing P2P live streaming overlays. The main point is to show the elements needed to construct a system with that approach. A key element in the feasibility of this approach is a near real-time optimization engine for peer selection. Peer organization in a way that enables high bandwidth utilization plus optimized peer selection based on multiple utility factors make it possible to achieve large source bandwidth savings and provide high quality of user experience. The benefits of our approach are also seen most when NAT constraints come into play

    Taxonomy of P2P Applications

    Get PDF
    Peer-to-peer (p2p) networks have gained immense popularity in recent years and the number of services they provide continuously rises. Where p2p-networks were formerly known as file-sharing networks, p2p is now also used for services like VoIP and IPTV. With so many different p2p applications and services the need for a taxonomy framework rises. This paper describes the available p2p applications grouped by the services they provide. A taxonomy framework is proposed to classify old and recent p2p applications based on their characteristics

    Practical service placement approach for microservices architecture

    Get PDF
    Community networks (CNs) have gained momentum in the last few years with the increasing number of spontaneously deployed WiFi hotspots and home networks. These networks, owned and managed by volunteers, offer various services to their members and to the public. To reduce the complexity of service deployment, community micro-clouds have recently emerged as a promising enabler for the delivery of cloud services to community users. By putting services closer to consumers, micro-clouds pursue not only a better service performance, but also a low entry barrier for the deployment of mainstream Internet services within the CN. Unfortunately, the provisioning of the services is not so simple. Due to the large and irregular topology, high software and hardware diversity of CNs, it requires of aPeer ReviewedPostprint (author's final draft
    • …
    corecore