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

Asfandyar Qureshi

dblp:03/900 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
3 papers
Content delivery and video streaming · 27% Transport protocols and congestion control · 22% Cellular and mobile networks · 19%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Energy-efficient computing · 85% Distributed systems · 15%

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

TopicWeightPapersLastEvidence papers
Energy-efficient computing
datacenter power management
0.112009
Cutting the electric bill for internet-scale systems · SIGCOMM 2009
Transport protocols and congestion control › multipath transport
network striping
0.122006
Horde: separating network striping policy from mechanism · MobiSys 2005
Tavarua: video streaming with WWAN striping · ACM Multimedia 2006
Content delivery and video streaming
wireless video streaming
0.112006
Tavarua: video streaming with WWAN striping · ACM Multimedia 2006
Cellular and mobile networks › mobile networks
WWAN
0.112006
Tavarua: video streaming with WWAN striping · ACM Multimedia 2006
Internet architecture and protocols
inverse multiplexing
0.112005
Horde: separating network striping policy from mechanism · MobiSys 2005
Distributed systems
middleware
0.012005
Horde: separating network striping policy from mechanism · MobiSys 2005

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

simulation · 0.2packet scheduling · 0.1network striping · 0.1middleware · 0.1
YearPublicationVenuePosition
2009 Cutting the electric bill for internet-scale systems
abstract
Energy expenses are becoming an increasingly important fraction of data center operating costs. At the same time, the energy expense per unit of computation can vary significantly between two different locations. In this paper, we characterize the variation due to fluctuating electricity prices and argue that existing distributed systems should be able to exploit this variation for significant economic gains. Electricity prices exhibit both temporal and geographic variation, due to regional demand differences, transmission inefficiencies, and generation diversity. Starting with historical electricity prices, for twenty nine locations in the US, and network traffic data collected on Akamai's CDN, we use simulation to quantify the possible economic gains for a realistic workload. Our results imply that existing systems may be able to save millions of dollars a year in electricity costs, by being cognizant of locational computation cost differences.
Asfandyar Qureshi, Rick Weber, Hari Balakrishnan, John V. Guttag, Bruce M. Maggs
SIGCOMM1
2008 Plugging Into Energy Market Diversity
Asfandyar Qureshi
HotNets1
2006 Tavarua: video streaming with WWAN striping
abstract
Tavarua is a multimedia streaming system that leverages network-striping to deliver relatively high bit rate video over present-day cellular wireless wide-area networks. The Tavarua system achieves this by building on our previously developed flexible network-striping middleware. This paper describes a motivating mobile telemedicine application, and the design of the Tavarua system. It also describes experiments in which our initial Tavarua implementation was used to stripe video over multiple 3G cellular-phones from different providers.
Asfandyar Qureshi, Jennifer N. Carlisle, John V. Guttag
ACM Multimedia1
2005 Horde: separating network striping policy from mechanism
abstract
Inverse multiplexing, or network striping, allows the construction of a high-bandwidth virtual channel from a collection of multiple low-bandwidth network channels. Striping systems usually employ an immutable packet scheduling policy and allow applications to be oblivious of the way in which packets are routed to specific network channels. Though this is appropriate for many applications, other applications can benefit from an approach that explicitly involves the application in the dynamic determination of the striping policy.Horde is middleware that facilitates flexible striping in wireless environments for a diverse range of applications. Horde separates the striping policy from routing and scheduling. It allows applications to specify network quality-of-service objectives that the striping mechanism attempts to satisfy. Horde can be used by a set of application data streams, each with its own quality-of-service policy, to flexibly stripe data over a highly heterogeneous set of dynamically varying wireless network channels.We present the Horde architecture, describe an early implementation, and examine how different policies can be used to modulate the quality-of-service observed across different independent data streams.
Asfandyar Qureshi, John V. Guttag
MobiSys1