Referenced Items are not available for this document.
The primary concern of this paper is delay analysis of IEEE 802.4 token-bus, IEEE 802.5 token-ring, and Fiber Distributed Data Interface (FDDI) when all the network traffic is of the highest priority class. We model them in an unified manner as a cyclic-service system with exhaustive time-limited service policies. We have specifically pointed out two variants of the time-limited service policies-nonpreemptive and look-ahead. The former models the token-bus, and the latter models the token-ring and FDDI. The major result of this paper is an iterative algorithm to approximate the mean delays for the nonpreemptive policy. Numerical results show that the algorithm is reasonably accurate for both deterministic and exponential frame sizes. Last, we apply the algorithm to the performance analysis of a token-bus. In the appendix, we also outline a similar approach for the look-ahead policy
Published in:
Communications, IEEE Transactions on
(Volume:42
,
Issue:
10
)
Date of Publication: Oct 1994
- Page(s):
- 2833 - 2842
- ISSN :
- 0090-6778
- INSPEC Accession Number:
- 4820805
- Digital Object Identifier :
- 10.1109/26.328953
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Oct 1994
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
