Share Email Print

Proceedings Paper

Network distribution of highly scalable VBR video traffic
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We examine some of the implications of the recent introduction of a class of highly scalable video compression algorithms for network distribution. In particular, we investigate statistical multiplexing of highly scalable VBR traffic in high speed networks, characterized by low channel error rates. The superiority of multiple priority shared queuing policies over the most commonly considered two priority approaches is established through simulation studies. We also propose an optimal Earliest Due Date (EDD) scheduling approach, which has decided advantages over shared queuing, when transmission delay and jitter are to be kept very small. This proposed approach involves dynamic modification of EDD scheduling parameters.

Paper Details

Date Published: 14 March 1995
PDF: 15 pages
Proc. SPIE 2417, Multimedia Computing and Networking 1995, (14 March 1995); doi: 10.1117/12.206052
Show Author Affiliations
David S. Taubman, Univ. of California/Berkeley (United States)
Avideh Zakhor, Univ. of California/Berkeley (United States)

Published in SPIE Proceedings Vol. 2417:
Multimedia Computing and Networking 1995
Arturo A. Rodriguez; Jacek Maitan, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?