Better bounds for online k-frame throughput maximization in network switches

DOI10.1016/J.TCS.2016.10.009zbMATH Open1355.68029arXiv1309.4919OpenAlexW1501474073MaRDI QIDQ346256FDOQ346256

Authors: Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki

Publication date: 5 December 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: 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 proposed an online algorithm and showed that its competitive ratio is at most

f r a c 2 k B l f l o o r B / k f l o o r + k

for any

B g e k

, where

B

is the size of the buffer. They also gave a lower bound of

f r a c B l f l o o r 2 B / k f l o o r

for deterministic online algorithms when

2 B g e q k

and

k

is a power of 2. In this paper, we improve upper and lower bounds on the competitive ratio of

k

-OFTM. Our main result is to improve an upper bound of

O (k^{2})

by Kesselman et al. to

f r a c 5 B + l f l o o r B / k f l o o r - 4 l f l o o r B / 2 k f l o o r = O (k)

for

B g e q 2 k

. Note that this upper bound is tight up to a multiplicative constant factor since the lower bound given by Kesselman et al. is

O m e g a (k)

. We also give two lower bounds. First we give a lower bound of

f r a c 2 B l f l o o r B / (k - 1) f l o o r + 1

on the competitive ratio of deterministic online algorithms for any

k g e q 2

and any

B g e q k - 1

, which improves the previous lower bound of

f r a c B l f l o o r 2 B / k f l o o r

by a factor of almost four. Next, we present the first nontrivial lower bound on the competitive ratio of randomized algorithms. Specifically, we give a lower bound of

k - 1

against an oblivious adversary for any

k g e q 3

and any

B

.

Full work available at URL: https://arxiv.org/abs/1309.4919

Recommendations

zbMATH Keywords

buffer management competitive analysis online problem packet fragmentation

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11)

Cites Work

Cited In (2)

This page was built for publication: Better bounds for online \(k\)-frame throughput maximization in network switches

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