Virtual Time CSMA Protocols for Hard Real-Time Communication

IEEE Transactions on Software Engineering

Volumn SE-13, Issue 8, 1987, Pages 938-952

  Zhao, Wei ^a   Ramamritham, Krithi ^b  

^a AMHERST COLLEGE   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

CSMA protocols; multiaccess networks; performance evaluation; real time communications; simulation; virtual time

Indexed keywords

COMPUTER SIMULATION;

REAL-TIME CLOCK; REAL-TIME COMMUNICATION; VIRTUAL TIME CSMA PROTOCOLS; VIRTUAL-TIME CLOCK; VIRTUAL-TIME PROTOCOLS;

COMPUTER NETWORKS;

EID: 0023399417     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1987.233512     Document Type: Article

References (33)

1. N. Abramson, “The ALOHA system-Another alternative for computer communications,” in AFIPS Proc. FJCC, vol. 37, 1970.
2. J. I. Capetanakis, “Tree algorithm for packet broadcast channels,” IEEE Trans. Commun., vol. COM-27, no. 10, Oct. 1979.
3. I. Chlamtac, W. R. Franta, and D. Levin, “BRAM: The broadcast recognizing access method,” IEEE Trans. Commun., vol. COM-27, no. 8, Aug. 1979.
4. G. Fayolle, P. Flajolet, M. Hofri, and P. Jacquet, “Analysis of a stack algorithm for random multiple-access communication,” IEEE Trans. Inform. Theory, vol. IT-31, No. 2, Mar. 1985.
5. A. Grami, K. Sochraby, and J. Hayes, “Further results on probing,” in Proc. IEEE Int. Commun. Conf., 1982.
6. L. W. Hansen and M. Schwardtz, “An assigned-slot listen-before-transmission transmission protocol for a multiaccess data channel,” IEEE Trans. Commun., vol. COM-27, no. 6, June 1979.
7. J. F. Hayes, “An adaptive technique for local distribution,” IEEE Trans. Commun., vol. COM-26, no. 8, 1978.
8. D. R. Jefferson, “Virtual time,” ACM Trans. Program. Lang. Syst., vol. 7, no. 3, July 1985.
9. E. D. Jensen, C. D. Locke, and H. Tokuda, “A time-driven scheduling model for real-time operating systems,” in Proc. IEEE Real-Time Time Systems Symp., Dec. 1985.
10. L. Kleinrock, “Packet switching in radio channels: Part I-Carrier sense multiple-access modes and their throughput-delay characteristics,” IEEE Trans. Commun., vol. COM-23, no. 12, Dec. 1975.
11. L. Kleinrock and Y. Yemini, “An optimal adaptive scheme for multiple access broadcast communication,” in Proc. ICC, 1978.
12. L. Kleinrock and M. O. Scholl, “Packet switching in radio channels: New conflict-free multiple access schemes,” IEEE Trans. Commun., vol. COM-28, no. 7, July 1980.
13. J. F. Kurose, M. Schwartz, and T. Yemini, “Controlling window protocols for time-constrained communication i n a multiple access environment,” in Proc. 8th IEEE Int. Data Communication Symp., 1983.
14. J. F. Kurose, “Time-constrained communication i n multiple accesses networks,” Ph.D. dissertation, Columbia Univ., New York, 1984.
15. L. Lamport, “Time, clocks, and the ordering of events in a distributed system, Commun. ACM, pp. 558–565, July 1978.
16. J. S. Meditch and D. H. Yin, “Performance analysis of virtual time CSMA,” in Proc. IEEE Infocom’86, Apr. 1986.
17. A. K. Mok and M. L. Dertouzos, “Multiprocessor scheduling in a hard real-time environment,” in Proc. Seventh Texas Conf. Computing Systems, Nov. 1978.
18. A. K. Mok and S. A. Ward, “Distributed broadcast channel access,” Comput. Networks, vol. 3, Nov. 1979.
19. A. K. Mok, “Fundamental design problems of distributed systems for the hard real-time environment,” Ph.D. dissertation, Massachusetts Inst. Technol., Cambridge, May 1983.
20. M. L. Molle, “Unifications and extensions of the multiple access communications problem,” Ph.D. dissertation, Univ. California at Los Angeles, July 1981.
21. M. L. Molle and L. Kleinrock, “Virtual time MSMA: Why two clocks are better than one,” IEEE Trans. Commun., vol. COM-33, no. 9, Sept. 1985.
22. S. Panwar, D. Towsley, and J. Wolf, “Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service,” submitted for publication.
23. S. Panwar, “Time constrained and multiaccess communications,” Ph.D. dissertation, Univ. Massachusetts at Amherst, Feb. 1986.
24. K. Ramamritham, J. A. Stankovic, and W. Zhao, “Distributed scheduling of hard real-time tasks under resource constraints in the Spring system,” IEEE Trans. Comput., submitted for publication, Nov. 1985.
25. K. Ramamritham, “Channel characteristics in local area hard real-time time systems,” Comput. Networks and ISDN Syst., 1987, to be published.
26. E. H. Rothauser and D. Wild, “MLMA-A collision-free multi access method,” in Proc. IFIP Congr. 77, 1977.
27. M. Scholl, “Multiplexing techniques for data transmission over packet switched radio systems,” Ph.D. dissertation, Univ. Califomia at Los Angeles, 1976.
28. J. A. Stankovic, “A perspective on distributed computer systems,” IEEE Trans. Comput., vol. C-33, no. 12, Dec. 1984.
29. A. A. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.
30. D. Towsley and G. Venkatesh, “Window random access protocols for local computer networks,” IEEE Trans. Comput., vol. C-31, no. 8, Aug. 1982.
31. Y. Yemini, “On the channel sharing in discrete-time packet switched, multiaccess broadcast communication,” Ph.D. dissertation, Univ. California at Los Angeles, 1978.
32. W. Zhao, “A heuristic approach to scheduling hard real-time tasks with resource requirements i n distributed systems,” Ph.D. dissertation, Univ. Massachusetts at Amherst, 1986.
33. W. Zhao and K. Ramamritham, “A virtual time CSMA protocol for hard real-time communication,” in Proc. IEEE Real-Time Systems Symp., Dec. 1986.