Throughput maximization for periodic packet routing on trees and grids

DOI10.1007/978-3-642-18318-8_19MaRDI QIDQ3075463zbMATH OpenOpenAlexFDO

Authors Britta Peis, Andreas Wiese

Publication date 15 February 2011

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18318-8_19

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Policies for periodic packet routing
• Time-constrained scheduling of weighted packets on trees and meshes
• Packet Routing on the Grid
• scientific article; zbMATH DE number 1303574
• Packet Routing: Complexity and Algorithms

Cited in

(3)

• Policies for periodic packet routing
• Time-constrained scheduling of weighted packets on trees and meshes
• Multicommodity flow in trees: packing via covering and iterated relaxation

This page was built for publication: Throughput maximization for periodic packet routing on trees and grids

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