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

Chitra Muthukrishnan

dblp:58/7062 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

Computer networks · 3 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 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
3 papers
Routing and switching · 36% Network optimization and economics · 32% Internet architecture and protocols · 28%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Memory systems · 77% Cloud and datacenter computing · 23%

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

TopicWeightPapersLastEvidence papers
Routing and switching › inter-domain routing
BGP
0.112011
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness · SIGMETRICS 2011
Routing and switching
inter-domain routing
0.112011
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness · SIGMETRICS 2011
Network optimization and economics
pricing
0.112011
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness · SIGMETRICS 2011
Network optimization and economics › game theory › routing game
selfish routing
0.112011
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness · SIGMETRICS 2011
Internet architecture and protocols
middlebox
0.112010
EndRE: An End-System Redundancy Elimination Service for Enterprises · NSDI 2010
Internet architecture and protocols
redundancy elimination
0.112010
EndRE: An End-System Redundancy Elimination Service for Enterprises · NSDI 2010
Memory systems
content-addressable memory
0.112010
Cheap and Large CAMs for High Performance Data-Intensive Networked Systems · NSDI 2010
Routing and switching
routing policy
0.012011
De-ossifying internet routing through intrinsic support for end-network and ISP selfishness · SIGMETRICS 2011

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

simulation · 0.1
YearPublicationVenuePosition
2011 De-ossifying internet routing through intrinsic support for end-network and ISP selfishness
abstract
We present the S4R supplemental routing system to address the constraints BGP places on ISPs and stub network alike. Technical soundness and economic viability are equal first class design requirements for S4R. In S4R, ISPs announce links connecting different parts of the Internet. ISPs can selfishly price their links to attract maximal amount of traffic. Stub networks can selfishly select paths that best meet their requirements at the lowest cost. We design a variety of practical algorithms for ISP and stub network response that strike a balance between accommodating selfishness of all participants and ensuring efficient and stable operation overall. We employ large scale simulations over realistic scenarios to show that S4R operates at a close-to-optimal state and that it encourages broad participation from stubs and ISPs.
Aditya Akella, Shuchi Chawla 0001, Holly Esquivel, Chitra Muthukrishnan
SIGMETRICS4
2010 Using strongly typed networking to architect for tussle
abstract
Today's networks discriminate towards or against traffic for a wide range of reasons, and in response end users and their applications increasingly attempt to evade monitoring and control, resulting in an ongoing tussle whose roots run deep. In this work we explore an architectural paradigm that can accommodate such tussles in a systematic and transparent fashion. The key idea at the core of our design is strongly typed networking: the notion that application messages contain type information that fully describes the content being transferred. Our framework allows for transparency between parties which then leads to dialog and choice for both users and service providers. While in the early stages, we provide a possible framework for directly addressing the tussle between end users and "the network" without resorting to an ever-increasing degree of obfuscation and inference.
Chitra Muthukrishnan, Vern Paxson, Mark Allman, Aditya Akella
HotNets1
2010 EndRE: An End-System Redundancy Elimination Service for Enterprises
Bhavish Agarwal, Aditya Akella, Ashok Anand, Athula Balachandran, Pushkar V. Chitnis, Chitra Muthukrishnan, Ramachandran Ramjee, George Varghese
NSDI6
2010 Cheap and Large CAMs for High Performance Data-Intensive Networked Systems
Ashok Anand, Chitra Muthukrishnan, Steven Kappes, Aditya Akella, Suman Nath
NSDI2