By Topic

Timing properties of the timed token MAC protocol

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sijing Zhang ; Network Technol. Res. Center, Nanyang Technol. Univ., Singapore ; Burns, A.

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

Published in:

Computer Communications and Networks, 1997. Proceedings., Sixth International Conference on

Date of Conference:

22-25 Sep 1997