| 1. |
- Chatzidrossos, Ilias, 1981-, et al.
(författare)
-
Delay and playout probability trade-off in mesh-based peer-to-peer streaming with delayed buffer map updates
- 2009
-
Ingår i: Peer-to-Peer Networking and Applications. - : Springer Science and Business Media LLC. - 1936-6442 .- 1936-6450. ; 3:3, s. 208-221
-
Tidskriftsartikel (refereegranskat)abstract
- In mesh-based peer-to-peer streaming systemsdata is distributed among the peers according tolocal scheduling decisions. The local decisions affecthow packets get distributed in the mesh, the probabilityof duplicates and consequently, the probabilityof timely data delivery. In this paper we proposean analytic framework that allows the evaluation ofscheduling algorithms. We consider four solutions inwhich scheduling is performed at the forwarding peer,based on the knowledge of the playout buffer contentat the neighbors. We evaluate the effectiveness of thesolutions in terms of the probability that a peer can playout a packet versus the playback delay, the sensitivityof the solutions to the accuracy of the knowledge of theneighbors’ playout buffer contents, and the scalabilityof the solutions with respect to the size of the overlay.We also show how the model can be used to evaluatethe effects of node arrivals and departures on the overlay’sperformance.
|
|
| 2. |
- Girdzijauskas, Sarunas, 1978-, et al.
(författare)
-
Fuzzynet : Ringless Routing in a Ring-like Structured Overlay
- 2010
-
Ingår i: Peer-to-Peer Networking and Applications. - : Springer Science and Business Media LLC. - 1936-6442 .- 1936-6450. ; 4:3, s. 259-273
-
Tidskriftsartikel (refereegranskat)abstract
- Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guarantees, each node needs to eagerly maintain its immediate neighboring links - the ring invariant. However, the ring maintenance is an expensive task and it may not even be possible to maintain the ring invariant continuously under high churn, particularly as the network size grows. Furthermore, routing anomalies in the network, peers behind firewalls and Network Address Translators (NATs) create non-transitivity effects, which inevitably lead to the violation of the ring invariant. We argue that reliance on the ring structure is a serious impediment for real life deployment and scalability of structured overlays. In this paper we propose an overlay called Fuzzynet, which does not rely on the ring invariant, yet has all the functionalities of structured overlays. Fuzzynet takes the idea of lazy overlay maintenance further by dropping any explicit connectivity and data maintenance requirement, relying merely on the actions performed when new Fuzzynet peers join the network. We show that with sufficient amount of neighbors (O(log N), comparable to traditional structured over-lays), even under high churn, data can be retrieved in Fuzzynet w.h.p. We validate our novel design principles by simulations as well as PlanetLab experiments and compare them with ring based overlays.
|
|
| 3. |
- Gurtov, Andrei, et al.
(författare)
-
Cyclic ranking in single-resource peer-to-peer exchange
- 2018
-
Ingår i: Peer-to-Peer Networking and Applications. - : SPRINGER. - 1936-6442 .- 1936-6450. ; 11:3, s. 632-643
-
Tidskriftsartikel (refereegranskat)abstract
- Peer-to-peer (P2P) sharing systems use incentives for resource exchange to encourage cooperation and ensure fairness. In bilateral strategies, such as BitTorrent Tit-for-Tat or deficit-based FairTorrent, individual decisions of peers utilize direct observations. It may result in low performance and unfair treatment. In this paper, we study a novel exchange strategy that applies Cyclic Ranking (CR). In addition to direct observations, a peer utilizes provision cycles-a shared history of effective exchanges. The PageRank algorithm runs for the locally collected cycles and computes the numerical ranks to estimate the reputation. The CR strategy incrementally augments known incentive-aware strategies. For evaluation we implement CR-BitTorrent and CR-FairTorrent variants. Our simulation model captures the dependence on network bandwidth and the number of seeders as well as selfishness and stability of the participants. The initial experiments show improved fairness and download times, compared to the original BitTorrent and FairTorrent. The performance of selfish and unstable peers decreases by as much as 50%. The CR strategy suits well in environments where direct reciprocity has shown little effect. Contrasted to existing solutions, the CR strategy rewards longevity and stability of peers.
|
|
| 4. |
- Liu, Xingchen, et al.
(författare)
-
A trustworthy and reliable multi-keyword search in blockchain-assisted cloud-edge storage
- 2024
-
Ingår i: Peer-to-Peer Networking and Applications. - : Springer. - 1936-6442 .- 1936-6450. ; 17:2, s. 985-1000
-
Tidskriftsartikel (refereegranskat)abstract
- Edge computing has low transmission delay and unites more agile interconnected devices spread across geographies, which enables cloud-edge storage more suitable for distributed data sharing. This paper proposes a trustworthy and reliable multi-keyword search (TRMS) in blockchain-assisted cloud-edge storage, where data users can choose a faster search based on edge servers or a wider search based on cloud servers. To acquire trustworthy search results and find reliable servers, the blockchain-based smart contract is introduced in our scheme, which will execute the search algorithm and update the score-based trust management model. In this way, search results and trust scores will be published and recorded on the blockchain. By checking search results, data users can judge whether the returned documents are top-k documents. Based on the trust management model, we can punish the malicious behavior of search servers, while data users can choose more reliable servers based on trust scores. To improve efficiency, we design a threshold-based depth-first search algorithm. Extensive experiments are simulated on Hyperledger Fabric v2.4.1, which demonstrate our scheme (with 16 threads) can reduce the time cost of index construction by 92% and the time cost of search by 82%, approximately. Security analysis and extensive experiments can prove the security and efficiency of the proposed scheme.
|
|
| 5. |
- Sacha, Jan, et al.
(författare)
-
Decentralising a service-oriented architecture
- 2010
-
Ingår i: Peer-to-Peer Networking and Applications. - : Springer Science and Business Media LLC. - 1936-6442 .- 1936-6450. ; 3:4, s. 323-350
-
Tidskriftsartikel (refereegranskat)abstract
- Service-oriented computing is becoming an increasingly popular paradigm for modelling and building distributed systems in open and heterogeneous environments. However, proposed service-oriented architectures are typically based on centralised components, such as service registries or service brokers, that introduce reliability, management, and performance issues. This paper describes an approach to fully decentralise a service-oriented architecture using a self-organising peer-to-peer network maintained by service providers and consumers. The design is based on a gradient peer-to-peer topology, which allows the system to replicate a service registry using a limited number of the most stable and best performing peers. The paper evaluates the proposed approach through extensive simulation experiments and shows that the decentralised registry and the underlying peer-to-peer infrastructure scale to a large number of peers and can successfully manage high peer churn rates.
|
|
| 6. |
- Schmidt, Mischa, et al.
(författare)
-
Experiences with large-scale operational trials of ALTO-enhanced P2P filesharing in an intra-ISP scenario
- 2013
-
Ingår i: Peer-to-Peer Networking and Applications. - : Springer Science and Business Media LLC. - 1936-6442 .- 1936-6450. ; 6:2, s. 134-154
-
Tidskriftsartikel (refereegranskat)abstract
- Application Layer Traffic Optimization (ALTO) has recently gained attention in the research and standardisation community as a way for a network operator to guide the peer selection process of distributed applications by providing network layer topology information. In particular P2P applications are expected to gain from ALTO, due to the many connections peers form among each other, often without taking network layer topology information into account. In this paper, we present results of an extensive intra-ISP trial with an ALTO-enhanced P2P filesharing software. In summary, our results show that—depending on the concrete setting and on the distribution of upload capacity in the network—ALTO enables an ISP to save operational costs significantly while not degrading application layer performance noticeably. In addition, based on our experience we are able to give advice to operators on how to save costs with ALTO while not sacrificing application layer performance at all.
|
|
| 7. |
- Shafaat, Tallat M., et al.
(författare)
-
Dealing with network partitions in structured overlay networks
- 2009
-
Ingår i: Peer-to-Peer Networking and Applications. - : Springer Science and Business Media LLC. - 1936-6442 .- 1936-6450. ; 2:4, s. 334-347
-
Tidskriftsartikel (refereegranskat)abstract
- Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. These systems have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this paper, we present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.
|
|
