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

Amol Nayate

dblp:44/6472 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none

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

Computer networks · 3Databases, data management, data science and information retrieval · 3Applied, interdisciplinary, general and emerging computing · 2Software engineering, systems software and programming languages · 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 architecture, parallel and distributed computing, and storage systems
5 papers
Distributed systems · 70% Storage systems · 23% Cloud and datacenter computing · 6%
Computer networks
1 paper
Network measurement and analytics · 77% Content delivery and video streaming · 23%

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

TopicWeightPapersLastEvidence papers
Distributed systems › replication
data replication
0.122005
Improving Availability and Performance with Application-Specific Data Replication · IEEE Trans. Knowl. Data Eng. 2005
Application specific data replication for edge services · WWW 2003
Distributed systems
edge computing
0.122005
Improving Availability and Performance with Application-Specific Data Replication · IEEE Trans. Knowl. Data Eng. 2005
Application specific data replication for edge services · WWW 2003
Storage systems
distributed storage
0.112009
PADS: A Policy Architecture for Distributed Storage Systems · NSDI 2009
Distributed systems
replication
0.112006
PRACTI Replication · NSDI 2006
Distributed systems
consistency models
0.012003
Application specific data replication for edge services · WWW 2003
Distributed systems › distributed system architecture › distributed operating systems
disconnected operation
0.012001
Resource management for scalable disconnected access to Web services · WWW 2001
Cloud and datacenter computing
resource management
0.012001
Resource management for scalable disconnected access to Web services · WWW 2001
Storage systems › data redundancy
replicated storage
0.012006
PRACTI Replication · NSDI 2006
Distributed systems
distributed object systems
0.012005
Improving Availability and Performance with Application-Specific Data Replication · IEEE Trans. Knowl. Data Eng. 2005
Content delivery and video streaming
prefetching and caching
0.012003
End-to-end WAN service availability · IEEE/ACM Trans. Netw. 2003
Network security › attack strategy
denial-of-service attack
0.012001
Resource management for scalable disconnected access to Web services · WWW 2001

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

distributed object architecture · 0.1resource isolation · 0.1automatic allocation · 0.1relaxed consistency models · 0.1trace-based simulation · 0.0connectivity traces · 0.0application-specific replication · 0.0
YearPublicationVenuePosition
2009 PADS: A Policy Architecture for Distributed Storage Systems
Nalini Moti Belaramani, Jiandan Zheng, Amol Nayate, Robert Soulé, Michael Dahlin, Robert Grimm 0001
NSDI3
2006 PRACTI Replication
Nalini Moti Belaramani, Michael Dahlin, Amol Nayate, Arun Venkataramani, Praveen Yalagandula, Jiandan Zheng
NSDI4
2005 Improving Availability and Performance with Application-Specific Data Replication
abstract
The emerging edge services architecture promises to improve the availability and performance of Web services by replicating servers at geographically distributed sites. A key challenge in such systems is data replication and consistency, so that edge server code can manipulate shared data without suffering the availability and performance penalties that would be incurred by accessing a traditional centralized database. This work explores using a distributed object architecture to build an edge service data replication system for an e-commerce application, the TPC-W benchmark, which simulates an online bookstore. We take advantage of application-specific semantics to design distributed objects that each manages a specific subset of shared information using simple and effective consistency models. Our experimental results show that by slightly relaxing consistency within individual distributed objects, our application realizes both high availability and excellent performance. For example, in one experiment, we find that our object-based edge server system provides five times better response time over a traditional centralized cluster architecture and a factor of nine improvement over an edge service system that distributes code but retains a centralized database.
Michael Dahlin, Amol Nayate, Jiandan Zheng, Arun Iyengar
IEEE Trans. Knowl. Data Eng.3
2004 Transparent Information Dissemination
Amol Nayate, Michael Dahlin, Arun Iyengar
Middleware1
2003 Application specific data replication for edge services
abstract
The emerging edge services architecture promises to improve the availability and performance of web services by replicating servers at geographically distributed sites. A key challenge in such systems is data replication and consistency so that edge server code can manipulate shared data without incurring the availability and performance penalties that would be incurred by accessing a traditional centralized database. This paper explores using a distributed object architecture to build an edge service system for an e-commerce application, an online bookstore represented by the TPC-W benchmark. We take advantage of application specific semantics to design distributed objects to manage a specific subset of shared information using simple and effective consistency models. Our experimental results show that by slightly relaxing consistency within individual distributed objects, we can build an edge service system that is highly available and efficient. For example, in one experiment we find that our object-based edge server system provides a factor of five improvement in response time over a traditional centralized cluster architecture and a factor of nine improvement over an edge service system that distributes code but retains a centralized database.
Michael Dahlin, Amol Nayate, Jiandan Zheng, Arun Iyengar
WWW3
2003 End-to-end WAN service availability
abstract
This paper seeks to understand how network failures affect the availability of service delivery across wide-area networks (WANs) and to evaluate classes of techniques for improving end-to-end service availability. Using several large-scale connectivity traces, we develop a model of network unavailability that includes key parameters such as failure location and failure duration. We then use trace-based simulation to evaluate several classes of techniques for coping with network unavailability. We find that caching alone is seldom effective at insulating services from failures but that the combination of mobile extension code and prefetching can improve average unavailability by as much as an order of magnitude for classes of service whose semantics support disconnected operation. We find that routing-based techniques may provide significant improvements but that the improvements of many individual techniques are limited because they do not address all significant categories of network failures. By combining the techniques we examine, some systems may be able to reduce average unavailability by as much as one or two orders of magnitude.
Michael Dahlin, Bharat Chandra, Amol Nayate
IEEE/ACM Trans. Netw.4
2001 Resource management for scalable disconnected access to Web services
abstract
Disconnected operation, in which a client accesses a service without relying on network connectivity, is crucial for improving availability, supporting mobility, and providing responsive performance. Because manyweb services are not cachable, disconnected access to web services may require mobile service code to execute in client caches. Unfortunately, (a) this code is untrusted, (b) this code mayhave nearly limitless resource demands due to prefetching, and (c) a large number of competing code modules must coexist. Thus, resource managementisakey problem both for preventing denial of service attacks and for providing good performance across many services. This paper addresses the feasibility of meeting the resource management needs of an environment where service code is shipped to clients, proxies, or content distribution intermediaries. It rst examines the requirements of such a system and then develops a resource-management strategy to meet these requirements by (a) providing isolation across services to prevent denial of service attacks, (b) automatically providing appropriate allocations to dierent services to provide good global performance, and (c) requiring no hand tuning across a wide range of system congurations and workloads. 1.
Bharat Chandra, Michael Dahlin, Amjad-Ali Khoja, Amol Nayate, Asim Razzaq, Anil Sewani
WWW5