Partial loss probability of OVSF single-code assignment with space-limited batch arrival queues: M[2<sup>x</sup>]/M/c/c

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Journal Artical > Item 310904400/8681

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/8681

Title:	Partial loss probability of OVSF single-code assignment with space-limited batch arrival queues: M[2^x]/M/c/c
Authors:	Chen, Jui-Chi
Contributors:	Department of Computer Science and Information Engineering
Keywords:	Bandwidth;Communication channels (information theory);Computer simulation;Probability;Profitability;Queueing networks;Band-width utilization;Loss probability;OVSF codes;Queuing models;WCDMA network
Date:	2010-01
Issue Date:	2010-04-07 13:27:18 (UTC+0)
Publisher:	Asia University
Abstract:	In a WCDMA Node-B, orthogonal variable spreading factor (OVSF) codes are both valuable and limited. Many efforts are being made to create OVSF code-assignment schemes that support a maximum number of users. Here the author (a) proposes a batch arrival and partial loss queuing model to evaluate OVSF single-code assignment system performance, and (b) derives expressions for calculating two important system performance measures (partial loss probability and bandwidth utilization) that respectively denote subscriber service quality and operator profit. Results from a simulation test suggest that the proposed model has utility in the construction of WCDMA networks.
Relation:	Journal of Information Science and Engineering 26 (1) :267-278
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Artical

Files in This Item:

File	Description	Size	Format
12		0Kb	Unknown	549	View/Open
12.doc		29Kb	Microsoft Word	371	View/Open