Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30280
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorLi, CY-
dc.creatorWai, PKA-
dc.creatorLi, VOK-
dc.date.accessioned2014-12-19T06:56:25Z-
dc.date.available2014-12-19T06:56:25Z-
dc.identifier.issn1063-6692-
dc.identifier.urihttp://hdl.handle.net/10397/30280-
dc.language.isoenen_US
dc.titleThe decomposition of a blocking model for connection-oriented networksen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage549-
dc.identifier.epage558-
dc.identifier.volume12-
dc.identifier.issue3-
dc.identifier.doi10.1109/TNET.2004.828937-
dcterms.abstractTwo 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.-
dcterms.bibliographicCitationIEEE/ACM Transactions on networking, 2004, v. 12, no. 3, p. 549-558-
dcterms.isPartOfIEEE/ACM Transactions on Networking-
dcterms.issued2004-
dc.identifier.isiWOS:000222229100013-
dc.identifier.scopus2-s2.0-4344680159-
dc.identifier.rosgroupidr16683-
dc.description.ros2003-2004 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Sep 6, 2020

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Sep 25, 2020

Page view(s)

128
Last Week
6
Last month
Citations as of Sep 27, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.