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

Andrey Ermolinskiy

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

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

Computer networks · 3 · 1 first-authorSystems, architecture and hardware · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 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
Internet architecture and protocols · 77% Routing and switching · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 50% Distributed systems · 50%

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

TopicWeightPapersLastEvidence papers
Distributed systems
concurrency control
0.112009
Minuet: Rethinking Concurrency Control in Storage Area Networks · FAST 2009
Storage systems › networked storage
storage area network
0.112009
Minuet: Rethinking Concurrency Control in Storage Area Networks · FAST 2009
Internet architecture and protocols › future internet architecture
clean-slate network architecture
0.112007
A data-oriented (and beyond) network architecture · SIGCOMM 2007
Internet architecture and protocols
multicast
0.112006
Revisiting IP multicast · SIGCOMM 2006
Routing and switching
multicast routing
0.112006
Revisiting IP multicast · SIGCOMM 2006
YearPublicationVenuePosition
2009 Minuet: Rethinking Concurrency Control in Storage Area Networks
Andrey Ermolinskiy, Daekyeong Moon, Byung-Gon Chun, Scott Shenker
FAST1
2009 C2Cfs: A Collective Caching Architecture for Distributed File Access
abstract
In this paper we present C2Cfs - a decentralized collective caching architecture for distributed file systems. C2Cfs diverges from the traditional client-server model and advocates decoupling the consistency management role of the central server from the data serving role. Our design enables multiple client-side caches to share data and efficiently propagate updates via direct client-to-client transfers, while maintaining the standard consistency semantics. We present an NFSv4-based implementation of our architecture, which works with unmodified NFS servers and requires no changes to the protocol. Finally, we evaluate the implementation and demonstrate the performance benefits of decentralized data access enabled by our approach.
Andrey Ermolinskiy, Renu Tewari
HPCC1
2008 Reducing Transient Disconnectivity using Anomaly-Cognizant Forwarding
Andrey Ermolinskiy, Scott Shenker
HotNets1
2007 A data-oriented (and beyond) network architecture
abstract
The Internet has evolved greatly from its original incarnation. For instance, the vast majority of current Internet usage is data retrieval and service access, whereas the architecture was designed around host-to-host applications such as telnet and ftp. Moreover, the original Internet was a purely transparent carrier of packets, but now the various network stakeholders use middleboxes to improve security and accelerate applications. To adapt to these changes, we propose the Data-Oriented Network Architecture (DONA), which involves a clean-slate redesign of Internet naming and name resolution.
Teemu Koponen, Mohit Chawla, Byung-Gon Chun, Andrey Ermolinskiy, Kye Hyun Kim, Scott Shenker, Ion Stoica
SIGCOMM4
2006 Revisiting IP multicast
abstract
This paper revisits a much explored topic in networking - the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led to a generally pessimistic view that the complexity of multicast routing-and inter-domain multicast routing in particular - can only be overcome by restricting the service model (as in single-source) multicast. This paper proposes a new approach to implementing IP multicast that we hope leads to a reevaluation of this commonly held view.
Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenker
SIGCOMM2