This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Window Protocol for Transmission of Time-Constrained Messages
September 1990 (vol. 39 no. 9)
pp. 1186-1203

The authors propose and study a window protocol suitable for transmitting time-constrained messages in a multiaccess network. The protocol differs from traditional window protocols in that it explicitly takes time constraints into account. The window is formed on the basis of the latest time to send a message (LS). A major advantage of the window protocol is that a newly arriving message is immediately considered for transmission if its LS is less than that of all pending messages in the system. As a result, the protocol closely approximates the optimal minimum-laxity-first policy. A performance evaluation through simulation shows that the protocol performs well in a wide range of environments, including under overloaded conditions.

[1] N. Abramson, "The ALOHA System--Another alternative for computer communications," inAFIPS Proc. Fall Joint Comput., 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," inProc. IEEE Int. Commun. Conf., 1982.
[6] L. W. Hansen and M. Schwartz, "An assigned-slot listen-before-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, Aug. 1978.
[8] J. Y. Juang and B. W. Wah, "Unifies window protocols for contention resolution in local multi-access networks," inProc. Third Annu. Joint Conf. IEEE Comput. Commun. Soc., Apr. 1984.
[9] E. D. Jensen, C. D., Locke, and H. Tokuda, "A time-driven scheduling model for real-time operating systems," inProc. IEEE Real-Time Syst. Symp., Dec. 1985.
[10] L. Kleinrock, "Packet switching in radio channels: Part 1--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," inProc. 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 in a multiple access environment," inProc. 8th IEEE Int. Data Commun. Symp., 1983.
[14] J. F. Kurose, "Time-constrained communication in multiple accesses networks," Ph.D. dissertation, Columbia Univ., 1984.
[15] J. S. Meditch and D. H. Yin, "Performance analysis of virtual time CSMA," inProc. IEEE Infocom '86, Apr. 1986.
[16] J. Misra, "Distributed discrete-event simulation,"Comput. Surveys, vol. 18, no. 1, Mar. 1986.
[17] A. K. Mok and M. L. Dertouzos, "Multiprocessor scheduling in a hard real-time environment," inProc. Seventh Texas Conf. Comput. Syst., Nov. 1978.
[18] A. K. Mok and S. A. Ward, "Distributed broadcast channel access,"Comput. Network, 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, MA, May 1983.
[20] M. L. Molle, "Unifications and extensions of the multiple access communications problem," Ph.D. dissertation, Univ. of California at Los Angeles, July 1981.
[21] M. L. Molle and L. Kleinrock, "Virtual time CSMA: 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,"J. ACM, vol. 35, no. 4, Oct. 1988.
[23] S. Panwar, "Time constrained and multiaccess communications," Ph.D. dissertation, Univ. of Massachusetts at Amherst, Feb. 1986.
[24] K. Ramamritham, "Channel characteristics in local area hard real-time systems,"Comput. Networks ISDN Syst., vol. 3, no. 13, 1987.
[25] E. H. Rothauser and D. Wild, "MLMA--A collision-free multi-access method," inProc. IFIP Congr. 77, 1977.
[26] M. Scholl, "Multiplexing techniques for data transmission over packet switched radio systems," Ph.D. dissertation, Univ. of California at Los Angeles, 1976.
[27] K. C. Sevcik and M. J. Johnson, "Cycle time properties of the FDDI token ring protocol,"IEEE Trans. Software Eng., vol. SE-13, no. 3, pp. 376-385, Mar. 1987.
[28] J. A. Stankovic, "A perspective on distributed computer systems,"IEEE Trans. Comput., vol. C-33, no. 12, Dec. 1984.
[29] J. A. Stankovic, "Misconceptions about real-time computing,"IEEE Comput. Mag., Oct. 1988.
[30] A. S. Tanenbaum,Computer Networks, Englewood Cliffs, NJ: Prentice-Hall, 1981.
[31] D. Towsley and G. Venkatesh, "Window random access protocols for local computer networks,"IEEE Trans. Comput., vol. C-31, no. 8, Aug. 1982.
[32] B. W. Wah and J. Y. Juang, "An efficient protocol for load balancing on CSMA/CD networks," inProc. Eighth Conf. Local Comput. Networks, Oct. 1983.
[33] Y. Yemini, "On the channel sharing in discrete-time packet switched, multiaccess broadcast communication," Ph.D. dissertation, Univ. of California at Los Angeles, 1978.
[34] W. Zhao and K. Ramamritham, "Virtual time CSMA protocols for hard real-time communication,"IEEE Trans. Software Eng., vol. SE-13, no. 8, Aug. 1987.
[35] W. Zhaoet al., "Performance evaluation of a window protocol for hard real-time communication," Tech. Rep., Dep. Comput. Inform. Sci., Univ. of Massachusetts, Aug. 1987.
[36] W. Zhao, "Using the continuous simulation clock to control the discrete distributed simulation," inProc. 21st Simulation Conf., Mar. 1988.
[37] T. Znati and L. Ni, "A prioritized multiaccess protocol for distributed real-time applications," inProc. IEEE 7th Int. Conf. Distributed Comput. Syst., Sept. 1987.

Index Terms:
window protocol; time-constrained messages; multiaccess network; performance evaluation; computer networks; multi-access systems; protocols.
Citation:
W. Zhao, J.A. Stankovic, K. Ramamritham, "A Window Protocol for Transmission of Time-Constrained Messages," IEEE Transactions on Computers, vol. 39, no. 9, pp. 1186-1203, Sept. 1990, doi:10.1109/12.57059
Usage of this product signifies your acceptance of the Terms of Use.