Downloads: 191
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| j.tcs.2016.10.009.pdf | 367.36 kB | Adobe PDF | View/Open |
| Title: | Better bounds for online k-frame throughput maximization in network switches |
| Authors: | Kawahara, Jun    https://orcid.org/0000-0001-7208-044X (unconfirmed)Kobayashi, Koji M. Miyazaki, Shuichi https://orcid.org/0000-0003-0369-1970 (unconfirmed) |
| Author's alias: | 川原, 純 小林, 浩二 宮崎, 修一 |
| Keywords: | Buffer management Online problem Competitive analysis Packet fragmentation |
| Issue Date: | 2-Jan-2017 |
| Publisher: | Elsevier BV |
| Journal title: | Theoretical Computer Science |
| Volume: | 657 |
| Issue: | Part B |
| Start page: | 173 |
| End page: | 190 |
| Rights: | © 2017. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ The full-text file will be made open to the public on 2 January 2019 in accordance with publisher's 'Terms and Conditions for Self-Archiving'. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 This is not the published version. Please cite only the published version. |
| URI: | http://hdl.handle.net/2433/226933 |
| DOI(Published Version): | 10.1016/j.tcs.2016.10.009 |
| Appears in Collections: | Journal Articles |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.