arXiv subjects

Rashmi Kushwaha

Publications and source records attributed to Rashmi Kushwaha.

3 recordsLinked to original sources

arXiv2024

ReputeStream: Mitigating Free-Riding through Reputation-Based Multi-Layer P2P Live Streaming

This paper presents a novel algorithm for peer-to-peer (P2P) live streaming that addresses the limitations of single-layer systems through a multi-layered approach. The proposed solution adapts to diverse user capabilities and bandwidth conditions while tackling common P2P challenges such as free-riding, malicious behavior, churn, and flash crowds. By implementing a reputation-based system, the algorithm promotes fair resource sharing and active participation. The algorithm also incorporates a request-to-join mechanism to effectively manage flash crowds. In addition, a dynamic reputation system improves network efficiency by strategically positioning high-reputation peers closer to video sources or other significant contributors.

cs.NI↗

arXiv2024

Reputation-Driven Peer-to-Peer Live Streaming Architecture for Preventing Free-Riding

We present a peer-to-peer (P2P) live-streaming architecture designed to address challenges such as free-riding, malicious peers, churn, and network instability through the integration of a reputation system. The proposed algorithm incentivizes active peer participation while discouraging opportunistic behaviors, with a reputation mechanism that rewards altruistic peers and penalizes free riders and malicious actors. To manage peer dynamics, the algorithm continuously updates the strategies and adjusts to changing neighbors. It also implements a request-to-join mechanism for flash crowd scenarios, allowing the source node to delegate requests to child nodes, forming an interconnected tree structure that efficiently handles high demand and maintains system stability. The decentralized reputation mechanism promotes long-term sustainability in the P2P live streaming system.

cs.NI↗

arXiv2024

Generalized Distance Metric for Various DHT Routing Algorithms in Peer-to-Peer Networks

We present a generalized distance metric that can be used to implement routing strategies and identify routing table entries to reach the root node for a given key, in a DHT (Distributed Hash Table) network based on either Chord, Kademlia, Tapestry, or Pastry. The generalization shows that all the above four DHT algorithms are in fact, the same algorithm but with different parameters in distance representation. We also proposes that nodes can have routing tables of varying sizes based on their memory capabilities but with the fact that each node must have at least two entries, one for the node closest from it, and the other for the node from whom it is closest in each ring components for all the algorithms. Messages will always reach the correct root nodes by following the above rule. We also further observe that in any network, if the distance metric to define the root node in the DHT is same at all the nodes, then the root node for a key will also be the same, irrespective of the size of the routing table at different nodes.

cs.NI↗