article

Costly circuits, submodular schedules and approximate Carathéodory Theorems

Authors:

Shaileshh Bojja Venkatakrishnan,

Mohammad Alizadeh,

Pramod ViswanathAuthors Info & Claims

Queueing Systems: Theory and Applications, Volume 88, Issue 3-4

Pages 311 - 347

https://doi.org/10.1007/s11134-017-9546-x

Published: 01 April 2018 Publication History

Abstract

Hybrid switching--in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch--is a promising alternative to interconnect servers in today's large-scale data centers. Circuit switches offer a very high link rate, but incur a non-trivial reconfiguration delay which makes their scheduling challenging. In this paper, we demonstrate a lightweight, simple and nearly optimal scheduling algorithm that trades off reconfiguration costs with the benefits of reconfiguration that match the traffic demands. Seen alternatively, the algorithm provides a fast and approximate solution toward a constructive version of Carathéodory's Theorem for the Birkhoff polytope. The algorithm also has strong connections to submodular optimization, achieves a performance at least half that of the optimal schedule and strictly outperforms the state of the art in a variety of traffic demand settings. These ideas naturally generalize: we see that indirect routing leads to exponential connectivity; this is another phenomenon of the power of multi-hop routing, distinct from the well-known load balancing effects.

References

[1]

Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (1993). https://books.google.com/books?id=WnZRAAAAMAAJ

Digital Library

[2]

Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., Vahdat, A.: Hedera: dynamic flow scheduling for data center networks. NSDI 10, 19---19 (2010)

Digital Library

[3]

Alizadeh, M., Greenberg, A., Maltz, D.A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., Sridharan, M.: Data center TCP (DCTCP). In: SIGCOMM (2011)

Digital Library

[4]

Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121---164 (2012)

[5]

Azar, Y., Gamzu, I.: Efficient submodular function maximization under linear packing constraints. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) Automata, Languages, and Programming, pp. 38---50. Springer, Berlin, Heidelberg (2012)

Digital Library

[6]

Barman, S.: Approximating Nash equilibria and dense bipartite subgraphs via an approximate version of Carathéodory's theorem. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pp. 361---369. ACM (2015)

Digital Library

[7]

Barnhart, C., Sheffi, Y.: A network-based primal-dual heuristic for the solution of multicommodity network flow problems. Transp. Sci. 27(2), 102---117 (1993)

Digital Library

[8]

Benson, T., Akella, A., Maltz, D.A.: Network traffic characteristics of data centers in the wild. In: SIGCOMM (2010)

Digital Library

[9]

Bienstock, D., Chopra, S., Günlük, O., Tsai, C.Y.: Minimum cost capacity installation for multicommodity network flows. Math. Program. 81(2), 177---199 (1998)

Digital Library

[10]

Cao, Z., Kodialam, M., Lakshman, T.: Joint static and dynamic traffic scheduling in data center networks. In: INFOCOM (2014)

[11]

Chang, C.S., Chen, W.J., Huang, H.Y.: Birkhoff---von Neumann input buffered crossbar switches. In: INFOCOM (2000)

[12]

Chang, C.S., Lee, D.S., Jou, Y.S.: Load balanced Birkhoff---von Neumann switches. In: 2001 IEEE Workshop on High Performance Switching and Routing, pp. 276---280. IEEE (2001)

[13]

Dasylva, A., Srikant, R.: Optimal wdm schedules for optical star networks. IEEE/ACM Trans. Netw. (TON) 7(3), 446---456 (1999)

Digital Library

[14]

Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. ACM 61(1), 1:1---1:23 (2014).

Digital Library

[15]

Duan, R., Su, H.H.: A scaling algorithm for maximum weight matching in bipartite graphs. In: SODA (2012)

Digital Library

[16]

Farrington, N.: Optics in data center network architecture. Ph.D. thesis, Citeseer (2012)

Digital Library

[17]

