• 沒有找到結果。

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

N/A
N/A
Protected

Academic year: 2022

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

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

Accession number:20100912736997

Title: Partial loss probability of OVSF single-code assignment with space-limited batch arrival queues: M[2<sup>x</sup>]/M/c/c Authors: Chen, Jui-Chi (1)

Author affiliation:(1) Department of Computer Science and Information Engineering, Asia University, Taichung, 413, Taiwan Corresponding author:Chen, J.-C.

([email protected])

Source title: Journal of Information Science and Engineering Abbreviated source title:J. Inf. Sci. Eng.

Volume:26 Issue:1

Issue date:January 2010 Publication year:2010 Pages:267-278

Language:English ISSN:10162364 CODEN:JINEEY

Document type:Conference article (CA)

Publisher:Institute of Information Science, 128 Academia Road, Section 2, Nankang, Taipei, 115, Taiwan

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.

Number of references:18

Main heading:Queueing theory

Controlled terms: Bandwidth - Communication channels (information theory) - Computer simulation - Probability - Profitability - Queueing networks

(2)

Uncontrolled terms: Band-width utilization - Loss probability - OVSF codes - Queuing models - WCDMA network

Classification code:716.1 Information Theory and Signal Processing - 723 Computer Software, Data Handling and Applications - 723.5 Computer Applications - 911.2 Industrial Economics - 922.1 Probability Theory

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.

參考文獻

相關文件

circuit sat: Given a circuit, is there a truth assignment such that the circuit outputs truea. • circuit sat ∈ NP: Guess a truth assignment and then evaluate

• tiny (a single segment, used by .com programs), small (one code segment and one data segment), medium (multiple code segments and a single data segment), compact (one code

Here, a deterministic linear time and linear space algorithm is presented for the undirected single source shortest paths problem with positive integer weights.. The algorithm

Keywords: Adaptive Lasso; Cross-validation; Curse of dimensionality; Multi-stage adaptive Lasso; Naive bootstrap; Oracle properties; Single-index; Pseudo least integrated

Graduate Masters/mistresses will be eligible for consideration for promotion to Senior Graduate Master/Mistress provided they have obtained a Post-Graduate

The Hilbert space of an orbifold field theory [6] is decomposed into twisted sectors H g , that are labelled by the conjugacy classes [g] of the orbifold group, in our case

circuit sat: Given a circuit, is there a truth assignment such that the circuit outputs true?.. • circuit sat ∈ NP: Guess a truth assignment and then evaluate the

Briefing of the home assignment (Designing a plan for e-assessment) Ø  Participants have to complete the assignment before attending Session 2 Ø  File name: