Broadcast Delivery

Proceedings of the IEEE

Volumn 76, Issue 12, 1988, Pages 1566-1577

  Wong, John W ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL SYSTEMS--TELETEXT AND VIDEOTEX; PROBABILITY--QUEUEING THEORY; TELEVISION BROADCASTING;

BROADCAST CYCLE DESIGN; BROADCAST INFORMATION DELIVERY SYSTEMS; BROADCAST POLLING; HEURISTIC SCHEDULING ALGORITHMS; PROBABILISTIC PAGE SELECTION;

RADIO BROADCASTING;

EID: 0024167643     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.16350     Document Type: Article

References (33)

1. J. Gecsei, The Architecture of Videotex Systems. Englewood Cliffs, NJ: Prentice-Hall, 1983.
2. A.F. Alber, Videotex/Teletext: Principles and Practices. New York, NY: McGraw-Hill, 1985.
3. J.R. Storey, A. Vincent, and R. Fitzgerald, “A description of the broadcast telidon system,” IEEE Trans. Consumer Electron., vol. CE-26, no. 3, 1980.
4. P. Mothersole,” New information systems using the domestic television receiver,” Proc. Inst. Elec. Eng., vol. 126, no. 12, 1979.
5. A.J. Ball, G.V. Bochmann, and J. Gecsei, “Videotex networks,” Computer, vol. 13, no. 12, pp. 8–14, Dec. 1980.
6. F.W. Tompa, J. Gecsei, and G.V. Bochmann, “Data structuring facilities for interactive videotex systems,” Computer, vol. 14, no. 8, pp. 72–81, Aug. 1981.
7. M. Sugimoto, M. Taniguchi, S. Yokoi, and H. Hata, “Videotex: advancing to higher bandwidth,” IEEE Commun. Mag., vol. 26, no. 2, pp. 22–30, Feb. 1988.
8. G.D. Ott and J.L. Strand, “Videotex tutorial,”]. Telecommunication Networks, vol. 2, no. 3, pp. 385–398, 1983.
9. M.L. Ellis, G.W. Gates, J.M. Smith, G.L. Peckham, and H.P. Gray, “INDAX: an operational interactive cabletext systern,” IEEE J. Selected Areas Commun., vol. SAC-1, no. 2, pp. 285–294, Feb. 1983.
10. R.A. von Vignau, “Bildschirmtext and the CEPT videotex system,” IEEE J. Selected Areas Commun., vol. SAC-1, no. 2, pp. 254–259, Feb. 1983.
11. S. Harashima, T. Kumamoto, and T. Kitamma, “Japanese videotex system captain-experimental service and user outline,” IEEE Trans. Commun., vol. COM-29, no. 12, Dec. 1981.
12. D.K. Gifford, J.M. Lucassen, and S.T. Berlin, “The application of digital broadcast communication to large-scale information systems,” IEEE J. Selected Areas Commun., vol. SAC-3, no. 3, pp. 457–467, May 1985.
13. J. Hedger and R. Eason, “Telesoftware: adding intelligence to teletext,” Proc. Inst. Elec. Eng., vol. 126, Dec. 1979.
14. C. Herman, C. Copal, K.C. Lee, and A. Weinrib, “The data-cycle architecture for very high throughput database systems,” in Proc. ACM SICMOD International Conf. on Management of Data, (San Francisco, CA), pp. 97–103, 1987.
15. G. Robinson and W. Loveless, “Touch-tone teletext: a combined teletext-viewdata system,” IEEE Trans. Consumer Electron., vol. CE-25, no. 3, pp. 298–303, July 1979.
16. M.H. Ammar and J.W. Wong, “On the optimality of cyclic transmission in teletext systems,” IEEE Trans. Commun., vol. COM-35, no. 1, pp. 68–73, Jan. 1987.
17. C. Derman, “On sequential decisions and Markov processes,” Management Sci., vol. 9, 1962.
18. M.H. Ammar and J.W. Wong, “The design of teletext broadcast cycles,” Performance Evaluation, vol. 5, no. 4, pp. 235–242, Dec. 1985.
19. G.K. Zipf, Human Behavior and the Principle of Least Effort. Reading, MA: Addison-Wesley, 1949.
20. M.H. Ammar, “Teletext-like information delivery using broadcast polling,” Computer Networks and ISDN Systems, vol. 12, no. 2, pp. 107–115, 1986.
21. M.H. Ammar, “Response time in a teletext system: an individual user's perspective,” IEEE Trans. Commun., vol. COM-35, no. 11, pp. 1159–1170, Nov. 1987.
22. R.R. Muntz, “Analytic modeling of interactive systems,” Proc. IEEE, vol. 63, June 1975.
23. J.W. Wong and M.H. Ammar, “Analysis of broadcast delivery in a videotex system,” IEEE Trans. Comput., vol. C-34, no. 9, pp. 863–866, Sept. 1985.
24. S.S. Lam, “Queueing networks with population size constraints,” IBM J. Res. Develop., vol. 21, no. 7, pp. 370–378, July 1977.
25. J.P. Buzen, “Computational algorithms for closed queueing networks with exponential servers,” Commun. ACM, vol. 16, no. 9, pp. 527–531, Sept. 1973.
26. L. Kleinrock, Queueing Systems Vol. 1: Theory. New York, NY: Wiley Interscience, 1975.
27. H.D. Dykeman, M.H. Ammar, and J.W. Wong, “Scheduling algorithms for videotex systems under broadcast delivery,” in Proc. International Conf. on Communications, (Toronto, Canada), pp. 1847–1851, 1986.
28. R.A. Howard, Dynamic Programming and Markov Processes. Cambridge, MA: M.I.T. Press, 1960.
29. J.W. Wong and H.D. Dykeman, “Architecture and performance of large scale information delivery networks,” in Proc. 12th International Teletraffic Congress, (Torino, Italy), 1988.
30. P.J. Denning, “Effects of scheduling on file memory operations,” AFIPS Joint Computer Conference Proceedings, vol. 30, pp. 9–21, 1967.
31. J.W. Wong and M.H. Ammar, “Response time performance of videotex systems,” IEEE J. Selected Areas Commun., vol. SAC-4, no. 7, pp. 1174–1180, Oct. 1986.
32. M. Reiser and H. Kobayashi, “Queueing network models with multiple closed chains: theory and computational algorithms,” IBM J. Res. Develop., vol. 19, pp. 283–294, 1975.
33. H.D. Dykeman and J.W. Wong, “A performance study of broadcast information delivery systems,” in Proc. IEEE Info-corn ′88, (New Orleans, LA), pp. 739–745, 1988.