TY - GEN
T1 - Packet Forwarding with Swaps
AU - Matsui, Cameron
AU - Rosenbaum, Will
N1 - Publisher Copyright:
© 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2023
Y1 - 2023
N2 - We consider packet forwarding in the adversarial queueing theory (AQT) model introduced by Borodin et al. In this context, a series of recent works have established optimal bounds for buffer space usage of $$O(\log n)$$ for simple network topologies, where n is the size of the network. Optimal buffer space usage, however, comes at a cost: any protocol that achieves o(n) buffer space usage cannot guarantee bounded packet latency. In this paper, we introduce a generalization of the AQT model that allows for packet swaps in addition to regular forwarding operations. We show that in this model, it is possible to simultaneously achieve both optimal buffer space usage and packet latency when the network is a path of length n. To this end, we introduce an analytic tool we call the smoothed configuration of the network. We employ the smoothed configuration to reason about packet latency for a large family of local forwarding protocols, whereby we derive our main result. We also employ the smoothed configuration to analyze the total buffer space usage of forwarding protocols under stochastic packet arrivals. We show that the total network load is n in its steady state, but that the system takes exponential time in expectation to reach a total load of n.
AB - We consider packet forwarding in the adversarial queueing theory (AQT) model introduced by Borodin et al. In this context, a series of recent works have established optimal bounds for buffer space usage of $$O(\log n)$$ for simple network topologies, where n is the size of the network. Optimal buffer space usage, however, comes at a cost: any protocol that achieves o(n) buffer space usage cannot guarantee bounded packet latency. In this paper, we introduce a generalization of the AQT model that allows for packet swaps in addition to regular forwarding operations. We show that in this model, it is possible to simultaneously achieve both optimal buffer space usage and packet latency when the network is a path of length n. To this end, we introduce an analytic tool we call the smoothed configuration of the network. We employ the smoothed configuration to reason about packet latency for a large family of local forwarding protocols, whereby we derive our main result. We also employ the smoothed configuration to analyze the total buffer space usage of forwarding protocols under stochastic packet arrivals. We show that the total network load is n in its steady state, but that the system takes exponential time in expectation to reach a total load of n.
KW - adversarial queueing theory
KW - buffer space usage
KW - packet forwarding
KW - packet latency
KW - packet swaps
UR - http://www.scopus.com/inward/record.url?scp=85163390988&partnerID=8YFLogxK
U2 - 10.1007/978-3-031-32733-9_24
DO - 10.1007/978-3-031-32733-9_24
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85163390988
SN - 9783031327322
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 536
EP - 557
BT - Structural Information and Communication Complexity - 30th International Colloquium, SIROCCO 2023, Proceedings
A2 - Rajsbaum, Sergio
A2 - Rajsbaum, Sergio
A2 - Balliu, Alkida
A2 - Olivetti, Dennis
A2 - Daymude, Joshua J.
PB - Springer Science and Business Media Deutschland GmbH
T2 - 30th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2023
Y2 - 6 June 2023 through 9 June 2023
ER -