In Compute/Memory Dynamic Packet/Circuit Switch Placement for Optically Disaggregated Data Centers

Adaranijo Peters; George Oikonomou; Georgios Zervas

doi:10.1364/JOCN.10.00B164

Journal of Optical Communications and Networking
Vol. 10,
Issue 7,
pp. B164-B178
(2018)
•https://doi.org/10.1364/JOCN.10.00B164

In Compute/Memory Dynamic Packet/Circuit Switch Placement for Optically Disaggregated Data Centers

Adaranijo Peters, George Oikonomou, and Georgios Zervas

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Adaranijo Peters, George Oikonomou, and Georgios Zervas, "In Compute/Memory Dynamic Packet/Circuit Switch Placement for Optically Disaggregated Data Centers," J. Opt. Commun. Netw. 10, B164-B178 (2018)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Abstract

Network function services on conventional hybrid data center (DC) architectures such as HELIOS are hard-wired and dedicated to specific network resources. This limits flexibility and performance to handle diverse traffic patterns. Furthermore, disaggregation of server resources has shown promising potential to improve resource utilization, which has been a limitation of conventional server-centric DCs. This paper presents a reconfigurable hybrid disaggregated DC (dRedBox) architecture that combines the concept of server resource disaggregation with cutting-edge software and electronic and optical technologies. The dRedBox architecture provides a remarkable amount of flexibility and connectivity through hardware-based multilayer network function service programmability. This allows for multilayer network services to be dynamically deployed at runtime to network resources and, in turn, handle diverse traffic patterns. Furthermore, this study proposes algorithms and strategies for selecting and deploying electronic packet switching and optical circuit switching function services to implement virtual machine network requests across dRedBox and conventional hybrid disaggregated architectures under different traffic patterns. Finally, the performance of the various strategies on the dRedBox and conventional hybrid disaggregated DC architectures is evaluated in terms of blocking probability, energy efficiency, network utilization, and cost. Extensive results show that, at 10% blocking probability, dRedBox architecture achieves 100% gain on VM placement and 92% energy savings compared with conventional hybrid disaggregated architectures.

Full Article | PDF Article

More Like This

Optically Disaggregated Data Centers With Minimal Remote Memory Latency: Technologies, Architectures, and Resource Allocation [Invited]

Georgios Zervas, Hui Yuan, Arsalan Saljoghei, Qianqiao Chen, and Vaibhawa Mishra
J. Opt. Commun. Netw. 10(2) A270-A285 (2018)

DACON: a reconfigurable application-centric optical network for disaggregated data center infrastructures [Invited]

Xiaotao Guo, Xuwei Xue, Fulong Yan, Bitao Pan, Georgios Exarchakos, and Nicola Calabretta
J. Opt. Commun. Netw. 14(1) A69-A80 (2022)

Disaggregated optical-layer switching for optically composable disaggregated computing [Invited]

Kiyo Ishii, Ryosuke Matsumoto, Takashi Inoue, and Shu Namiki
J. Opt. Commun. Netw. 15(1) A11-A25 (2023)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (13)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (4)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Symbol	Description
$G (N, E)$	Graph representing a transparent DC network topology where $N$ is the set of network nodes (bricks, EoTs, ToRs, and ToCs), and $E$ is the set of physical links.
$R$	Set of sets where each set $R_{i}$ represents a VM network request to be deployed in the DC network.
$N_{R_{i}}^{CPU}$	Set of CPU bricks in $R_{i}$ .
$N_{R_{i}}^{MEM}$	Set of memory bricks in $R_{i}$ .
$B$	VM network request matrix where each element is a bandwidth requirement for a network link between a CPU brick in $N_{R_{i}}^{CPU}$ and a memory brick in $N_{R_{i}}^{MEM}$ . The rows and columns of the VM network request matrix represents the CPU bricks and memory bricks, respectively.
$P$	Set of subsets where each subset $P_{i}$ is a unique set or multiset of two elements and represents a possible way that different numbers of CPU and memory bricks in a VM network request can be paired to build EPS virtual/logical topologies. The first element $p_{i, 1}$ and the second element $p_{i, 2}$ of each subset represents the number of CPU bricks and memory bricks, respectively.
$C$	Set of subsets where each subset $C_{i}$ contains a possible combination of the CPU bricks in $N_{R_{i}}^{CPU}$ , and each element $c_{i, j}$ represents the $j$ th CPU brick in $C_{i}$ .
$C M$	Set of memory bricks where each element represents a memory brick, which requires a network link from all the CPU bricks in $C_{i}$ .
$M$	Set of subsets where each subset $M_{i}$ contains a possible combination of the memory bricks in $C M$ , and each element $m_{i, j}$ represents the $j$ th memory brick in $M_{i}$ .
$V$	A set that is the union of all elements in $C_{i}$ and $M_{i}$ .
$TX cap$	Capacity of a transceiver.
$t b_{c_{i, j}}$	Sum of required bandwidth of network links from a CPU brick in $C_{i}$ to all memory bricks in $M_{i}$ .
${t b}_{m_{i, j}}$	Sum of required bandwidth of network links from all CPU bricks in $C_{i}$ to a memory brick in $M_{i}$ .
$x_{c_{i, j}}$	Equals 1 if $t b_{c_{i, j}} \leq TX cap$ , otherwise equals 0.
$x_{m_{i, j}}$	Equals 1 if $t b_{m_{i, j}} \leq TX cap$ , otherwise equals 0.
$K$	Set that contains candidate bricks or electronic packet switches that can be used to build EPS virtual/logical topologies.
$L$	Number of candidate bricks or electronic packet switches in $K$ .
TDB	Database for EPS virtual/logical topologies.
OT	Set that contains the remaining network links in $B$ that have not been used to create an EPS virtual/logical topology.
$Z$	Set of sets where each subset $Z_{s}$ represents a created topology for the VM network request $R_{i}$ , and element $z_{s, d}$ represents the $d$ th link in $Z_{s}$ .
$N Z$	Number of generated topologies in $Z$ .
$f_{Z_{s}}$	Number of links to established in $Z_{s}$ .
$b_{z_{s, d}}$	Required bandwidth for link $z_{s, d}$ .
$e b_{z_{s, d}}$	Bandwidth in an existing network path for link $z_{s, d}$ .
$h_{z_{s, d}}$	Equals to 1 if resources are available for link $z_{s, d}$ , otherwise equals 0.

