On the optimality of cyclic transmission in teletext systems

Ammar, Mostafa; Wong, J.W.

doi:10.1109/cdc.1985.268711

Cited by 41 publications

(79 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some previous work has shown the use of multicast to provide scalable services [9,[11][12][13][14][15]. Some other applications of multicast for the delivery of information, news to large audience and general data base access were described in [14,16,17].…”

Section: Related Workmentioning

confidence: 99%

Analysis of a Cyclic Multicast Proxy Server Architecture

Abiona

Anjali

Onime

et al. 2008

IJCNS

View full text Add to dashboard Cite

The exponential growths of the World Wide Web (WWW) users have made the deployment of proxy servers popular on a network with limited resources. WWW clients perceive better response time, improved performance and speed when response to requested pages are served from the cache of a proxy server, resulting in faster response times after the first document fetch. This work proposes cyclic multicast as a scalable technique for improving proxy server performance for next generation networks. The proposed system uses a cyclic multicast engine for the delivery of popular web pages from the proxy server cache to increasingly large users under limited server capacity and network resources. The cyclic multicast technique would be more efficient for the delivery of highly requested web pages from the cache to large number of receivers. We describe the operation of the cyclic multicast proxy server and characterized the gains in performance.

show abstract

Section: Related Workmentioning

confidence: 99%

Analysis of a Cyclic Multicast Proxy Server Architecture

Abiona

Anjali

Onime

et al. 2008

IJCNS

View full text Add to dashboard Cite

show abstract

“…The optimal one-time schedule includes tests by decreasing priority p i and according to (2) has opt-M e [0](I n ) = max i ip i = 1. The optimal memoryless schedule uses q i ∝ p i and from (3) has opt M -MAX e (I n ) = i p i = H n .…”

Section: Ratio For Max Ementioning

confidence: 99%

“…The special case of singletons, where each test contains a single element, was extensively studied in the context of scheduling Teletext [2], broadcast disks [1,10,3,3,3,4], and search in unstructured p2p networks [7].…”

Section: Introductionmentioning

confidence: 99%

Scheduling Subset Tests: One-Time, Continuous, and How They Relate

Cohen

Kaplan

Mansour

2013

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

View full text Add to dashboard Cite

Abstract. A test scheduling instance is specified by a set of elements, a set of tests, which are subsets of elements, and numeric priorities assigned to elements. The schedule is a sequence of test invokations with the goal of covering all elements. This formulation had been used to model problems in multiple application domains from network failure detection to broadcast scheduling. The modeling considered both SUMe and MAXe objectives, which correspond to average or worst-case cover times over elements (weighted by priority), and both one-time testing, where the goal is to detect if a fault is currently present, and continuous testing, performed in the background in order to detect presence of failures soon after they occur. Since all variants are NP hard, the focus is on approximations. We present combinatorial approximations algorithms for both SUMe and MAXe objectives on continuous and MAXe on one-time schedules. The approximation ratios we obtain depend logarithmically on the number of elements and significantly improve over previous results. Moreover, our unified treatment of SUMe and MAXe objectives facilitates simultaneous approximation with respect to both. Since one-time and continuous testing can be viable alternatives, we study the overhead of continuous testing, captured by the ratio of optimal one-time to continuous cover times. We establish that the worst-case ratio is O(log n), but also provide evidence, by considering Zipf distributions, that the typical ratio is lower.

show abstract

“…Ammar and Wong [2] studied a teletext system with N queues, fed by independent Poisson arrival streams. Service times in all queues are deterministic (slotted, unit time each); there are no switch-over times and the service discipline is locally gated.…”

Section: Introductionmentioning

confidence: 99%