The Complexity of File Transfer Scheduling with Forwarding

DOI10.1137/0219015MaRDI QIDQ3034813zbMATH OpenOpenAlexFDO

Authors Jennifer Whitehead

Publication date 1990

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0219015

zbMATH Keywords

complexitynetworkscheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling File Transfers
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
• Scheduling File Transfers for Trees and Odd Cycles
• scientific article; zbMATH DE number 1161267
• OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS

Cited in

(4)

• On the complexity of coordinated display of multimedia objects
• Scheduling File Transfers
• On a local protocol for concurrent file transfers
• ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS

This page was built for publication: The Complexity of File Transfer Scheduling with Forwarding

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