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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Siddhartha Annapureddy

dblp:50/2151 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2007
—ORCID · none

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

Computer networks · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
Content delivery and video streaming · 82% Internet architecture and protocols · 14% Network optimization and economics · 4%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 56% Memory systems · 44%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
video-on-demand
0.122007
Is high-quality vod feasible using P2P swarming? · WWW 2007
Exploring VoD in P2P Swarming Systems · INFOCOM 2007
Content delivery and video streaming › peer-to-peer streaming
mesh-based streaming
0.112007
Is high-quality vod feasible using P2P swarming? · WWW 2007
Internet architecture and protocols
network coding
0.112007
Exploring VoD in P2P Swarming Systems · INFOCOM 2007
Content delivery and video streaming › peer-to-peer streaming
peer-to-peer live streaming
0.112007
Exploring VoD in P2P Swarming Systems · INFOCOM 2007
Content delivery and video streaming › video-on-demand
peer-to-peer video-on-demand
0.112007
Is high-quality vod feasible using P2P swarming? · WWW 2007
Content delivery and video streaming
quality of experience
0.112007
Is high-quality vod feasible using P2P swarming? · WWW 2007
Memory systems › cache management › storage caching
cooperative caching
0.112005
Shark: Scaling File Servers via Cooperative Caching · NSDI 2005
Storage systems
file systems
0.112005
Shark: Scaling File Servers via Cooperative Caching · NSDI 2005
Network optimization and economics
resource allocation
0.012007
Is high-quality vod feasible using P2P swarming? · WWW 2007
Storage systems › file systems › distributed file system
file server scaling
0.012005
Shark: Scaling File Servers via Cooperative Caching · NSDI 2005

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

simulation · 0.1prototype implementation · 0.1overlay topology management · 0.1network coding · 0.1
YearPublicationVenuePosition
2007 Exploring VoD in P2P Swarming Systems
abstract
Digital media companies have recently started embracing P2P networks as an alternative distribution mechanism. However, with current P2P swarming systems users need to download the full video, and hence have to wait a long time before they can start watching it. While a lot of effort has gone into optimizing the distribution of large files, little research has been done on enabling Video-on-Demand (VoD) functionality with P2P swarming systems. The main challenges reside in ensuring that users can start watching a movie at any point in time, with small start-up times and sustainable playback rates. In this work, we address the issues of providing VoD using P2P mesh-based networks. We investigate scheduling techniques, and network coding in particular. Using both simulations and a prototype implementation, we show that high-quality VoD is feasible, and give guidelines to build play-as-you-download P2P swarming systems with high playback rates and low start-up delays.
Siddhartha Annapureddy, Saikat Guha 0002, Christos Gkantsidis, Dinan Gunawardena, Pablo Rodriguez 0001
INFOCOM1
2007 Is high-quality vod feasible using P2P swarming?
abstract
Peer-to-peer technologies are increasingly becoming the medium of choice for delivering media content, both professional and homegrown, to large user populations. Indeed, current P2P swarming systems have been shown to be very efficient for large-scale content distribution with few server resources. However, such systems have been designed for generic file distribution and provide a limited user experience for viewing media content. For example, users need to wait to download the full video before they can start watching it. In general, the main challenge resides in designing systems that ensure that users can start watching a movie at any point in time, with small start-up times and sustainable playback rates. In this work, we address the issues of providing a Video-on-Demand (VoD) using P2P mesh-based networks. We show that providing high quality VoD using P2P is feasible using a combination of techniques including (a) network coding, (b) optimized resource allocation across different parts of the video, and (c) overlay topology management algorithms. Our evaluation also shows that systems that do not optimize in all these dimensions could significantly under-utilize the network resources resulting in poor VoD performance. We present our results based on simulations and a prototype implementation. Categories and Subject Descriptors
Siddhartha Annapureddy, Saikat Guha 0002, Christos Gkantsidis, Dinan Gunawardena, Pablo Rodriguez 0001
WWW1
2005 Shark: Scaling File Servers via Cooperative Caching
Siddhartha Annapureddy, Michael J. Freedman, David Mazières
NSDI1