Time-constrained scheduling of weighted packets on trees and meshes

DOI10.1007/s00453-002-1019-9zbMath1053.68013OpenAlexW1479750681MaRDI QIDQ1400890

Adi Rosén, Micah Adler, Rajmohan Rajaraman, Sanjeev Khanna

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1097&context=cis_papers

zbMATH Keywords

Approximation algorithmDeadlinePacket routing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Direct routing: Algorithms and complexity ⋮ Online packet-routing in grids with bounded buffers ⋮ Online time-constrained scheduling in linear and ring networks ⋮ Scheduling problems in transportation networks of line topology ⋮ Universal Packet Routing with Arbitrary Bandwidths and Transit Times ⋮ Approximation algorithms for time-constrained scheduling on line networks ⋮ Time-optimum packet scheduling for many-to-one routing in wireless sensor networks

This page was built for publication: Time-constrained scheduling of weighted packets on trees and meshes