Local synchronous capacity allocation schemes for guaranteeing message deadlines with the timed token protocol

Abstract

The problem of guaranteeing synchronous message deadlines in communication networks using the timed token medium access control protocol is studied. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. A class of local synchronous capacity allocation schemes, which allocate the synchronous capacity to a node without using information about messages on the other nodes, is developed, analyzed, and evaluated in terms of the ability of the schemes to guarantee message deadlines. It is shown that one of the local allocation schemes proposed can achieve the same performance as that of the best global allocation scheme known to date.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>