Abstract: In this talk, we study the online OVSF (Orthogonal Variable SpreadingFactor) code assignment problem with resource augmentation introduced by Erlebach et al. in STACS'04. We propose a 2-competitive algorithm with help of 2 \lg^{*} h trees for the height h of the OVSF code tree, which substantially improves the previous resource of 3h/8 + 2 trees shown by Chan et al. in COCOON'09. This is joint work with Yuichi Asahiro (Kyushu Sangyo University) and Kenta Kanmera (Kyushu Institute of Technology).
|