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

Serhat Arslan

dblp:257/8042 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
5since 2021 · last 2023
0000-0002-6192-3672ORCID · corroborated

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

Computer networks · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 since 2021Applied, interdisciplinary, general and emerging 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
2 papers
Internet architecture and protocols · 50% Datacenter networks · 50%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 57% Interconnection networks and networks-on-chip · 43%

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

TopicWeightPapersLastEvidence papers
Datacenter networks
low-latency networking
0.512021
The nanoPU: A Nanosecond Network Stack for Datacenters · OSDI 2021
Internet architecture and protocols › network architecture design › layered architecture › protocol layering
network stack
0.512021
The nanoPU: A Nanosecond Network Stack for Datacenters · OSDI 2021
Cloud and datacenter computing
datacenter network
0.212023
Bolt: Sub-RTT Congestion Control for Ultra-Low Latency · NSDI 2023
Interconnection networks and networks-on-chip
network interface
0.112021
The nanoPU: A Nanosecond Network Stack for Datacenters · OSDI 2021
YearPublicationVenuePosition
2023 Green With Envy: Unfair Congestion Control Algorithms Can Be More Energy Efficient
abstract
Despite 40 years of active research on congestion control, there has been little or no consideration of how it impacts the energy usage of end-hosts or networking equipment. Particularly with the burgeoning energy consumption of data centers and wide-area networks, we argue that the time is ripe for the networking community to start thinking along these lines. To pave the way, we conduct lab experiments to measure the energy used by popular congestion control algorithms. We consider various aspects of congestion control and the rich research challenges that arise when we consider energy efficiency. Specifically, we find that fairness for the bandwidth allocated by congestion control can increase energy consumption by as high as 16%. We extrapolate these results to projected savings on the order of $10 million/year for large data centers.
Serhat Arslan, Sundararajan Renganathan, Bruce Spang
HotNets1
2023 Bolt: Sub-RTT Congestion Control for Ultra-Low Latency
Serhat Arslan, Gautam Kumar 0001, Nandita Dukkipati
NSDI1
2022 Trust-free service measurement and payments for decentralized cellular networks
abstract
Decentralized cellular networks have emerged to increase network accessibility by distributing infrastructure ownership over independent entities. Unlike the centralized setting, these architectures can allow users to connect to any untrusted base station without prior subscription. However, verification of the service is necessary in the absence of trust for commensurate payments by the user. Further, any method of verification must be non-intrusive and reliably agreed upon by the involved parties. To this end, we describe two-sided measurements where both the users and the providers independently assess the cellular service. We find that reconciling measurements from different layers of the cellular stack for a diverse set of matching observations is challenging but not impossible. Hence, new use cases such as a decentralized slicing marketplace, and contract-free roaming can be enabled by two-sided measurements. We envision applying two-sided measurements to real-time, on-demand network slicing and present an architecture that is capable of offering, as well as verifying, such slices in a scalable manner.
S. V. R. Anand, Serhat Arslan, Rajat Chopra, Sachin Katti, Milind Kumar Vaddiraju, Ranvir Rana, Peiyao Sheng, Himanshu Tyagi, Pramod Viswanath
HotNets2
2021 The nanoPU: A Nanosecond Network Stack for Datacenters
Stephen Ibanez, Alex Mallery, Serhat Arslan, Theo Jepsen, Muhammad Shahbaz 0001, Changhoon Kim, Nick McKeown
OSDI3
2021 Updating the theory of buffer sizing
Bruce Spang, Serhat Arslan, Nick McKeown
Perform. Evaluation2
2020 Using Google Search Trends to Estimate Global Patterns in Learning
abstract
The use of the Internet for learning provides a unique and growing opportunity to revisit the task of quantifying how much people have learned about a given subject in different regions around the world. Google alone receives over 5 billion searches a day and its publicly available data provides insight into learning process that is otherwise unobservable on a global scale. In this paper we, introduce the Computer Science Literacy-Proxy Index via Search (CSLI-s), a measure that utilizes online search data to make an educated guess around trends in computer science education. This measure uses a statistical signal processing technique to compose search volumes from a spectrum of topics into a coherent score. We intentionally explore and mitigate the biases of search data and, in the process, develop CSLI-s scores that correlate with traditional, more expensive metrics of learning. We then use search-trend data to measure patterns in subject literacy across countries and over time. To the best of our knowledge, this is the first measure of learning via Internet search-trends. The Internet is becoming a standard tool for learners and, as such, we anticipate search-trend data will have growing relevance to the learning science community.
Serhat Arslan, Mo Tiwari, Chris Piech
L@S1