Blocking probabilities of multiple classes in IP networks with qos routing

Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/79008

DC Field	Value	Language
dc.contributor	應用數學系
dc.creator	Wang, Chia Hung;Luh, H.
dc.creator	陸行	zh_TW
dc.date	2009
dc.date.accessioned	2015-10-19T07:17:37Z	-
dc.date.available	2015-10-19T07:17:37Z	-
dc.date.issued	2015-10-19T07:17:37Z	-
dc.identifier.uri	http://nccur.lib.nccu.edu.tw/handle/140.119/79008	-
dc.description.abstract	We propose a mathematical model for calculating blocking probabilities with optimal bandwidth allocation and QoS routing on multiclass communication networks. This scheme is performed by means of a two-phase procedure. The first step determines optimal paths under network constraints. The second step computes the blocking probability with predetermined optimal solutions. The blocking is due to the failure of meeting the demand of end-to-end paths for each class. © Springer Science+Business Media LLC 2009.
dc.format.extent	176 bytes	-
dc.format.mimetype	text/html	-
dc.relation	Advances in Queueing Theory and Network Applications,281-301
dc.title	Blocking probabilities of multiple classes in IP networks with qos routing
dc.type	article	en
dc.identifier.doi	10.1007/978-0-387-09703-9_16
dc.doi.uri	http://dx.doi.org/10.1007/978-0-387-09703-9_16
item.cerifentitytype	Publications	-
item.fulltext	With Fulltext	-
item.grantfulltext	restricted	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	article	-
Appears in Collections:	期刊論文

File	Description	Size	Format
index.html		176 B	HTML2	View/Open

Check