The design of teletext broadcast cycles

Windows scheduling of arbitrary-length jobs on multiple machines

“…One example is the Broadcast Disks environment (e.g., Acharya et al 1995) where satellites broadcast popular information pages to clients. Another example is the TeleText environment (e.g., Ammar and Wong 1985) where running banners appear in some television networks. In such systems, there are clients and servers where the servers choose what information to push and in what frequency in order to guarantee short delays of clients waiting for desired information.…”

Query Management for Efficient Data Access in Wireless Environment

“…PUSH LB (Push Lower Bound) [5,22,23] -The optimum schedule for push is defined by Ammar et al as follows: (i) popular items should be broadcast more often than their not sopopular counterparts, (ii) two successive broadcasts of the same item should be equal distance apart throughout the schedule and (iii) the relative number of appearances of items on the broadcast channel should be in the square root ratio of their access probabilities. In other words the items have to be broadcasted in ratio of their access probabilities.…”

“…The fundamental push algorithms are Broadcast Disks [5] and Teletext System [22] . In these schedules all items being accessed are partitioned into a number of disks.…”

A maiden analysis of longest wait first

“…All the experimental comparisons of the most natural algorithms have identified the LWF as the clear champion [9,23,2]. In the natural setting where the request arrival times for each page have a Poisson distribution, LWF broadcasts each page with frequency roughly proportional to the square root of the page's arrival rate, which is essentially optimal [3].…”