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

Roger G. Kermode

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

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

Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
Internet architecture and protocols · 40% Network optimization and economics · 20% Physical-layer communications · 20%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › error control
automatic repeat request
0.011998
Scoped Hybrid Automatic Repeat reQuest with Forward Error Correction (SHARQFEC) · SIGCOMM 1998
Physical-layer communications › channel coding › error control coding
forward error correction
0.011998
Scoped Hybrid Automatic Repeat reQuest with Forward Error Correction (SHARQFEC) · SIGCOMM 1998
Internet architecture and protocols
multicast
0.011998
Scoped Hybrid Automatic Repeat reQuest with Forward Error Correction (SHARQFEC) · SIGCOMM 1998
Internet architecture and protocols › multicast
reliable multicast
0.011998
Scoped Hybrid Automatic Repeat reQuest with Forward Error Correction (SHARQFEC) · SIGCOMM 1998
Network optimization and economics
traffic localization
0.011998
Scoped Hybrid Automatic Repeat reQuest with Forward Error Correction (SHARQFEC) · SIGCOMM 1998

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

simulation · 0.0
YearPublicationVenuePosition
1999 A novel method for video-on-demand via digital broadcast
abstract
We propose a new method for the on-demand delivery of streaming media over a small number of multicast channels to large numbers of receivers called Truncated Exponential Partitioning (TEP). Objects delivered using TEP are consumed from the beginning to the end in a linear fashion. This allows their data to be segmented and carried in different channels that are scheduled so that each can arrive just in time for presentation. As a consequence, the amount of storage required in the receiver, access latency, and bandwidth required for a desired level of performance are minimized. Quantitative expressions for these metrics are derived for TEP and compared to a similar scheme skyscraper broadcasting (SB) scheme from which the design of TEP was based. Simulations show that TEP offers superior performance to the SE scheme. Finally, an architecture for delivering movies over cable networks using TEP is proposed.
Roger G. Kermode
LANMAN1
1998 Scoped Hybrid Automatic Repeat reQuest with Forward Error Correction (SHARQFEC)
abstract
Reliable multicast protocols scale only as well as their ability to localize traffic. This is true for repair requests, repairs, and the session traffic that enables receivers to suppress extraneous requests and repairs. We propose a new reliable multicast traffic localization technique called Scoped Hybrid Automatic Repeat reQuest with Forward Error Correction (SHARQFEC). SHARQFEC operates in an end-to-end fashion and localizes traffic using a hierarchy of administratively scoped regions. Session traffic is further reduced through the use of a novel method for indirectly determining the distances between session members. For large sessions, this mechanism reduces the amount of session traffic by several orders of magnitude over non-scoped protocols such as Scalable Reliable Multicast (SRM). Forward Error Correction is selectively added to regions which are experiencing greater loss, thereby reducing the volume of repair traffic and recovery times. Receivers request additional repairs as necessary. Simulations show that SHARQFEC out performs both SRM and non-scoped hybrid Automatic Repeat reQuest / Forward Error Correction protocols. Assuming the widespread deployment of administrative scoping, SHARQFEC could conceivably provide scalable reliable delivery to tens of millions of receivers without huge increases in network bandwidth.
Roger G. Kermode
SIGCOMM1
1995 Coding for content: enhanced resolution from coding
abstract
This paper describes a new video coding algorithm [Kermode 1994] that extends the traditional hybrid transform coding techniques used in MPEG in two ways. First, pictures are analyzed and segmented into a number of regions roughly corresponding to the background and any moving foreground objects. These regions are then encoded independently from one another thereby incorporating degree of useful content into the encoded representation beyond the pictures themselves. Second, the new algorithm also stores the background regions from several frames which can then be used to construct an artificial image at a higher resolution than that of the original background. Furthermore, both of these features are implemented at no overall cost in compression efficiency. In fact the new algorithm still outperforms MPEG, even for particularly degenerate sequences where the underlying assumption used for segmentation is broken.
Roger G. Kermode, Andy Lippman
ICIP (3)1