Farrington, N., Porter, G., Radhakrishnan, S., Bazzaz, H.H., Subramanya, V., Fainman, Y., Papen, G., Vahdat, A.: Helios: a hybrid electrical/optical switch architecture for modular data centers. In: SIGCOMM (2011)

Digital Library

[18]

Felzenszwalb, P.F., Zabih, R.: Dynamic programming and graph algorithms in computer vision. IEEE Trans. Pattern Anal. Mach. Intell. 33(4), 721---740 (2011)

Digital Library

[19]

Ferreira, R.P.M., Luna, H.P.L., Mahey, P., Souza, M.C.D.: Global optimization of capacity expansion and flow assignment in multicommodity networks. Pesquisa Operacional 33(2), 217---234 (2013)

[20]

Fleischer, L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13(4), 505---520 (2000)

Digital Library

[21]

Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596---615 (1987)

Digital Library

[22]

Fu, S., Wu, B., Jiang, X., Pattavina, A., Zhang, L., Xu, S.: Cost and delay tradeoff in three-stage switch architecture for data center networks. In: HPSR (2013)

[23]

Garg, N., Koenemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630---652 (2007)

Digital Library

[24]

Giaccone, P., Prabhakar, B., Shah, D.: Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE J. Sel. Areas Commun. 21(4), 546---559 (2003)

Digital Library

[25]

Gopal, I.S., Wong, C.K.: Minimizing the number of switchings in an SS/TDMA system. IEEE Trans. Commun. 33(6), 497---501 (1985)

[26]

Greenberg, A., Lahiri, P., Maltz, D.A., Patel, P., Sengupta, S.: Towards a next generation data center architecture: scalability and commoditization. In: Proceedings of the ACM Workshop on Programmable Routers for Extensible Services of Tomorrow, pp. 57---62. ACM (2008)

Digital Library

[27]

Grötschel, M., Lovász, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169---197 (1981)

[28]

Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics. Springer (1993). https://books.google.com/books?id=agLvAAAAMAAJ

[29]

Hamedazimi, N., Qazi, Z., Gupta, H., Sekar, V., Das, S.R., Longtin, J.P., Shah, H., Tanwer, A.: Firefly: a reconfigurable wireless data center fabric using free-space optics. In: SIGCOMM (2014)

Digital Library

[30]

Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439---561 (2006)

[31]

Inukai, T.: An efficient SS/TDMA time slot assignment algorithm. IEEE Trans. Commun. 27(10), 1449---1455 (1979)

[32]

Kandula, S., Padhye, J., Bahl, P.: Flyways to de-congest data center networks. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) Springer, Berlin, Heidelberg (2009)

[33]

Keslassy, I., Chang, C.S., McKeown, N., Lee, D.S.: Optimal load-balancing. In: INFOCOM (2005). https://www.microsoft.com/en-us/research/publication/flyways-to-de-congest-data-center-networks/

[34]

Keslassy, I., Kodialam, M., Lakshman, T., Stiliadis, D.: On guaranteed smooth scheduling for input-queued switches. In: INFOCOM (2003)

[35]

Keslassy, I., Zhang-Shen, R., McKeown, N.: Maximum size matching is unstable for any packet switch. IEEE Commun. Lett. 7(10), 496---498 (2003)

[36]

Leighton, T., Makedon, F., Plotkin, S., Stein, C., Tardos, É., Tragoudas, S.: Fast approximation algorithms for multicommodity flow problems. J. Comput. Syst. Sci. 50(2), 228---243 (1995)

Digital Library

[37]

Li, X., Hamdi, M.: On scheduling optical packet switches with reconfiguration delay. IEEE J. Sel. Areas Commun. 21(7), 1156---1164 (2003)

Digital Library

[38]

Li, Y., Panwar, S., Chao, H.J.: Frame-based matching algorithms for optical switches. In: 2003 HPSR Workshop on High Performance Switching and Routing, pp. 97---102. IEEE (2003)

[39]

