Referenced Items are not available for this document.
Two general-purpose decomposition methods to calculate the blocking probabilities of connection-oriented networks are presented. The methods are based on either the call status or the link status of the networks, and can significantly reduce the required computational times. A heuristic is presented to simplify the application of the proposed decomposition methods on networks with irregular topologies. Numerical examples are given to demonstrate the applications of the proposed methods.
Published in:
Networking, IEEE/ACM Transactions on
(Volume:12
,
Issue:
3
)
Date of Publication: June 2004
- Page(s):
- 549 - 558
- ISSN :
- 1063-6692
- INSPEC Accession Number:
- 8054429
- Digital Object Identifier :
- 10.1109/TNET.2004.828937
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 June 2004
- Issue Date :
- June 2004
- Sponsored by :
- Association for Computing Machinery
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.
