Reconfigurable routing in data center networks (2401.13359v2)
Abstract: A hybrid network is a static (electronic) network that is augmented with optical switches. The Reconfigurable Routing Problem (RRP) in hybrid networks is the problem of finding settings for the optical switches augmenting a static network so as to achieve optimal delivery of some given workload. The problem has previously been studied in various scenarios with both tractability and NP-hardness results obtained. However, the data center and interconnection networks to which the problem is most relevant are almost always such that the static network is highly structured (and often node-symmetric) whereas all previous results assume that the static network can be arbitrary (which makes existing computational hardness results less technologically relevant and also easier to obtain). In this paper, and for the first time, we prove various intractability results for RRP where the underlying static network is highly structured, for example consisting of a hypercube, and also extend some existing tractability results.
- A scalable, commodity data center network architecture. ACM SIGCOMM Comput. Commun. Rev., 38:63–74, 2008.
- Toward demand-aware networking: a theory for self-adjusting networks. ACM SIGCOMM Comput. Commun. Rev., 48:31–40, 2019.
- Approximation hardness of bounded degree MIN-CSP and MIN-BISECTION. In Proc. of 29th Int. Colloq. on Automata, Languages and Programming (ICALP), pages 623–632, 2002.
- The features, hardware, and architectures of data center networks: a survey. J. Parallel Distrib. Comput., 96:45–74, 2016.
- The bisection width of cubic graphs. Bull. Austral. Math. Soc., pages 389–396, 1988.
- Efficient non-segregated routing for reconfigurable demand-aware networks. In Proc. of IFIP Networking Conf., pages 1–9. IEEE Press, 2019.
- Efficient non-segregated routing for reconfigurable demand-aware networks. Comput. Commun., 164:138–147, 2020.
- Characterizing the algorithmic complexity of reconfigurable data center architectures. In Proc. of Symp. on Architectures for Networking and Communications Systems (ANCS), pages 89–96. ACM Press, 2018.
- On the complexity of non-segregated routing in reconfigurable data center architectures. ACM SIGCOMM Comput. Commun. Rev., 49:2–81, 2019.
- Survey of reconfigurable data center networks: enablers, algorithms, complexity. ACM SIGACT News, 50:62–79, 2019.
- Teofilo F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci., pages 293–306, 1985.
- BCube: A high performance, server-centric network architecture for modular data centers. ACM SIGCOMM Comput. Commun. Rev., 39:63–74, 2009.
- DCell: a scalable and fault-tolerant network structure for data centers. In Proc. of ACM SIGCOMM Conf. on Data Communication, pages 75–86, 2008.
- A survey of reconfigurable optical networks. Opt. Switch. Netw., 41:100621, 2021.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.