Liu, H., Lu, F., Forencich, A., Kapoor, R., Tewari, M., Voelker, G.M., Papen, G., Snoeren, A.C., Porter, G.: Circuit switching under the radar with reactor. In: NSDI (2014)

Digital Library

[40]

Liu, H., Mukerjee, M.K., Li, C., Feltman, N., Papen, G., Savage, S., Seshan, S., Voelker, G.M., Andersen, D.G., Kaminsky, M., Porter, G., Snoeren, A.C.: Scheduling techniques for hybrid circuit/packet networks. In: ACM CoNEXT (2015)

Digital Library

[41]

Mahey, P., Benchakroun, A., Boyer, F.: Capacity and flow assignment of data networks by generalized benders decomposition. J. Global Optim. 20(2), 169---189 (2001)

Digital Library

[42]

McKeown, N.: The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Netw. 7(2), 188---201 (1999)

Digital Library

[43]

McKeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% throughput in an input-queued switch. IEEE Trans. Commun. 47(8), 1260---1267 (1999)

[44]

Mekkittikul, A., McKeown, N.: A practical scheduling algorithm to achieve 100% throughput in input-queued switches. In: INFOCOM (1998)

[45]

Mirrokni, V., Leme, R.P., Vladu, A., Wong, S.C.W.: Tight bounds for approximate Carathéodory and beyond. arXiv preprint arXiv:1512.08602 (2015)

[46]

Pettie, S., Sanders, P.: A simpler linear time 2/3-$$\varepsilon $$? approximation for maximum weight matching. Inf. Process. Lett. 91(6), 271---276 (2004)

Digital Library

[47]

Pinsker, M.S.: On the complexity of a concentrator. In: 7th International Telegraffic Conference, Vol. 4, pp. 1---318. Citeseer (1973)

[48]

Porter, G., Strong, R., Farrington, N., Forencich, A., Chen-Sun, P., Rosing, T., Fainman, Y., Papen, G., Vahdat, A.: Integrating microsecond circuit switching into the data center. In: SIGCOMM (2013)

Digital Library

[49]

Prabhakar, B., McKeown, N.: On the speedup required for combined input-and output-queued switching. Automatica 35(12), 1909---1920 (1999)

Digital Library

[50]

Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM (JACM) 36(2), 335---348 (1989)

Digital Library

[51]

Roy, A., Zeng, H., Bagga, J., Porter, G., Snoeren, A.C.: Inside the social network's (datacenter) network. In: SIGCOMM (2015)

Digital Library

[52]

Schrijver, A.: Combinatorial Optimization--Polyhedra and Efficiency. Springer, Berlin (2003)

[53]

Shieh, A., Kandula, S., Greenberg, A.G., Kim, C.: Seawall: performance isolation for cloud datacenter networks. In: HotCloud (2010)

Digital Library

[54]

Singla, A., Singh, A., Chen, Y.: OSA: an optical switching architecture for data center networks with unprecedented flexibility. In: NSDI (2012)

Digital Library

[55]

Srikant, R., Ying, L.: Communication Networks: An Optimization, Control and Stochastic Networks Perspective. Cambridge University Press, New York, NY (2014)

Digital Library

[56]

Towles, B., Dally, W.J.: Guaranteed scheduling for switches with configuration overhead. IEEE/ACM Trans. Netw. 11(5), 835---847 (2003)

Digital Library

[57]

Valiant, L.G.: A bridging model for parallel computation. Commun. ACM 33(8), 103---111 (1990)

Digital Library

[58]

Wang, C.H., Javidi, T.: Adaptive policies for scheduling with reconfiguration delay: an end-to-end solution for all-optical data centers. ArXiv preprint arXiv:1511.03417 (2015)

[59]

Wang, C.H., Javidi, T., Porter, G.: End-to-end scheduling for all-optical data centers. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 406---414. IEEE (2015)

[60]

Wang, G., Andersen, D.G., Kaminsky, M., Papagiannaki, K., Ng, T., Kozuch, M., Ryan, M.: c-through: part-time optics in data centers. In: SIGCOMM (2011)

