topologies and algorithms for data center networksljilja/cnl/presentations/ljilja/iwcsn2016/...•...
TRANSCRIPT
![Page 1: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/1.jpg)
Topologies and Algorithms for Data Center Networks
Ljiljana Trajković
Communication Networks Laboratory http://www.ensc.sfu.ca/~ljilja/cnl/
Simon Fraser University Vancouver, British Columbia, Canada
![Page 2: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/2.jpg)
Communication Networks Laboratory
• Ph.D. students: • Soroush Haeri • Hanene Ben Yedder • Qingue Ding • Zhida Li • Umme Zakia
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 2
![Page 3: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/3.jpg)
Roadmap
• Data center networks and their topologies • Network virtualization • Virtual network embedding algorithms • Simulation results • Conclusions and references
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 3
![Page 4: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/4.jpg)
Data Center Networks (DCNs)
• Data centers are core infrastructure of cloud computing • They provide:
• cost-effective infrastructure for storing data and hosting large-scale service applications
• infrastructure for providers of Internet applications (Amazon, Google, Facebook)
• DCN architecture needs flexibility to effectively support applications that have diverse resource requirements from the underlying infrastructure: • storage, computing power, bandwidth, and latency
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 4
![Page 5: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/5.jpg)
DCN topologies
• Switch-Centric: • Conventional • Fat-Tree • F2Tree • Diamond
• Server-Centric: • BCube • DCell • FiConn
• Enhanced topologies (optical or wireless designs)
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 5
![Page 6: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/6.jpg)
Virtual network embedding (VNE) algorithms • Global Resource Capacity Multicommodity Flow (GRC-M) • Global Resource Capacity (GRC) • D-ViNE and R-ViNE
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 6
• 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. • L. Gong, Y. Wen, Z. Zhu, and T. Lee, “Toward profit-seeking virtual network embedding algorithm via global resource capacity,” in Proc. IEEE INFOCOM,
Toronto, ON, Canada, Apr. 2014, pp. 1–9. • 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.
![Page 7: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/7.jpg)
VNE in data center networks
• Data center networks have defined topologies • Topological features significantly affect quality of the
VNE solution • Goal:
• Identify the network topology that is better suited for VNE
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 7
![Page 8: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/8.jpg)
Switch-centric topologies: Conventional
• Based on tree topology: • core layer (layer-3) of switches/routers • aggregation layer (layer-2) of switches • edge layer (layer-1) of top-of-rack access switches
• Core layer: responsible for routing and balancing traffic load between the core and the aggregation layer
• Aggregation layer: provides default gateway redundancy, spanning tree processing, load balancing, and firewall
• Edge layer: each switch is connected to two aggregation switches for redundancy
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• 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–774, Oct.
2016. 8
![Page 9: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/9.jpg)
Switch-centric topologies: Conventional
• Conventional (two-tier): 10 switches, 24 hosts, and 40 links
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 9
Core
Edge
Core switch Access switch Host
![Page 10: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/10.jpg)
Switch-centric topologies: Fat-Tree
• Notation: Fat-TreeK
• Special Clos architecture • Initially proposed to interconnect processors of parallel
supercomputers • switches • Supports hosts
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• C. E. Leiserson, “Fat-Trees: universal networks for hardware-efficient supercomputing,” IEEE Trans. Comput., vol. 30, no. 10, pp. 892–901, Oct. 1985. • M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable, commodity data center
network architecture,” ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 63–74, Oct. 2008.
(k/2)2 + k2 k-portk3/4
10
![Page 11: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/11.jpg)
Switch-centric topologies: Fat-Tree
• Fat-Tree4: 20 4-port switches, 16 hosts, and 48 links
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 11
Core switch Access switchAggregation switch Host
![Page 12: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/12.jpg)
Switch-centric topologies: F2Tree
• Notation: F2Tree • An enhancement of the Fat-Tree topology • switches • Supports hosts
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• G. Chen, Y. Zhao, D. Pei, and D. Li, “Rewiring 2 links is enough: Accelerating failure recovery in production data center networks,” in Proc. IEEE ICDCS, Columbus, Ohio,
USA, June 2015, pp. 569–578.
12
(5/4)⇥ k2 � (7/2)⇥ k + 2k3/4� k2 + k
![Page 13: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/13.jpg)
Switch-centric topologies: F2Tree
• F2Tree: 26 switches, 24 hosts, and 90 links
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 13
Core switch Access switchAggregation switch Host
POD 1 POD 3 POD 4POD 2
![Page 14: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/14.jpg)
Switch-centric topologies: Diamond
• Notation: Diamond • Variation of the Fat-Tree topology • It has symmetrical architecture where the core switches
are divided in two layers • switches • Supports hosts
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• Y. Sun, J. Chen, Q. Lu, and W. Fang, “Diamond: an improved fat-tree architecture for large-scale data centers,” J. Commun., vol. 9, no. 1, pp. 91–98, Jan. 2014.
14
k2/4
k3/4
![Page 15: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/15.jpg)
Switch-centric topologies: Diamond
• Diamond: 20 switches, 16 hosts, and 48 links
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 15
Core switch Access switch Host
POD 1 POD 2 POD 3 POD 4
![Page 16: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/16.jpg)
Server-centric topologies: BCube
• Notation: BCube(k,n) • k: BCube level • n: number of hosts in the level-0 BCube
• Recursively structured • Switches are not directly interconnected • Hosts perform packet forwarding functions
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu, “BCube: A high performance, server-centric network architecture for modular data centers,”
ACM SIGCOMM Comput. Commun. Rev., vol. 39, no. 4, pp. 63–74, Oct. 2009.
16
![Page 17: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/17.jpg)
Server-centric topologies: BCube
• BCube (2,4): 8 switches, 16 hosts, and 32 links
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 17
BCube(0,2)
Access switch Host
BCube(0,3) BCube(0,4)BCube(0,1)
![Page 18: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/18.jpg)
Server-centric topologies: DCell
• DCell1 structure with 4 ports consisting of 5 DCell0s
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 18
![Page 19: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/19.jpg)
Server-centric topologies: FiConn
• FiConn2 structure with 4 ports. Each Ficonn1 contains 3 Ficonn0 ports
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 19
![Page 20: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/20.jpg)
Network virtualization
• Network virtualization enables coexistence of multiple virtual networks on a shared physical infrastructure
• Provides: • flexible management • lower implementation cost • higher network scalability • increased resource utilization, and • improved energy efficiency
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 20
![Page 21: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/21.jpg)
Network virtualization
• Virtualized network model divides the role of Internet Service Providers (ISPs) into: • Infrastructure Providers (InPs)
• manage the physical infrastructure • Service Providers (SPs)
• aggregate resources from multiple InP into multiple Virtual Networks (VNs)
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 21
![Page 22: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/22.jpg)
Substrate network vs. virtual network
• InPs operate physical substrate networks (SNs) • SN components:
• physical nodes (substrate nodes) • physical links (substrate links)
• Substrate nodes and links are: • interconnected using arbitrary topology • used to host various virtualized networks with
arbitrary topologies • Virtual networks are embedded into a substrate network
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 22
![Page 23: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/23.jpg)
Virtual network embedding
• Virtual Network Embedding (VNE) allocates SN resources to VNs
• InP’s revenue depends on VNE efficiency • VNE problem may be reduced to the multi-way
separator: • NP-hard • optimal solution may only be obtained for small
instances
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• M. Yu, Y. Yi, J. Rexford, and M. Chiang, “Rethinking virtual network embedding: substrate support for path splitting and migration,”
Comput. Commun. Rev., vol. 38, no. 2, pp. 19–29, Mar. 2008.
23
![Page 24: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/24.jpg)
VNE solution
• Two subproblems: • Virtual Node Mapping (VNoM): maps virtual nodes to
substrate nodes • Virtual Link Mapping (VLiM): maps virtual links to
substrate paths • VNE algorithms address the VNoM while solving the VLiM
using: • Shortest-Path (SP) algorithms or • Multicommodity Flow (MCF) algorithm
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 24
![Page 25: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/25.jpg)
VNE solution: VLiM and path splitting
• The shortest-path algorithms do not permit path splitting: • stricter than the MCF algorithm
• MCF enables path splitting: • a flow may be divided into multiple flows with lower
capacity • flows are routed through various paths
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• D. G. Andersen, “Theoretical approaches to node assignment,” Dec. 2002, Unpublished Manuscript. [Online]. Available: http://repository.cmu.edu/compsci/
86/. 25
![Page 26: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/26.jpg)
VNE formulation: constrains
• Substrate network graph: • Resources:
• substrate nodes: CPU capacity • substrate links: bandwidth
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
15
15
10
10
5 5
10
10
5
5
5
Gs(Ns, Es)
C(ns)
B(es)
26
![Page 27: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/27.jpg)
VNE formulation: constrains
• Virtual network graph: • Resources:
• virtual nodes: CPU capacity • virtual links: bandwidth
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
10
5 5
15 5
10
G i(N i , E i)
C(n i)
B(e i)
27
![Page 28: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/28.jpg)
VNE: example
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 28
9
21
6
18
11 24
20
15
30
5
25
15
10 5
3 4
2
6
19
2
14
11 24
10
20
5
25
5
R = 39 ≡ 15+5+10+3+2+4
C = 43 ≡ 15+5+10+3+2+4+4
![Page 29: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/29.jpg)
VNE objective
• Maximize the profit of InPs • Contributing factors to the generated profit:
• embedding revenue • embedding cost • acceptance ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• 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.
• L. Gong, Y. Wen, Z. Zhu, and T. Lee, “Toward profit-seeking virtual network embedding algorithm via global resource capacity,”
in Proc. IEEE INFOCOM, Toronto, ON, Canada, Apr. 2014, pp. 1–9.
29
![Page 30: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/30.jpg)
VNE objective: revenue
• Maximize revenue:
• : weights for CPU requirements • : weight for bandwidth requirements • general assumption:
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
R(G i) = wc
X
n i2N i
C(n i) + wb
X
e i2E i
B(e i)
wb
wc
wc = wb = 1
30
![Page 31: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/31.jpg)
VNE objective: revenue
• Generated revenue is not a function of the embedding configuration: • is constant regardless of the embedding
configuration
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
R(G i)
31
![Page 32: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/32.jpg)
VNE objective: cost
• Minimize the cost:
• : total allocated bandwidth of the substrate link for virtual link
• depends on the embedding configuration
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
C(G i) =X
n i2N i
C(n i) +X
e i2E i
X
es2Es
fe i
es
fe i
es
e i
es
C(G i)
32
![Page 33: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/33.jpg)
VNE objective: acceptance ratio
• Maximize acceptance ratio:
• : number of accepted Virtual Network Requests (VNRs) in a given time interval
• : number of all arrived VNRs in
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
p⌧a = | a(⌧)|| (⌧)|
⌧| a(⌧)|
| (⌧)| ⌧
33
![Page 34: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/34.jpg)
VNE objective function
• Objective of embedding a VNR is to maximize:
• : large negative penalty for unsuccessful embedding • The upper bound:
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
F( i) =
⇢R(G i
)�C(G i) successful embeddings
� otherwise
�
F( i) 0
34
![Page 35: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/35.jpg)
VNE algorithms: Global Resource Capacity Multicommodity Flow (GRC-M) • GRC-M employs the Global Resource Capacity (GRC) for
virtual node mapping while using the Multicommodity Flow algorithm for identifying the link mappings
• GRC algorithm is effective in calculating the embedding potential of substrate nodes
• MCF algorithm enables path splitting, which improves resources utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• 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.
35
![Page 36: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/36.jpg)
VNE algorithms: Global Resource Capacity Multicommodity Flow (GRC-M) • GRC algorithm calculates the embedding capacity for
a substrate node : • Objective of the MCF algorithm:
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 36
r = (1� d)c+ dMr
minimizeX
es2Es
1
B(es) + ✏
X
e i2E i
fe i
es
r(nsi )
nsi
![Page 37: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/37.jpg)
VNE algorithms: Global Resource Capacity Multicommodity Flow (GRC-M) • Substrate network graph: • Resources:
• substrate nodes: CPU capacity
• substrate links: bandwidth • Virtual network graph: • Resource requirements:
• virtual nodes: CPU capacity • virtual links: bandwidth
• : weight for CPU requirements (= 1)
• : weight for bandwidth requirements (= 1) • : total bandwidth of the substrate link allocated to virtual link • : number of accepted Virtual Network Requests (VNRs) in a given time
interval • : number of VNRs that arrived in
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 37
Gs(Ns, Es)
C(ns)
B(es)G i(N i , E i)
B(e i)
C(n i)
⌧
wc
wb
fe i
es
| a(⌧)|es
| (⌧)|⌧
![Page 38: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/38.jpg)
VNE algorithms: Global Resource Capacity (GRC) • Node-ranking-based algorithm:
• computes a score/rank for substrate and virtual nodes • employs a large-to-large and small-to-small mapping
scheme to map the virtual nodes to substrate nodes • Employs the Shortest-Path algorithm to solve VLiM • Outperforms earlier similar proposals
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 38
• L. Gong, Y. Wen, Z. Zhu, and T. Lee, “Toward profit-seeking virtual network embedding algorithm via global resource capacity,”
in Proc. IEEE INFOCOM, Toronto, ON, Canada, Apr. 2014, pp. 1–9.
![Page 39: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/39.jpg)
VNE algorithms: Global Resource Capacity (GRC) • Calculates the embedding capacity for a substrate
node :
• : damping factor • : substrate link connecting and • : normalized CPU resource of
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 39
r(nsi )
nsi
r(nsi ) = (1� d)C(ns
i ) + dX
nsj2N (ns
i )
B�es(ns
i , nsj)�
X
nsk2N (ns
j)
B�es(ns
j , nsk)�
es(nsi , n
sj) ns
i nsj
C(nsi ) ns
i
0 < d < 1
C(nsi ) =
C(nsi )P
ns2Ns C(ns)
![Page 40: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/40.jpg)
VNE algorithms: Global Resource Capacity (GRC) • Matrix form:
• • • is a matrix:
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 40
r = (1� d)c+ dMr
c = (C(ns1), C(ns
2), . . . , C(nsj))
T
r = (r(ns1), r(n
s2), . . . , r(n
sk))
T
M k-by-k
mij =
8>>><
>>>:
B�es(ns
i , nsj)�
X
nsk2N (ns
j)
B�es(ns
j , nsk)� es(ns
i , nsj) 2 Es
0 otherwise
![Page 41: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/41.jpg)
VNE algorithms: Global Resource Capacity (GRC) • is calculated iteratively:
• Initially: • Stop condition:
•
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 41
rk+1 = (1� d)c+ dMrk
r0 = c
|rk+1 � rk| < �,
0 < � << 1
r
![Page 42: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/42.jpg)
VNE algorithms: R-Vine and D-Vine
• Formulate VNE problem as a Mixed Integer Program (MIP)
• Their objective is to minimize the cost of accommodating the VNRs
• Use a rounding-based approach to obtain a linear programming relaxation of the relevant MIP
• Use Multicommodity Flow algorithm for solving VLiM
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
• 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.
42
![Page 43: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/43.jpg)
Traffic
Fat-Tree: • traffic forwarding is only performed by the switches BCube: • hosts are used to forward traffic
• introduces additional traffic over the links that are connected to the hosts
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 43
![Page 44: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/44.jpg)
Simulations: substrate networks
• Fat-Tree6: 54 hosts, 45 switches, and 162 links • Switch to host ratio: 0.84
• BCube(2,4): 64 hosts, 48 switches, and 192 link • Switch to host ratio: 0.75
• CPU resources: • Hosts: 100 units • Switches: 0 units
• Bandwidth resources: 100 units per link
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 44
![Page 45: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/45.jpg)
Simulations: virtual network graphs
• Waxman algorithm used to generate virtual network graphs: • • number of nodes: uniformly distributed between 3
and 10 • each virtual node: connected to a maximum of 3
virtual nodes
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
↵ = 0.5 and � = 0.2
45
![Page 46: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/46.jpg)
Simulations: virtual network graphs
• CPU requirements: • uniformly distributed between 2 and 20 units
• Bandwidth requirements: • uniformly distributed between 1 to 10 units • illustrates a substrate network with 10 Gbps links and
virtual networks with 100 Mbps to 1 Gbps links
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 46
![Page 47: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/47.jpg)
Simulations: other parameters
• Poisson distribution for arrivals with implies 1 to 8 units per 100 time units
• Exponentially distributed life-times with mean 1,000 time units
• Traffic loads: 10, 20, 30, 40, 50, 60, 70, and 80 Erlangs • Total simulation time: 50,000 time units • Performance metrics:
• acceptance ratio, revenue to cost ratio, and substrate resource utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 47
![Page 48: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/48.jpg)
VNE-Sim
• A discrete event VNE simulator written in C++ • Based on the Discrete Event System Specification (DEVS)
framework • Employs the Adevs library
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 48
• A. M. Uhrmacher, “Dynamic structures in modeling and simulation: a reflective approach,” ACM Trans. Modeling and Computer Simulation,
vol. 11, no. 2, pp. 206–232, Apr. 2001. • J. J. Nutaro, Building Software for Simulation: Theory and Algorithms, with
Applications in C++. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2010. • S. Haeri and Lj. Trajković, “VNE-Sim: a virtual network embedding simulator,” in Proc.
SIMUTOOLS, Prague, Czech Republic, Aug. 2016.
![Page 49: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/49.jpg)
Acceptance ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Conventional
49
10 20 30 40 50 60 70 80Traffic load (Erlang)
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0Ac
cept
ance
ratio
GRC-MD-VineR-VineGRC
![Page 50: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/50.jpg)
Acceptance ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Diamond
50
10 20 30 40 50 60 70 80Traffic load (Erlang)
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0Ac
cept
ance
ratio
GRC-MD-VineR-VineGRC
![Page 51: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/51.jpg)
Acceptance ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
F2Tree
51
10 20 30 40 50 60 70 80Traffic load (Erlang)
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.0Ac
cept
ance
ratio
GRC-MD-VineR-VineGRC
![Page 52: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/52.jpg)
Revenue to cost ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Conventional
52
10 20 30 40 50 60 70 80Traffic load (Erlang)
0.40
0.42
0.44
0.46
0.48
0.50
0.52
0.54
0.56R
even
ue to
cos
t rat
io
GRC-MD-VineR-VineGRC
![Page 53: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/53.jpg)
Revenue to cost ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Diamond
53
10 20 30 40 50 60 70 80Traffic load (Erlang)
0.40
0.42
0.44
0.46
0.48
0.50
0.52
0.54
0.56R
even
ue to
cos
t rat
ioGRC-MD-VineR-VineGRC
![Page 54: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/54.jpg)
Revenue to cost ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
F2Tree
54
10 20 30 40 50 60 70 80Traffic load (Erlang)
0.40
0.42
0.44
0.46
0.48
0.50
0.52
0.54
0.56R
even
ue to
cos
t rat
ioGRC-MD-VineR-VineGRC
![Page 55: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/55.jpg)
Average node utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Conventional
55
10 20 30 40 50 60 70 80Traffic load (Erlang)
20
30
40
50
60
70
80Av
erag
e no
de u
tiliz
atio
n %
GRC-MD-VineR-VineGRC
![Page 56: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/56.jpg)
Average node utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Diamond
56
10 20 30 40 50 60 70 80Traffic load (Erlang)
20
30
40
50
60
70
80Av
erag
e no
de u
tiliz
atio
n %
GRC-MD-VineR-VineGRC
![Page 57: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/57.jpg)
Average node utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
F2Tree
57
10 20 30 40 50 60 70 80Traffic load (Erlang)
20
30
40
50
60
70
80Av
erag
e no
de u
tiliz
atio
n %
GRC-MD-VineR-VineGRC
![Page 58: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/58.jpg)
Average link utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Conventional
58
10 20 30 40 50 60 70 80Traffic load (Erlang)
20
30
40
50
60
70Av
erag
e lin
k ut
ilizat
ion
%
GRC-MD-VineR-VineGRC
![Page 59: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/59.jpg)
Average link utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
Diamond
59
10 20 30 40 50 60 70 80Traffic load (Erlang)
20
30
40
50
60
70Av
erag
e lin
k ut
ilizat
ion
%
GRC-MD-VineR-VineGRC
![Page 60: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/60.jpg)
Average link utilization
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA
F2Tree
60
10 20 30 40 50 60 70 80Traffic load (Erlang)
20
30
40
50
60
70Av
erag
e lin
k ut
ilizat
ion
%
GRC-MD-VineR-VineGRC
![Page 61: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/61.jpg)
Simulation results: Conventional, F2Tree, Diamond • F2Tree topology:
• exhibits higher acceptance ratio compared to conventional two-tier and Diamond topologies
• may accept additional VNRs since it provides multiple paths between hosts
• Conventional two-tier and F2Tree topologies have the highest and the lowest revenue to cost ratios and link utilizations, respectively
• Conventional two-tier and Diamond topologies show the lowest and highest node utilizations, respectively
• F2Tree topology has higher wiring density and number of nodes and, hence, the embedding cost is higher while the link and node utilizations are lower
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 61
![Page 62: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/62.jpg)
Simulation results: Conventional, F2Tree, Diamond • While Diamond topology has smaller number of nodes than F2Tree,
it still exhibits higher node utilization and has comparable performance
• The simulated data center topologies are much smaller than the deployed networks due to high memory requirements and long simulation times
• However, large data centers possess similar structures as those simulated in this study
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 62
![Page 63: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/63.jpg)
Simulation results: Fat-Tree vs. BCube
• Fat-Tree topology offers up to: • 10% higher acceptance ratio • 20% higher node utilization • 10% higher link utilization
• The revenue to cost ratio of the Fat-Tree topology is slightly lower than the BCube topology
• Desirable: • high acceptance ratio, high substrate resource
utilization, and high revenue to cost ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 63
![Page 64: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/64.jpg)
Conclusions
• Links that are connected to the hosts are important for the virtual network embeddings: • especially for embedding virtual nodes that require
multiple connections to other nodes • Performing traffic forwarding using only the core
switches instead of the hosts may lead to higher VNR acceptance ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 64
![Page 65: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/65.jpg)
Conclusions
Simulated Fat-Tree topology: • Has higher switch to host ratio (0.84) compared to the
BCube topology (0.75) • Additional paths between the hosts enable:
• higher acceptance ratio • higher resource utilization
• Tradeoff: • lower revenue to cost ratio
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 65
![Page 66: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/66.jpg)
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–774, Oct. 2016.
• G. Chen, Y. Zhao, D. Pei, and D. Li, “Rewiring 2 links is enough: Accelerating failure recovery in production data center networks,” in Proc. IEEE ICDCS, Columbus, Ohio, USA, June 2015, pp. 569–578.
• Y. Sun, J. Chen, Q. Lu, and W. Fang, “Diamond: an improved fat-tree architecture for large-scale data centers,” J. Commun., vol. 9, no. 1, pp. 91–98, Jan. 2014.
• H. Ballani, P. Costa, T. Karagiannis, and A. Rowstron, “Towards predictable datacenter networks,” ACM SIGCOMM Comput. Commun. Rev., vol. 41, no. 4, pp. 242–253, Oct. 2011.
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 66
![Page 67: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/67.jpg)
References • C. Guo, G. Lu, H. J. Wang, S. Yang, C. Kong, P. Sun, W. Wu, and Y. Zhang,
“SecondNet: a data center network virtualization architecture with bandwidth guarantees,” in Proc. ACM CoNEXT 2010, Philadelphia, PA, USA, Dec. 2010, p. 15.
• C. Guo, G. Lu, D. Li, H. Wu, X. Zhang, Y. Shi, C. Tian, Y. Zhang, and S. Lu, “BCube: A high performance, server-centric network architecture for modular data centers,” ACM SIGCOMM Comput. Commun. Rev., vol. 39, no. 4, pp. 63–74, Oct. 2009.
• M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable, commodity data center network architecture,” ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 63–74, Oct. 2008.
• C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang, and S. Lu, “DCell: a scalable and fault-tolerant network structure for data centers,” ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 4, pp. 75–86, Oct. 2008.
• C. E. Leiserson, “Fat-Trees: universal networks for hardware-efficient supercomputing,” IEEE Trans. Comput., vol. 30, no. 10, pp. 892–901, Oct. 1985.
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 67
![Page 68: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/68.jpg)
References Network Virtualization: • M. Chowdhury and R. Boutaba, “Network virtualization: state of the art and
research challenges,” IEEE Commun. Mag., vol. 47, no. 7, pp. 20–26, July 2009.
• N. Feamster, L. Gao, and J. Rexford, “How to lease the Internet in your spare time,” Comput. Commun. Rev., vol. 37, no. 1, pp. 61–64, Jan. 2007.
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 68
![Page 69: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/69.jpg)
References Virtual Network Embedding Algorithms: • L. Gong, Y. Wen, Z. Zhu, and T. Lee, “Toward profit-seeking virtual network
embedding algorithm via global resource capacity,” in Proc. IEEE INFOCOM, Toronto, ON, Canada, Apr. 2014, pp. 1–9.
• 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.
• S. Zhang, Y. Qian, J. Wu, and S. Lu, “An opportunistic resource sharing and topology-aware mapping framework for virtual networks,” in Proc. IEEE INFOCOM, Orlando, FL, USA, Mar. 2012, pp. 2408–2416.
• X. Cheng, S. Su, Z. Zhang, H. Wang, F. Yang, Y. Luo, and J. Wang, “Virtual network embedding through topology-aware node ranking,” Comput. Commun. Rev., vol. 41, pp. 38–47, Apr. 2011.
• M. Yu, Y. Yi, J. Rexford, and M. Chiang, “Rethinking virtual network embedding: substrate support for path splitting and migration,” SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 19–29, Mar. 2008.
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 69
![Page 70: Topologies and Algorithms for Data Center Networksljilja/cnl/presentations/ljilja/iwcsn2016/...• Data center networks and their topologies • Network virtualization • Virtual](https://reader034.vdocument.in/reader034/viewer/2022050105/5f43a7906b217b41644622bb/html5/thumbnails/70.jpg)
References Virtual Network Embedding Algorithms: • 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ć, “Virtual network embeddings in data center networks,” in Proc. IEEE Int. Symp. Circuits and Systems, Montreal, Canada, May 2016, pp. 874–877.
• S. Haeri and Lj. Trajković, “VNE-Sim: a virtual network embedding simulator,” in Proc. SIMUTOOLS, Prague, Czech Republic, Aug. 2016.
November 14, 2016 IWCSN 2016, Georgia State University, Atlanta, USA 70