Online OVSF Code Assignment with Resource Augmentation

DOI10.1007/978-3-540-72870-2_18MaRDI QIDQ5434437zbMATH OpenOpenAlexFDO

Authors Yong Zhang, Hong Zhu, Francis Y. L. Chin

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72870-2_18

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• A constant-competitive algorithm for online OVSF code assignment
• An algorithmic view on OVSF code assignment
• (1 + )-competitive algorithm for online OVSF code assignment with resource augmentation
• STACS 2004

Cited in

(17)

• Improving the competitive ratio of the online OVSF code assignment problem
• On Walsh code assignment
• OVSF-CDMA code assignment in wireless ad hoc networks
• (1 + )-competitive algorithm for online OVSF code assignment with resource augmentation
• Partial loss probability of OVSF single-code assignment with space-limited batch arrival queues: \(M[2^X]/M/c/c\)
• Assignment of OVSF Codes in Wideband CDMA
• (1+ )-competitive algorithm for online OVSF code assignment with resource augmentation
• Constant-competitive tree node assignment
• STACS 2004
• Online Tree Node Assignment with Resource Augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• Computing and Combinatorics
• Absolute and asymptotic bounds for online frequency allocation in cellular networks
• Online tree node assignment with resource augmentation
• A constant-competitive algorithm for online OVSF code assignment
• An algorithmic view on OVSF code assignment
• OVSF code assignment strategies with minimal fragmentations for WCDMA systems

This page was built for publication: Online OVSF Code Assignment with Resource Augmentation

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