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.

Scott Karlin

dblp:12/2198 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

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

Computer networks · 2 · 1 first-authorSoftware 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 architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 66% Processor architecture and microarchitecture · 34%
Computer networks
1 paper
Routing and switching · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
operating system support
0.012004
Operating Systems Support for Planetary-Scale Network Services · NSDI 2004
Routing and switching › router architecture
software router
0.012001
Building a Robust Software-Based Router Using Network Processors · SOSP 2001
Processor architecture and microarchitecture › special-purpose processor
network processor
0.012001
Building a Robust Software-Based Router Using Network Processors · SOSP 2001
Distributed systems › distributed system architecture
wide-area distributed systems
0.012004
Operating Systems Support for Planetary-Scale Network Services · NSDI 2004
Routing and switching
packet forwarding
0.012001
Building a Robust Software-Based Router Using Network Processors · SOSP 2001

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

network processor programming · 0.1hierarchical architecture · 0.1
YearPublicationVenuePosition
2005 Building extensible routers using network processors
abstract
This paper describes our effort to build extensible routers using a combination of general-purpose and network processors. We emphasize five overriding challenges that dictate our design decisions: (1) optimal resource allocation; (2) efficient but flexible scheduling of the CPU; (3) maintaining overall router robustness; (4) maximizing router performance; and (5) providing sufficient extensibility to enable the injection of new functionality into the router. We adopt a hierarchical architecture, in which packet flows traverse a range of processing/forwarding paths, thereby partitioning hardware and software in concert. This paper both presents the architecture, and describes our experiences implementing the architecture and addressing the five design challenges in a prototype built from Intel IXP 1200 and a Pentium. Copyright © 2005 John Wiley & Sons, Ltd.
Nadia Shalaby, Andy C. Bavier, Yitzchak M. Gottlieb, Scott Karlin, Larry L. Peterson, Xiaohu Qie, Tammo Spalink, Michal Wawrzoniak
Softw. Pract. Exp.4
2004 Operating Systems Support for Planetary-Scale Network Services
Andy C. Bavier, Mic Bowman, Brent N. Chun, David E. Culler, Scott Karlin, Steve Muir, Larry L. Peterson, Timothy Roscoe, Tammo Spalink, Michal Wawrzoniak
NSDI5
2002 VERA: an extensible router architecture
Scott Karlin, Larry L. Peterson
Comput. Networks1
2001 Building a Robust Software-Based Router Using Network Processors
abstract
Recent efforts to add new services to the Internet have increased interest in software-based routers that are easy to extend and evolve. This paper describes our experiences using emerging network processors---in particular, the Intel IXP1200---to implement a router. We show it is possible to combine an IXP1200 development board and a PC to build an inexpensive router that forwards minimum-sized packets at a rate of 3.47Mpps. This is nearly an order of magnitude faster than existing pure PC-based routers, and sufficient to support 1.77Gbps of aggregate link bandwidth. At lesser aggregate line speeds, our design also allows the excess resources available on the IXP1200 to be used robustly for extra packet processing. For example, with 8 × 100Mbps links, 240 register operations and 96 bytes of state storage are available for each 64-byte packet. Using a hierarchical architecture we can guarantee line-speed forwarding rates for simple packets with the IXP1200, and still have extra capacity to process exceptional packets with the Pentium. Up to 310Kpps of the traffic can be routed through the Pentium to receive 1510 cycles of extra per-packet processing.
Tammo Spalink, Scott Karlin, Larry L. Peterson, Yitzchak M. Gottlieb
SOSP2
1985 The Traveling Salesman Problem on a Hypercubic, MIMD Computer
Edward W. Felten, Steve W. Otto, Scott Karlin
ICPP3