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

Parveen Patel

dblp:90/506 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2023
—ORCID · conflict

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

Computer networks · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 4 · 2 first-author · 1 since 2021

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
4 papers
Datacenter networks · 48% Routing and switching · 22% Transport protocols and congestion control · 19%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Cloud and datacenter computing · 54% Distributed systems · 46%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cloud storage
0.212016
Realizing the Fault-Tolerance Promise of Cloud Storage Using Locks with Intent · OSDI 2016
Distributed systems
fault tolerance
0.212016
Realizing the Fault-Tolerance Promise of Cloud Storage Using Locks with Intent · OSDI 2016
Cloud and datacenter computing › cloud networking
cloud load balancing
0.212013
Ananta: cloud scale load balancing · SIGCOMM 2013
Datacenter networks › datacenter transport
datacenter congestion control
0.112010
Data center TCP (DCTCP) · SIGCOMM 2010
Datacenter networks › datacenter transport
data center TCP
0.112010
Data center TCP (DCTCP) · SIGCOMM 2010
Datacenter networks
datacenter transport
0.112010
Data center TCP (DCTCP) · SIGCOMM 2010
Transport protocols and congestion control
TCP congestion control
0.112010
Data center TCP (DCTCP) · SIGCOMM 2010
Routing and switching
traffic engineering
0.112009
VL2: a scalable and flexible data center network · SIGCOMM 2009
Network measurement and analytics
traffic matrix estimation
0.112009
The nature of data center traffic: measurements & analysis · Internet Measurement Conference 2009
Routing and switching › load sharing
valiant load balancing
0.112009
VL2: a scalable and flexible data center network · SIGCOMM 2009
Distributed systems
replication
0.112016
Realizing the Fault-Tolerance Promise of Cloud Storage Using Locks with Intent · OSDI 2016
Cloud and datacenter computing
resource allocation
0.012009
VL2: a scalable and flexible data center network · SIGCOMM 2009
Transport protocols and congestion control
TCP
0.012003
Upgrading transport protocols using untrusted mobile code · SOSP 2003

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

