Improving the competitive ratio of the online OVSF code assignment problem

DOI10.3390/A2030953zbMath1461.68262OpenAlexW1974567673MaRDI QIDQ1662487

Kazuya Okamoto, Shuichi Miyazaki

Publication date: 20 August 2018

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a2030953

zbMATH Keywords

competitive analysisonline algorithmonline OVSF code assignment

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Online algorithms; streaming algorithms (68W27)

Related Items (1)

(\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation

Cites Work

• Constant-competitive tree node assignment
• An algorithmic view on OVSF code assignment
• Online Bandwidth Allocation
• Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks
• Online Tree Node Assignment with Resource Augmentation
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• Online OVSF Code Assignment with Resource Augmentation

This page was built for publication: Improving the competitive ratio of the online OVSF code assignment problem