Referenced Items are not available for this document.
Based on the theoretical framework given by Gunther [1], this paper provides a method which permits designing deadlock-free communication networks with a tradeoff between routing constraints and the number of resource classes. This tradeoff may be adapted for specific network requirements like availability, throughput, and cost. The graph-theoretical basis of this "barrier graph" approach allows easy implementation and has low execution time overhead.
Published in:
Communications, IEEE Transactions on
(Volume:32
,
Issue:
8
)
Date of Publication: Aug 1984
- Page(s):
- 897 - 901
- ISSN :
- 0090-6778
- Digital Object Identifier :
- 10.1109/TCOM.1984.1096160
- Date of Current Version :
- 06 January 2003
- Issue Date :
- Aug 1984
- 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.
