Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol
dc.contributor.author | Wang, Jun | en_GB |
dc.contributor.author | Zhang, Sijing | en_GB |
dc.contributor.author | Maple, Carsten | en_GB |
dc.contributor.author | Zhao, Zhengxu | en_GB |
dc.date.accessioned | 2012-11-05T10:27:48Z | |
dc.date.available | 2012-11-05T10:27:48Z | |
dc.date.issued | 2009-03 | |
dc.identifier.citation | Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol 2009, 31 (3):557-565 Computer Standards & Interfaces | en_GB |
dc.identifier.issn | 09205489 | |
dc.identifier.doi | 10.1016/j.csi.2008.03.019 | |
dc.identifier.uri | http://hdl.handle.net/10547/250945 | |
dc.description.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"n>TTRT. Numerical examples are presented to demonstrate the enhanced performance of this new local scheme over any of the previously published local SBA schemes. | |
dc.language.iso | en | en |
dc.publisher | Elsevier | en_GB |
dc.relation.url | http://linkinghub.elsevier.com/retrieve/pii/S0920548908000421 | en_GB |
dc.rights | Archived with thanks to Computer Standards & Interfaces | en_GB |
dc.title | Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol | en |
dc.type | Article | en |
dc.identifier.journal | Computer Standards & Interfaces | en_GB |
html.description.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"n>TTRT. Numerical examples are presented to demonstrate the enhanced performance of this new local scheme over any of the previously published local SBA schemes. |
Files in this item
This item appears in the following Collection(s)
-
Centre for Wireless Research (CWR)
The Centre for Wireless Research brings together expertise in the areas of mobile and wireless sensor networks. The breadth and depth of the expertise make the Centre rich with research and innovation potential.