Online control message aggregation in chain networks

DOI10.1007/978-3-642-40104-6_12MaRDI QIDQ2842151zbMATH OpenOpenAlexFDO

Authors Marcin Bienkowski, Jaroslaw Byrka, Łukasz Jeż, Jiří Sgall, Grzegorz Stachowiak, Marek Chrobak

Publication date 12 August 2013

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40104-6_12

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)

Recommendations

• Latency Constrained Aggregation in Chain Networks Admits a PTAS
• Tight bounds for delay-sensitive aggregation
• Online Algorithms for Multilevel Aggregation
• \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
• Tight bounds for delay-sensitive aggregation

Cited in

(8)

• Online algorithms for multi-level aggregation
• \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
• Tight bounds for delay-sensitive aggregation
• Latency Constrained Aggregation in Chain Networks Admits a PTAS
• Online Algorithms for Multilevel Aggregation
• Tight bounds for delay-sensitive aggregation
• scientific article; zbMATH DE number 2086617 (Why is no real title available?)
• New results on multi-level aggregation

This page was built for publication: Online control message aggregation in chain networks

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