On the effect of forwarding table size on SDN network utilization

Proceedings - IEEE INFOCOM

Volumn , Issue , 2014, Pages 1734-1742

  Cohen, Rami ^a   Lewin Eytan, Liane ^a   Naor, Joseph Seffi ^b   Raz, Danny ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION;

EXTENSIVE SIMULATIONS; FORWARDING TABLES; LEADING TECHNOLOGY; NET WORK UTILIZATION; NETWORKING DEVICES; OPTIMIZATION PROBLEMS; SOFTWARE-DEFINED NETWORKS; TRAFFIC ENGINEERING;

APPROXIMATION ALGORITHMS;

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

References (16)

1. S. Agarwal, M. Kodialam, and T.V. Lakshman. Traffic engineering in Software Defined Networks. Proceedings of IEEE Infocom 2013.
2. R. Albert and A.L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, Vol. 74, pp. 47-97, 2002.
3. G. Baier, E. Kohler, and M. Skutella. The k-splittable fow problem. Algorithmica, Vol. 42, pp. 231178, 2005.
4. J. Chen, R. Rajaraman, and R. Sundaram. Meet and merge: approximation algorithms for confluent flow. Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pp. 373-382, 2003.
5. J. Chen, R.D. Kleinberg, L. Lovasz, R. Rajaraman, R. Sundaram, and A. Vetta. (Almost) Tight bounds and existence theorems for singlecommodity confluent flows. Journal of the ACM, Vol. 54(4), Article 16, 2007.
6. P. Donovan, B. Shepherd, A. Vetta, and G.Wilfong. Degree-Constrained Network Flows. Proceedings of the 39th annual ACM symposium on theory of computing (STOC), pp. 681-688, 2007.
7. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. ACM SIGCOMM Comput. Commun. Rev., Vol. 29(4), pp. 251-262, 1999.
8. N. Garg, and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput., Vol. 37(2), pp. 630-652, (2007)
9. C. Guo, G. Lu, D. Li, H.Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and Songwu Lu. BCube: A high performance, server-centric network architecture for modular data centers. Proceedings of the ACM SIGCOMM 2009 conference on Data communication, 2009.
10. T. Hartman, A. Hassidim, H. Kaplan, D. Raz, and M. Segalov. How to split a flow Proceedings of IEEE Infocom 2012.
11. J. M. Kleinberg. Single-source unsplittable flow. Proceedings of FOCS 1996, pp. 6817.
12. S.G. Kolliopoulos. Edge-disjoint paths and unsplittable flow. Handbook of Approximation Algorithms and Metaheuristics, ser. Chapman and Hall/CRC, T.F. Gonzalez, Ed., 2007.
13. C.E. Leiserson. Fat-trees: Universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, 1985.
14. N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner. OpenFlow: enabling innovation in campus networks. SIGCOMM Comput. Commun. Rev., Vol. 38(2), 2008.
15. R. Narayanan, S. Kotha, G. Lin, A. Khan, S. Rizvi, W. Javed, H. Khan, and S.A. Khayam. Macroflows and Microflows: Enabling Rapid Network Innovation through a Split SDN Data Plane. 2012 European Workshop on Software Defined Networking (EWSDN), pp. 79-84, 2012.
16. B. Stephens, A. Cox, W. Felter, C. Dixon, and J. Carter. PAST: scalable ethernet for data centers. Proceedings of the 8th international conference on Emerging networking experiments and technologies (CoNEXT '12), pp. 49-60, 2012.