locks with intent · 0.2measurement · 0.2experiments · 0.2analysis · 0.2queue management · 0.1ECN · 0.1socket-level logging · 0.1
YearPublicationVenuePosition
2023 Towards Modern Development of Cloud Applications
abstract
When writing a distributed application, conventional wisdom says to split your application into separate services that can be rolled out independently. This approach is well-intentioned, but a microservices-based architecture like this often backfires, introducing challenges that counteract the benefits the architecture tries to achieve. Fundamentally, this is because microservices conflate logical boundaries (how code is written) with physical boundaries (how code is deployed). In this paper, we propose a different programming methodology that decouples the two in order to solve these challenges. With our approach, developers write their applications as logical monoliths, offload the decisions of how to distribute and run applications to an automated runtime, and deploy applications atomically. Our prototype implementation reduces application latency by up to 15× and reduces cost by up to 9× compared to the status quo.
Sanjay Ghemawat, Robert Grandl, Srdjan Petrovic, Michael Whittaker, Parveen Patel, Ivan Posva, Amin Vahdat
HotOS5
2016 Realizing the Fault-Tolerance Promise of Cloud Storage Using Locks with Intent
Srinath Setty, Chunzhi Su, Jacob R. Lorch, Lidong Zhou, Hao Chen 0030, Parveen Patel, Jinglei Ren
OSDI6
2013 Ananta: cloud scale load balancing
abstract
Layer-4 load balancing is fundamental to creating scale-out web services. We designed and implemented Ananta, a scale-out layer-4 load balancer that runs on commodity hardware and meets the performance, reliability and operational requirements of multi-tenant cloud computing environments. Ananta combines existing techniques in routing and distributed systems in a unique way and splits the components of a load balancer into a consensus-based reliable control plane and a decentralized scale-out data plane. A key component of Ananta is an agent in every host that can take over the packet modification function from the load balancer, thereby enabling the load balancer to naturally scale with the size of the data center. Due to its distributed architecture, Ananta provides direct server return (DSR) and network address translation (NAT) capabilities across layer-2 boundaries. Multiple instances of Ananta have been deployed in the Windows Azure public cloud with combined bandwidth capacity exceeding 1Tbps. It is serving traffic needs of a diverse set of tenants, including the blob, table and relational storage services. With its scale-out data plane we can easily achieve more than 100Gbps throughput for a single public IP address. In this paper, we describe the requirements of a cloud-scale load balancer, the design of Ananta and lessons learnt from its implementation and operation in the Windows Azure public cloud.
Parveen Patel, Deepak Bansal, Ashwin Murthy, Albert G. Greenberg, David A. Maltz, Randy Kern, Marios Zikos, Changhoon Kim, Naveen Karri
SIGCOMM1
2010 Data center TCP (DCTCP)
abstract
Cloud data centers host diverse applications, mixing workloads that require small predictable latency with others requiring large sustained throughput. In this environment, today's state-of-the-art TCP protocol falls short. We present measurements of a 6000 server production cluster and reveal impairments that lead to high application latencies, rooted in TCP's demands on the limited buffer space available in data center switches. For example, bandwidth hungry "background" flows build up queues at the switches, and thus impact the performance of latency sensitive "foreground" traffic.
Mohammad Alizadeh, Albert G. Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, Murari Sridharan
SIGCOMM5
2009 The nature of data center traffic: measurements & analysis
abstract
We explore the nature of traffic in data centers, designed to support the mining of massive data sets. We instrument the servers to collect socket-level logs, with negligible performance impact. In a 1500 server operational cluster, we thus amass roughly a petabyte of measurements over two months, from which we obtain and report detailed views of traffic and congestion conditions and patterns. We further consider whether traffic matrices in the cluster might be obtained instead via tomographic inference from coarser-grained counter data.
Srikanth Kandula, Sudipta Sengupta, Albert G. Greenberg, Parveen Patel, Ronnie Chaiken
Internet Measurement Conference4
2009 VL2: a scalable and flexible data center network
abstract
To be agile and cost effective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL2, a practical network architecture that scales to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer-2 semantics. VL2 uses (1) flat addressing to allow service instances to be placed anywhere in the network, (2) Valiant Load Balancing to spread traffic uniformly across network paths, and (3) end-system based address resolution to scale to large server pools, without introducing complexity to the network control plane. VL2's design is driven by detailed measurements of traffic and fault data from a large operational cloud service provider. VL2's implementation leverages proven network technologies, already available at low cost in high-speed hardware implementations, to build a scalable and reliable network architecture. As a result, VL2 networks can be deployed today, and we have built a working prototype. We evaluate the merits of the VL2 design using measurement, analysis, and experiments. Our VL2 prototype shuffles 2.7 TB of data among 75 servers in 395 seconds - sustaining a rate that is 94% of the maximum possible.
Albert G. Greenberg, James R. Hamilton, Navendu Jain, Srikanth Kandula, Changhoon Kim, Parantap Lahiri, David A. Maltz, Parveen Patel, Sudipta Sengupta
SIGCOMM8
2003 TCP Meets Mobile Code
Parveen Patel, David Wetherall, Jay Lepreau, Andrew Whitaker
HotOS1
2003 Upgrading transport protocols using untrusted mobile code
abstract
In this paper, we present STP, a system in which communicating end hosts use untrusted mobile code to remotely upgrade each other with the transport protocols that they use to communicate. New transport protocols are written in a type-safe version of C, distributed out-of-band, and run in-kernel. Communicating peers select a transport protocol to use as part of a TCP-like connection setup handshake that is backwards-compatible with TCP and incurs minimum connection setup latency. New transports can be invoked by unmodified applications. By providing a late binding of protocols to hosts, STP removes many of the delays and constraints that are otherwise commonplace when upgrading the transport protocols deployed on the Internet. STP is simultaneously able to provide a high level of security and performance. It allows each host to protect itself from untrusted transport code and to ensure that this code does not harm other network users by sending significantly faster than a compliant TCP. It runs untrusted code with low enough overhead that new transport protocols can sustain near gigabit rates on commodity hardware. We believe that these properties, plus compatibility with existing applications and transports, complete the features that are needed to make STP useful in practice.
Parveen Patel, Andrew Whitaker, David Wetherall, Jay Lepreau, Tim Stack
SOSP1