GUARANTEEING SYNCHRONOUS MESSAGE DEADLINES WITH THE TIMED TOKEN MEDIUM ACCESS-CONTROL PROTOCOL

被引:71
|
作者
AGRAWAL, G [1 ]
CHEN, B [1 ]
ZHAO, W [1 ]
DAVARI, S [1 ]
机构
[1] UNIV HOUSTON CLEAR LAKE, DEPT COMP SCI, HOUSTON, TX 77058 USA
关键词
HARD REAL-TIME; DISTRIBUTED SYSTEM; FDDI; TIMED TOKEN MEDIUM ACCESS CONTROL PROTOCOL; SYNCHRONOUS MESSAGES; PERFORMANCE EVALUATION AND ANALYSIS; SYNCHRONOUS BANDWIDTH; WORST CASE ACHIEVABLE UTILIZATION;
D O I
10.1109/12.272433
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We study the problem of guaranteeing synchronous message deadlines in token ring networks where the timed token medium access control protocol is employed. Synchronous bandwidth, defined as the maximum time for which a node can transmit its synchronous messages every time it receives the token, is a key parameter in the control of synchronous message transmission. To ensure the transmission of synchronous messages before their deadlines, synchronous capacities must be properly allocated to individual nodes. We address the issue of appropriate allocation of the synchronous capacities. Several synchronous bandwidth allocation schemes are analyzed in terms of their ability to satisfy deadline constraints of synchronous messages. We show that an inappropriate allocation of the synchronous capacities could cause message deadlines to be missed, even if the synchronous traffic is extremely low. We propose a scheme, called the normalized proportional allocation scheme, which can guarantee the synchronous message deadlines for synchronous traffic of up to 33% of available utilization.
引用
收藏
页码:327 / 339
页数:13
相关论文
共 50 条
  • [1] An optimal synchronous bandwidth allocation scheme for guaranteeing synchronous message deadlines with the timed-token MAC protocol
    Zhang, SJ
    Burns, A
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (06) : 729 - 741
  • [2] Testing the Schedulability of Synchronous Traffic for the Timed Token Medium Access Control Protocol
    Sijing Zhang
    Alan Burns
    Ahmed Mehaoua
    E. Stewart Lee
    Hongji Yang
    [J]. Real-Time Systems, 2002, 22 : 251 - 280
  • [3] Testing the schedulability of synchronous traffic for the timed token medium access control protocol
    Zhang, SJ
    Burns, A
    Mehaoua, A
    Stewart Lee, E
    Yang, HJ
    [J]. REAL-TIME SYSTEMS, 2002, 22 (03) : 251 - 280
  • [4] SELECTION OF TIMED TOKEN PROTOCOL PARAMETERS TO GUARANTEE MESSAGE DEADLINES
    HAMDAOUI, M
    RAMANATHAN, P
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (03) : 340 - 351
  • [5] Guaranteeing hard real-time traffic with legitimately short deadlines with the timed token protocol
    Wang, Jun
    Zhang, Sijing
    Maple, Carsten
    Zhao, Zhengxu
    [J]. COMPUTER STANDARDS & INTERFACES, 2009, 31 (03) : 557 - 565
  • [6] Cycle-time properties of the timed token medium access control protocol
    Zhang, SJ
    Burns, A
    Cheng, TH
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (11) : 1362 - 1367
  • [7] A MEDIUM ACCESS-CONTROL PROTOCOL FOR AN ATM ACCESS NETWORK
    CASALS, O
    GARCIA, J
    BLONDIA, C
    [J]. HIGH SPEED NETWORKS AND THEIR PERFORMANCE, 1994, 21 : 289 - 308
  • [8] Finding the minimum available transmission time for the timed token medium access control protocol
    Zhang, SJ
    Lee, ES
    Burns, A
    Yang, HJ
    [J]. PROCEEDINGS OF THE 11TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, 1999, : 185 - 194
  • [9] Determining the asynchronous threshold values of the timed token medium access protocol
    Gençata, A
    Buzluca, F
    [J]. COMPUTER JOURNAL, 2003, 46 (04): : 421 - 426
  • [10] Guaranteeing the timely transmission of periodic messages with arbitrary deadline constraints using the timed token media access control protocol
    Wang, J.
    Zhang, S.
    Maple, C.
    [J]. IET COMMUNICATIONS, 2011, 5 (04) : 519 - 533