A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Filters
Toward an understanding of the processing delay of peer-to-peer relay nodes
2008
2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN)
In this work, based on an extensive set of Internet traces, we pursue an understanding of the processing delays incurred at relay nodes and their impact on the application performance. ...
nodes; and 3) we show that, serious VoIP quality degradation may occur due to relay processing, thus we have to monitor the processing delays of a relay node continuously to prevent the application performance ...
In addition, we analyze the sampled processing delays to gain an understanding of the workload pattern of Internet nodes, the effect of packet size on relay processing, and the instability of processing ...
doi:10.1109/dsn.2008.4630111
dblp:conf/dsn/ChenL08
fatcat:iejofbtesfhi7oivmyfpdnsndi
Peer-to-peer live streaming: Optimality results and open problems
2008
2008 42nd Annual Conference on Information Sciences and Systems
nodes: All the results discussed here apply to the case where nodes only relay commodities for which they are receivers. ...
It is again open to determine simple "unstructured schemes" which are rate-and delay-efficient, with or without network coding, under general network topologies and in the presence of relay nodes. ...
doi:10.1109/ciss.2008.4558542
dblp:conf/ciss/Massoulie08
fatcat:dyt627zdqbbjtmdlett3ashapq
Towards Better Understanding of Bitcoin Unreachable Peers
[article]
2017
arXiv
pre-print
The bitcoin peer-to-peer network has drawn significant attention from researchers, but so far has mostly focused on publicly visible portions of the network, i.e., publicly reachable peers. ...
We also empirically evaluate a method that uses timing information to re-identify the peer that created a transaction against unreachable peers. ...
We believe that our work sheds more light into a more hidden part of the Bitcoin network and is a valuable step towards better understanding the Bitcoin ecosystem as a whole. ...
arXiv:1709.06837v1
fatcat:x7v7t6oha5glddbar7wvj5omdi
Triangle Inequality and Routing Policy Violations in the Internet
[chapter]
2009
Lecture Notes in Computer Science
By exposing opportunities to improve the delay between two nodes, TIVs can help myriad applications that seek to minimize end-to-end latency. ...
Triangle inequality violations (TIVs) are the effect of packets between two nodes being routed on the longer direct path between them when a shorter detour path through an intermediary is available. ...
The random selection of one bad triangle per node pair intends to not bias the results toward pathological senders or receivers, or toward the properties of the most severe violations, which might differ ...
doi:10.1007/978-3-642-00975-4_5
fatcat:luar2x3p2rcufl764mtafewxgu
QoS monitoring in real-time streaming overlays based on lock-free data structures
2021
Multimedia tools and applications
Playback continuity is another key aspect in these cases: in presence of peer churning and network congestion, a peer-to-peer overlay should quickly rearrange connections among receiving nodes to avoid ...
AbstractPeer-to-peer streaming is a well-known technology for the large-scale distribution of real-time audio/video contents. ...
relaying of the stream towards each H node. ...
doi:10.1007/s11042-020-10198-9
fatcat:sttn3rjwrrgcvgtnujf6uedt54
Simulation of Hybrid Edge Computing Architectures
[article]
2021
arXiv
pre-print
According to the proposed scheme, participants to the system are employed to relay messages of other devices, so as to reach a destination (usually a server at the edge of the network) even in absence ...
of an Internet connection. ...
This research was also funded in part by the University of Urbino through the "Bit4Food" research project. ...
arXiv:2108.12592v1
fatcat:5x3ydyxczre4pncqdggatncyei
Implications of source routing
2012
Proceedings of the 2012 ACM conference on CoNEXT student workshop - CoNEXT Student '12
Our model of peering consists of ASs leasing dark fiber to an Internet Exchange Point (IXP), and an Ethernet connection to a public peering fabric to send and receive traffic. ...
We model geographical constraints in peering by assigning each node to a set of locations where each location roughly corresponds to an IXP. ...
A relaying service is the forwarding of packets from an ingress channel to an egress channel. Relay prices indicate the amount charged to users for relaying a unit volume (e.g. mbps) of traffic. ...
doi:10.1145/2413247.2413255
dblp:conf/conext/AscigilC12
fatcat:2uwcvxple5bozdplapbbhaaxjy
Calibrating the performance and security of blockchains via information propagation delays
2022
Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing
Despite the importance of information propagation delays in a blockchain's peer-to-peer network, little is known about them. ...
Miners of a blockchain exchange information about blocks and transactions with one another via a peer-to-peer (P2P) network. ...
Furthermore, we thank Marcel Mulder for contributing computational resources to the project. ...
doi:10.1145/3477314.3507003
fatcat:zy3jf3oqanashjccipsumgnc2i
A collaborative P2P scheme for NAT Traversal Server discovery based on topological information
2010
Computer Networks
In fact, only 5% of the communica-tions experience an extra delay that may degrade the QoS due to the use of Relays. Furthermore, the amount of extra transit traffic generated is only 6%. ...
However, the Internet has evolved, and nowadays the largest portion of the traffic is due to peerto-peer (p2p) applications. ...
During the process a large num-ber of servers have to measure the RTT to the client, which constitutes a high probing load. ...
doi:10.1016/j.comnet.2010.03.022
fatcat:bo5hbbia7jcotlmz4kaxc33pjm
Tarzan
2002
Proceedings of the 9th ACM conference on Computer and communications security - CCS '02
Cover traffic prevents a global observer from using traffic analysis to identify an initiator. ...
Protocols toward unbiased peer-selection offer new directions for distributing trust among untrusted entities. ...
Acknowledgments We thank Emil Sit and Josh Cates for significant contribution to the software design and implementation of Tarzan tunnels; David Mazières for helpful discussions regarding security design ...
doi:10.1145/586135.586137
fatcat:mdmxlcbklvdhhiqczcsyt74rsi
Cover traffic prevents a global observer from using traffic analysis to identify an initiator. ...
Protocols toward unbiased peer-selection offer new directions for distributing trust among untrusted entities. ...
Acknowledgments We thank Emil Sit and Josh Cates for significant contribution to the software design and implementation of Tarzan tunnels; David Mazières for helpful discussions regarding security design ...
doi:10.1145/586110.586137
dblp:conf/ccs/FreedmanM02
fatcat:ujugen4eg5fchaqa7lo5qx3wpu
Locality-Awareness in a Peer-to-Peer Publish/Subscribe Network
[chapter]
2012
Lecture Notes in Computer Science
One of the potential problems with peer-to-peer overlays, however, is the inefficient traffic and large delays, due to the mismatch between the physical network and the overlay topology. ...
The ultimate purpose is to avoid communications over long-distance links, instead, nodes send data over short-distance and low-cost links, when possible, while maintaining an acceptable quality of service ...
Simulations are ran with a peer-to-peer network that consists of up to 4000 nodes. ...
doi:10.1007/978-3-642-30823-9_4
fatcat:re3ego3y4verdhvnwi4ksyxdgu
Alibi Routing
2015
Computer communication review
, when upheld, would make it impossible to traverse both the relay and the forbidden regions. ...
Rather, Alibi Routing is able to derive its proofs of avoidance from user-provided GPS coordinates and speed of light propagation delays. ...
We also thank Brendan Rowan for his help in developing an earlier version of the Alibi Routing protocol, and Dave Mount for his helpful guidance on computing target regions. ...
doi:10.1145/2829988.2787509
fatcat:ogro62o5xrd7ldg2tcp6sryrty
Alibi Routing
2015
Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication - SIGCOMM '15
, when upheld, would make it impossible to traverse both the relay and the forbidden regions. ...
Rather, Alibi Routing is able to derive its proofs of avoidance from user-provided GPS coordinates and speed of light propagation delays. ...
We also thank Brendan Rowan for his help in developing an earlier version of the Alibi Routing protocol, and Dave Mount for his helpful guidance on computing target regions. ...
doi:10.1145/2785956.2787509
dblp:conf/sigcomm/LevinLVLLLSB15
fatcat:5ygluzkewfdyjhgbvhxsh7j3x4
NAT Traversal Techniques: A Survey
2020
International Journal of Computer Applications
Its soul purpose has been the effective utilisation of IPv4 public addresses by enabling the sharing of a single (or few) IPv4 address(es) by a large number of nodes within a private network. ...
Unfortunately, it imposes a great obstacle with respect to Peer-to-Peer (P2P) applications. To address this issue, different NAT traversal techniques have been proposed. ...
If both nodes are behind symmetric routers, the relay option is used to traverse the NAT. Fairness is an issue in this case where the relay node has to provide more bandwidth to the firewalled node. ...
doi:10.5120/ijca2020920885
fatcat:ausaxpmfhfaa3fho5boivx7d6a
« Previous
Showing results 1 — 15 out of 5,241 results