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.

Jyoti Parwatikar

dblp:32/6092 · DBLP profile ↗
← Back
9ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0002-0327-5889ORCID · corroborated

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

Computer networks · 5 · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Theory of computation · 1

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 · 49% Wireless networking · 18% Internet of things and sensor networks · 15%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 50% Interconnection networks and networks-on-chip · 50%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
overlay networks
0.712023
Demo: General Purpose Overlay Network Using Sidecar Model in Presence of Intermittent Links with Monitoring · ICNP 2023
Internet of things and sensor networks
delay tolerant networks
0.212023
Demo: General Purpose Overlay Network Using Sidecar Model in Presence of Intermittent Links with Monitoring · ICNP 2023
Network management and operations
network monitoring
0.212023
Demo: General Purpose Overlay Network Using Sidecar Model in Presence of Intermittent Links with Monitoring · ICNP 2023
Wireless networking
wireless network protocols
0.212023
Demo: General Purpose Overlay Network Using Sidecar Model in Presence of Intermittent Links with Monitoring · ICNP 2023
Wireless networking › multiple access protocols
distributed queueing
0.012003
Distributed Queueing in Scalable High Performance Routers · INFOCOM 2003
Routing and switching
router architecture
0.012003
Distributed Queueing in Scalable High Performance Routers · INFOCOM 2003
Performance modeling and evaluation
queueing models
0.012003
Distributed Queueing in Scalable High Performance Routers · INFOCOM 2003
Interconnection networks and networks-on-chip › network scheduling
switch scheduling
0.012003
Distributed Queueing in Scalable High Performance Routers · INFOCOM 2003
Routing and switching › router architecture
high-speed router
0.012003
Distributed Queueing in Scalable High Performance Routers · INFOCOM 2003

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