Component	Power (W)	Cost ($)
Optical switch port	0.05	500
Electronic switch port	12.5	500
Transceiver 10G	1	50

Symbol	Description
$G (N, E)$	Graph representing a transparent DC network topology where $N$ is the set of network nodes (bricks, EoTs, ToRs, and ToCs), and $E$ is the set of physical links.
$R$	Set of sets where each set $R_{i}$ represents a VM network request to be deployed in the DC network.
$N_{R_{i}}^{CPU}$	Set of CPU bricks in $R_{i}$ .
$N_{R_{i}}^{MEM}$	Set of memory bricks in $R_{i}$ .
$B$	VM network request matrix where each element is a bandwidth requirement for a network link between a CPU brick in $N_{R_{i}}^{CPU}$ and a memory brick in $N_{R_{i}}^{MEM}$ . The rows and columns of the VM network request matrix represents the CPU bricks and memory bricks, respectively.
$P$	Set of subsets where each subset $P_{i}$ is a unique set or multiset of two elements and represents a possible way that different numbers of CPU and memory bricks in a VM network request can be paired to build EPS virtual/logical topologies. The first element $p_{i, 1}$ and the second element $p_{i, 2}$ of each subset represents the number of CPU bricks and memory bricks, respectively.
$C$	Set of subsets where each subset $C_{i}$ contains a possible combination of the CPU bricks in $N_{R_{i}}^{CPU}$ , and each element $c_{i, j}$ represents the $j$ th CPU brick in $C_{i}$ .
$C M$	Set of memory bricks where each element represents a memory brick, which requires a network link from all the CPU bricks in $C_{i}$ .
$M$	Set of subsets where each subset $M_{i}$ contains a possible combination of the memory bricks in $C M$ , and each element $m_{i, j}$ represents the $j$ th memory brick in $M_{i}$ .
$V$	A set that is the union of all elements in $C_{i}$ and $M_{i}$ .
$TX cap$	Capacity of a transceiver.
$t b_{c_{i, j}}$	Sum of required bandwidth of network links from a CPU brick in $C_{i}$ to all memory bricks in $M_{i}$ .
${t b}_{m_{i, j}}$	Sum of required bandwidth of network links from all CPU bricks in $C_{i}$ to a memory brick in $M_{i}$ .
$x_{c_{i, j}}$	Equals 1 if $t b_{c_{i, j}} \leq TX cap$ , otherwise equals 0.
$x_{m_{i, j}}$	Equals 1 if $t b_{m_{i, j}} \leq TX cap$ , otherwise equals 0.
$K$	Set that contains candidate bricks or electronic packet switches that can be used to build EPS virtual/logical topologies.
$L$	Number of candidate bricks or electronic packet switches in $K$ .
TDB	Database for EPS virtual/logical topologies.
OT	Set that contains the remaining network links in $B$ that have not been used to create an EPS virtual/logical topology.
$Z$	Set of sets where each subset $Z_{s}$ represents a created topology for the VM network request $R_{i}$ , and element $z_{s, d}$ represents the $d$ th link in $Z_{s}$ .
$N Z$	Number of generated topologies in $Z$ .
$f_{Z_{s}}$	Number of links to established in $Z_{s}$ .
$b_{z_{s, d}}$	Required bandwidth for link $z_{s, d}$ .
$e b_{z_{s, d}}$	Bandwidth in an existing network path for link $z_{s, d}$ .
$h_{z_{s, d}}$	Equals to 1 if resources are available for link $z_{s, d}$ , otherwise equals 0.

Component	Power (W)	Cost ($)
Optical switch port	0.05	500
Electronic switch port	12.5	500
Transceiver 10G	1	50

Abstract

Cited By

Figures (13)

Tables (4)

Journal of Optical Communications and Networking