Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol

  • Authors:
  • Jun Wang;Sijing Zhang;Carsten Maple;Zhengxu Zhao

  • Affiliations:
  • University of Bedfordshire, Faculty of Creative Arts, Technologies and Science, Institute for Research in Applicable Computing, Park Square, Luton, LU1 3JU, UK;University of Bedfordshire, Faculty of Creative Arts, Technologies and Science, Institute for Research in Applicable Computing, Park Square, Luton, LU1 3JU, UK;University of Bedfordshire, Faculty of Creative Arts, Technologies and Science, Institute for Research in Applicable Computing, Park Square, Luton, LU1 3JU, UK;University of Derby, Faculty of Business, Computing and Law, School of Computing, Kedleston Road, Derby, DE22 1GB, UK

  • Venue:
  • Computer Standards & Interfaces
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Synchronous bandwidth, defined as the maximum time a node is allowed to send its synchronous messages while holding the token, is a sensitive parameter for deadline guarantees of synchronous messages in any timed token network. In order to offer such guarantees, synchronous bandwidth has to be allocated carefully to each individual node. This paper studies the synchronous bandwidth allocated to those synchronous message streams whose deadlines are less than twice the Target Token Rotation Time (TTRT). A new approach for allocating synchronous bandwidth to such streams, which can be used with any previously published local synchronous bandwidth allocation (SBA) for guaranteeing a general synchronous message set with its minimum deadline (D"m"i"n) no less than 2.TTRT, is proposed. The proposed scheme can be applied efficiently in practice to any general synchronous message set with D"m"i"nTTRT. Numerical examples are presented to demonstrate the enhanced performance of this new local scheme over any of the previously published local SBA schemes.