{"title":"Timing properties of the timed token MAC protocol","authors":"Sijing Zhang, A. Burns","doi":"10.1109/ICCCN.1997.623355","DOIUrl":null,"url":null,"abstract":"We investigate the inherent timing properties of the timed token medium access control (MAC) protocol that are necessary for guaranteeing synchronous message deadlines in a timed token ring network such as the Fibre Distributed Data Interface (FDDI) network. As a result, the best-so-far result of the upper bound on the time possibly elapsed between any number of successive token arrivals at a particular node was derived. This result, which is particularly important for studies on real-time communications in any timed token ring network, has been published by Zhang and Burns (see IEEE/ACM Trans. on Networking, vol.3, p. 729-41, 1995) with no proof given. In this paper, we complement our early work by presenting a concise formal proof of this upper bound.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Sixth International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.1997.623355","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
We investigate the inherent timing properties of the timed token medium access control (MAC) protocol that are necessary for guaranteeing synchronous message deadlines in a timed token ring network such as the Fibre Distributed Data Interface (FDDI) network. As a result, the best-so-far result of the upper bound on the time possibly elapsed between any number of successive token arrivals at a particular node was derived. This result, which is particularly important for studies on real-time communications in any timed token ring network, has been published by Zhang and Burns (see IEEE/ACM Trans. on Networking, vol.3, p. 729-41, 1995) with no proof given. In this paper, we complement our early work by presenting a concise formal proof of this upper bound.