Channel Allocation under Batching and VCR Control in Video-on-Demand Systems

Dan, Asit; Shahabuddin, Perwez; Sitaram, Dinkar; Towsley, Don

doi:10.1006/jpdc.1995.1135

Cited by 105 publications

(62 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are stream merging schemes called Batching [14], Piggybacking [15], Tapping [19], Patching [20], and Dynamic skyscraper [21].…”

Section: Related Workmentioning

confidence: 99%

“…Moreover, the latency (w i ) of receiver-i is needed to be updated to find its maximum latency throughout its processing time. The conditional statements from line number (14) to line number (20) are grouping receivers for the existing recovery stream. The summary of this case can be described like this:…”

Section: : Nsaddreceiver(i) 29mentioning

confidence: 99%

“…To reduce the number of streams and alleviate network bandwidth usage on the sender, existing stream merging schemes (Refs. [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25]) can be applied. Because these existing schemes assume mainly video-on-demand (VoD) applications, they need to keep the jitter of the data stream delivery as small as possible for smooth video playback.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Lost Data Recovery Scheme for Sensor Data Stream Multicasting

Win

Yoshihisa

Ishi

et al. 2018

Journal of Information Processing

View full text Add to dashboard Cite

Abstract:In this paper, we propose a lost data recovery scheme called the synchronized recovery stream merging (SRSM) for sensor data stream multicasting in the unstable networks of the IoT applications. We propose two types of SRSM. The first one is "Latency-aware synchronized recovery stream merging (SRSM-L)" for IoT applications that has restrictions of acceptable latency. The other is "Bandwidth-dependent synchronized recovery stream merging (SRSM-B)" for the cases in which the network bandwidth for the sender is limited. Our proposed schemes reduce the number of the streams managed by the sender by waiting for other recovery streams to synchronize the delivery timing and merging. From our simulation evaluations, we confirmed that our proposed schemes save network bandwidth on the sender in the random and burst failure situations. We confirmed that SRSM-L could reduce the network bandwidth of the sender about 52% in the random failure situation, keeping the acceptable latency. We also confirmed that SRSM-B could keep the specified number of streams constant and the latency overheads small in the burst failure situation.

show abstract

“…There are stream merging schemes called Batching [14], Piggybacking [15], Tapping [19], Patching [20], and Dynamic skyscraper [21].…”

Section: Related Workmentioning

confidence: 99%

Section: : Nsaddreceiver(i) 29mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Lost Data Recovery Scheme for Sensor Data Stream Multicasting

Win

Yoshihisa

Ishi

et al. 2018

Journal of Information Processing

View full text Add to dashboard Cite

show abstract

“…To keep the discussion focused, we assume that batching is the primary resource sharing technique, and we do not consider any VCR-like operations. These operations can be supported by allocating contingency channels [5]. For MFQL, we assume that the server knows exactly the access frequency of each movie.…”

Section: Workload Characteristicsmentioning

confidence: 99%

“…The classes of resource sharing strategies include batching [3,5], patching [8], piggy-backing [7], broadcasting [9], and interval caching [4]. Batching accumulates requests to same movies and services them together by utilizing the multicast facility.…”

Section: Introductionmentioning

confidence: 99%