Arithmetic Study about Efficiency in Network Topologies for Data Centers
Data centers are getting more and more attention due the rapid increase of IoT deployments, which may result in the implementation of smaller facilities being closer to the end users as well as larger facilities up in the cloud. In this paper, an arithmetic study has been carried out in order to mea...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-06-01
|
| Series: | Network |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2673-8732/3/3/15 |
| _version_ | 1797578380727549952 |
|---|---|
| author | Pedro Juan Roig Salvador Alcaraz Katja Gilly Cristina Bernad Carlos Juiz |
| author_facet | Pedro Juan Roig Salvador Alcaraz Katja Gilly Cristina Bernad Carlos Juiz |
| author_sort | Pedro Juan Roig |
| collection | DOAJ |
| description | Data centers are getting more and more attention due the rapid increase of IoT deployments, which may result in the implementation of smaller facilities being closer to the end users as well as larger facilities up in the cloud. In this paper, an arithmetic study has been carried out in order to measure a coefficient related to both the average number of hops among nodes and the average number of links among devices for a range of typical network topologies fit for data centers. Such topologies are either tree-like or graph-like designs, where this coefficient provides a balance between performance and simplicity, resulting in lower values in the coefficient accounting for a better compromise between both factors in redundant architectures. The motivation of this contribution is to craft a coefficient that is easy to calculate by applying simple arithmetic operations. This coefficient can be seen as another tool to compare network topologies in data centers that could act as a tie-breaker so as to select a given design when other parameters offer contradictory results. |
| first_indexed | 2024-03-10T22:21:07Z |
| format | Article |
| id | doaj.art-44a178c66b394c8ea3575c706d0e74f9 |
| institution | Directory Open Access Journal |
| issn | 2673-8732 |
| language | English |
| last_indexed | 2024-03-10T22:21:07Z |
| publishDate | 2023-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Network |
| spelling | doaj.art-44a178c66b394c8ea3575c706d0e74f92023-11-19T12:15:31ZengMDPI AGNetwork2673-87322023-06-013329832510.3390/network3030015Arithmetic Study about Efficiency in Network Topologies for Data CentersPedro Juan Roig0Salvador Alcaraz1Katja Gilly2Cristina Bernad3Carlos Juiz4Computer Engineering Department, Miguel Hernández University, 03202 Elche, SpainComputer Engineering Department, Miguel Hernández University, 03202 Elche, SpainComputer Engineering Department, Miguel Hernández University, 03202 Elche, SpainComputer Engineering Department, Miguel Hernández University, 03202 Elche, SpainMathematics and Computer Science Department, University of the Balearic Islands, 07022 Palma de Mallorca, SpainData centers are getting more and more attention due the rapid increase of IoT deployments, which may result in the implementation of smaller facilities being closer to the end users as well as larger facilities up in the cloud. In this paper, an arithmetic study has been carried out in order to measure a coefficient related to both the average number of hops among nodes and the average number of links among devices for a range of typical network topologies fit for data centers. Such topologies are either tree-like or graph-like designs, where this coefficient provides a balance between performance and simplicity, resulting in lower values in the coefficient accounting for a better compromise between both factors in redundant architectures. The motivation of this contribution is to craft a coefficient that is easy to calculate by applying simple arithmetic operations. This coefficient can be seen as another tool to compare network topologies in data centers that could act as a tie-breaker so as to select a given design when other parameters offer contradictory results.https://www.mdpi.com/2673-8732/3/3/15data centergraph-like topologynetwork topologyresource migrationtree-like topology |
| spellingShingle | Pedro Juan Roig Salvador Alcaraz Katja Gilly Cristina Bernad Carlos Juiz Arithmetic Study about Efficiency in Network Topologies for Data Centers Network data center graph-like topology network topology resource migration tree-like topology |
| title | Arithmetic Study about Efficiency in Network Topologies for Data Centers |
| title_full | Arithmetic Study about Efficiency in Network Topologies for Data Centers |
| title_fullStr | Arithmetic Study about Efficiency in Network Topologies for Data Centers |
| title_full_unstemmed | Arithmetic Study about Efficiency in Network Topologies for Data Centers |
| title_short | Arithmetic Study about Efficiency in Network Topologies for Data Centers |
| title_sort | arithmetic study about efficiency in network topologies for data centers |
| topic | data center graph-like topology network topology resource migration tree-like topology |
| url | https://www.mdpi.com/2673-8732/3/3/15 |
| work_keys_str_mv | AT pedrojuanroig arithmeticstudyaboutefficiencyinnetworktopologiesfordatacenters AT salvadoralcaraz arithmeticstudyaboutefficiencyinnetworktopologiesfordatacenters AT katjagilly arithmeticstudyaboutefficiencyinnetworktopologiesfordatacenters AT cristinabernad arithmeticstudyaboutefficiencyinnetworktopologiesfordatacenters AT carlosjuiz arithmeticstudyaboutefficiencyinnetworktopologiesfordatacenters |