Skip to main content
Log in

Hard real-time communication in multiple-access networks

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

With the increasing use of distributed hard real-time systems, the ability of computer networks to handle hard real-time message traffic is becoming more important. For traditional networks, maximizing the throughput or minimizing the average message delay is the most important performance criteria. In the hard real-time domain, however, concern focuses on satisfying the time constraints of individual messages. This paper examines recent developments in hard real-time communication in local area multiple-access networks. Two general strategies are used in hard real-time communication: the guarantee strategy and the best-effort strategy. In the former, messages are guaranteed to meet their deadlines during normal operation of the network. In the best-effort strategy, the network will attempt to send messages before their deadlines, but no guarantees are given. Real-time message traffic can be distinguished according to whether it is best suited for the guarantee strategy or the best-effort strategy. Although this paper concentrates on multiple-access networks, many of the concepts presented and lessons learned are also applicable to other types of networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agrawal, G., B. Chen, W. Zhao, and S. Davari. 1992. Guaranteeing synchronous message deadlines in high speed token ring networks with timed token protocol. InProceedings of the 12th IEEE International Conference on Distributed Computing Systems, pages 468–475.

  • Agrawal, G., B. Chen, and W. Zhao. 1993. Local synchronous capacity allocation schemes for guaranteeing message deadlines with the timed token protocol. InProceedings of INFOCOM '93, pages 186–193.

  • ANSI Standard X3T9.5/88–139, Rev 4.0. 1990.FDDI Media Access Control (MAC).

  • ANSI/IEEE Standard 802.4-1985. 1985.Token-Passing Bus Access Method and Physical Layer Specifications.

  • Arvind, K. 1989. A new probabilistic algorithm for clock synchronization. Technical Report 88-81, Department of Computer and Information Science, University of Massachusetts at Amherst.

  • Arvind, K., K. Ramamritham, and J. A. Stankovic. 1991a. Window MAC protocols for real-time communication services. Technical Report 90–127, Department of Computer and Information Science, University of Massachusetts at Amherst.

  • Arvind, K., K. Ramamritham, and J. A. Stankovic. 1991b. A local area network architecture for communication in distributed real-time systems.Journal of Real-Time Systems, 3(2):115–147.

    Google Scholar 

  • Arvind, K. 1991.Protocols for Distributed Real-Time Systems. PhD thesis, Department of Computer and Information Science, University of Massachusetts at Amherst.

  • Bhargava, A., J. F. Kurose, and D. Towsley. 1988. A hybrid media access protocol for high-speed ring networks.IEEE Transactions on Selected Areas in Communications, 6(6):924–933.

    Google Scholar 

  • Bially, T., B. Gold, and S. Seneff. 1980. A technique for adaptive voice flow control in integrated packet networks.IEEE Transactions on Communications, COM-28(3):325–333.

    Google Scholar 

  • Chen, B., G. Agrawal, and W. Zhao. 1992. Optimal synchronous capacity allocation for hard real-time communications with the timed token protocol. InProceedings of the IEEE Real-Time Systems Symposium, pages 198–207.

  • Chlamtac, I., and A. Ganz. 1988. A multibus train communication (AMTRAC) architecture for high-speed fiber optic networks.IEEE Transactions on Selected Areas in Communications, 6(6):903–912.

    Google Scholar 

  • Ciminiera, L., P. Montuschi, and A. Valenzano. 1989. Some properties of double-ring networks with real-time constraints. InProceedings of the IEEE Real-Time Systems Symposium, pages 360–368.

  • Clark, D. D., S. Shenker, and L. Zhang. 1992. Supporting real-time applications in an integrated services packet network: Architecture and mechanism. InProceedings of ACM SIGCOMM'92, pages 14–26.

  • Cristian, F. 1989. Probabilistic clock synchronization.Distributed Computing, 3:146–158.

    Google Scholar 

  • de Prycker, M. 1991.Asynchronous Transfer Mode: Solution for Broadband ISDN. Ellis Horwood.

  • Dolev, D., J. Y. Halpern, and H. R. Strong. 1986. On the possibility and impossibility of achieving clock synchronization.Journal of Computer and System Sciences, 32:230–250.

    Google Scholar 

  • Ferrari, D., and D. C. Verma. 1990. A scheme for real-time channel establishment in wide-area networks.IEEE Journal on Selected Areas in Communications, SAC-8(3):368–379.

    Google Scholar 

  • Ghanbari, M. 1989. Two-layer coding of video signals for VBR networks.IEEE Journal on Selected Areas in Communications, 7(5):771–781.

    Google Scholar 

  • Green, D. T., and D. T. Marlow. 1989. SAFENET — a LAN for navy mission critical systems. InProceedings of the IEEE Conference on Local Computer Networks, pages 340–346.

  • Grow, R. M. 1982. A timed token protocol for local area networks. InProceedings of Electro/82, Token Access Protocols, paper 17/3.

  • Hong, J., X. Tan, and D. Towsley. 1989. A performance analysis of minimum laxity and earliest deadline scheduling in a real-time system.IEEE Transactions on Computers, 38(12):1736–1744.

    Google Scholar 

  • Hwang, R.-H., J. F. Kurose, and D. Towsley. 1992. The effect of processing delay and QOS requirements in high speed networks. InProceedings of IEEE Infocom'92, pages 160–169.

  • IEEE Standard 802.5-1989. 1989.Token Ring Access Method and Physical Layer Specifications.

  • Jain, R. 1991. Performance analysis of FDDI token ring networks: Effect of parameters and guidelines for setting TTRT.IEEE LTS, 2(2):16–22.

    Google Scholar 

  • Jayasumana, A. P., and G. G. Jayasumana. 1989. On the use of the IEEE 802.4 token bus in distributed real-time control systems.IEEE Transactions on Industrial Electronics, 36(3):391–397.

    Google Scholar 

  • Johnson, M. J. 1987. Proof that timing requirements of the FDDI token ring protocols are satisfied.IEEE Transactions on Communications, COM-35(6):620–625.

    Google Scholar 

  • Kalmanek, C. R., H. Kanakia, and S. Keshav. 1990. Rate controlled servers for very high-speed networks. InProceedings of IEEE Global Telecommunications Conference, pages 300.3.1–300.3.9.

  • Kamat, S., and W. Zhao. 1993. Real-time schedulability of two token ring protocols. InProceedings of the IEEE International Conference on Distributed Computing Systems, pages 347–354.

  • Kamat, S., G. Agrawal, and W. Zhao. 1994. On available bandwidth in FDDI-based reconfigurable networks. To appear inProceedings of IEEE Infocom'94.

  • Kandlur, D. D., K. G. Shin, and D. Ferrari. 1991. Real-time communication in multi-hop networks. InProceedings of the 11th International Conference on Distributed Computing Systems, pages 300–307.

  • Karlsson, G., and M. Vetterli. 1989. Packet video and its integration into the network architecture.IEEE Journal on Selected Areas in Communications, 7(5):739–751.

    Google Scholar 

  • Kim, B. G., and D. Towsley. 1986. Dynamic flow control protocols for packet-switching multiplexers serving real-time multipacket messagers.IEEE Transactions on Communications, COM-34(4):348–356.

    Google Scholar 

  • Klein, M. H., J. P. Lehoczky, and R. Rajkumar. 1994. Rate-Monotonic Analysis for Real-Time Industrial Computing.IEEE Computer, 27(1):24–33.

    Google Scholar 

  • Kleinrock, L. 1985. Distributed systems.Communications of the ACM, 28(11):1200–1213.

    Google Scholar 

  • Kleinrock, L. 1992. The latency/bandwidth tradeoff in gigabit networks.IEEE Communications Magazine, 30(4):36–40.

    Google Scholar 

  • Kopetz, H., and G. Grünsteidl. 1994. TTP — A Protocol for Fault-Tolerant Real-Time Systems.IEEE Computer, 27(1):14–23.

    Google Scholar 

  • Kopetz, H., and W. Ochsenreiter. 1987. Clock synchronization in distributed real-time systems.IEEE Transactions on Computers, 36(8):933–940.

    Google Scholar 

  • Krishna, C. M., and Y. H. Lee, editors. 1991. Special issue on real-time systems.IEEE Computer, 24(5).

  • Kung, H. T. 1992. Gigabit local area networks: A systems perspective.IEEE Communications Magazine, pages 79–89.

  • Kurose, J. F., M. Schwartz, and Y. Yemini. 1984. Multiple-access protocols and time constrained communication.Computing Surveys, 16(1):43–70.

    Google Scholar 

  • Kurose, J. F., M. Schwartz, and Y. Yemini. 1988. Controlling window protocols for time-constrained communication in multiple access networks.IEEE Transactions on Communications, 36(1):41–49.

    Google Scholar 

  • Kurose, J. F. 1984.Time-Constrained Communication in Multiple Access Networks. PhD thesis, Department of Computer Science, Columbia University.

  • Lamport, L., and P. M. Melliar-Smith. 1985. Synchronizing clocks in the presence of faults.Journal of the Association for Computing Machinery, 32(1):52–78.

    Google Scholar 

  • Lehoczky, J. P. 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines. InProceedings of the IEEE Real-Time Systems Symposium, pages 201–209.

  • Lehoczky, J. P., and L. Sha. 1986. Performance of real-time bus scheduling algorithms.ACM Performance Evaluation Review, 14(1):44–53.

    Google Scholar 

  • Lehoczky, J. P., L. Sha, and Y. Ding. 1989. The rate monotonic scheduling algorithm: Exact characterization and average case behavior. InProceedings of the IEEE Real-Time Systems Symposium, pages 166–171.

  • Leung, J. Y.-T., T. W. Tam, and G. H. Young. 1990. On-line routing of real-time messages. InProceedings of the IEEE Real-Time Systems Symposium, pages 126–135.

  • Lim, C.-C., L.-J. Yao, and W. Zhao. 1991. A comparative study of three token ring protocols for real-time communications. InProceedings of the 11th IEEE International Conference on Distributed Computing Systems, pages 308–317.

  • Lim, C.-C., L.-J. Yao, and W. Zhao. 1992. Transmitting time-dependent multimedia data in FDDI networks. InProceedings SPIE International Symposium, OE/FIBERS'92, pages 144–153.

  • Liu, C. L., and J. W. Layland. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment.Journal of the Association for Computing Machinery, 20(1):46–61.

    Google Scholar 

  • Liu, J. W. S., K.-J. Lin, W.-K. Shih, A. C.-S. Yu, J.-Y. Chung, and W. Zhao. 1991. Algorithms for scheduling imprecise computations.IEEE Computer, 24(5):58–68.

    Google Scholar 

  • Liu, M. T. 1978. Distributed loop computer networks.Advances in Computers, 17:163–221.

    Google Scholar 

  • Lundelius, J., and N. Lynch. 1984. An upper and lower bound for clock synchronization.Information and Control, 62(2/3):190–204.

    Google Scholar 

  • Malcolm, N., and W. Zhao. 1991. Version selection schemes for hard real-time communications. InProceedings of the IEEE Real-Time Systems Symposium, pages 12–21.

  • Malcolm, N., and W. Zhao. 1993. Guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. InProceedings of the IEEE Conference on Local Computer Networks, pages 186–195.

  • Malcolm, N., and W. Zhao. 1994.Hard real-time communication in local area networks. To be published by Kluwer Academic Publishers.

  • Malcolm, N., W. Zhao, and C. Barter. 1990. Guarantee protocols for communication in distributed real-time systems. InProceedings of IEEE Infocom'90, pages 1078–1086.

  • Mok, A. K., and S. A. Ward. 1979. Distributed broadcast channel access.Computer Networks, 3(5):327–335.

    Google Scholar 

  • Molle, M. L., and L. Kleinrock. 1985. Virtual time CSMA: Why two clocks are better than one.IEEE Transactions on Communications, COM-33(9):919–933.

    Google Scholar 

  • Montuschi, P., L. Ciminiera, and A. Valenzano. 1992. Time characteristics of IEEE 802.4 token bus protocol.IEE Proceedings-E, 139(1):81–87.

    Google Scholar 

  • Mukherjee, S., D. Saha, M. C. Saksena, and S. K. Tripathi. 1993. A bandwidth allocation scheme for time constrained message transmission on a slotted ring LAN. InProceedings of the IEEE Real-Time Systems Symposium, pages 44–53.

  • Ng, J. K. Y., and J. W. S. Liu. 1991. Performance of local area network protocols for hard real-time applications. InProceedings of the 11th International Conference on Distributed Computing Systems, pages 318–326.

  • Niehaus, D., E. M. Nahum, J. A. Stankovic, and K. Ramamritham. 1992. Architecture and OS support for predictable real-time systems. Personal communication.

  • Paige, J. L. 1990. SAFENET — a navy approach to computer networking. InProceedings of the IEEE Conference on Local Computer Networks, pages 268–273.

  • Pang, J., and F. A. Tobagi. 1989. Throughput analysis of a timer controlled token passing protocol under heavy load.IEEE Transactions on Communications, 37(7):694–702.

    Google Scholar 

  • Panwar, S. S., and D. Towsley. 1988. On the optimality of the STE rule for multiple server queues that serve customers with deadlines. Technical Report 88-81, Department of Computer and Information Science, University of Massachusetts at Amherst.

  • Panwar, S. S., D. Towsley, and J. K. Wolf. 1988. Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service.Journal of the Association for Computing Machinery, 35(4):832–844.

    Google Scholar 

  • Pleinevaux, P. 1992. An improved hard real-time scheduling for the IEEE 802.5.The Journal of Real-Time Systems, 4(2):99–112.

    Google Scholar 

  • Pradhan, D. K., editor. 1986.Fault-Tolerant Computing: Theory and Techniques. Prentice-Hall, volume 1.

  • Ramamritham, K. 1987. Channel characteristics in local-area hard real-time systems.Computer Networks and ISDN Systems, 13(1):3–13.

    Google Scholar 

  • Ramanathan, P., D. D. Kandlur, and K. G. Shin. 1990a. Hardware-assisted software clock synchronization for homogeneous distributed systems.IEEE Transactions on Computers, 39(4):514–524.

    Google Scholar 

  • Ramanathan, P., K. G. Shin, and R. W. Butler. 1990b. Fault-tolerant clock synchronization in distributed systems.IEEE Computer, 23(10):33–42.

    Google Scholar 

  • Scholl, F. W., and M. H. Coden. 1988. Passive optical star systems for fiber optic local area networks.IEEE Transactions on Selected Areas in Communications, 6(6):913–923.

    Google Scholar 

  • Schulzrinne, H., J. F. Kurose, and D. Towsley. 1990. Congestion control for real-time traffic in high-speed networks. InProceedings of IEEE Infocom'90, pages 543–550.

  • Schwartz, M. 1987.Telecommunication Networks: Protocols, Modeling and Analysis. Addison-Wesley.

  • Sha, L., R. Rajkumar, and J. Lehoczky. 1990. Real-time scheduling support in Futurebus+. InProceedings of the IEEE Real-Time Systems Symposium, pages 331–340.

  • Sha, L, editor. 1994. Special issue on industrial computing.IEEE Computer, 27(1).

  • Sha, L., S. S. Sathaye, and J. K. Strosnider. 1992. Scheduling real-time communication on dual-link networks. InProceedings of the IEEE Real-Time Systems Symposium, pages 188–197.

  • Shih, W. K., J. W. S. Liu, and C. L. Liu. 1993. Modified rate-monotonic algorithm for scheduling periodic jobs with deferred deadlines.IEEE Transactions on Software Engineering, 19(12):1171–1179.

    Google Scholar 

  • Shin, K. G, editor. 1987. Special issue on real-time systems.IEEE Transactions on Computers, 36(8).

  • Shin, K. G., and C.-J. Hou. 1990. Analysis of three contention protocols in distributed real-time systems. InProceedings of the IEEE Real-Time Systems Symposium, pages 136–145.

  • Shin, K. G., and Q. Zheng. 1993. Mixed time-constrained and non-time-constrained communications in local area networks.IEEE Transactions on Communications, 41(11):1668–1676.

    Google Scholar 

  • Stallings, W. 1991.Data and Computer Communications. Macmillan, 3rd edition.

  • Stankovic, J. A. 1984. A perspective on distributed computer systems.IEEE Transactions on Computers, C-33(12):1102–1115.

    Google Scholar 

  • Stankovic, J. A. 1988. Misconceptions about real-time computing: A serious problem for next generation systems.IEEE Computer, 21(10):10–19.

    Google Scholar 

  • Stankovic, J. A., D. Niehaus, and K. Ramamritham. 1991a. SpringNet: A scalable architecture for high performance, predictable, and distributed real-time computing. Technical Report 91-74, Department of Computer and Information Science, University of Massachusetts at Amherst.

  • Stankovic, J. A., D. Niehaus, and K. Ramamritham. 1991b. SpringNet: A scalable architecture for high performance, predictable, and distributed real-time computing. InWorkshop on Architecture Supports for Real-Time Systems, pages 11–16.

  • Stankovic, J. A., and K. Ramamritham, editors. 1988.Hard Real-Time Systems. IEEE Computer Society Press.

  • Stankovic, J. A., and K. Ramamritham, editors. 1993.Advances in Real-Time Systems. IEEE Computer Society Press.

  • Stankovic, J. A., and K. Ramamritham. 1989. The Spring Kernel: A new paradigm for real-time operating systems.Special Issue on Real-Time Operating Systems, ACM Operating System Review, 23(3):54–71.

    Google Scholar 

  • Strosnider, J. K., and D. Katcher. 1991. Bridging the gap between scheduling theory and reality.Office of Naval Research, Fourth Annual Review and Workshop, Foundations of Real-Time Computing.

  • Strosnider, J. K., and T. E. Marchok. 1989. Responsive, deterministic IEEE 802.5 token ring scheduling.Journal of Real-Time Systems, 1(2):133–158.

    Google Scholar 

  • Strosnider, J. K., T. Marchok, and J. Lehoczky. 1988. Advanced real-time scheduling using the IEEE 802.5 token ring. InProceedings of the IEEE Real-Time Systems Symposium, pages 42–52.

  • Strosnider, J. K. 1988.Highly Responsive Real-Time Token Rings. PhD thesis, Department of Electrical and Computer Engineering, Carnegie Mellon University.

  • Tindell, K. 1993. Holistic schedulability analysis for distributed hard real-time systems. Technical Report YCS 197, Department of Computer Science, University of York.

  • Tanenbaum, A. S. 1988.Computer Networks. Prentice-Hall, Inc., 2nd edition.

  • Teener, M., and R. Gvozdanovic. 1989. FDDI-II operation and architecture. InProceedings of the IEEE Conference on Local Computer Networks, pages 49–61.

  • Tobagi, F. A., F. Borgonovo, and L. Fratta. 1983. ExpressNet: A high performance integrated-services local area network.IEEE Transactions on Selected Areas in Communications, SAC-1(5):898–913.

    Google Scholar 

  • Tokuda, H., C. W. Mercer, Y. Ishikawa, and T. E. Marchok. 1989. Priority inversions in real-time communication. InProceedings of the IEEE Real-Time Systems Symposium, pages 348–359.

  • Trajković, L., and S. J. Golestani. 1992. Congestion control for multimedia services.IEEE Network, 6(5):20–26.

    Google Scholar 

  • Ulm, J. N. 1982. A timed token ring local area network and its performance characteristics. InProceedings of the IEEE Conference on Local Computer Networks, pages 50–56.

  • U.S. Department of Defense. 1994.Survivable Adaptable Fiber Optic Embedded Network (SAFENET). MILSTD-2204A.

  • van Tilborg, A. M., and G. M. Koob. 1991a.Foundations of Real-Time Computing: Formal Specifications and Methods. Kluwer Academic Publishers.

  • van Tilborg, A. M., and G. M. Koob. 1991b.Foundations of Real-Time Computing: Scheduling and Resource Management. Kluwer Academic Publishers.

  • Vetterli, M., and M. W. Garrett. 1990. Joint source channel coding for real time packet services. InProceedings of the Australian Video Communications Workshop, pages 136–145.

  • Volz, R. A., L. Sha, and D. Wilcox. 1991. Maintaining global time in Futurebus+.The Journal of Real-Time Systems, 3(1):5–17.

    Google Scholar 

  • Welch, J. L., and N. Lynch. 1988. A new fault-tolerant algorithm for clock synchronization.Information and Computation, 77(1):1–36.

    Google Scholar 

  • Wilkov, R. S. 1972. Analysis and Design of Reliable Computer Networks.IEEE Transactions on Communications, COM-20(6):660–678.

    Google Scholar 

  • Yamamoto, Y., and K. Takahashi. 1989. ATM network performance design covering video communications. InProceedings of the 4th ATERB Fast Packet Switching Workshop.

  • Yates, D., J. Kurose, D. Towsley, and M. G. Hluchyj. 1993. On per-session delay distributions and the call admission problem for real-time applications with QOS requirements. InProceedings of ACM SIGCOMM'93, pages 2–12.

  • Yao, L.-J. 1994.Real-time communications in token ring networks. PhD thesis, Department of Computer Science, University of Adelaide.

  • Yao, L.-J., and W. Zhao. 1991. Performance of an extended IEEE 802.5 protocol in hard real-time systems. InProceedings of IEEE Infocom'91, pages 469–478.

  • Yau, S, editor. 1989. Special issue on distributed computer systems.IEEE Transactions on Computers, 38(8).

  • Yemini, Y. 1983. A bang-bang principle for real-time transport protocols. InProceedings of ACM SIGCOMM'83, pages 262–268.

  • Zafirovic-Vukotic, M., I. G. Niemegeers, and D. S. Valk. 1988. Performance analysis of slotted ring protocols in HSLAN'S.IEEE Transactions on Selected Areas in Communications, 6(6):1011–1024.

    Google Scholar 

  • Zhang, H., and D. Ferrari. 1993. Rate-controlled static priority queueing. InProceedings of IEEE Infocom'93, pages 227–236.

  • Zhang, H., and S. Keshav. 1991. Comparison of rate-based service disciplines. InProceedings of ACM SIGCOMM'91, pages 113–121.

  • Zhang, L. 1990. Virtual clock: A new traffic control algorithm for packet switching networks. InProceedings of ACM SIGCOMM'90, pages 19–29.

  • Zhao, W. editor. 1989. Special issue on real-time operating systems.ACM Operating Systems Review, 23(3).

  • Zhao, W., C. Barter, and N. Malcolm. 1989. Virtual time CSMA protocols with two version message model for real-time communications. InProceedings of the 1989 IEEE International Conference on Networks, pages 295–300.

  • Zhao, W., and K. Ramamritham. 1986. A virtual time CSMA protocol for hard real-time communications. InProceedings of the IEEE Real-Time Systems Symposium, pages 120–127.

  • Zhao, W., and K. Ramamritham. 1987. Virtual time CSMA protocols for hard real-time communications.IEEE Transactions on Software Engineering, SE-13(8):938–952.

    Google Scholar 

  • Zhao, W., and J. A. Stankovic. 1989. Performance analysis of FCFS and improved FCFS scheduling algorithms for dynamic real-time computer systems. InProceedings of the IEEE Real-Time Systems Symposium, pages 156–165.

  • Zhao, W., J. A. Stankovic, and K. Ramamritham. 1988. A multi-access window protocol for time constrained communications. InProceedings of the 8th IEEE International Conference on Distributed Computing Systems, pages 384–392.

  • Zhao, W., J. A. Stankovic, and K. Ramamritham. 1990. A window protocol for transmission of time constrained messages.IEEE Transactions on Computers, 39(9):1186–1203.

    Google Scholar 

  • Zheng, Q., and K. G. Shin. 1992. Fault-tolerant real-time communication in distributed computing systems. InDigest of Papers, FTCS-22, pages 86–93.

  • Zheng, Q., and K. G. Shin. On the ability of establishing real-time channels in point-to-point packet-switched networks. To appear in IEEE Transactions on Communications.

  • Zheng, Q., and K. G. Shin. 1993. Synchronous bandwidth allocation in FDDI networks. InProceedings of ACM Multimedia'93, pages 31–38.

  • Ziegler, J. 1989. MIL-STD-1553 takes over serial data bus designs.Computer Design, 28(17):99–102.

    Google Scholar 

  • Zimmermann, H. 1981. OSI Reference Model — the ISO model of architecture for open systems interconnection.IEEE Transactions on Communication, COM-28(4):425–432.

    Google Scholar 

  • Znati, T. 1991. Deadline Driven Window Protocol for Transmission of Real-Time Traffic. InProceedings of the 10th IEEE International Conference on Computers and Communications, pages 667–673.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Malcolm, N., Zhao, W. Hard real-time communication in multiple-access networks. Real-Time Syst 8, 35–77 (1995). https://doi.org/10.1007/BF01893145

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01893145

Keywords

Navigation