Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Prithula Dhungel

dblp:77/8072 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 3 first-authorSystems, architecture and hardware · 2Security and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network measurement and analytics · 87% Content delivery and video streaming · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics › internet measurement
peer-to-peer network measurement
0.222011
Unraveling the BitTorrent Ecosystem · IEEE Trans. Parallel Distributed Syst. 2011
BitTorrent Darknets · INFOCOM 2010
Network measurement and analytics
traffic measurement
0.112010
BitTorrent Darknets · INFOCOM 2010
Distributed systems › peer-to-peer systems › file sharing
bittorrent
0.112010
BitTorrent Darknets · INFOCOM 2010
Distributed systems
peer-to-peer systems
0.112010
BitTorrent Darknets · INFOCOM 2010
Content delivery and video streaming
peer-to-peer content distribution
0.012011
Unraveling the BitTorrent Ecosystem · IEEE Trans. Parallel Distributed Syst. 2011
Content delivery and video streaming › peer-to-peer file sharing
file sharing
0.012010
BitTorrent Darknets · INFOCOM 2010

Methods — techniques the papers use, named apart from their topics

measurement study · 0.2macroscopic analysis · 0.2measurement analysis · 0.1crawling · 0.1
YearPublicationVenuePosition
2012 Xunlei: Peer-Assisted Download Acceleration on a Massive Scale
Prithula Dhungel, Keith W. Ross, Moritz Steiner, Ye Tian 0004, Xiaojun Hei
PAM1
2011 A Measurement Study of Attacks on BitTorrent Seeds
abstract
We study a natural and potentially devastating attack against BitTorrent, namely, attacking the initial seed in a torrent's early stages. The goal of this attack is to diminish the seed's ability to upload blocks. If the attacker can discover and react quickly enough to the new torrent, it can possibly "nip the torrent in its bud," preventing all of the leechers from obtaining the entire file. We consider two natural seed attacks: the bandwidth attack and the connection attack. We take a three-prong approach to analyze these attacks. First, we actually launch and measure the attacks using popular BitTorrent seeds (Azureus, uTorrent, and BitTornado). To this end, because we do not want to interfere with torrents in the wild, we have created our own private torrents within PlanetLab. Second, to gain insight into our empirical results, we carefully analyze the connection management and seeding algorithms in open-source BitTorrent seeds. Third, we construct a simple fluid model which provides additional insights into the empirical results. We have discovered that the three BitTorrent seeds investigated are quite resilient to such an attack. The observations and conclusions in this paper can help P2P developers design highly-resilient P2P systems.
Prithula Dhungel, Xiaojun Hei, Di Wu 0001, Keith W. Ross
ICC1
2011 Unraveling the BitTorrent Ecosystem
abstract
BitTorrent is the most successful open Internet application for content distribution. Despite its importance, both in terms of its footprint in the Internet and the influence it has on emerging P2P applications, the BitTorrent Ecosystem is only partially understood. We seek to provide a nearly complete picture of the entire public BitTorrent Ecosystem. To this end, we crawl five of the most popular torrent-discovery sites over a ine-month period, identifying all of 4.6 million and 38,996 trackers that the sites reference. We also develop a high-performance tracker crawler, and over a narrow window of 12 hours, crawl essentially all of the public Ecosystem's trackers, obtaining peer lists for all referenced torrents. Complementing the torrent-discovery site and tracker crawling, we further crawl Azureus and Mainline DHTs for a random sample of torrents. Our resulting measurement data are more than an order of magnitude larger (in terms of number of torrents, trackers, or peers) than any earlier study. Using this extensive data set, we study in-depth the Ecosystem's torrent-discovery, tracker, peer, user behavior, and content landscapes. For peer statistics, the analysis is based on one typical snapshot obtained over 12 hours. We further analyze the fragility of the Ecosystem upon the removal of its most important tracker service.
Prithula Dhungel, Di Wu 0001, Keith W. Ross
IEEE Trans. Parallel Distributed Syst.2
2010 Understanding and Improving Ratio Incentives in Private Communities
abstract
Incentive mechanisms play a critical role in P2P systems. Private BitTorrent sites use a novel incentive paradigm, where the sites record upload and download amounts of users and require each user to maintain its upload-to-download ratio above a specified threshold. This paper explores in-depth incentives in private P2P file-sharing systems. Our contributions are threefold. We first conduct a measurement study on a representative private BitTorrent site, examining how incentives influence user behavior. Our measurement study shows that, as compared with public torrents, a private BitTorrent site provides more incentive for users to contribute and seed. Second, we develop a game theoretic model and analytically show that the ratio mechanism indeed provides effective incentives. But existing ratio incentives in private BitTorrent sites are vulnerable to collusions. Third, to prevent collusion, we propose an upload entropy scheme, and show through analysis and experiment that the entropy scheme successfully limits colluding, while rarely affecting normal users who do not collude.
Zhengye Liu, Prithula Dhungel, Di Wu 0001, Keith W. Ross
ICDCS2
2010 BitTorrent Darknets
abstract
A private BitTorrent site (also known as a "Bit Torrent darknet") is a collection of torrents that can only be accessed by members of the darknet community. The private BitTorrent sites also have incentive policies which encourage users to continue to seed files after completing downloading. Although there are at least 800 independent BitTorrent darknets in the Internet, they have received little attention in the research community to date. We examine BitTorrent darknets from macroscopic, medium-scopic and microscopic perspectives. For the macroscopic analysis, we consider 800+ private sites to obtain a broad picture of the darknet landscape, and obtain a rough estimate of the total number of files, accounts, and simultaneous peers within the entire darknet landscape. Although the size of each private site is relatively small, we find the aggregate size of the darknet landscape to be surprisingly large. For the medium-scopic analysis, we investigate content overlap between four private sites and the public BitTorrent ecosystem. For the microscopic analysis, we explore in-depth one private site and examine its user behavior. We observe that the seed-to-leecher ratios and upload-to-download ratios are much higher than in the public ecosystem. The macroscopic, medium-scopic and microscopic analyses when combined provide a vivid picture of the darknet landscape, and provide insight into how the darknet landscape differs from the public BitTorrent ecosystem.
Prithula Dhungel, Di Wu 0001, Zhengye Liu, Keith W. Ross
INFOCOM2
2010 Waiting for Anonymity: Understanding Delays in the Tor Overlay
abstract
Although Tor is the most widely used overlay for providing anonymity services, its users often experience very high delays. Because much of Tor usage is for Web applications, which are sensitive to latency, it is critical to reduce delays in Tor. To take an important step in this direction, we seek an in-depth understanding of delays in Tor. By taking snapshots of the entire Tor network within a short time window, we are able to study the delay distribution of the entire router population. We also monitor delays introduced by individual Tor routers over extended periods of time. Our results indicate that apart from delays introduced by routers, overlay network latency also plays a significant role in delays in Tor. We have also observed that at any time, there exist huge differences in the delays introduced by different routers. Our results reveal key performance characteristics of Tor system behavior and provide valuable insights for improving the Tor performance.
Prithula Dhungel, Moritz Steiner, Ivinko Rimac, Volker Hilt, Keith W. Ross
Peer-to-Peer Computing1
2010 Understanding Peer Exchange in BitTorrent Systems
abstract
Peer Exchange (PEX), in which peers directly exchange with each other lists of active peers in the torrent, has been widely implemented in modern BitTorrent clients for decentralized peer discovery. However, there is little knowledge about the behavior of PEX in operational systems. In this paper, we perform both passive measurements and Planetlab experiments to study the impact and properties of BitTorrent PEX. We first study the impact of PEX on the download efficiency of BitTorrent. We observe that PEX can significantly reduce the download time for some torrents. We then analyze the freshness, redundancy and spread speed of PEX messages. Finally, we also conduct large- scale Planetlab experiments to understand the impact of PEX on the overlay properties of BitTorrent.
Di Wu 0001, Prithula Dhungel, Xiaojun Hei, Keith W. Ross
Peer-to-Peer Computing2
2010 On the Privacy of Peer-Assisted Distribution of Security Patches
abstract
When a host discovers that it has a software vulnerability that is susceptible to an attack, the host needs to obtain and install a patch. Because centralized distribution of patches may not scale well, peer-to-peer (P2P) approaches have recently been suggested. There is, however, a serious privacy problem with peer-assisted patch distribution: when a peer A requests a patch from another peer B, it announces to B its vulnerability, which B can exploit instead of providing the patch. Through analytical modeling and simulation, we show that a large majority of vulnerable hosts will typically become compromised with a basic design for peer- assisted patch distribution. We then study the effectiveness of two different approaches in countering this privacy problem. The first approach utilizes special-purpose peer nodes, referred to as honeypots, that discover and blacklist malicious peers listening for patch requests from susceptible hosts. In the second approach, the patches are requested through an anonymizing network, hiding the identities of susceptible hosts from malicious peers. Using analytical models and simulation, we show that, honeypots do not completely solve the privacy problem; in contrast, an anonymizing network turns out to be more suitable for security patch distribution.
Di Wu 0001, Cong Tang, Prithula Dhungel, Nitesh Saxena, Keith W. Ross
Peer-to-Peer Computing3
2009 Measurement and mitigation of BitTorrent leecher attacks
Prithula Dhungel, Di Wu 0001, Keith W. Ross
Comput. Commun.1