Competitive analysis of organization networks or multicast acknowledgment: how much to wait?

DOI10.1007/s00453-011-9567-5zbMath1264.68011OpenAlexW3137741150MaRDI QIDQ1945175

Elias Koutsoupias, Carlos Fisch Brito, Shailesh Vaya

Publication date: 3 April 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9567-5

zbMATH Keywords

online algorithmscompetitive ratioasynchronous distributed regimefull information regimemulticast acknowledgement problemorganization networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Approximation algorithms for the joint replenishment problem with deadlines ⋮ Online Algorithms for Multilevel Aggregation ⋮ New results on multi-level aggregation

Cites Work

• Unnamed Item
• Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
• On-line analysis of the TCP acknowledgment delay problem
• Brief announcement

This page was built for publication: Competitive analysis of organization networks or multicast acknowledgment: how much to wait?