Size-based flow-scheduling using spike-detection

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6751 LNCS, Issue , 2011, Pages 331-345

  Divakaran, Dinil Mon ^a   Altman, Eitan ^b   Vicat Blanc Primet, Pascale ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MANDI   (India)

^b INRIA ^*  (India)

Author keywords

Flows; Networks; Performance modelling; Queueing; Scheduling

Indexed keywords

BUFFER LENGTH; ELEPHANT FLOW; FLOWS; HIGH LOAD; PERFORMANCE MODELLING; QUEUEING; SIZE-BASED SCHEDULING;

MAMMALS; QUEUEING THEORY; STOCHASTIC SYSTEMS;

SCHEDULING;

EID: 79959365809     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21713-5_24     Document Type: Conference Paper

References (14)

1. Aalto, S., Ayesta, U.: Mean delay analysis of multi level processor sharing disciplines. In: INFOCOM (April 2006)
2. Avrachenkov, K., Ayesta, U., Brown, P., Nyberg, E.: Differentiation Between Short and Long TCP Flows: Predictability of the Response Time. In: Proc. IEEE INFOCOM (2004)
3. Collange, D., Costeux, J.L.: Passive estimation of quality of experience. J. UCS 14(5), 625-641 (2008)
4. Divakaran, D.M., Carofiglio, G., Altman, E., Vicat-Blanc Primet, P.: A Flow Scheduler Architecture. In: IFIP/TC6 Networking 2010, pp. 122-134 (May 2010)
5. Estan, C., Varghese, G.: New directions in traffic measurement and accounting. SIGCOMM Comput. Commun. Rev. 32(4), 323-336 (2002)
6. Harchol-Balter, M., Schroeder, B., Bansal, N., Agrawal, M.: Size-based scheduling to improve web performance. ACM Trans. Comput. Syst. 21(2), 207-233 (2003)
7. John, W., Tafvelin, S., Olovsson, T.: Trends and Differences in Connection- Behavior within Classes of Internet Backbone Traffic. In: PAM, pp. 192-201 (2008)
8. Kleinrock, L., Muntz, R.R.: Processor sharing queueing models of mixed scheduling disciplines for time shared system. J. ACM 19(3), 464-482 (1972)
9. Kleinrock, L.: Queueing Systems: Computer Applications, vol. II. Wiley Interscience, Hoboken (1976)
10. Psounis, K., Ghosh, A., Prabhakar, B., Wang, G.: SIFT: A simple algorithm for tracking elephant flows, and taking advantage of power laws. In: 43rd Annual Allerton Conf. on Control, Communication and Computing (2005)
11. Rai, I.A., Biersack, E.W., Urvoy-Keller, G.: Size-based scheduling to improve the performance of short TCP flows. IEEE Network 19(1), 12-17 (2005)
12. Schrage, L.: A proof of the optimality of the Shortest Remaining Processing Time Discipline. Operations Research 16, 687-690 (1968)
13. Yashkov, S.F.: Processor-sharing queues: some progress in analysis. Queueing Syst. Theory Appl. 2(1), 1-17 (1987)
14. Zseby, T., et al: RFC 5475: Techniques for IP Packet Selection. Network Working Group (March 2009), http://www.rfc-editor.org/rfc/rfc5475.txt