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

Kyriakos Zarifis

dblp:94/8396 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
1since 2021 · last 2022
—ORCID · none

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

Computer networks · 4Security and privacy · 3 · 2 first-author · 1 since 2021Systems, architecture and hardware · 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
4 papers
Routing and switching · 35% Network management and operations · 13% Transport protocols and congestion control · 11%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 100%
Software engineering, system software, and programming languages
1 paper
Debugging and program repair · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › adaptive routing
detour routing
0.422014
DIBS: just-in-time congestion mitigation for data centers · EuroSys 2014
Don't drop, detour! · SIGCOMM 2013
Internet architecture and protocols › buffer management
buffer sharing
0.212014
DIBS: just-in-time congestion mitigation for data centers · EuroSys 2014
Transport protocols and congestion control › congestion management
congestion mitigation
0.212014
DIBS: just-in-time congestion mitigation for data centers · EuroSys 2014
Network performance modeling
packet loss reduction
0.212014
DIBS: just-in-time congestion mitigation for data centers · EuroSys 2014
Routing and switching
routing
0.212013
Don't drop, detour! · SIGCOMM 2013
Cloud and datacenter computing
datacenter network
0.112010
Ripcord: a modular platform for data center networking · SIGCOMM 2010
Routing and switching
switch buffer management
0.112014
DIBS: just-in-time congestion mitigation for data centers · EuroSys 2014
Debugging and program repair
fault localization
0.112014
Troubleshooting blackbox SDN control software with minimal causal sequences · SIGCOMM 2014
Cloud and datacenter computing › datacenter network
datacenter traffic management
0.012013
Don't drop, detour! · SIGCOMM 2013

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

detour routing · 0.3buffer management · 0.3detour-induced buffer sharing · 0.2
YearPublicationVenuePosition
2022 SSQoE: Measuring Video QoE from the Server-Side at a Global Multi-tenant CDN
Anant Shah, Juan Bran, Kyriakos Zarifis, Harkeerat Bedi
PAM3
2016 Modeling HTTP/2 Speed from HTTP/1 Traces
Kyriakos Zarifis, Mark Holland, Ethan Katz-Bassett, Ramesh Govindan
PAM1
2014 DIBS: just-in-time congestion mitigation for data centers
abstract
Data centers must support a range of workloads with differing demands. Although existing approaches handle routine traffic smoothly, intense hotspots--even if ephemeral--cause excessive packet loss and severely degrade performance. This loss occurs even though congestion is typically highly localized, with spare buffer capacity at nearby switches. In this paper, we argue that switches should share buffer capacity to effectively handle this spot congestion without the monetary hit of deploying large buffers at individual switches. Specifically, we present detour-induced buffer sharing (DIBS), a mechanism that achieves a near lossless network without requiring additional buffers at individual switches. Using DIBS, a congested switch detours packets randomly to neighboring switches to avoid dropping the packets. We implement DIBS in hardware, on software routers in a testbed, and in simulation, and we demonstrate that it reduces the 99th percentile of delay-sensitive query completion time by up to 85%, with very little impact on other traffic.
Kyriakos Zarifis, Rui Miao 0001, Matt Calder, Ethan Katz-Bassett, Minlan Yu, Jitendra Padhye
EuroSys1
2014 PEERING: An AS for Us
abstract
Internet routing suffers from persistent and transient failures, circuitous routes, oscillations, and prefix hijacks. A major impediment to progress is the lack of ways to conduct impactful interdomain research. Most research is based either on passive observation of existing routes, keeping researchers from assessing how the Internet will respond to route or policy changes; or simulations, which are restricted by limitations in our understanding of topology and policy.
Brandon Schlinker, Kyriakos Zarifis, Ítalo S. Cunha, Nick Feamster, Ethan Katz-Bassett
HotNets2
2014 Diagnosing Path Inflation of Mobile Client Traffic
Kyriakos Zarifis, Tobias Flach, Srikanth Nori, David R. Choffnes, Ramesh Govindan, Ethan Katz-Bassett, Z. Morley Mao, Matt Welsh
PAM1
2014 Troubleshooting blackbox SDN control software with minimal causal sequences
abstract
Software bugs are inevitable in software-defined networking control software, and troubleshooting is a tedious, time-consuming task. In this paper we discuss how to improve control software troubleshooting by presenting a technique for automatically identifying a minimal sequence of inputs responsible for triggering a given bug, without making assumptions about the language or instrumentation of the software under test. We apply our technique to five open source SDN control platforms---Floodlight, NOX, POX, Pyretic, ONOS---and illustrate how the minimal causal sequences our system found aided the troubleshooting process.
Colin Scott, Andreas Wundsam, Barath Raghavan, Aurojit Panda, Andrew Or, Jefferson Lai, Eugene Huang, Ahmed El-Hassany, Sam Whitlock, Hrishikesh B. Acharya, Kyriakos Zarifis, Scott Shenker
SIGCOMM12
2013 Don't drop, detour!
abstract
Today's data centers must support a range of workloads with different demands. While existing approaches handle routine traffic smoothly, ephemeral but intense hotspots cause excessive packet loss and severely degrade performance. This loss occurs even though the congestion is typically highly localized, with spare buffer capacity available at nearby switches.
Matt Calder, Rui Miao 0001, Kyriakos Zarifis, Ethan Katz-Bassett, Minlan Yu, Jitendra Padhye
SIGCOMM3
2010 Ripcord: a modular platform for data center networking
abstract
In this demo, we present Ripcord, a modular platform for rapidly prototyping scale-out data center networks. Ripcord enables researchers to build and evaluate new network features and topologies, using only commercially available hardware and open-source software. The Ripcord demo will show three examples of custom network functions, operating together, on top of a 160-node cluster. The first is a routing engine that isolates classes of traffic. The second is a dynamic network manager than adjusts links and switch power states to reduce energy. The third is a statistics aggregator that supports network health monitoring and automatic alerts. The demo will be interactive, with a visualization of live parameters for each link and switch, such as bandwidth, drops, and power status, as well a control panel to modify the traffic load. We feel that an interactive demo is the best way to introduce the research community to Ripcord and get their feedback.
Brandon Heller, David Erickson, Nick McKeown, Rean Griffith, Igor Ganichev, Scott Whyte, Kyriakos Zarifis, Daekyeong Moon, Scott Shenker, Stephen Stuart
SIGCOMM7