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

Yiannis Yiakoumis

dblp:50/7950 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

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

Computer networks · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 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
Internet architecture and protocols · 34% Network management and operations · 33% Network optimization and economics · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Energy-efficient computing · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › network economics › internet economics
network neutrality
0.212016
Neutral Net Neutrality · SIGCOMM 2016
Internet architecture and protocols › packet scheduling
fair queueing
0.212013
Scheduling packets over multiple interfaces while respecting user preferences · CoNEXT 2013
Internet architecture and protocols
packet scheduling
0.212013
Scheduling packets over multiple interfaces while respecting user preferences · CoNEXT 2013
Network management and operations
home network management
0.112012
Putting home users in charge of their network · UbiComp 2012
Network management and operations › quality of service management
traffic prioritization
0.112012
Putting home users in charge of their network · UbiComp 2012
Internet architecture and protocols
quality of service
0.012012
Putting home users in charge of their network · UbiComp 2012
Energy-efficient computing › power management › energy-efficient networking
network power management
0.012010
ElasticTree: Saving Energy in Data Center Networks · NSDI 2010

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

user study · 0.2network cookies · 0.2deficit round robin · 0.2user preference elicitation · 0.1
YearPublicationVenuePosition
2016 Neutral Net Neutrality
abstract
Should applications receive special treatment from the network? And if so, who decides which applications are preferred? This discussion, known as net neutrality, goes beyond technology and is a hot political topic. In this paper we approach net neutrality from a user's perspective. Through user studies, we demonstrate that users do indeed want some services to receive preferential treatment; and their preferences have a heavy-tail: a one-size-fits-all approach is unlikely to work. This suggests that users should be able to decide how their traffic is treated. A crucial part to enable user preferences, is the mechanism to express them. To this end, we present network cookies, a general mechanism to express user preferences to the network. Using cookies, we prototype Boost, a user-defined fast-lane and deploy it in 161 homes.
Yiannis Yiakoumis, Sachin Katti, Nick McKeown
SIGCOMM1
2013 Scheduling packets over multiple interfaces while respecting user preferences
abstract
Now that our smartphones have multiple interfaces (WiFi, 3G, 4G, etc.), we have preferences for which interfaces an application may use. We may prefer to stream video over WiFi because it is fast, but VoIP over 3G because it gives continued connectivity. We also have relative preferences, such as giving Netflix twice as much capacity as Dropbox. This means our mobile devices need to schedule packets in keeping with our preferences while making use of all the capacity available. This is the natural domain of fair queuing, and this paper is about the design of a packet scheduler to meet these requirements. We show that traditional fair queueing schedulers cannot take into account a user's preferences for some interfaces over others. We present a novel packet scheduler called miDRR that meets our needs by generalizing DRR for multiple interfaces. We demonstrate a prototype running in Linux and show that it works correctly and can easily run at the speeds we need.
Kok-Kiong Yap, Te-Yuan Huang, Yiannis Yiakoumis, Sandeep Chinchali, Nick McKeown, Sachin Katti
CoNEXT3
2012 Putting home users in charge of their network
abstract
Policy-makers, ISPs and content providers are locked in a debate about who can control the Internet traffic that flows into our homes. In this paper we argue that the user, not the ISP or the content provider, should decide how traffic is prioritized to and from the home. Home users know most about their preferences, and if they can express them well to the ISP, then both the ISP and user are better off. To test the idea we built a prototype that lets users express highlevel preferences that are translated to low-level semantics and used to control the network.
Yiannis Yiakoumis, Sachin Katti, Te-Yuan Huang, Nick McKeown, Kok-Kiong Yap, Ramesh Johari
UbiComp1
2010 ElasticTree: Saving Energy in Data Center Networks
Brandon Heller, Srinivasan Seetharaman, Priya Mahadevan, Yiannis Yiakoumis, Puneet Sharma 0001, Sujata Banerjee, Nick McKeown
NSDI4