envoy sidecar · 0.7urgency-proportional allocation · 0.1dynamic reallocation · 0.1deferred underflow · 0.1backlog-proportional allocation · 0.1
YearPublicationVenuePosition
2026 Hermes: A General-Purpose Proxy-Enabled Networking Architecture
abstract
We introduce Hermes, a general-purpose networking architecture built on an overlay of reconfigurable proxies. Hermes delegates networking responsibilities from applications and services to the overlay proxies. It employs a range of proxying and tunneling techniques, utilizes HTTP as its core component, and incorporates assisting components to facilitate service delivery, enhance communication, and improve end-users' experience. To substantiate these benefits, we prototyped Hermes and demonstrated its ability to efficiently address service and communication challenges. We showed that Hermes enables end-to-end solutions for compatibility with legacy applications and protocols and reliable delivery in highly disadvantaged networking conditions. Furthermore, Hermes demonstrated its ability to provide end-to-end, business-logic-driven handling of general IP traffic and to serve as a communication pipeline for Named Data Networking, facilitating the development and adoption of future networking architectures.
Behrooz Farkiani, Fan Liu 0020, John D. DeHart, Jyoti Parwatikar, Patrick Crowley
IEEE Trans. Netw. Serv. Manag.5
2025 Performance Comparison of HTTP/3 and HTTP/2 with Proxy Integration
abstract
This paper systematically evaluates the performance of QUIC/HTTP3 (H3) and TCP/HTTP2 (H2) in proxy-enhanced environments. H3 integrates UDP-based flow-controlled streams, built-in TLS, multiplexing, and connection migration to better support modern web communication. While prior studies show that H3 can outperform or underperform H2 depending on network conditions, the role of proxies and connection migration remains underexplored. We assess a variety of H2 and H3 client implementations across, particularly in lossy networks and proxy setups. Our findings show that proxies can significantly enhance H2 performance, yielding a 90% improvement in single-stream downloads under severe impairments when used with the BBR congestion control algorithm. In contrast, proxies have minimal impact on H3, which maintains consistent performance due to its internal mechanisms. H3 excels under high-loss and high-latency conditions, leveraging connection migration and multiplexing to deliver up to 88.36% improvement in migration scenarios and 81.5% in extreme loss cases. While optimized H2 can match H3 in some settings, H3 is more robust overall, showing less sensitivity to proxies, impairments, and congestion control variations.
Fan Liu 0020, Behrooz Farkiani, John D. DeHart, Jyoti Parwatikar, Patrick Crowley
ICCCN4
2023 Demo: General Purpose Overlay Network Using Sidecar Model in Presence of Intermittent Links with Monitoring
abstract
We have been working to create a novel and practical software infrastructure to enable networking researchers to develop, evaluate, and demonstrate networked systems, services, and protocols using modern real-world devices and platforms. As a first demonstration of this, we will show an Envoy sidecar overlay network supporting smartphone requested web traffic over a network with intermittent links with real time network monitoring and audience participation.
John D. DeHart, Jyoti Parwatikar, Behrooz Farkiani, Patrick Crowley
ICNP2
2010 Design of an Extensible Network Testbed
abstract
Networking testbeds have become an increasingly important part of the networking research cycle. One of the primary reasons for this is that testbeds offer researchers access to network conditions and environments which are very difficult to reproduce in a local laboratory. This work presents the design of the Open Network Laboratory (ONL) testbed. The underlying infrastructure of ONL is general enough to support resource extensibility and heterogeneity at a fundamental level. New types of resources (e.g., multicore PCs, FPGAs, network processors, etc) can be added to the testbed without modifying any testbed infrastructure software. Resource types can also be extended to support multiple distinct sets of functionality (e.g., an FPGA might act as a router, a switch, or a traffic generator). Moreover, users can dynamically add new resource extensions without any modification to the existing infrastructure.
Charlie Wiseman, Jyoti Parwatikar, John D. DeHart, Jonathan S. Turner
NCA2
2008 A remotely accessible network processor-based router for network experimentation
abstract
Over the last decade, programmable Network Processors (NPs) have become widely used in Internet routers and other network components. NPs enable rapid development of complex packet processing functions as well as rapid response to changing requirements. In the network research community, the use of NPs has been limited by the challenges associated with learning to program these devices and with using them for substantial research projects. This paper reports on an extension to the Open Network Laboratory testbed that seeks to reduce these "barriers to entry" by providing a complete and highly configurable NP-based router that users can access remotely and use for network experiments. The base router includes support for IP route lookup and general packet filtering, as well as a flexible queueing sub-system and extensive support for performance monitoring. In addition, it provides a plugin environment that can be used to extend the router's functionality, enabling users to carry out significant network experiments with a relatively modest investment of time and effort. This paper describes our NP router and explains how it can be used. We provide several examples of network experiments that have been implemented using the plugin environment, and provide some baseline performance data to characterize the overall system performance. We also report that these routers have already been used for ten non-trivial projects in an advanced architecture course where most of the students had no prior experience using NPs.
Charlie Wiseman, Jonathan S. Turner, Michela Becchi, Patrick Crowley, John D. DeHart, Mart Haitjema, Shakir James, Fred Kuhns, Jyoti Parwatikar, Ritun Patney, Michael Wilson 0001, David Zar
ANCS10
2006 The open network laboratory
abstract
The Open Network Laboratory (ONL) is a remotely accessible network testbed of high performance routers which has been designed with an eye towards ease of use for users from the naïve to the expert. The system is built around a set of high-performance routers that are extendible and easily configurable through the Remote Laboratory Interface (RLI), an intuitive graphical interface. The RLI also makes it easy to configure packet filters in the routers, assign flows or flow aggregates to separate queues with configurable QoS and attach hardware monitoring points to real-time charts. The RLI’s real-time charts and user data facility makes it easy to directly view the effects of traffic as it moves through a router, allowing the user to gain better insight into system behavior and create compelling demonstrations. Each port of the router is equipped with an embedded processor that supports software plugins which allow users to extend the system’s functionality. This paper describes the ONL and how it can be used in networking education. You should checkout our web site onl.arl.wustl.edu which includes a short video.
John D. DeHart, Fred Kuhns, Jyoti Parwatikar, Jonathan S. Turner, Charlie Wiseman
SIGCSE3
2003 Distributed Queueing in Scalable High Performance Routers
abstract
This paper presents and evaluates distributed queueing algorithms for regulating the flow of traffic through large, high performance routers. Distributed queueing has a similar objective to crossbar-scheduling mechanisms used in routers with relatively small port counts, and shares some common high level characteristics. However, the need to minimize communication overhead rules out the iterative methods that are typically used for crossbar scheduling, while the ability to sub-divide the available bandwidth among different ports provides a degree of freedom that is absent in the crossbar scheduling context, where inputs must be matched to outputs. Our algorithms are based on four ideas (1) backlog-proportional-allocation of output bandwidth, (2) urgency-proportional-allocation of input bandwidth, (3) dynamic reallocation of bandwidth and (4) deferred underflow. Our algorithms guarantee congestion-free operation of the switch fabric. Our performance results show that for uniform random traffic, even a very modest speedup is sufficient to reduce the loss of output link bandwidth due to sub-optimal rate allocation to negligible levels, and that even under extreme conditions, a speedup of two is sufficient to eliminate such bandwidth loss.
Prashanth Pappu, Jyoti Parwatikar, Jonathan S. Turner, Kenneth Wong
INFOCOM2
1999 Vaudeville: A High Performance, Voice Activated Teleconferencing Application
Jyoti Parwatikar, A. Maynard Engebretson, Paul McCartney, John D. DeHart, Kenneth J. Goldman
Multim. Tools Appl.1
1997 On-line Scheduling with Hard Deadlines (Extended Abstract)
Sally A. Goldman, Jyoti Parwatikar, Subhash Suri
WADS2