Scalable on-demand streaming of stored complex multimedia
| dc.contributor.advisor | Eager, Derek L. | en_US |
| dc.contributor.committeeMember | Srinivasan, Raj | en_US |
| dc.contributor.committeeMember | Makaroff, Dwight | en_US |
| dc.contributor.committeeMember | Keil, J. Mark | en_US |
| dc.contributor.committeeMember | Bunt, Rick B. | en_US |
| dc.contributor.committeeMember | Wong, Johnny W. | en_US |
| dc.creator | Zhao, Yanping | en_US |
| dc.date.accessioned | 2004-07-29T11:40:19Z | en_US |
| dc.date.accessioned | 2013-01-04T04:48:56Z | |
| dc.date.available | 2004-08-09T08:00:00Z | en_US |
| dc.date.available | 2013-01-04T04:48:56Z | |
| dc.date.created | 2004-07 | en_US |
| dc.date.issued | 2004-07-27 | en_US |
| dc.date.submitted | July 2004 | en_US |
| dc.description.abstract | Previous research has developed a number of efficient protocols for streaming popular multimedia files on-demand to potentially large numbers of concurrent clients. These protocols can achieve server bandwidth usage that grows much slower than linearly with the file request rate, and with the inverse of client start-up delay. This hesis makes the following three main contributions to the design and performance evaluation of such protocols. The first contribution is an investigation of the network bandwidth requirements for scalable on-demand streaming. The results suggest that the minimum required network bandwidth for scalable on-demand streaming typically scales as K/ln(K) as the number of client sites K increases for fixed request rate per client site, and as ln(N/(ND+1)) as the total file request rate N increases or client start-up delay D decreases, for a fixed number of sites. Multicast delivery trees configured to minimize network bandwidth usage rather than latency are found to only modestly reduce the minimum required network bandwidth. Furthermore, it is possible to achieve close to the minimum possible network and server bandwidth usage simultaneously with practical scalable delivery protocols. Second, the thesis addresses the problem of scalable on-demand streaming of a more complex type of media than is typically considered, namely variable bit rate (VBR) media. A lower bound on the minimum required server bandwidth for scalable on-demand streaming of VBR media is derived. The lower bound analysis motivates the design of a new immediate service protocol termed VBR bandwidth skimming (VBRBS) that uses constant bit rate streaming, when sufficient client storage space is available, yet fruitfully exploits the knowledge of a VBR profile. Finally, the thesis proposes non-linear media containing parallel sequences of data frames, among which clients can dynamically select at designated branch points, and investigates the design and performance issues in scalable on-demand streaming of such media. Lower bounds on the minimum required server bandwidth for various non-linear media scalable on-demand streaming approaches are derived, practical non-linear media scalable delivery protocols are developed, and, as a proof-of-concept, a simple scalable delivery protocol is implemented in a non-linear media streaming prototype system. | en_US |
| dc.identifier.uri | http://hdl.handle.net/10388/etd-07292004-114019 | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | Performance evaluation | en_US |
| dc.subject | periodic broadcast protocols | en_US |
| dc.subject | stream merging | en_US |
| dc.subject | video-on-demand | en_US |
| dc.title | Scalable on-demand streaming of stored complex multimedia | en_US |
| dc.type.genre | Thesis | en_US |
| dc.type.material | text | en_US |
| thesis.degree.department | Computer Science | en_US |
| thesis.degree.discipline | Computer Science | en_US |
| thesis.degree.grantor | University of Saskatchewan | en_US |
| thesis.degree.level | Doctoral | en_US |
| thesis.degree.name | Doctor of Philosophy (Ph.D.) | en_US |