Algorithmic aspects of bandwidth trading

DOI10.1145/1186810.1186820MaRDI QIDQ2944546zbMATH OpenOpenAlexFDO

Authors Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph (Seffi) Naor

Publication date 2 September 2015

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1186810.1186820

zbMATH Keywords

approximation algorithms for NP-hard problemsdynamic storage allocationgeneral cachingresource allocationscheduling

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2038752
• An auction mechanism for allocating the bandwidth of networks to their users
• scientific article; zbMATH DE number 2080220
• Optimizing bandwidth allocation in elastic optical networks with application to scheduling
• Flexible bandwidth assignment with application to optical networks

Cited in

(5)

• Scheduling split intervals with non-uniform demands
• scientific article; zbMATH DE number 2038752 (Why is no real title available?)
• Sharing in construction projects -- on determining optimal container assignments for the on-site accommodation of trades
• Minimizing total busy time in parallel scheduling with application to optical networks
• Real-time scheduling to minimize machine busy times

This page was built for publication: Algorithmic aspects of bandwidth trading

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