2017
DOI: 10.1109/tpds.2016.2646366
|View full text |Cite
|
Sign up to set email alerts
|

VLCcube: A VLC Enabled Hybrid Network Structure for Data Centers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(4 citation statements)
references
References 24 publications
0
4
0
Order By: Relevance
“…Network topologies are selected in light of their use in engineering practices. In particular, switch-centric network topologies mainly include Fat-tree [8], Spine-leaf [9], etc., while servercentric network topologies mainly include Bcube [10], Dcell [12], etc [13][14][15][16][17][18][19][20]. Consequently, in our analysis, we concentrate on these three categories of topologies.…”
Section: Related Workmentioning
confidence: 99%
“…Network topologies are selected in light of their use in engineering practices. In particular, switch-centric network topologies mainly include Fat-tree [8], Spine-leaf [9], etc., while servercentric network topologies mainly include Bcube [10], Dcell [12], etc [13][14][15][16][17][18][19][20]. Consequently, in our analysis, we concentrate on these three categories of topologies.…”
Section: Related Workmentioning
confidence: 99%
“…In [14], a threshold-based, wireless link-aware flow placement algorithm with low complexity is put forward. Luo et al have presented VLCcube, an interrack wireless solution that extends the design of wireless DCN through organizing all racks into a wireless Torus structure via the emerging visible light links [15].…”
Section: Wireless Communications and Mobile Computingmentioning
confidence: 99%
“…Input: Topology graph G(V, E), , , route length limit Output: a set of routes for ( , ) (1) Tabu list T = 0, Route set S = 0, Node set N = { }; (2) for each node in set N do (3) if the length of the path from to is larger than then (4) Break; (5) end (6) for each neighbor a of node do (7) if a is equal to then (8) Add the path from to in the tree to S; (9) Add the nodes in the path to T except ; (10) else (11) if a is already included in T then (12) Cut and the subtree rooted at from the tree; (13) end (14) end (15) Add to N if ∉ N; (16) end (17) Remove from N; (18) end (19) Return S Algorithm 2: Route calculation.…”
Section: Wfn Schedulingmentioning
confidence: 99%
“…Recent interest has been generated in the optical wireless (OW) DCN because it not only eliminates the fundamental limitations introduced by the copper or fiber cables by employing optical wireless technology, but also brings efficient optical switching technology to the conventional electrical switch-based DCN. In particular, optical wireless technology avoids cable complexity, thereby enhancing the DCN's space utilization, heat dissipation, and energy efficiency [6]. In addition, it has the potential to offer great flexibility and ultra-high data rates over a broad unlicensed spectrum range [7], as well as negligible waveguide dispersion and attenuation [8].…”
Section: Introductionmentioning
confidence: 99%