Skip Navigation

The Computer Journal 2003 46(4):421-426; doi:10.1093/comjnl/46.4.421
© 2003 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gençata, A.
Right arrow Articles by Buzluca, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Determining the Asynchronous Threshold Values of the Timed Token Medium Access Protocol

Aysegül Gençata1 and Feza Buzluca1

1 Istanbul Technical University, Electrical and Electronics Faculty, Department of Computer Engineering, Maslak, Istanbul 80626, Turkey Email: buzluca@cs.itu.edu.tr

Due to its timed-token medium access control protocol, fibre distributed data interface is suitable for transmitting real-time and non-real-time data. Several protocol parameters should be properly selected to satisfy the time constraints of the synchronous messages and to provide the maximum usage of the asynchronous transmission bandwidth. In this study the effect of asynchronous threshold values on the behaviour of the ring is considered, and two methods are developed to calculate suitable threshold values for different purposes. In the first method the proper asynchronous threshold values are calculated to share out the asynchronous bandwidth between nodes in given proportions. In the second method, asynchronous data transmissions of nodes are limited by using appropriate asynchronous threshold values. In this way the actual target token rotation time can be reduced to facilitate achieving the real-time requirements of synchronous messages.

Received 8 May, 2002. Revised 11 November, 2002.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.