The Complexity of File Transfer Scheduling with Forwarding

DOI10.1137/0219015zbMATH Open0692.68023OpenAlexW2071513795MaRDI QIDQ3034813FDOQ3034813

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

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

zbMATH Keywords

networkcomplexityscheduling

Mathematics Subject Classification ID

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

Cited In (4)

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

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)