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

MaRDI QIDQ3105288zbMATH OpenFDO

Authors Jui-Chi Chen

Publication date 5 January 2012

zbMATH Keywords

bandwidth utilizationOVSF codepartial loss probabilityqueuing modelsWCDMA networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Assignment of OVSF Codes in Wideband CDMA
• Online OVSF Code Assignment with Resource Augmentation
• Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks
• OVSF code assignment strategies with minimal fragmentations for WCDMA systems
• A Constant-Competitive Algorithm for Online OVSF Code Assignment

This page was built for publication: Partial loss probability of OVSF single-code assignment with space-limited batch arrival queues: \(M[2^X]/M/c/c\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3105288)