Algorithmic aspects of bandwidth trading

ACM Transactions on Algorithms

Volumn 3, Issue 1, 2007, Pages

  Bhatia, Randeep ^a   Chuzhoy, Julia ^b,e   Freund, Ari ^c   Naor, Joseph ^d  

^a LUCENT TECHNOLOGIES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c IBM HAIFA RESEARCH LAB   (Israel)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^e INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Approximation algorithms for NP hard problems; Dynamic storage allocation; General caching; Resource allocation; Scheduling

Indexed keywords

APPROXIMATION ALGORITHMS; DYNAMIC STORAGE ALLOCATION; GENERAL CACHING; REAL-TIME SCHEDULING;

BANDWIDTH; COMMERCE; COMPUTATIONAL COMPLEXITY; INDUSTRIAL ECONOMICS; OPTIMIZATION; RESOURCE ALLOCATION; SCHEDULING;

ALGORITHMS;

EID: 33847279451     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1186810.1186820     Document Type: Article

References (19)

1. ARKIN, E. M., AND SILVERBERG, E. B. 1987. Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18, 1-8.
2. ALON, N., AND SPENCER, J. H. 2000. The Probabilistic Method, 2nd ed. John Wiley, New York.
3. BAR-NOY, A., GUHA, S., NAOR, J., AND SCHIEBER, B. 2001. Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31, 331-352.
4. BAR-YEHUDA R., BAR-NOY, A., FREUND, A., NAOR, J., AND SCHIEBER, B. 2001. A unified approach to approximating resource allocation and scheduling. J. ACM 48, 1069-1090.
5. BERMAN, P., AND DASGUPTA, B. 2000. Multi-Phase algorithms for throughput maximization for real-time scheduling. J. Comb. Optim. 4, 307-323.
6. CHELIOTIS, G. 2000. Bandwidth trading in the real world: Findings and implications for commodities brokerage. In 3rd Berlin Internet Economics Workshop. 26-27.
7. CHIU, S., AND CRAMETZ, J. P. 2000. Surprising pricing relationships. In Bandwidth Special Report, 12-14. http://www.riskwaters. com/bandwidth/images/pricing.pdf.
8. CHUZHOY, J., OSTROVSKY, R., AND RABANI, Y. 2001. Approximation algorithms for the job interval selection problem and related scheduling problems. In Proceedings of the 42nd Annual Symposium on the Foundations of Computer Science. 348-356.
9. GAREY, M. R., JOHNSON, D. S., MILLER, G. L., AND PAPADIMITRIOU, C. H. 1980. The complexity of coloring circular arcs and chords. SIAM J. Algebraic Discrete Methods 1, 216-227.
10. JAIN, K., AND VAZIRANI, V. V. 2001. Approximation algorithms for the metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. J. ACM 48, 274-296.
11. JANSEN, K. 1994. An approximation algorithm for the license and shift class design problem. Eur. J. Oper. Res. 73, 127-131.
12. KENYON, C., AND CHELIOTIS, V. V. 2001. Stochastic models for telecom commoditiy prices. Comput. Netw. 36, 533-555.
13. KOLEN, A. W. J., AND KROON, L. G. 1991. On the computational complexity of (maximum) class scheduling. Eur. J. Oper. Res. 54, 23-38.
14. KOLEN, A. W. J., AND KROON, L. G. 1993. On the computational complexity of (maximum) shift scheduling. Eur. J. Oper. Res. 64, 138-151.
15. KOLEN, A. W. J., AND KROON, L. G. 1994. An analysis of shift class design problems. Eur. J. Oper. Res. 79, 417-430.
16. LENSTRA, J. K., AND KOLEN, A. W. J. 1995. Combinatorics in operations research. In Handbook of Combinatorics, R. L. Graham et al. Eds. North-Holland, Amster.
17. SPIEKSMA, F. C. R. 1999. On the approximability of an interval scheduling problem. J. Scheduling 2, 215-227.
18. VAZIRANI, V. V. 2001. Approximation Algorithms. Springer-Verlag.
19. WINKLER, P., AND ZHANG, L. 2003. Wavelength assignment and generalized interval graph coloring. In 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 830-831.