Virtual Network Embedding for Switch-Centric Data Center Networks

2021 IEEE International Symposium on Circuits and Systems May 22-28, 2021 Virtual & Hybrid Conference

Virtual Network Embedding for

Switch-Centric Data Center Networks

*Simon Fraser University

**Huawei, Huawei Technologies

Ana Laura Gonzalez Rios*, Kamila Bekshentayeva*,

Maheeppartap Singh*, Soroush Haeri**, and Ljiljana Trajković*

Virtual Network Embedding for

Switch-Centric Data Center Networks

Communication Networks Laboratory http://www.ensc.sfu.ca/~ljilja/cnl/

Simon Fraser University

Vancouver, British Columbia, Canada

Roadmap

• Introduction

• Virtual network embedding

• Topologies in data center networks

• Experimental procedure and results

• Conclusion

• References

Roadmap

• Introduction

• Virtual network embedding

• Topologies in data center networks

• Experimental procedure and results

• Conclusion

• References

https://aws.amazon.com/blogs/publicsector/tag/data-center/

Amazon data center

Data center networks

• Data center networks (DCNs): essential infrastructure for provisioning diverse Internet services and applications

• Software defined networks and network function virtualization technologies:

• offer low implementation cost

• optimize DCNs resource utilization and energy efficiency

• Network virtualization:

• integrates distributed cloud computing services with physical storage, servers, and network resources by embedding multiple virtual networks (VNs) into a common physical substrate network (SN)

• Virtual network embedding (VNE): NP-hard problem with a large solution space

Roadmap

• Introduction

• Virtual network embedding

• Topologies in data center networks

• Experimental procedure and results

• Conclusion

• References

VNE: example

9

6 11

24 20

15 5

15

5 10

3 4

2

6

2 11

24

10 5

5

Virtual network embedding

• VNE problem may be solved by employing:

• heuristic uncoordinated algorithms

• coordination between embedding stages

VNE approaches: uncoordinated

• Uncoordinated two-stage algorithms solve:

• Virtual Node Mapping (VNoM): heuristic

• Virtual Link Mapping (VLiM):

• Shortest Path (SP): without path splitting

• Multi-Commodity Flow (MCF): with path splitting

• Restricted solution space: algorithms ignore preselection of node mappings

VNE algorithms: coordinated

• The coordinated two-stage algorithms solve:

• VNoM first while considering link constraints and availability

• VLiM then employs SP or MCF techniques

• The coordinated one-stage algorithms:

• Simultaneously solved by creating a suitable optimal virtual link between the nodes

Y. Zhou, Y. Li, D. Jin, L. Su, and L. Zeng, “A virtual network embedding scheme with two- stage node mapping based on physical resource migration,” in Proc. IEEE Int. Conf.

Commun. Syst., Singapore, Nov. 2010, pp. 761–766.

H. Yu, V. Anand, C. Qiao, H. Di, and X. Wei, “A cost efficient design of virtual infrastructures with joint node and link mapping,” J. Netw. Syst. Manage., vol. 20, no. 1, pp. 97–115, Sept. 2012.

Virtual networks embedding algorithms

Implemented algorithms:

• Monte Carlo Tree Search (MCTS)-based algorithms:

• Multi-Commodity Flow (MaVEn-M)

• Shortest path (MaVEn-S)

• Deterministic (D-ViNE) and Randomized (R-ViNE) algorithms

• Global Resource Capacity (GRC)

• GRC with Multi-Commodity Flow (GRC-M)

Coordinated virtual networks embedding algorithms

• MCTS-based Multi-Commodity Flow (MaVEn-M):

• Coordinates stages and embeds virtual links using MCF

• MCTS-based shortest path (MaVEn-S):

• Employs breadth first search to coordinate stages and to embed virtual links

• Global Resource Capacity Multi-Commodity Flow (GRC-M):

• Improves substrate resources utilization by allowing path splitting

S. Haeri and Lj. Trajkovic, “Virtual network embedding via Monte-Carlo tree search,”

IEEE Transactions on Cybernetics, vol. 47, no. 2, pp. 1–12, Feb. 2017.

S. Haeri, Q. Ding, Z. Li, and Lj. Trajković, “Global resource capacity algorithm with path splitting for virtual network embedding,” in Proc. IEEE Int. Symp. Circuits and Systems, Montreal, Canada, May 2016, pp. 666–669.

