Low-complexity multi-resource packet scheduling for network function virtualization

Proceedings - IEEE INFOCOM

Volumn 26, Issue , 2015, Pages 1400-1408

  Li, Xin ^a   Qian, Chen ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COST BENEFIT ANALYSIS; HTTP; INTRUSION DETECTION; OPHTHALMOLOGY; PACKET NETWORKS; SCHEDULING; TRANSFER FUNCTIONS; VIRTUAL REALITY;

HARDWARE RESOURCES; INTERNET TRAFFIC; NETWORK FUNCTIONS; PACKET PROCESSING; PACKET SCHEDULING; PACKET SCHEDULING ALGORITHM; PROTOTYPE IMPLEMENTATIONS; VIRTUAL NETWORKS;

SCHEDULING ALGORITHMS;

EID: 84954233339     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2015.7218517     Document Type: Conference Paper

References (36)

1. The caida ucsd anonymized internet traces 2013-2014. mar. http: //www. caida. org/data/passive/passive 2013 dataset. xml.
2. NS3. http: //www. nsnam. org/.
3. M. Al-Fares, A. Loukissas, and A. Vahdat. A Scalable, Commodity Data Center Network Architecture. In Proc. of ACM SIGCOMM, 2008.
4. A. Anand, A. Gupta, A. Akella, S. Seshan, and S. Shenker. Packet caches on routers: The implications of universal redundant traffic elimination. In Proc. of ACM SIGCOMM, 2008.
5. T. Benson, A. Akella, and D. Maltz. Network traffic characteristics of data centers in the wild. In Proc. of ACM IMC, 2010.
6. G. Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 55 (1): 58-75, 2005.
7. M. E. Crovella and A. Bestavros. Self-similarity in World Wide Web traffic: Evidence and possible causes. Proc. of SIGMETRICS, 1996.
8. W. Cui and C. Qian. Difs: Distributed flow scheduling for adaptive routing in hierarchical data center networks. In Proc. of ACM/IEEE ANCS, 2014.
9. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Proc. of ACM SIGCOMM, 1989.
10. C. Estan and G. Varghese. New Directions in Traffic Measurement and Accounting. In Proc. of ACM SIGCOMM.
11. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. In Proc. of ACM SIGCOMM, 1999.
12. A. Ghodsi, V. Sekar, M. Zaharia, and I. Stoica. Multi-resource fair queueing for packet processing. In Proc. of ACM SIGCOMM, 2012.
13. A. Ghodsi, M. Zaharia, B. Hindman, A. Konwinski, S. Shenker, and I. Stoica. Dominant resource fairness: fair allocation of multiple resource types. In Proc. of USENIX NSDI, 2011.
14. M. L. Goldstein, S. A. Morris, and G. G. Yen. Problems with fitting to the power-law distribution. The European Physical Journal BCondensed Matter and Complex Systems, 41 (2): 255-58, 2004.
15. P. Goyal, H. M. Vin, and H. Chen. Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks. In Proc. of ACM SIGCOMM, 1996.
16. R. Guerzoni et al. Network functions virtualisation: An introduction, benefits, enablers, challenges and call for action, introductory white paper. In SDN and Open Flow World Congress, 2012.
17. L. Guo and I. Matta. The war between mice and elephants. In Proc. of IEEE ICNP, 2001.
18. E. Kohler. The Click Modular Router. PhD thesis, Massachusetts Institute of Technology, 2000.
19. M. E. Newman. Power laws, Pareto distributions and Zipf's law. Contemporary physics, 46 (5): 323-351, 2005.
20. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Transactions on Networking, 1 (3): 344-357, 1993.
21. V. Paxson and S. Floyd. Wide area traffic: The failure of Poisson modeling. IEEE/ACM Transactions on Networking, 3 (3): 226-244, 1995.
22. C. Qian and S. Lam. ROME: Routing On Metropolitan-scale Ethernet . In Proceedings of IEEE ICNP, 2012.
23. I. A. Rai, G. Urvoy-Keller, and E. W. Biersack. Analysis of LAS scheduling for job size distributions with high variance. In Proc. of ACM SIGMETRICS.
24. V. Sekar, N. Egi, S. Ratnasamy, M. K. Reiter, and G. Shi. Design and implementation of a consolidated middlebox architecture. In Proc. of USENIX NSDI, 2012.
25. J. Sherry and S. Ratnasamy. A Survey of Enterprise Middlebox Deployments. Technical report, EECS, UC Berkeley, 2012.
26. R. Smith, N. Goyal, J. Ormont, K. Sankaralingam, and C. Estan. Signature Matching in Network Processing Using SIMD/GPU Architectures. In Proc. of IEEE ISPASS, 2009.
27. N. Spring, R. Mahajan, and D. Wetherall. Measuring ISP topologies with Rocketfuel. 2002.
28. B. Suter, T. V. Lakshman, D. Stiliadis, and A. Choudhury. Design considerations for supporting TCP with per-flow queueing. In Proc. of IEEE INFOCOM, 1998.
29. W. Wang, B. Li, and B. Liang. Multi-Resource Round Robin: A Low Complexity Packet Scheduler with Dominant Resource Fairness. In Proc. of IEEE ICNP, 2013.
30. W. Wang, B. Liang, and B. Li. Low Complexity Multi-Resource Fair Queueing with Bounded Delay. In Proc. of IEEE INFOCOM, 2014.
31. Z. Wang, Z. Qian, Q. Xu, Z. Mao, and M. Zhang. An untold story of middleboxes in cellular networks. In Proc. of ACM SIGCOMM, 2011.
32. W. Willinger, M. S. Taqqu, R. Sherman, and D. V. Wilson. Self-similarity through high-variability: Statistical analysis of ethernet LAN traffic at the source level. IEEE/ACM Transactions on Networking, 1997.
33. M. Yu, L. Jose, and R. Miao. Software defined traffic measurement with opensketch. In Proc. of USENIX NSDI, 2013.
34. Y. Yu and C. Qian. Space shuffle: A scalable, flexible, and highbandwidth data center network. In Proceedings of IEEE ICNP, 2014.
35. Y. Yu, C. Qian, and X. Li. Distributed collaborative monitoring in software defined networks. In Proc. of ACM HotSDN, 2014.
36. L. Zhang. Virtual clock: A new traffic control algorithm for packet switching networks. In Proc. of ACM SIGCOMM, 1990.