Synchronous bandwidth allocation for real-time communications with the timed-token MAC protocol

2.50
Hdl Handle:
http://hdl.handle.net/10547/270575
Title:
Synchronous bandwidth allocation for real-time communications with the timed-token MAC protocol
Authors:
Han, Ching-Chih; Shin, K.G.; Hou, Chao-Ju
Abstract:
One of the key issues in tailoring the timed-token MAC protocol for real-time applications is synchronous bandwidth allocation (SBA), whose objective is to meet both the protocol and deadline constraints. The former constraint requires that the total time allocated to all nodes for transmitting synchronous messages should not exceed the target token rotation time. The latter constraint requires that the minimum time available for a node to transmit its synchronous messages before their deadlines should be no less than the maximum message transmission time. Several nonoptimal local SEA schemes and an optimal global SBA scheme have been proposed. Local SBA schemes use only information available locally to each node and are thus preferred to global schemes because of their lower network-management overhead. If optimal local SBA schemes, if any, can be devised, they will be superior to their global counterparts both in performance and in ease of network management. In this paper, we formally prove that there does not exist any optimal local SBA scheme. We also propose an optimal global SBA scheme which has an O(nM) polynomial-time worst-case complexity, where n is the number of synchronous message streams in the system and M is the time complexity for solving a linear programming problem with 3n constraints and n variables
Citation:
Han, C., Shin, K.G. and Hou, C. (2001) Synchronous bandwidth allocation for real-time communications with the timed-token MAC protocol 2001, 50 (5):414-431 IEEE Transactions on Computers
Publisher:
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Journal:
IEEE Transactions on Computers
Issue Date:
2008
URI:
http://hdl.handle.net/10547/270575
DOI:
10.1109/12.926157
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=926157
Type:
Article
Language:
en
ISSN:
00189340
Appears in Collections:
Centre for Research in Distributed Technologies (CREDIT)

Full metadata record

DC FieldValue Language
dc.contributor.authorHan, Ching-Chihen_GB
dc.contributor.authorShin, K.G.en_GB
dc.contributor.authorHou, Chao-Juen_GB
dc.date.accessioned2013-02-27T16:12:41Z-
dc.date.available2013-02-27T16:12:41Z-
dc.date.issued2008-
dc.identifier.citationHan, C., Shin, K.G. and Hou, C. (2001) Synchronous bandwidth allocation for real-time communications with the timed-token MAC protocol 2001, 50 (5):414-431 IEEE Transactions on Computersen_GB
dc.identifier.issn00189340-
dc.identifier.doi10.1109/12.926157-
dc.identifier.urihttp://hdl.handle.net/10547/270575-
dc.description.abstractOne of the key issues in tailoring the timed-token MAC protocol for real-time applications is synchronous bandwidth allocation (SBA), whose objective is to meet both the protocol and deadline constraints. The former constraint requires that the total time allocated to all nodes for transmitting synchronous messages should not exceed the target token rotation time. The latter constraint requires that the minimum time available for a node to transmit its synchronous messages before their deadlines should be no less than the maximum message transmission time. Several nonoptimal local SEA schemes and an optimal global SBA scheme have been proposed. Local SBA schemes use only information available locally to each node and are thus preferred to global schemes because of their lower network-management overhead. If optimal local SBA schemes, if any, can be devised, they will be superior to their global counterparts both in performance and in ease of network management. In this paper, we formally prove that there does not exist any optimal local SBA scheme. We also propose an optimal global SBA scheme which has an O(nM) polynomial-time worst-case complexity, where n is the number of synchronous message streams in the system and M is the time complexity for solving a linear programming problem with 3n constraints and n variablesen_GB
dc.language.isoenen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCen_GB
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=926157en_GB
dc.rightsArchived with thanks to IEEE Transactions on Computersen_GB
dc.titleSynchronous bandwidth allocation for real-time communications with the timed-token MAC protocolen
dc.typeArticleen
dc.identifier.journalIEEE Transactions on Computersen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.