272,234 research outputs found

    Overlay journals, repositories and the evolution of scholarly communication

    Get PDF
    This paper examines the part overlay journals can play in developing new roles for repositories in the scholarly communication process. This requires that we answer some outstanding questions about the overlay journal model: · How are overlay journals distinct from other overlay services and other journals? · What business models are applicable? · What opportunities do overlay journals offer to repositories? And, perhaps most importantly: · What value can an overlay journal bring to the process of scholarly communication? As a result of the answer to the first of these questions, this paper gives a definition of an overlay journal as an entity that performs all the activities of a scholarly journal and relies on structural links with one or more archives or repositories to perform its activities. It finds that the overlay journals that already exist use a variety of business models, which means that repositories can engage with overlay journals in many different ways. Research and practice show that overlay journals offer new possibilities for publishers, repositories, authors and readers alike, and as such have a great deal to offer to scholarly communication

    End-to-end QoE optimization through overlay network deployment

    Get PDF
    In this paper an overlay network for end-to-end QoE management is presented. The goal of this infrastructure is QoE optimization by routing around failures in the IP network and optimizing the bandwidth usage on the last mile to the client. The overlay network consists of components that are located both in the core and at the edge of the network. A number of overlay servers perform end-to-end QoS monitoring and maintain an overlay topology, allowing them to route around link failures and congestion. Overlay access components situated at the edge of the network are responsible for determining whether packets are sent to the overlay network, while proxy components manage the bandwidth on the last mile. This paper gives a detailed overview of the end-to-end architecture together with representative experimental results which comprehensively demonstrate the overlay network's ability to optimize the QoE

    Understanding the Properties of the BitTorrent Overlay

    Get PDF
    In this paper, we conduct extensive simulations to understand the properties of the overlay generated by BitTorrent. We start by analyzing how the overlay properties impact the efficiency of BitTorrent. We focus on the average peer set size (i.e., average number of neighbors), the time for a peer to reach its maximum peer set size, and the diameter of the overlay. In particular, we show that the later a peer arrives in a torrent, the longer it takes to reach its maximum peer set size. Then, we evaluate the impact of the maximum peer set size, the maximum number of outgoing connections per peer, and the number of NATed peers on the overlay properties. We show that BitTorrent generates a robust overlay, but that this overlay is not a random graph. In particular, the connectivity of a peer to its neighbors depends on its arriving order in the torrent. We also show that a large number of NATed peers significantly compromise the robustness of the overlay to attacks. Finally, we evaluate the impact of peer exchange on the overlay properties, and we show that it generates a chain-like overlay with a large diameter, which will adversely impact the efficiency of large torrents

    An introduction to overlay journals

    Get PDF
    An overlay journal performs all the activities of a scholarly journal and relies on structural links with one or more archives or repositories to perform its activities. This paper offers a briefing on the contribution overlay journals can make to scholarly communication. It explains what ‘overlay’ services are, how overlay journals have evolved and what makes their contribution to scholarly communication so valuable

    Avatar: A Time- and Space-Efficient Self-Stabilizing Overlay Network

    Full text link
    Overlay networks present an interesting challenge for fault-tolerant computing. Many overlay networks operate in dynamic environments (e.g. the Internet), where faults are frequent and widespread, and the number of processes in a system may be quite large. Recently, self-stabilizing overlay networks have been presented as a method for managing this complexity. \emph{Self-stabilizing overlay networks} promise that, starting from any weakly-connected configuration, a correct overlay network will eventually be built. To date, this guarantee has come at a cost: nodes may either have high degree during the algorithm's execution, or the algorithm may take a long time to reach a legal configuration. In this paper, we present the first self-stabilizing overlay network algorithm that does not incur this penalty. Specifically, we (i) present a new locally-checkable overlay network based upon a binary search tree, and (ii) provide a randomized algorithm for self-stabilization that terminates in an expected polylogarithmic number of rounds \emph{and} increases a node's degree by only a polylogarithmic factor in expectation
    • …
    corecore