File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/MSN48538.2019.00052
- Scopus: eid_2-s2.0-85084305916
- WOS: WOS:000569762200037
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Spectral Graph Theory Based Topology Analysis for Reconfigurable Data Center Networks
Title | Spectral Graph Theory Based Topology Analysis for Reconfigurable Data Center Networks |
---|---|
Authors | |
Keywords | reconfigurable network topology analysis upper bound spectral graph theory |
Issue Date | 2019 |
Publisher | IEEE, Computer Society. The Journal's web site is located at https://ieeexplore.ieee.org/xpl/conhome/1002549/all-proceedings |
Citation | 2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN), Shenzhen, China, 11-13 December 2019, p. 230-233 How to Cite? |
Abstract | Emerging technological innovations introduce the possibility to reconfigure the data center topology at runtime. The development of reconfigurable architectures can adapt their topology to account for changing demands, e.g., using Flyways-like augmented links. However, there is no common notion established in this area of how to evaluate the topology, the underlying theoretical analysis is not yet well studied. In this paper, we present the upper bound of the network diameter using spectral graph theory, to the best of our knowledge, which is a first theoretical attempt on understanding the nature of the reconfigurable data center networks. We further prove the algebraic connectivity is insensitive to the weight changes. Finally, based the algebra-connectivity λ 2 , we give a comprehensive link-augmentation validity, which can be implemented in current DCNs potentially. |
Persistent Identifier | http://hdl.handle.net/10722/283294 |
ISBN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, DK | - |
dc.contributor.author | Wang, XW | - |
dc.contributor.author | Huang, M | - |
dc.contributor.author | Wang, CL | - |
dc.date.accessioned | 2020-06-22T02:54:39Z | - |
dc.date.available | 2020-06-22T02:54:39Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | 2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN), Shenzhen, China, 11-13 December 2019, p. 230-233 | - |
dc.identifier.isbn | 9781728152134 | - |
dc.identifier.uri | http://hdl.handle.net/10722/283294 | - |
dc.description.abstract | Emerging technological innovations introduce the possibility to reconfigure the data center topology at runtime. The development of reconfigurable architectures can adapt their topology to account for changing demands, e.g., using Flyways-like augmented links. However, there is no common notion established in this area of how to evaluate the topology, the underlying theoretical analysis is not yet well studied. In this paper, we present the upper bound of the network diameter using spectral graph theory, to the best of our knowledge, which is a first theoretical attempt on understanding the nature of the reconfigurable data center networks. We further prove the algebraic connectivity is insensitive to the weight changes. Finally, based the algebra-connectivity λ 2 , we give a comprehensive link-augmentation validity, which can be implemented in current DCNs potentially. | - |
dc.language | eng | - |
dc.publisher | IEEE, Computer Society. The Journal's web site is located at https://ieeexplore.ieee.org/xpl/conhome/1002549/all-proceedings | - |
dc.relation.ispartof | International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Proceedings | - |
dc.rights | International Conference on Mobile Ad-Hoc and Sensor Networks (MSN) Proceedings. Copyright © IEEE, Computer Society. | - |
dc.rights | ©2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | reconfigurable network | - |
dc.subject | topology analysis | - |
dc.subject | upper bound | - |
dc.subject | spectral graph theory | - |
dc.title | Spectral Graph Theory Based Topology Analysis for Reconfigurable Data Center Networks | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Wang, CL: clwang@cs.hku.hk | - |
dc.identifier.authority | Wang, CL=rp00183 | - |
dc.identifier.doi | 10.1109/MSN48538.2019.00052 | - |
dc.identifier.scopus | eid_2-s2.0-85084305916 | - |
dc.identifier.hkuros | 310356 | - |
dc.identifier.spage | 230 | - |
dc.identifier.epage | 233 | - |
dc.identifier.isi | WOS:000569762200037 | - |
dc.publisher.place | United States | - |