How to split a flow?

Proceedings - IEEE INFOCOM

Volumn , Issue , 2012, Pages 828-836

  Hartman, Tzvika ^a   Hassidim, Avinatan ^a   Kaplan, Haim ^a,b   Raz, Danny ^a,c   Segalov, Michal ^a  

^a Google Inc   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DESTINATION NODES; FLOW ALGORITHM; NETWORK LINKS;

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

References (18)

1. M. Al-Fares, A. Loukissas, and A. Vahdat, "A scalable, commodity data center network architecture," in SIGCOMM, 2008.
2. G. Baier, E. Köhler, and M. Skutella, "The k-splittable flow problem," Algorithmica, vol. 42, pp. 231-248, 2005.
3. T. Benson, A. Anand, A. Akella, and M. Zhang, "The case for fine-grained traffic engineering in data centers," in Proceedings of the 2010 internet network management conference on Research on enterprise networking (INM/WREN'10). USENIX Association, 2010.
4. MPLS Traffic Engineering (TE) - Automatic Bandwidth Adjustment for TE Tunnels, Cisco.
5. E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
6. H. N. Gabow and R. E. Tarjan, "Algorithms for two bottleneck optimization problems," J. Algorithms, vol. 9, pp. 411-417, September 1988.
7. L. D. Ghein, MPLS Fundamentals. Cisco Press, 2006.
8. M. Grötschel, L. Lovász, and A. Schrijver, "The ellipsoid method and its consequences in combinatorial optimization," Combinatorica, vol. 1, no. 2, pp. 169-197, 1981.
9. Y. Hendel and W. Kubiak, "Decomposition of flow into paths to minimize their length."
10. L. Khachiyan, "A polynomial time algorithm in linear programming," Soviet Math. Dokl., vol. 20, pp. 191-195, 1979.
11. J. M. Kleinberg, "Single-source unsplittable flow," in FOCS, 1996, pp. 68-77.
12. S. G. Kolliopoulos, "Edge-disjoint paths and unsplittable flow," in Handbook of Approximation Algorithms and Metaheuristics, ser. Chapman and Hall/CRC, T. F. Gonzalez, Ed., 2007.
13. 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, pp. 69-74, March 2008.
14. V. S. Mirrokni, M. Thottan, H. Uzunalioglu, and S. Paul, "A simple polynomial time framework for reduced-path decomposition in multipath routing," in INFOCOM, 2004.
15. E. Osborne and A. Simha, Traffic Engineering with MPLS. Pearson Education, 2002.
16. A. Premji, Using MPLS Auto-bandwidth in MPLS Networks, Juniper Networks, Sunnyvale, CA 94089 USA.
17. M. Thorup, "Integer priority queues with decrease key in constant time and the single source shortest paths problem," J. Comput. Syst. Sci., vol. 69, no. 3, pp. 330-353, 2004.
18. B. Vatinlen, F. Chauvet, P. Chrétienne, and P. Mahey, "Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths," European Journal of Operational Research, vol. 185, pp. 1390-1401, 2008.