Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol | Real-Time Systems Skip to main content
Log in

Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol

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

Abstract

One of the key issues related to guaranteeing synchronous message deadlines in a timed token network (such as fiber distributed data interface) where the timed token medium access control protocol is used is the schedulability test of synchronous traffic (i.e., testing whether or not all synchronous messages can be transmitted before their deadlines, under a given setting of network parameters). Much work has been done on how to assign network parameters appropriately in order to guarantee timely transmission of synchronous traffic. As a result quite a few synchronous bandwidth allocation schemes and some good guidelines on selection of the target token rotation time have been proposed. In contrast, limited research has been conducted on how to effectively test whether or not given network parameters can guarantee timely transmission of all synchronous messages (of a considered synchronous message set) before their deadlines. The previous testing methods for synchronous message schedulability only provide a sufficient (but not necessary) test and therefore fail to always keep effective for any synchronous message set considered. In this paper, we propose two testing methods for determining the schedulability of a synchronous message set with message deadlines no longer than periods. The proposed tests perform better than any previous test in the sense that they are both sufficient and necessary. Some numerical examples are given to compare different testing methods, all of which have demonstrated the superiority of the proposed tests to other existing testing methods.

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

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Grow, R. M. 1982. A timed token protocol for local area networks. In Proceedings of the Electro'82, Token Access Protocols, Paper 17/3.

  2. Fibre distributed data interface (FDDI)—token ring media access control (MAC). ANSI Standard X3.139, 1987.

  3. Agrawal, G., Chen, B., Zhao, W., and Davari, S. 1994. Guaranteeing synchronous message deadlines with the timed token medium access control protocol. IEEE Transactions on Computers 43(3): 327-339.

    Google Scholar 

  4. Agrawal, G., Chen, B., and Zhao, W. 1993. Local synchronous capacity allocation schemes for guaranteeing message deadlines with the timed token protocol. In Proceedings of the IEEE Infocom'93.

  5. Chen, B., Agrawal, G., and Zhao, W. 1992. Optimal synchronous capacity allocation for hard real-time communications with the timed token protocol. In Proceedings of the IEEE RTSS'92, pp. 198-207.

  6. Han, C.-C., and Shin, K. G. 1995. A polynomial-time optimal synchronous bandwidth allocation scheme for the timed-token MAC protocol. In Proceedings of the IEEE Infocom'95, pp. 875-882.

  7. Malcolm, N. and Zhao, W. 1993. Guaranteeing synchronous messages with arbitrary deadline constraints in an FDDI network. In Proceedings of the IEEE Conference on Local Computer Networks, pp. 186-195.

  8. Zhang, S., and Burns, A. 1995. An optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed-token MAC protocol. IEEE/ACM Transactions on Networking 3(6): 729-741.

    Google Scholar 

  9. Zhang, S., and Burns, A. 1995. On the schedulability of synchronous message sets with the minimum message deadline less than 2 · TTRT in an FDDI network. In Proceedings of the 4th International Conference on Computer Communications and Networks (IC3N'95), Las Vegas, pp. 498-501.

  10. Zhang, S., and Burns, A. 1995. Guaranteeing synchronous message sets in FDDI networks. In Proceedings of the DCCS'95—13th IFAC Workshop on Distributed Computer Control Systems, Toulouse-Blagnac, France, pp. 107-112.

  11. Zhang, S., Burns, A., and Wellings, A. 1996. An efficient and practical local synchronous bandwidth allocation scheme for the timed-token MAC protocol. In Proceedings of the IEEE Infocom'96, San Francisco, 2, pp. 920-927.

    Google Scholar 

  12. Zhang, S., Cheng, T. H., Yang, H., Subramanian, K. R., Tan, C. H., and Zhang, L. 1997. Improving the normalized proportional allocation scheme for time-critical communication in FDDI networks. In Proceedings of the 1st International Conference on Information, Communication and Signal Processing, Singapore, 3, pp. 1436-1440.

    Google Scholar 

  13. Zheng, Q., and Shin, K. G. 1993. Synchronous bandwidth allocation in FDDI networks. In Proceedings of the ACM Multimedia'93, pp. 31-38.

  14. Hamdaoui, M., and Ramanathan, P. 1993. Selecting timed token protocol parameters to guarantee the deadlines of real-time messages. In Proceedings of the Workshop on Parallel and Distributed Real-Time Systems at the 7th International Parallel Processing Symposium, Newport Beach, California, USA, p. 110.

  15. Hamdaoui, M., and Ramanathan, P. 1995. Selection of timed token parameters to guarantee message deadlines. IEEE/ACM Transactions on Networking 3(3): 340-351.

    Google Scholar 

  16. Malcolm, N., and Zhao, W. 1994. The timed-token protocol for real-time communications. Computer 27(1): 35-41.

    Google Scholar 

  17. Agrawal, G., Chen, B., Zhao, W., and Davari, S. 1992. Guaranteeing synchronous message deadlines with the timed token protocol. In Proceedings of the 12th IEEE International Conference on Distributed Computing Systems.

  18. Zhang, S., Cheng, T. H., Subramanian, K. R., Zhang, L., and Tan, C. H. 1997. Testing the feasibility of synchronous bandwidth allocation for time-critical communication in FDDI networks. In Proceedings of the 6th International Conference on Computer Communications and Networks (IC3N'97), Las Vegas, USA, 326-331.

  19. Chen, B., and Zhao, W. 1992. Properties of the timed token protocol. Technical Report 92-038, Computer Science Department, Texas A&M University.

  20. Jain, R. 1994. FDDI Handbook—High-Speed Networking using Fiber and other Media. Addison-Wesley Publishing Company.

  21. Ross, F. E. 1989. An overview of FDDI: the fiber distributed data interface. IEEE Journal on Selected Areas in Communications 7(7): 1043-1051.

    Google Scholar 

  22. Ross, F. E. 1986. FDDI—A Tutorial. IEEE Communication Magazine 24(5): 10-17.

    Google Scholar 

  23. Zhang, S., and Burns, A. 1994. Timing properties of the timed token protocol. Technical Report (YCS 243), Department of Computer Science, University of York.

  24. Zhang, S., and Lee, E. S. 1999. The worst-case scenario for transmission of synchronous traffic in an FDDI network. In Proceedings of the IEEE LCN'99 (The 24th IEEE Annual Conference on Local Computer Networks, pp. 192-201.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, S., Burns, A., Mehaoua, A. et al. Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol. Real-Time Systems 22, 251–280 (2002). https://doi.org/10.1023/A:1014558418873

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014558418873

Navigation