WEKO3
アイテム
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation
http://hdl.handle.net/10228/0002000069
http://hdl.handle.net/10228/0002000069004f7d6f-bd34-4e20-a5b2-48bc15ef45ed
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
10347466.pdf (282 KB)
|
|
| アイテムタイプ | 学術雑誌論文 = Journal Article(1) | |||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2023-08-22 | |||||||||||||||||
| 資源タイプ | ||||||||||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||||||||||
| 資源タイプ | journal article | |||||||||||||||||
| タイトル | ||||||||||||||||||
| タイトル | (1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| その他のタイトル | ||||||||||||||||||
| その他のタイトル | (1 + ε)-Competitive Algorithm for Online OVSF Code Assignment with Resource Augmentation | |||||||||||||||||
| 言語 | en | |||||||||||||||||
| 言語 | ||||||||||||||||||
| 言語 | eng | |||||||||||||||||
| 著者 |
Asahiro, Yuichi
× Asahiro, Yuichi
× Kanmera, Kenta
× 宮野, 英次
WEKO
6037
|
|||||||||||||||||
| 抄録 | ||||||||||||||||||
| 内容記述タイプ | Abstract | |||||||||||||||||
| 内容記述 | This paper studies the online Orthogonal Variable Spreading Factor (OVSF) code assignment problem with resource augmentation introduced by Erlebach et al. (in STACS 2004. LNCS, vol. 2996, pp. 270–281, 2004). We propose a (1+1/α)-competitive algorithm with help of (1+⌈α⌉)lg∗ h trees for the height h of the OVSF code tree and any α≥1. In other words, it is a (1+ε)-competitive algorithm with help of (1+⌈1/ε⌉)lg∗ h trees for any constant 0<ε≤1. In the case of α=1 (or ε=1), we obtain a 2-competitive algorithm with 2lg∗ h trees, which substantially improves the previous resource of 3h/8+2 trees shown by Chan et al. (COCOON 2009. LNCS, vol. 5609, pp. 358–367, 2009). In another aspect, if it is not necessary to bound the incurred cost for individual requests to a constant, an amortized (4/3+δ)-competitive algorithm with (11/4+4/(3δ)) trees for any 0<δ≤4/3 is also designed in Chan et al. (COCOON 2009. LNCS, vol. 5609, pp. 358–367, 2009). The algorithm in this paper gives us a new trade-off between the competitive ratio and the resource augmentation when α≥3 (or ε≤1/3), although the incurred cost for individual requests is bounded to a constant. | |||||||||||||||||
| 書誌情報 |
en : Journal of Combinatorial Optimization 巻 26, 号 4, p. 687-708, 発行日 2012-02-08 |
|||||||||||||||||
| 出版社 | ||||||||||||||||||
| 出版者 | Springer | |||||||||||||||||
| DOI | ||||||||||||||||||
| 関連タイプ | isIdenticalTo | |||||||||||||||||
| 識別子タイプ | DOI | |||||||||||||||||
| 関連識別子 | https://doi.org/10.1007/s10878-012-9454-2 | |||||||||||||||||
| ISSN | ||||||||||||||||||
| 収録物識別子タイプ | PISSN | |||||||||||||||||
| 収録物識別子 | 1382-6905 | |||||||||||||||||
| ISSN | ||||||||||||||||||
| 収録物識別子タイプ | EISSN | |||||||||||||||||
| 収録物識別子 | 1573-2886 | |||||||||||||||||
| 著作権関連情報 | ||||||||||||||||||
| 権利情報 | Copyright (c) Springer Science+Business Media, LLC 2012. This is a post-peer-review, pre-copyedit version of an article published in Journal of Combinatorial Optimization. The final authenticated version is available online at: https://doi.org/10.1007/s10878-012-9454-2. | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | Online OVSF code assignment problem | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | resource augmentation | |||||||||||||||||
| キーワード | ||||||||||||||||||
| 主題Scheme | Other | |||||||||||||||||
| 主題 | competitive algorithm | |||||||||||||||||
| 出版タイプ | ||||||||||||||||||
| 出版タイプ | AM | |||||||||||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||||||||||
| 査読の有無 | ||||||||||||||||||
| 値 | yes | |||||||||||||||||
| 研究者情報 | ||||||||||||||||||
| URL | https://hyokadb02.jimu.kyutech.ac.jp/html/233_ja.html | |||||||||||||||||
