Broadcast delivery

Abstract

This paper is concerned with the architecture and performance of systems that use a broadcast channel to deliver information to a community of users. lnformation is organized into units called pages, and at any instant of time, two or more users may request the same page. Broadcast delivery is attractive for such an environment because a single transmission of a page will satisfy all pending requests for that page. Three alternative architectures for broadcast information delivery systems are considered. They are one-way broadcast, two-way interaction, and hybrid one-way broadcasthwo-way interaction. An important design issue is the scheduling of page transmissions such that the user response time is minimized. For each architecture, existing scheduling algorithms are described, and their mean response time performance evaluated. Properties of scheduling algorithms that yield optimal mean response time are discussed. A comparative discussion of the performance differences of the three architectures is also provided.

Broadcast program generation for Webcasting

“…Obviously, in the above definition we assume that it is possible to achieve the equal-spacing criterion [5,23] in the transmission of the data items.…”

On-Demand Data Broadcasting for Mobile Decision Making

“…These policies can be classified as either non-preemptive or preemptive. In a non-preemptive environment, it has been pointed out that that First Come First Serve (FCFS) scheduling would provide poor access time in broadcast pull [10] and Most Requests First (MRF) and Longest Wait First (LWF) were proposed as efficient alternatives [10,29]. The RxW algorithm [4] combines the benefits of MRF and FCFS, where the intuition underlying RxW is that "hot" or popular data items are disseminated as soon as possible yet it avoids starvation of "cold" or less popular data items by means of an aging scheme.…”

“…Such a scheme also makes an effective use of the low wireless bandwidth and clearly improves user perceived performance. Several scheduling algorithms have been proposed that attempt to achieve maximum aggregation [2,10,28,29]. Assuming the traditional OLAP server basic functionality, the broadcast pull or on-demand environment as shown in figure 1, is the most suitable for supporting wireless OLAP query processing.…”

Semantic-based delivery of OLAP summary tables in wireless environments

“…These policies can be classified as either non-preemptive or preemptive. In the non-preemptive con- text, it was pointed out that that First Come First Serve (FCFS) scheduling would provide poor access time for a broadcast pull environments [8] and Most Requests First (MRF) and Longest Wait First (LWF) were proposed as alternative efficient algorithms in [8,22]. The RxW algorithm [4] combines the benefits of MRF and FCFS, where the intuition underlying RxW is that hot or popular data items are disseminated as soon as possible yet it avoids starvation of cold or less popular data items by means of an aging scheme.…”