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

Jean-Paul Nussbaumer

dblp:47/4203 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1996
—ORCID · none

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

Computer networks · 3 · 2 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
2 papers
Content delivery and video streaming · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming › caching
bandwidth-storage tradeoff
0.021995
On Bandwidth and Storage Tradeoffs in Multimedia Distribution Networks · INFOCOM 1995
Networking Requirements for Interactive Video on Demand · IEEE J. Sel. Areas Commun. 1995
Content delivery and video streaming
caching
0.011995
Networking Requirements for Interactive Video on Demand · IEEE J. Sel. Areas Commun. 1995
Content delivery and video streaming › video-on-demand
interactive video-on-demand
0.011995
Networking Requirements for Interactive Video on Demand · IEEE J. Sel. Areas Commun. 1995
Content delivery and video streaming
video-on-demand
0.011995
Networking Requirements for Interactive Video on Demand · IEEE J. Sel. Areas Commun. 1995
Storage systems
distributed storage
0.011995
On Bandwidth and Storage Tradeoffs in Multimedia Distribution Networks · INFOCOM 1995

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

analytical modeling · 0.0stream sharing · 0.0simulation · 0.0cost function analysis · 0.0
YearPublicationVenuePosition
1996 Impact of Channel Allocation Policies on Quality of Service of Video on Demand over CATV
Jean-Paul Nussbaumer, Frank Schaffa
Multim. Tools Appl.1
1995 On Bandwidth and Storage Tradeoffs in Multimedia Distribution Networks
Frank Schaffa, Jean-Paul Nussbaumer
INFOCOM2
1995 Networking Requirements for Interactive Video on Demand
abstract
A significant driver for the consumer use of high bandwidth in the near future will be interactive video on demand (IVOD). A range of service types can be deployed, based on a differing sophistication, which must be traded against the network costs (bandwidth) and component costs (switch complexity and memory). The potential aggregate bandwidth required is huge (O(1Pb/s)), and thus it is essential to properly engineer the network to reduce the bandwidth required. This paper describes a variety of IVOD scenarios, and introduces a cost function that captures the combined bandwidth and storage requirements of the network. This cost function is used to compare different network engineering alternatives, particularly program caching and stream sharing. The effects of nonlinear pricing and differing weights of bandwidth and storage are also reflected by the cost function. This cost function can be used by network designers to determine optimal topology, sharing, and caching strategies for desired bandwidth versus memory costs in a particular network deployment. In addition, a simulation model is used to evaluate caching of programs or windows within programs. We show that there are some results that are widely applicable. In particular, the level in the network at which caching should take place is at approximately 80% depth in the distribution tree, above the head end switch in the network hierarchy. We also observe that the bandwidth savings in sharing streams (actually buffered windows of program content) is fairly small for user behavior based on Zipfs law. The overall intent of this work is to evaluate the effects of various server, cache, and sharing strategies on the bandwidth and storage requirements of the network and their proper placement within the network.>
Jean-Paul Nussbaumer, Baiju V. Patel, Frank Schaffa, James P. G. Sterbenz
IEEE J. Sel. Areas Commun.1
1994 Multimedia Delivery on Demand: Capacity Analysis and Implications
abstract
CATV networks are targeted to provide multimedia services to the home. This paper presents a simulation model aimed at evaluating the capacity of CATV networks. The model is based on the user profile, the service discipline and the CATV bandwidth. The issues addressed include the number of users supported by a single broadcast CATV-tree, the probability of accepting a request for multimedia service, and the number of users served over a period of time.>
Jean-Paul Nussbaumer, Baiju V. Patel, Frank Schaffa
LCN1