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

Joanna Kulik

dblp:14/6897 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Computer networks · 3 · 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
Transport protocols and congestion control · 78% Internet architecture and protocols · 12% Internet of things and sensor networks · 11%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
QUIC
0.312017
The QUIC Transport Protocol: Design and Internet-Scale Deployment · SIGCOMM 2017
Transport protocols and congestion control
transport protocol design
0.312017
The QUIC Transport Protocol: Design and Internet-Scale Deployment · SIGCOMM 2017
Internet of things and sensor networks
data dissemination
0.011999
Adaptive Protocols for Information Dissemination in Wireless Sensor Networks · MobiCom 1999
Internet of things and sensor networks › wireless sensor network
energy-efficient communication
0.011999
Adaptive Protocols for Information Dissemination in Wireless Sensor Networks · MobiCom 1999
Internet of things and sensor networks
wireless sensor network
0.011999
Adaptive Protocols for Information Dissemination in Wireless Sensor Networks · MobiCom 1999
Internet of things and sensor networks › wireless sensor network › wireless sensor network protocol
data dissemination protocol
0.011999
Adaptive Protocols for Information Dissemination in Wireless Sensor Networks · MobiCom 1999

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

iterative experimentation · 0.3simulation · 0.0meta-data negotiation · 0.0SPIN protocols · 0.0
YearPublicationVenuePosition
2017 The QUIC Transport Protocol: Design and Internet-Scale Deployment
abstract
We present our experience with QUIC, an encrypted, multiplexed, and low-latency transport protocol designed from the ground up to improve transport performance for HTTPS traffic and to enable rapid deployment and continued evolution of transport mechanisms. QUIC has been globally deployed at Google on thousands of servers and is used to serve traffic to a range of clients including a widely-used web browser (Chrome) and a popular mobile video streaming app (YouTube). We estimate that 7% of Internet traffic is now QUIC. We describe our motivations for developing a new transport, the principles that guided our design, the Internet-scale process that we used to perform iterative experiments on QUIC, performance improvements seen by our various services, and our experience deploying QUIC globally. We also share lessons about transport design and the Internet ecosystem that we learned from our deployment.
Adam Langley, Alistair Riddoch, Alyssa Wilk, Antonio Vicente, Charles Krasic, Fedor Kouranov, Ian Swett, Janardhan R. Iyengar, Jeff Bailey, Jeremy Dorfman, Jim Roskind, Joanna Kulik, Patrik Westin, Raman Tenneti, Robbie Shade, Ryan Hamilton, Victor Vasiliev, Wan-Teh Chang, Zhongyi Shi
SIGCOMM14
2002 Negotiation-Based Protocols for Disseminating Information in Wireless Sensor Networks
Joanna Kulik, Wendi B. Heinzelman, Hari Balakrishnan
Wirel. Networks1
1999 Adaptive Protocols for Information Dissemination in Wireless Sensor Networks
abstract
In this paper, we present a family of adaptive protocols, called SPIN (Sensor Protocols for Information via Negotiation), that efficiently disseminates information among sensors in an energy-constrained wireless sensor network.Nodes running a SPIN communication protocol name their data using high-level data descriptors, called meta-data.They use meta-data negotiations to eliminate the transmission of redundant data throughout the network.In addition, SPIN nodes can base their communication decisions both upon application-specific knowledge of the data and upon knowledge of the resources that are available to them.This allows the sensors to efficiently distribute data given a limited energy supply.We simulate and analyze the performance of two specific SPIN protocols, comparing them to other possible approaches and a theoretically optimal protocol.We find that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches.We also find that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.
Wendi B. Heinzelman, Joanna Kulik, Hari Balakrishnan
MobiCom2