Data popularity and shortest-job-first scheduling of network transfers

International Conference on Digital Telecommunications 2006, ICDT'06

Volumn , Issue , 2006, Pages

  Lupetti, Simone ^a   Zagorodnov, Dmitrii ^a  

^a UNIVERSITY OF TROMSØ   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

DATA POPULARITY; NETWORK TRANSFERS; SCHEDULING TRANSFERS; SHORTEST JOB FIRST (SJF);

ALGORITHMS; COMPUTER NETWORKS; PROBLEM SOLVING; SCHEDULING; STATIC ANALYSIS; STRATEGIC PLANNING;

DATA TRANSFER;

EID: 40849096057     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDT.2006.28     Document Type: Conference Paper

References (19)

1. .Mac. http://www.apple.com/dotmac/.
2. Mirror Image Internet, http://www.mirror-image.com/.
3. Streamload. http://www.streamload.com/.
4. K. Baker. Introduction to sequencing and scheduling. Addison-Wesley, 1974.
5. P. Brucker. Scheduling Algorithms. Springer, 4th edition, 2004.
6. L. Cherkasova and J. Lee. FastReplica: Efficient large file distribution within content delivery networks. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003.
7. E. G. Coffman, J. L. Bruno, and R. L. Graham. Computer and job-shop scheduling theory. Addison-Wesley, 1976.
8. R. W. Conway, W. L. Maxwell, and L. W. Miller. Theory of Scheduling. Addison-Wesley, 1967.
9. J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B. Weihl. Globally distributed content delivery. IEEE Internet Computing, 6(5):50-58, Sept. 2002.
10. J. E. G. Coffman, M. R. Garey, D. S. Johnson, and A. S. La-Paugh. Scheduling file transfers in a distributed network. In PODC '83: Proceedings of the second annual ACM symposium on Principles of distributed computing, pages 254-266, New York, NY, USA, 1983.
11. S. French. Sequencing and Scheduling: An Introduction to the Mathematics of the JobShop. John-Wiley & Sons, 1982.
12. M. N. Garofalakis and Y. E. Ioannidis. Scheduling issues in multimedia query optimization. ACM Comput. Surv., 27(4):590-592, 1995.
13. A. Goel, M. R. Henzinger, S. Plotkin, and E. Tardos. Scheduling data transfers in a network and the set scheduling problem. In STOC '99: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 189-197, New York, NY, USA, 1999.
14. N. G. Hall and C. Sriskandarajah. A survey of machine scheduling problems with blocking and no-wait in process. Operations Research, 44(3):510-525, May-Jun 1996.
15. D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. In Proceedings of the 29th ACM Symposium on the Theory of Computing (STOC), pages 654-663, May 1997.
16. D. Kosti, A. Rodriguez, J. Albrecht, and A. Vahdat. Bullet: high bandwidth data dissemination using an overlay mesh. In SOSP '03: Proceedings of the nineteenth ACM symposium on Operating systems principles, pages 282-297, New York, NY, USA, 2003.
17. D. McNickle and R. G. Addie. Comparing protocols for differential service in the Internet. In Proceedings of IEEE TENCON 2005. IEEE, December 2005.
18. S. S. Panwalkar and W. Iskander. A survey of scheduling rules. Operations Research, 1(25):45-61, Jan-Feb 1976.
19. K. Park, G. Kim, and M. E. Crovella. On the relationship between file sizes, transport protocols, and self-similar network traffic. Technical Report BU-CS-96-016, Boston University, August 1996.