To send or not to send: Reducing the cost of data transmission

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 2472-2480

  Golubchik, Leana ^a   Khuller, Samir ^b   Mukherjee, Koyel ^b   Yao, Yuan ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH USAGE; COMPETITIVE RATIO; DELAY IN TRANSMISSION; DETERMINISTIC ONLINE ALGORITHMS; NETWORK TRAFFIC; ON-LINE ALGORITHMS; OPTIMAL SOLUTIONS; STRONG CORRELATION;

ALGORITHMS; DATA COMMUNICATION SYSTEMS; INTERNET SERVICE PROVIDERS;

COST REDUCTION;

EID: 84883087672     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6567053     Document Type: Conference Paper

References (14)

1. http://meta.wikimedia.org/wiki/Wikistats.
2. N. Bansal, T. Kimbrel, and K. Pruhs. Dynamic speed scaling to manage energy and temperature. In Proc. of the 45th IEEE Symposium on Foundations of Computer Science, pages 520-529, 2004.
3. M. Charikar and S. Khuller. A robust maximum completion time measure for scheduling. In Proc. of the 17th ACM-SIAM symposium on Discrete algorithm, pages 324-333, 2006.
4. X. Dimitropoulos, P. Hurley, A. Kind, and M. Stoecklin. On the 95- percentile billing method. Passive and Active Network Measurement, pages 207-216, 2009.
5. D. Goldenberg, L. Qiuy, H. Xie, Y. R. Yang, and Y. Zhang. Optimizing cost and performance for multihoming. In Proc. of the ACM SIGCOMM, pages 79-92, 2004.
6. A. Gupta, R. Krishnaswamy, A. Kumar, and D. Segev. Scheduling with outliers. APPROX/RANDOM, pages 149-162, 2009.
7. L. Jez. A 4/3-competitive randomised algorithm for online packet scheduling with agreeable deadlines. In 27th International Symposium on Theoretical Aspects of Computer Science-STACS 2010, pages 489-500, 2010.
8. L. Jez. One to rule them all: A general randomized algorithm for buffer management with bounded delay. In Proc. of the 19th European Symposium on Algorithms, pages 239-250, 2011.
9. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in qos switches. In Proc. of the 33rd ACM symposium on Theory of computing, pages 520-529, 2001.
10. N. Laoutaris, G. Smaragdakis, P. Rodriguez, and R. Sundaram. Delay tolerant bulk data transfers on the internet. In Proc. of the 11th international joint conference on Measurement and modeling of computer systems, pages 229-238, 2009.
11. F. Li, J. Sethuraman, and C. Stein. An optimal online algorithm for packet scheduling with agreeable deadlines. In Proc. of the 16th annual ACM-SIAM symposium on Discrete algorithms, pages 801-802, 2005.
12. M. Pinedo. Scheduling: Theory, Algorithms and Systems. Prentice Hall, second edition, 2006.
13. F. Yao, A. Demers, and S. Shenker. A scheduling model for reduced cpu energy. In Proc. of the 36th Symposium on Foundations of Computer Science, pages 374-382, 1995.
14. B. Zhou, D. He, and Z. Sun. Network Traffic Modeling and Prediction with ARIMA/GARCH. In Proc. of HET-NETs Conference, pages 1-10, 2005.