| Autor: |
Gao Wei, Liang Li, Xu Tianwei, Gan Jianhou |
| Jazyk: |
angličtina |
| Rok vydání: |
2017 |
| Předmět: |
|
| Zdroj: |
Open Physics, Vol 15, Iss 1, Pp 501-508 (2017) |
| Druh dokumentu: |
article |
| ISSN: |
2391-5471 |
| DOI: |
10.1515/phys-2017-0057 |
| Popis: |
In normal computer networks, the data transmission between two sites go through the shortest path between two corresponding vertices. However, in the setting of software definition network (SDN), it should monitor the network traffic flow in each site and channel timely, and the data transmission path between two sites in SDN should consider the congestion in current networks. Hence, the difference of available data transmission theory between normal computer network and software definition network is that we should consider the prohibit graph structures in SDN, and these forbidden subgraphs represent the sites and channels in which data can’t be passed by the serious congestion. Inspired by theoretical analysis of an available data transmission in SDN, we consider some computational problems from the perspective of the graph theory. Several results determined in the paper imply the sufficient conditions of data transmission in SDN in the various graph settings. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
