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

Jesse Steinberg

dblp:79/3645 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, 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
1 paper
Edge and fog computing · 44% Internet architecture and protocols · 44% Wireless networking · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › world wide web
web proxy
0.012002
A web middleware architecture for dynamic customization of content for wireless clients · WWW 2002
Storage systems
declustering
0.011999
Permutation Development Data Layout (PDDL) · HPCA 1999
Storage systems
disk array
0.011999
Permutation Development Data Layout (PDDL) · HPCA 1999
Storage systems › repair
data reconstruction
0.011999
Permutation Development Data Layout (PDDL) · HPCA 1999
Storage systems › storage reliability
RAID
0.011999
Permutation Development Data Layout (PDDL) · HPCA 1999

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

declustering · 0.0
YearPublicationVenuePosition
2010 Improving HTTP-based video performance using network flow buffering
abstract
We present network flow buffering, which is the use of a remote flow-regulating buffer that is deployed between a Web client and server to improve performance of HTTP-based playback of video. We show that HTTP enhanced with network flow buffering significantly improves performance, especially under high packet loss and highly variable bandwidth conditions, when compared with using either straight HTTP or streaming. The benefits of network flow buffering are numerous, and include reducing interruptions to playback, maintaining high video-image quality, and decreasing client-buffering requirements. Network flow buffering is easily implemented with existing Web mechanisms.
Jesse Steinberg, Joseph Pasquale
ISCC1
2002 A web middleware architecture for dynamic customization of content for wireless clients
abstract
We present a new Web middleware architecture that allows users to customize their view of the Web for optimal interaction and system operation when using non-traditional resource-limited client machines such as wireless PDAs (personal digital assistants). Web Stream Customizers (WSC) are dynamically deployable software modules and can be strategically located between client and server to achieve improvements in performance, reliability, or security. An important design feature is that Customizers provide two points of control in the communication path between client and server, supporting adaptive system-based and content-based customization. Our architecture exploits HTTP's proxy capabilities, allowing Customizers to be seamlessly integrated with the basic Web transaction model. We describe the WSC architecture and implementation, and illustrate its use with three non-trivial, adaptive Customizer applications that we have built. We show that the overhead in our implementation is small and tolerable, and is outweighed by the benefits that Customizers provide.
Jesse Steinberg, Joseph Pasquale
WWW1
1999 Permutation Development Data Layout (PDDL)
abstract
Declustered data organizations in disk arrays (RAIDs) achieve less-intrusive reconstruction of data after a disk failure. We present PDDL, a new data layout for declustered disk arrays. PDDL layouts exist for a large variety of disk array configurations with a distributed spare disk. PDDL declustered disk arrays have excellent run-time performance under light and heavy workloads. PDDL maximizes access parallelism in the most critical circumstances, namely during reconstruction of data on the spare disk. PDDL occurs minimum address translation overhead compared to all other proposed declustering layouts.
Thomas J. E. Schwarz, Jesse Steinberg, Walter A. Burkhard
HPCA2