Coordinated virtual networks embedding algorithms

• ViNEYard:

• Deterministic: D-ViNE

• Randomized: R-ViNE

• Global Resource Capacity: GRC

M. Chowdhury, M. R. Rahman, and R. Boutaba, “ViNEYard: Virtual network embedding algorithms with coordinated node and link mapping,” IEEE/ACM Trans. Netw., vol. 20, no. 1, pp. 206–219, Feb. 2012.

Performance metrics

• Virtual network request (VNR) acceptance ratio

• Generated revenue

• Incurred cost (nodes and links)

• Substrate resource utilization

Performance metrics: VNR acceptance ratio

• VNR acceptance ratio of accepted requests among all requests:

• : number of accepted Virtual Network Requests (VNRs) in a given time interval

• : number of all arrived VNRs in time slot

• Goal: maximize acceptance ratio

p ^⌧ _a = ^| _{| (⌧)|}

^a

^{(⌧ ) |}

|

^a

(⌧ ) |

| (⌧)| ⌧

⌧

Performance metrics: generated revenue

• Revenue of infrastructure provider generated by embedding VNR

ᴪ

_! ^:

• 𝐺

^ᴪ!

(𝑁

^ᴪ!

, 𝐸

^ᴪ!

) ^:

the graph of the 𝑖^!" virtual network request

• 𝑤

_# ^and

𝑤

_$ : weights for CPU and bandwidth requests

• 𝑛

^{ᴪ! and}

𝑒

^ᴪ!: virtual nodes and links

• 𝒞(𝑛

^ᴪ!

)

^and

ℬ(𝑒

^ᴪ!

)

: CPU and bandwidth requirements

• Assumption:

𝑤

_#

= 𝑤

_$

= 1

• Goal: maximize revenue

R(G

ⁱ

) = w

_c

X

n ⁱ2N ⁱ

C(n

ⁱ

) + w

_b

X

e ⁱ2E ⁱ

B(e

ⁱ

)

Performance metrics: incurred cost

• Cost of embedding configuration and allocating substrate resources:

• : allocated bandwidth of a substrate link 𝑒^# allocated to the virtual link 𝑒^$!

• Goal: minimize the cost

C(G

ⁱ

) = X

n ⁱ2N ⁱ

C(n

ⁱ

) + X

e ⁱ2E ⁱ

X

e^s2E^s

f

_e^{es i}

f

_e^{es i}

VNE: example

9

21 6

18

11 24

20

15

30 5

25

15

5 10

3 4

2

6

19 2

14

11 24

10

20 5

25 5

Revenue: 39 ≡ 15+5+10+3+2+4 Cost: 43 ≡ 15+5+10+3+2+4+4

• Node utilization:

• : available CPU resource of a substrate node

• : maximum CPU resource of the node

• Goal: optimize the node utilization

Performance metrics: substrate resource node utilization

• Link utilization:

• : available bandwidth of a substrate link

• : maximum bandwidth of the link

• Goal: optimize the link utilization

Performance metrics: substrate resource link utilization

Roadmap

• Introduction

• Virtual network embedding

• Topologies in data center networks

• Experimental procedure and results

• Conclusion

• References

Data center topologies

• Classified based on the implementation of packet forwarding:

L. Popa, S. Ratnasamy, G. Iannaccone, A. Krishnamurthy, and I. Stoica, “A cost comparison of datacenter network architectures,” in Proc. ACM Conf. Emerg. Netw.

Experiments Technol., Philadelphia, PA, USA, Nov. 2010, pp. 1–12.

switch-centric server-centric hybrid

Data center network topologies

• Switch-Centric:

• Fat-Tree

• F²Tree

• Diamond

• Spine-Leaf

• Three-Tier

• Collapsed Core

• Server-Centric:

• BCube

• DCell

• FiConn

• Crystal

• Hybrid:

• Star-wired ring

Switch-centric topologies: Spine-Leaf (Leaf-Spine)

M. Alizadeh and T. Edsall, “On the data path performance of leaf-spine datacenter fabrics,” in Proc. IEEE 21st Annu. Symp. High-Perform. Interconnects, San Jose, CA, Aug. 2013, pp. 71–74.

Switch-centric topologies: Three-Tier

Switch-centric topologies: Collapsed Core

Small enterprise design profile reference guide, Cisco. [Online]. Avail- able:

https://www.cisco.com/c/en/us/td/docs/solutions/Enterprise/

