Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 549-558 |
| Number of pages | 10 |
| Journal | IEEE/ACM Transactions on Networking |
| Volume | 12 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jun 2004 |
ASJC Scopus subject areas
- Software
- Computer Science Applications
- Computer Networks and Communications
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'The decomposition of a blocking model for connection-oriented networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver