OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS

DOI10.1142/S0129054195000111zbMATH Open0830.68008OpenAlexW2114689831MaRDI QIDQ4853335FDOQ4853335

Authors: Miriam Di Ianni, Andrea Clementi 

Publication date: 28 January 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054195000111

Recommendations

• Minimum-delay schedules in layered networks
• Scheduling time-constrained communication in linear networks
• Scheduling transmissions in a network
• Packet Routing: Complexity and Algorithms
• Transmissions in a network with capacities and delays

zbMATH Keywords

NP-completenessscheduling problemoptimal time strategy

Mathematics Subject Classification ID

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

Cited In (8)

• Routing equal-size messages on a slotted ring
• Scheduling trains with small stretch on a unidirectional line
• The Complexity of File Transfer Scheduling with Forwarding
• Train scheduling on a unidirectional path
• Network scheduling problem with cross-docking and loading constraints
• Title not available (Why is that?)
• Routing with delays when storage is costly
• Real-Time Message Routing and Scheduling

This page was built for publication: OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS

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