Small Enterprise Design Profile/SEDP.html. Accessed: Nov. 8, 2020.

Roadmap

• Introduction

• Virtual network embedding

• Topologies in data center networks

• Experimental procedure and results

• Conclusion

• References

VNE-Sim: simulation platform

S. Haeri and Lj. Trajković, “VNE-Sim: a virtual network embedding simulator,”

in Proc. SIMUTOOLS, Prague, Czech Republic, Aug. 2016.

https://bitbucket.org/shaeri/vne-sim

GRC Network ViNEYard

Generator

Hiberlite BRITE

Core

FNSS GLPK

Boost GSL

Adevs

Experimental procedure

• Each topology contains:

• 6 aggregation (spine) switches

• 18 edge (leaf) switches

• 90 hosts

• 3 core switches (Three-Tier)

• Links:

• Spine-Leaf: 198

• Three-Tier: 126

• Collapsed Core: 123

Simulation parameters

• Duration of each scenario: 50,000 time units

• Constant VNR arrival rate of 1 request per 100 time units yields to traffic load of 10 Erlangs

• Computational budget (number of simulations) 𝛽 = 5: number of evaluated action samples per selection cycle

Simulations: substrate and virtual networks

• Parameters

SN CPU capacity 100 units

SN link bandwidth 100 units

Virtual CPU requirement Uniformly distributed between 2 and 20 units

Virtual link bandwidth requirement Uniformly distributed between 1 and 10 units

VNRs arrival Poisson distribution with mean arrival

rate 𝜆 of requests per unit time

VNRs life-time Exponentially distributed with a mean

(𝜇 = 1,000)

Average processing time

Acceptance ratio

Spine-Leaf Three-Tier Collapsed Core

Revenue to cost ratio

Spine-Leaf Three-Tier Collapsed Core

Average node utilization

Spine-Leaf Three-Tier Collapsed Core

Average link utilization

Spine-Leaf Three-Tier Collapsed Core

Roadmap

• Introduction

• Virtual network embedding

• Topologies in data center networks

• Experimental procedure and results

• Conclusion and references

Conclusion

• In this paper, we evaluated performance of:

• MaVEn-M, MaVEn-S, D-ViNE, R-ViNE, GRC, and GRC-M VNE algorithms

• Spine-Leaf, Three-Tier, and Collapsed Core data center network topologies

• VNE-Sim simulation platform

• In most cases, MaVEn-M and MaVEn-S outperformed other algorithms

• Simulation results illustrated the effect of substrate network topology on performance of VNE algorithms

• Selecting an appropriate switch-centric topology is a trade-off between network implementation cost and performance of a VNE algorithm

References

Data Center Networks:

• T. Chen, X. Gao, and G. Chen, “The features, hardware, and architectures of data center networks: a survey,” J. Parallel Distrib. Comput., vol. 96, pp. 45–74, Oct. 2016.

• Y. Liu, J. K. Muppala, M. Veeraraghavan, D. Lin, and M. Hamid, “Data center network topologies: research proposals,” in Data Center Networks, Springer Briefs in Computer Science. Springer, 2013, pp. 15–31.

Virtual Network Embedding Algorithms:

• M. Chowdhury, M. R. Rahman, and R. Boutaba, “ViNEYard: virtual network embedding

algorithms with coordinated node and link mapping,” IEEE/ACM Trans. Netw., vol. 20, no. 1, pp. 206–219, Feb. 2012.

References

Virtual Network Embedding Algorithms:

• S. Haeri and Lj. Trajković, “Virtual network embedding via Monte-Carlo tree search,” IEEE Trans. Cybern., vol. 47, no. 2, pp. 1–12, Feb. 2017.

• S. Haeri, Q. Ding, Z. Li, and Lj. Trajković, “Global resource capacity algorithm with path splitting for virtual network embedding,” in Proc. IEEE Int. Symp. Circuits and Systems, Montreal, Canada,

May 2016, pp. 666–669.

• S. Haeri and Lj. Trajković, “VNE-Sim: a virtual network embedding simulator,” in Proc.

SIMUTOOLS, Prague, Czech Republic, Aug. 2016.

• S. Haeri and Lj. Trajković, “Virtual network embeddings in data center networks,” in Proc.

IEEE Int. Symp. Circuits and Systems, Montreal, Canada, May 2016, pp. 874–877.