The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Os protocolos de tokens temporizados fornecem inadequadamente serviços de comunicação periódica, embora isso seja crucial para sistemas rígidos em tempo real. Propomos um algoritmo para garantir serviço de comunicação periódica em uma rede de protocolo token cronometrado. Nesta abordagem, alocamos largura de banda para cada nó de modo que a soma das alocações de largura de banda seja o Target Token Rotation Time (TTRT). Se um nó não puder consumir o tempo alocado, o tempo residual é concedido a outros nós para serviço não periódico usando um temporizador que contém o valor do tempo não utilizado e é anexado ao token. Este algoritmo pode sempre garantir a transmissão de mensagens em tempo real antes dos prazos quando a utilização da rede for inferior a 50%.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Young-yeol CHOO, Cheeha KIM, "Token with Timer Algorithm for Guaranteeing Periodic Communication Service in Multiple Access Networks" in IEICE TRANSACTIONS on Information,
vol. E85-D, no. 6, pp. 1049-1051, June 2002, doi: .
Abstract: Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an algorithm to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time is made concession to other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This algorithm can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.
URL: https://global.ieice.org/en_transactions/information/10.1587/e85-d_6_1049/_p
Copiar
@ARTICLE{e85-d_6_1049,
author={Young-yeol CHOO, Cheeha KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Token with Timer Algorithm for Guaranteeing Periodic Communication Service in Multiple Access Networks},
year={2002},
volume={E85-D},
number={6},
pages={1049-1051},
abstract={Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an algorithm to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time is made concession to other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This algorithm can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.},
keywords={},
doi={},
ISSN={},
month={June},}
Copiar
TY - JOUR
TI - Token with Timer Algorithm for Guaranteeing Periodic Communication Service in Multiple Access Networks
T2 - IEICE TRANSACTIONS on Information
SP - 1049
EP - 1051
AU - Young-yeol CHOO
AU - Cheeha KIM
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E85-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2002
AB - Timed token protocols inadequately provide periodic communication service, although this is crucial for hard real time systems. We propose an algorithm to guaranteeing periodic communication service on a timed token protocol network. In this approach, we allocate bandwidth to each node so that the summation of bandwidth allocations is Target Token Rotation Time (TTRT). If a node cannot consume the allocated time, the residual time is made concession to other nodes for non-periodic service using a timer which contains the unused time value and is appended to the token. This algorithm can always guarantee transmission of real-time messages before their deadlines when the network utilization is less than 50%.
ER -