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

Asad Awan

dblp:72/1221 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 first-authorComputer networks · 2

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 · 67% Internet of things and sensor networks · 26% Network measurement and analytics · 7%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming
quality of experience
0.112011
Understanding the impact of video quality on user engagement · SIGCOMM 2011
Content delivery and video streaming › quality of experience
video quality
0.112011
Understanding the impact of video quality on user engagement · SIGCOMM 2011
Internet of things and sensor networks › wireless sensor network › sensor network programming
macroprogramming
0.112007
Macroprogramming heterogeneous sensor networks using cosmos · EuroSys 2007
Internet of things and sensor networks
wireless sensor network
0.112007
Macroprogramming heterogeneous sensor networks using cosmos · EuroSys 2007
Embedded and real-time systems › embedded software › embedded operating systems
sensor node operating system
0.112007
Macroprogramming heterogeneous sensor networks using cosmos · EuroSys 2007
Programming languages and type systems
domain-specific languages
0.012007
Macroprogramming heterogeneous sensor networks using cosmos · EuroSys 2007

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

statistical analysis · 0.1
YearPublicationVenuePosition
2011 Understanding the impact of video quality on user engagement
abstract
As the distribution of the video over the Internet becomes main- stream and its consumption moves from the computer to the TV screen, user expectation for high quality is constantly increasing. In this context, it is crucial for content providers to understand if and how video quality affects user engagement and how to best invest their resources to optimize video quality. This paper is a first step towards addressing these questions. We use a unique dataset that spans different content types, including short video on demand (VoD), long VoD, and live content from popular video con- tent providers. Using client-side instrumentation, we measure quality metrics such as the join time, buffering ratio, average bitrate, rendering quality, and rate of buffering events.
Florin Dobrian, Vyas Sekar, Asad Awan, Ion Stoica, Dilip Antony Joseph, Aditya Ganjam, Jibin Zhan, Hui Zhang 0001
SIGCOMM3
2008 Scalable Data Collection in Sensor Networks
Asad Awan, Suresh Jagannathan, Ananth Grama
HiPC1
2007 Macroprogramming heterogeneous sensor networks using cosmos
abstract
In this paper, we present COSMOS, a novel architecture for macroprogramming heterogeneous sensor network systems. Macroprogramming specifies aggregate system behavior, as opposed to device-specific programs that code distributed behavior using explicit messaging. COSMOS is comprised of a macroprogramming language, mPL, and an operating system, mOS. mPL macroprograms are statically verifiable compositions of reusable user-specified, or system supported functional components. The mOS node/network operating system provides component management and a lean execution environment for mPL programs in heterogeneous resource-constrained sensor networks. It provides runtime application instantiation, with over-the-air reprogramming of the network. COSMOS facilitates composition of complex real-world applications that are robust, scalable and adaptive in dynamic data-driven sensor network environments. An important and novel aspect of COSMOS is the ability to easily extend its component basis library to add rich macroprogramming abstractions to mPL, tailored to domain and resource constraints, without modifications to the OS. Applications built on COSMOS are currently in use at the Bowen Labs for Structural Engineering, in Purdue University, for high-fidelity structural monitoring. We present a detailed description of the COSMOS architecture, its various components, and a comprehensive experimental evaluation using macro- and micro- benchmarks to demonstrate performance characteristics of COSMOS.
Asad Awan, Suresh Jagannathan, Ananth Grama
EuroSys1
2006 Unstructured peer-to-peer networks for sharing processor cycles
Asad Awan, Ronaldo A. Ferreira, Suresh Jagannathan, Ananth Grama
Parallel Comput.1
2005 Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
abstract
Search is a fundamental service in peer-to-peer (P2P) networks. However, despite numerous research efforts, efficient algorithms for guaranteed location of shared content in unstructured P2P networks are yet to be devised. In this paper, the authors presented a simple but highly effective protocol for object location that gives probabilistic guarantees of finding even rare objects independently of the network topology. The protocol relies on randomized techniques for replication of objects (or their references) and for query propagation. The authors proved analytically, and demonstrated experimentally, that this scheme provides high probabilistic guarantees of success, while incurring minimal overhead. The performance of this scheme was quantified in terms of network messages, probability of success, and response time. The robustness of this protocol was also evaluated in the presence of node failures (departures). Using simulation, it is shown that this scheme performs no worse than the best known access-frequency based protocols, without compromising access to rare objects.
Ronaldo A. Ferreira, Murali Krishna Ramanathan, Asad Awan, Ananth Grama, Suresh Jagannathan
Peer-to-Peer Computing3