341,232 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

    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

    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

    A Many-Core Overlay for High-Performance Embedded Computing on FPGAs

    Get PDF
    In this work, we propose a configurable many-core overlay for high-performance embedded computing. The size of internal memory, supported operations and number of ports can be configured independently for each core of the overlay. The overlay was evaluated with matrix multiplication, LU decomposition and Fast-Fourier Transform (FFT) on a ZYNQ-7020 FPGA platform. The results show that using a system-level many-core overlay avoids complex hardware design and still provides good performance results.Comment: Presented at First International Workshop on FPGAs for Software Programmers (FSP 2014) (arXiv:1408.4423

    Converging an Overlay Network to a Gradient Topology

    Get PDF
    In this paper, we investigate the topology convergence problem for the gossip-based Gradient overlay network. In an overlay network where each node has a local utility value, a Gradient overlay network is characterized by the properties that each node has a set of neighbors with the same utility value (a similar view) and a set of neighbors containing higher utility values (gradient neighbor set), such that paths of increasing utilities emerge in the network topology. The Gradient overlay network is built using gossiping and a preference function that samples from nodes using a uniform random peer sampling service. We analyze it using tools from matrix analysis, and we prove both the necessary and sufficient conditions for convergence to a complete gradient structure, as well as estimating the convergence time and providing bounds on worst-case convergence time. Finally, we show in simulations the potential of the Gradient overlay, by building a more efficient live-streaming peer-to-peer (P2P) system than one built using uniform random peer sampling.Comment: Submitted to 50th IEEE Conference on Decision and Control (CDC 2011
    corecore