On a local protocol for concurrent file transfers
DOI10.1007/s00224-013-9500-1zbMath1314.68043OpenAlexW2009875814MaRDI QIDQ487273
Rohit Khandekar, Guy Kortsarz, Vahid Liaghat, Mohammad Taghi Hajiaghayi
Publication date: 19 January 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.2937
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Approximation algorithms (68W25) Network protocols (68M12)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial algorithms for data migration to minimize average completion time
- On chromatic sums and distributed resource allocation
- Approximation algorithms for shop scheduling problems with minsum objective
- Minimum sum multicoloring on the edges of trees
- Improved results for data migration and open shop scheduling
- Min Sum Edge Coloring in Multigraphs Via Configuration LP
- A better than “best possible” algorithm to edge color multigraphs
- Scheduling File Transfers
- Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
- Data migration to minimize the total completion time
- A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
- Improved bounds for scheduling conflicting jobs with minsum criteria
- Bounds for Certain Multiprocessing Anomalies
- Approximation and Online Algorithms
This page was built for publication: On a local protocol for concurrent file transfers
