Controlling Window Protocols for Time-Constrained Communication in Multiple Access Networks

IEEE Transactions on Communications

Volumn 36, Issue 1, 1988, Pages 41-49

  Yemini, Yechiam ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS - PROTOCOLS; COMPUTER SIMULATION; MULTIPLEXING, TIME DIVISION; PROBABILITY;

MULTIPLE ACCESS NETWORKS; RANDOM ACCESS PROTOCOL; SEMI-MARKOV DECISION MODEL; TIME-CONSTRAINED COMMUNICATION; WINDOW PROTOCOLS;

DIGITAL COMMUNICATION SYSTEMS;

EID: 0023867794     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.2727     Document Type: Article

References (31)

1. F. Baccelli, P. Boyer, and G. Hebuternc, “Single-server queues with impatient customers,” Adv. Appl. Prob., vol. 16, pp. 887-905, 1984.
2. J. Capetanakis, “Generalized TDM A: The multiaccessing tree protocol,” IEEE Trans. Commun., vol. COM-27, pp. 1476-1484, Oct. 1979.
3. E. Coffman, Computer and Job Shop Scheduling. New York: Wiley Interscience, 1976.
4. Workshop on Distributed Sensor Networks, M.I.T. Lincoln Lab., Lexington, MA, 1982.
5. D. Cohen, “Using local area networks for carrying online voice,” in Local Computer Networks. Amsterdam: North-Holland, 1982, pp. 13-21.
6. G. Caviello, “Comparative discussion of circuit-versus packet-switched voice, “ IEEE Trans. Commun., vol. COM-27, pp. 1153-1159, Aug. 1979.
7. B. Doshi and H. Heffes, “Overload performance of several processor queueing disciplines for the M /M/1 queue, “ IEEE Trans. Commun., vol. COM-34, pp. 538-546, June 1986.
8. J. W. Forgie, “Speech transmission in store and forward networks,” in Proc. NCC 1975, pp. 137-142.
9. R. Gallager, “Conflict resolution in random access broadcast networks,” in Proc. AFOSR Workshop Commun. Theory Appl., Provincetown, MA, Sept. 1978, pp. 74-76.
10. ——,”A perspective on multiaccess channels,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 124-142, Mar. 1985.
11. B. Gavish and P. Schweitzer, “The Markovian queue with bounded waiting time,” Management Sci., vol. 23, pp. 1349-1357, Aug. 1977.
12. T. Gonsalves, “Packet invoice communication on an Ethernet local computer network: An experimental study,” in Proc. ACM Commun. Architectures and Protocols, Austin, TX, Aug. 1983, pp. 178-185.
13. J. F. Hayes, “An adaptive technique for local distribution,” IEEE Trans. Commun., vol. COM-26, pp. 1178-1186, Aug. 1978.
14. R. Howard, Dynamic Probabilistic System. New York: Wiley, 1971.
15. D. Johnson and G. O’Leary, “A local access network for packetized digital voice communication,” IEEE Trans. Commun., vol. COM-29, pp. 679-688, May 1981.
16. B. Kim, “Characteristics of arrival statistics of multiplexed voice packets,” IEEE J. Select. Areas Commun., vol. SAC-1, pp. 1133-1139, Dec. 1983.
17. L. Kleinrock, Queueing Systems, vol. 1: Theory. New York: Wiley Interscience, 1975.
18. J. F. Kurose and M. Schwartz, “A family of window protocols for time-constrained applications in CSMA networks,” in Proc. I NFO COM ‘83, San Diego, CA, Apr. 1983, pp. 405-413.
19. J. F. Kurose, M. Schwartz, and Y. Yemini, “Multiple access protocols nad time-constrained communication,” ACM Comput. Surveys, vol. 16, pp. 43-70, Mar. 1984.
20. J. F. Kurose, “Time-constrained communication in multiple access networks,” Dep. Compt. Sci., Columbia Univ., New York, NY, Tech. Rep., May 1984.
21. S. S. Lam and L. Kleinrock, “Packet switching in a multiaccess broadcast channel: Dynamic control procedures,” IEEE Trans. Commun., vol. COM-23, pp. 891-904, Sept. 1975.
22. J. Massey, “Collision resolution algorithms and random access communications,” in Multi-User Communications. New York: Springer-Velag, 1981, pp. 73-137.
23. J. Mosely and P. Humblet, “A class of efficient collision resolution algorithms for multiple access,” IEEE Trans. Commun., vol. COM-33, Feb. 1985.
24. M. Molle, “Asynchronous multiple access tree algorithms,” in Proc. 1983 ACM Commun. Architectures and Protocols, pp. 214-219.
25. M. Molle and L. Kleinrock, “Virtual-time CSMA: Why two clocks are better than one,” IEEE Trans. Commun., vol. COM-23, pp. 919-934, Sept. 1985.
26. R. Pokress, Ed., Special Issue on Integrated Services Digital Networks, IEEE Commun. Mag., Jan. 1984.
27. J. Shoch, “Carrying voice traffic through an Ethernet local network: A general overview,” in Local Networks for Computer Communications. Amsterdam; North-Holland, 1981, pp. 429-446.
28. M. Sloman and S. Prince, “Local network architecture for process control,” in Local Networks for Computer Communications. Amsterdam: North-Holland, 1981, pp. 407-427.
29. F. Tobagi, “Multiaccess protocols in packet communication system,” IEEE Trans. Commun., vol. COM-28, pp. 468-488, Apr. 1980.
30. B. Tsybakov, “Survey of USSR contributions to random multiple access communications,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 143-165, Mar. 1985.
31. C. Weinstein and J. Forgie, “Experience with speech communication in packet networks,” IEEE J. Select. Areas Commun., vol. SAC-1, pp. 963-980, Dec. 1983.