| Martin Reisslein and Keith W. Ross. High-performance prefetching protocols for VBR prerecorded video. IEEE Network, 12:44-55, November 1998. |
....contains an integral number of groups, and its size is larger than the average size of these groups by a specified percentage margin in order to accommodate their variable sizes. Between the VOD warehouse and the customer, a streaming protocol can be used to deliver the video to the customer [22]. Videoplayback rate and duration: In the proposed system, different video programmescanoccupy different number of optical channels. Therefore, it can accommodate video programmes with different playback rate (e.g. 1.5 Mbps for MPEG 1 and 4 Mbps for MPEG 2) and different duration (e.g. 90 ....
M. Reisslein, and K. W. Ross, "High performance prefetching protocols for VBR prerecorded video," IEEE Network, vol. 12, no. 6, pp. 46-55, Dec. 1998.
....once at the beginning of the session, as opposed to the dynamic allocation performed by the Deadline Credit policy based on the varying network resource requirements from all users. The CRTT policy is rate based and deadlines are not explicitly de ned as opposed to the Deadline Credit policy. In [8] the idea of prefetching is exploited through a protocol called Join the Shortest Queue (JSQ) The driving idea of this protocol is to utilise bu er space at the receiving end in order to prefetch frames when the transmission link is underutilised. The frames are prefetched in a way such that all ....
....reconstruction process. In addition, the DC policy gives priority of resources (bandwidth) to the streams that have su ered the most losses as it is explained in the fairness criterion. The decentralised version of JSQ allows prefetching when there are many distributed servers in the system. In [8] it is described for a single hop case though the authors note that the presented ideas can apply in a mutlihop environment. Compared to the multihop DC policy, the decentralised JSQ (a) performs prefetching for each connection independently as opposed to the fairness criterion in DC and (b) the ....
M. Reisslein and K.W. Ross. High-Performance Prefetching Protocols for VBR Prerecorded Video. IEEE Network, Vol. 12, num. 6, November/December 1998.
....burstiness complicates the design of efficient real time mechanisms capable of achieving high resource utilization. To address this problem, techniques for reducing rate variability and hence increasing the efficiency of VBR video delivery are intensively studied in many research works [8, 4, 6]. Among these techniques, in this paper we are only interested in the one termed smoothing by prefetching (or work ahead in [8] where the underutilized bandwidth during transmission of low rate portions is utilized to prefetch high rate portions. Given a VBR video stream, it can be partitioned ....
M. Reisslein and K. W. Ross, High-performance prefetching protocols for VBR prerecorded video, IEEE Network (Nov./Dec. 1998), 45--55.
....in, and use of streaming video is growing to the point where content providers and ISPs must carefully consider how to provide sufficient capacity. Researchers have long investigated a number of techniques to reduce the retrieval and delivery burdens of video. Caching[3, 4, 5] pre fetching[6, 7, 8], mirroring[9, 10] batching[2, 11] etc. are all techniques that have been developed. While these techniques attempt to distribute the workload and move content closer to the user, these techniques alone provide minimal effectiveness. There are numerous corner cases that make systems based on ....
M. Reisslein and K. Ross, "High-performance prefetching protocols for VBR prerecorded video," IEEE Network, vol. 12, pp. 46--55, November/December 1998.
No context found.
M. Reisslein and K. W. Ross, "High--performance prefetching protocols for VBR prerecorded video," IEEE Network, vol. 12, no. 6, pp. 46--55, Nov/Dec 1998.
....of the proxy s disk array most efficiently. To highlight the impact of the object placement and caching strategies we do not include the streaming over the local access network in our study, that is, we focus on the admission control condition Pl disk 5. We refer the interested reader to [22, 31, 14, 6] OSS for studies of continuous media streaming over local access networks. To motivate the replication and striping of video objects in the proxy s disk array, we first consider a very simple caching scenario. Suppose that the 10 video objects from Table 2 are cached in the proxy s disk ....
M. Reisslein and K. W. Ross. High performance prefetching protocols for VBR prerecorded video. IEEE Network, 12(6):46 55, Nov/Dec 1998.
....In Section 5 we study a similar problem for finitelength video. We develop heuristics for the finite length case and provide simulation results in Section 6. II. STREAMING STORED VIDEO One fundamental property of stored video, as mentioned in the Introduction and observed in many other papers [12 18], is that it is prefetchable. Prefetching is advantageous for at least three reasons. First, it allows the client to locally build up a reservoir in preparation for future bandwidth droughts. Droughts can occur over short time scales due to bursty Web requests, congestion avoidance in competing ....
M. Reisslein and K. W. Ross, "High-Performance Prefetching Protocols for VBR Prerecorded Video ," in IEEE Networking Magazine. Nov./Dec. 1998.
No context found.
M. Reisslein and K. W. Ross, "High-performance prefetching protocols for VBR prerecorded video," IEEE Network 12, pp. 46-55, Nov/Dec 1998.
....In Section 5 we study a similar problem for finitelength video. We develop heuristics for the finite length case and provide simulation results in Section 6. II. STREAMING STORED VIDEO One fundamental property of stored video, as mentioned in the Introduction and observed in many other papers [12 18], is that it is prefetchable. Prefetching is advantageous for at least three reasons. First, it allows the client to locally build up a reservoir in preparation for future bandwidth droughts. Droughts can occur over short time scales due to bursty Web requests, congestion avoidance in competing ....
M. Reisslein and K. W. Ross, "High-Performance Prefetching Protocols for VBR Prerecorded Video ," in IEEE Networking Magazine. Nov./Dec. 1998.
....scheduling policy. With JSQ prefetching the server selects the video frame with the earliest playback deadline for transmission. In other words, the server transmits the next frame to the playout queues with the smallest number of prefetched frames (i.e. 32 the shortest queues) We note that in [44] a JSQ prefetching protocol for the streaming of VBR encoded video in a Video on Demand system is described. The prefetching work in [44] focuses on aspects of a client centric JSQ prefetching protocol. In particular, a refined JSQ prefetching policy, which accommodates finite client buffers and ....
....words, the server transmits the next frame to the playout queues with the smallest number of prefetched frames (i.e. 32 the shortest queues) We note that in [44] a JSQ prefetching protocol for the streaming of VBR encoded video in a Video on Demand system is described. The prefetching work in [44] focuses on aspects of a client centric JSQ prefetching protocol. In particular, a refined JSQ prefetching policy, which accommodates finite client buffers and client interactions, is developed. Also, admission control strategies, which incorporate criteria such as the long run average link ....
[Article contains additional citation context not shown here]
M. Reisslein and K. W. Ross. High-performance prefetching protocols for vbr prerecorded video. IEEE Network, 12(6):46--55, Nov/Dec 1998.
....to its transmission through the network. As observed previously in many papers, pre recorded video and exact knowledge of the traffic dynamics of the video stream allows transport schemes to utilize network resources more efficiently, by employing, for instance, smoothing or prefetching techniques [12, 30, 31, 43, 61]. 1.1 Research Scope and Objectives The research conducted in this thesis focuses on the design of stored video distribution schemes that meet natural Quality of Service (QoS) requirements, when bandwidth conditions are limited. For example, QoS requirements may include the maximum tolerable ....
....in Section 3.6. 3.2 Streaming Stored Video In this section we review the relevant technological issues for streaming stored video. We first begin with the properties of the video medium. One fundamental property of stored video, as mentioned in the Introduction and observed in many other papers [12, 13, 30, 31, 43, 49, 61], is that it is prefetchable. Prefetching is advantageous for at least three reasons. First, it allows the client to locally build up a reservoir in preparation for future bandwidth droughts. Droughts can occur over short time scales due to bursty Web requests, congestion avoidance in competing ....
M. Reisslein and K. W. Ross. High-Performance Prefetching Protocols for VBR Prerecorded Video . In IEEE Networking Magazine. Nov./Dec. 1998.
....In Section 5 we study a similar problem for finitelength video. We develop heuristics for the finite length case and provide simulation results in Section 6. II. STREAMING STORED VIDEO One fundamental property of stored video, as mentioned in the Introduction and observed in many other papers [12 18], is that it is prefetchable. Prefetching is advantageous for at least three reasons. First, it allows the client to locally build up a reservoir in preparation for future bandwidth droughts. Droughts can occur over short time scales due to bursty Web requests, congestion avoidance in competing ....
M. Reisslein and K. W. Ross, "High-Performance Prefetching Protocols for VBR Prerecorded Video ," in IEEE Networking Magazine. Nov./Dec. 1998.
....In Section 5 we study a similar problem for finite length video. We develop heuristics for the finite length case and provide simulation results in Section 6. II. STREAMING STORED VIDEO One fundamental property of stored video, as mentioned in the Introduction and observed in many other papers [11 17], is that it is prefetchable. Prefetching is advantageous for at least three reasons. First, it allows the client to locally build up a reservoir in preparation for future bandwidth droughts. Droughts can occur over short time scales due to bursty Web requests, congestion avoidance in competing ....
M. Reisslein and K. W. Ross, "High-Performance Prefetching Protocols for VBR Prerecorded Video ," in IEEE Networking Magazine. Nov./Dec. 1998.
....of the proxy s disk array most efficiently. To highlight the impact of the object placement and caching strategies we do not include the streaming over the local access network in our study, that is, we focus on the admission control condition P disk loss ffl. We refer the interested reader to [34], 35] 36] 37] for studies of continuous media streaming over local access networks. To motivate the replication and striping of video objects in the proxy s disk array, we first consider a very simple caching scenario. Suppose that the 10 video objects from Table II are cached in the proxy s ....
M. Reisslein and K. W. Ross, "High--performance prefetching protocols for VBR prerecorded video," IEEE Network, vol. 12, no. 6, pp. 46--55, Nov/Dec 1998.
....4, which increasingly offer higher performance. The first of these schemes combines smoothing with bufferless multiplexing, providing significant performance gains. The second scheme uses server buffer multiplexing, further increasing performance. The third scheme uses client prefetching [13] 14] [15], and leads to yet further improvements. We provide extensive numerical examples that show that the aforementioned schemes can lead to dramatic reductions in initial start up latency while keeping the loss probability negligible. In Section 5 we show that our VBR multiplexing schemes can ....
M. Reisslein K. W. Ross, "High-Performance Prefetching Protocols for VBR Prerecorded Videoxb," IEEE Network, vol. 12, no. 6, Nov/Dec 1998.
....in the proxy s disk array on the proxy performance. To highlight the impact of these strategies we do not consider the streaming over the local access network in the remainder of this study, that is, we focus on the admission control condition P disk loss ffl. We refer the interested reader to [29], 30] 31] 32] for studies of continuous media streaming over local access networks. To motivate the replication and striping of video objects in the proxy s disk array, we first consider a very simple caching scenario. Suppose that the 10 video objects from Table II are cached in the proxy s ....
M. Reisslein and K. W. Ross, "High--performance prefetching protocols for VBR prerecorded video," IEEE Network, vol. 12, no. 6, pp. 46--55, Nov/Dec 1998.
No context found.
Martin Reisslein and Keith W. Ross. High-performance prefetching protocols for VBR prerecorded video. IEEE Network, 12:44-55, November 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC