Maximizing throughput in minimum rounds in an application-level relay service

DOI10.1137/1.9781611972870.11MaRDI QIDQ5233498zbMATH OpenOpenAlexFDO

Authors Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjaš, Chad Yoshikawa

Publication date 11 September 2019

Published in 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/168edaac000c4c691509a44785b3e4da6041a4d5

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Internet topics (68M11) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Localized Client-Server Load Balancing without Global Information
• The network as a storage device: dynamic routing with bounded buffers
• Online client-server load balancing without global information
• Combining fairness with throughput: online routing with multiple objectives
• Fairness in routing and load balancing

This page was built for publication: Maximizing throughput in minimum rounds in an application-level relay service

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