{"paper":{"title":"Better Bounds for Online $k$-Frame Throughput Maximization in Network Switches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki","submitted_at":"2013-09-19T10:26:22Z","abstract_excerpt":"We consider a variant of the online buffer management problem in network switches, called the $k$-frame throughput maximization problem ($k$-FTM). This problem models the situation where a large frame is fragmented into $k$ packets and transmitted through the Internet, and the receiver can reconstruct the frame only if he/she accepts all the $k$ packets. Kesselman et al.\\ introduced this problem and showed that its competitive ratio is unbounded even when $k=2$. They also introduced an \"order-respecting\" variant of $k$-FTM, called $k$-OFTM, where inputs are restricted in some natural way. They"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4919","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}