A varying-bandwidth list scheduling heuristic for file transfers

IEEE International Conference on Communications

Volumn 2, Issue , 2004, Pages 748-752

  Veeraraghavan, M ^a   Lee, H ^b   Chong, E K P ^c   Li, H ^c  

^a UNIVERSITY OF VIRGINIA   (United States)

^b Polytechnic University   (United States)

^c Department of Ecosystem Science and Sustainability   (United States)

Author keywords

Circuit switching; List scheduling; Optical networks; Scheduling file transfers

Indexed keywords

FREQUENCY ALLOCATION; PACKET NETWORKS; PACKET SWITCHING; PROBABILITY DENSITY FUNCTION; SCHEDULING; TIME DIVISION MULTIPLEXING;

CIRCUIT SWITCHING; LIST SCHEDULING; OPTICAL NETWORKS; SCHEDULING FILE TRANSFERS;

FREQUENCY DIVISION MULTIPLEXING;

EID: 4143081669     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2004.1312661     Document Type: Conference Paper

References (14)

1. A. Greenberg, R. Srikant, W. Whitt, "Resource sharing for book-ahead and instantaneous-request calls," IEEE/ACM Transactions on Networking, vol. 7, no. 1, pp. 10-22, February 1999.
2. D. Wischik and A. Greenberg, "Admission control for booking ahead shared resources," in Proc. of IEEE Infocom, San Francisco, CA, Mar. 29 - April 2, 1998, pp. 873-882.
3. First International Workshop on Protocols for Fast Long-Distance Networks, PFLDnet 2003, Feb. 3-4, 2003, Geneva, Switzerland, http://datat-ag.web.cem.ch/datatag/pfldnet2003/.
4. Office of Science, "DOE Workshop on Ultra High-Speed Transport Protocols and Network Provisioning for Large-Science Applications," April 10-11, 2003, Argonne National Laboratory, Argonne, IL, http:// www.csm.oml.gov/ghpn/wk2003.html.
5. M. Pinedo, Scheduling: Theory, algorithms and systems. Prentice-Hall: New Jersey, 1995.
6. E. G. Coffman, Jr., M. R. Garey, D. S. Johnson, A. S. Lapaugh, "Scheduling File Transfers," SLAM Journal of Computing, Vol. 14, No. 3, pp. 744-780, Aug. 1985.
7. T. Erlebach and K. Jansen, "Off-line and On-line Call Scheduling in Stars and Trees," in Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG '97, LNCS1335, Springer-Verlag 1997, pp. 195-213.
8. J. T. Havill, W. Mao and R. Simha, "A Lower Bound for On-line File Transfer Routing and Scheduling," in Proceedings of the 1997 Conference on Information Sciences and Systems, 1997, pp. 225-230.
9. S. Floyd, "Highspeed TCP for Large Congestion Windows," February, 2003, http://www.ietf.org/internet-drafts/draft-ietf-tsvwg-highspeed- 01.txt.
10. T. Kelly, "Scalable TCP: Improving Performance in Highspeed Wide Area Networks," presented at PFLDnet 2003, Feb. 3-4, 2003, Geneva, Switzerland, http://datatag.web.cem.ch/datatag/pfldnet2003/.
11. C. Jin, D. Wei, and S. Low, "FAST TCP: Motivation, architecture, algorithms, performance," in Proc. of IEEE Infocom, Hong Kong, Mar. 7-11, 2004.
12. L. Brakmo, L. Peterson, "TCP Vegas: End to End Congestion Avoidance on a Global Internet," IEEE Journal on Selected Areas in Communications, vol. 13, no. 8, pp. 1465-1480, Oct. 1995.
13. M. E. Crovella, M. Harchol-Balter, and C. D. Murta, "Task Assignment in a Distributed System: Improving Performance by Unbalancing Load," BUCS-TR-1997-018, October 31, 1997.
14. M. Veeraraghavan, X. Zheng, H. Lee, M. Gardner, and W. Feng, "CHEETAH: Circuit-switched High-speed End-to-End Transport ArcHitecture," in Proc. of Opticomm 2003, Dallas, TX, Oct. 13-17, 2003.