Digital Library

[61]

Wu, B., Yeung, K.L.: Nxg05-6: minimum delay scheduling in scalable hybrid electronic/optical packet switches. In: GLOBECOM (2006)

[62]

Wu, B., Yeung, K.L., Wang, X.: Nxg06-4: improving scheduling efficiency for high-speed routers with optical switch fabrics. In: GLOBECOM (2006)

[63]

Zhou, X., Zhang, Z., Zhu, Y., Li, Y., Kumar, S., Vahdat, A., Zhao, B.Y., Zheng, H.: Mirror mirror on the ceiling: flexible wireless links for data centers. In: SIGCOMM (2012)

Digital Library

Cited By

Dai WFoerster KFuchssteiner DSchmid S(2023)Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow RoutingACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/35972008:3(1-30)Online publication date: 12-May-2023
https://dl.acm.org/doi/10.1145/3597200
Addanki VAvin CSchmid S(2023)Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35793127:1(1-43)Online publication date: 2-Mar-2023
https://dl.acm.org/doi/10.1145/3579312
Foerster KSchmid S(2019)Survey of Reconfigurable Data Center NetworksACM SIGACT News10.1145/3351452.335146450:2(62-79)Online publication date: 24-Jul-2019
https://dl.acm.org/doi/10.1145/3351452.3351464
Show More Cited By

Recommendations

Costly Circuits, Submodular Schedules and Approximate Carathéodory Theorems
SIGMETRICS '16: Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science

Hybrid switching -- in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch -- is a promising alternative to interconnect servers in today's large scale data centers. Circuit switches ...
Costly Circuits, Submodular Schedules and Approximate Carathéodory Theorems
Performance evaluation review

Hybrid switching -- in which a high bandwidth circuit switch (optical or wireless) is used in conjunction with a low bandwidth packet switch -- is a promising alternative to interconnect servers in today's large scale data centers. Circuit switches ...
Computational Aspects of the Colorful Carathéodory Theorem

Let $$C_1,\dots ,C_{d+1}\subset \mathbb {R}^d$$C1,ý,Cd+1ýRd be $$d+1$$d+1 point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $$p_1, \dots , p_{d+1}$$p1,ý,pd+1 with $$p_i \in C_i$$piýCi, ...

Comments

Information & Contributors

Information

Published In

cover image Queueing Systems: Theory and Applications

Queueing Systems: Theory and Applications Volume 88, Issue 3-4

April 2018

199 pages

ISSN:0257-0130

Issue’s Table of Contents

Copyright © Copyright © 2018 Springer Science+Business Media, LLC, part of Springer Nature.

Publisher

J. C. Baltzer AG, Science Publishers

United States

Publication History

Published: 01 April 2018

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Dai WFoerster KFuchssteiner DSchmid S(2023)Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow RoutingACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/35972008:3(1-30)Online publication date: 12-May-2023
https://dl.acm.org/doi/10.1145/3597200
Addanki VAvin CSchmid S(2023)Mars: Near-Optimal Throughput with Shallow Buffers in Reconfigurable Datacenter NetworksProceedings of the ACM on Measurement and Analysis of Computing Systems10.1145/35793127:1(1-43)Online publication date: 2-Mar-2023
https://dl.acm.org/doi/10.1145/3579312
Foerster KSchmid S(2019)Survey of Reconfigurable Data Center NetworksACM SIGACT News10.1145/3351452.335146450:2(62-79)Online publication date: 24-Jul-2019
https://dl.acm.org/doi/10.1145/3351452.3351464
Foerster KPacut MSchmid S(2019)On the Complexity of Non-Segregated Routing in Reconfigurable Data Center ArchitecturesACM SIGCOMM Computer Communication Review10.1145/3336937.333693949:2(2-8)Online publication date: 21-May-2019
https://dl.acm.org/doi/10.1145/3336937.3336939

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents