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

2.50
Hdl Handle:
http://hdl.handle.net/10547/250945
Title:
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol
Authors:
Wang, Jun; Zhang, Sijing; Maple, Carsten; Zhao, Zhengxu
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.
Citation:
Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol 2009, 31 (3):557-565 Computer Standards & Interfaces
Publisher:
Elsevier
Journal:
Computer Standards & Interfaces
Issue Date:
Mar-2009
URI:
http://hdl.handle.net/10547/250945
DOI:
10.1016/j.csi.2008.03.019
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S0920548908000421
Type:
Article
Language:
en
ISSN:
09205489
Appears in Collections:
Centre for Wireless Research (CWR)

Full metadata record

DC FieldValue Language
dc.contributor.authorWang, Junen_GB
dc.contributor.authorZhang, Sijingen_GB
dc.contributor.authorMaple, Carstenen_GB
dc.contributor.authorZhao, Zhengxuen_GB
dc.date.accessioned2012-11-05T10:27:48Z-
dc.date.available2012-11-05T10:27:48Z-
dc.date.issued2009-03-
dc.identifier.citationGuaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol 2009, 31 (3):557-565 Computer Standards & Interfacesen_GB
dc.identifier.issn09205489-
dc.identifier.doi10.1016/j.csi.2008.03.019-
dc.identifier.urihttp://hdl.handle.net/10547/250945-
dc.description.abstractSynchronous 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.en_GB
dc.language.isoenen
dc.publisherElsevieren_GB
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0920548908000421en_GB
dc.rightsArchived with thanks to Computer Standards & Interfacesen_GB
dc.titleGuaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocolen
dc.typeArticleen
dc.identifier.journalComputer Standards & Interfacesen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.