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

Holly Esquivel

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

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

Software engineering, systems software and programming languages · 2Systems, architecture and hardware · 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
1 paper
Routing and switching · 54% Network optimization and economics · 46%

Topics — the 5 heaviest of 5, 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
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
SIGMETRICS3
2007 Automated Oracle Comparators for TestingWeb Applications
abstract
Software developers need automated techniques to maintain the correctness of complex, evolving Web applications. While there has been success in automating some of the testing process for this domain, there exists little automated support for verifying that the executed test cases produce expected results. We assist in this tedious task by presenting a suite of automated oracle comparators for testing Web applications. To effectively identify failures, each comparator is specialized to particular characteristics of the possibly nondeterministic Web applications' output in the form of HTML responses. We also describe combinations of comparators designed to achieve both high precision and recall in failure detection and a tool for helping testers to analyze the output of multiple oracles in detail. We present results from an evaluation of the effectiveness and costs of the oracle comparators. We also provide recommendations to testers on applying effective oracle comparators based on their application's characteristics.
Sara Sprenkle, Lori L. Pollock, Holly Esquivel, Barbara Hazelwood, Stacey Ecott
ISSRE3