Improving the competitive ratio of the online OVSF code assignment problem

DOI10.3390/A2030953zbMATH Open1461.68262OpenAlexW1974567673MaRDI QIDQ1662487FDOQ1662487

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

Recommendations

• Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
• A constant-competitive algorithm for online OVSF code assignment
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• \((1 + \epsilon )\)-competitive algorithm for online OVSF code assignment with resource augmentation
• (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation

zbMATH Keywords

competitive analysisonline algorithmonline OVSF code assignment

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Improving the Competitive Ratio of the Online OVSF Code Assignment Problem
• A Constant-Competitive Algorithm for Online OVSF Code Assignment
• (\(1+\varepsilon \))-competitive algorithm for online OVSF code assignment with resource augmentation

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

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