Multi-domain Network Slice Partitioning: A Graph Neural Network Algorithm
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910580688814080 |
|---|---|
| author | Wu, Zhouxiang Ishigaki, Genya Gour, Riti Li, Congzhou Khanure, Divya Jue, Jason P. |
| author_facet | Wu, Zhouxiang Ishigaki, Genya Gour, Riti Li, Congzhou Khanure, Divya Jue, Jason P. |
| contents | In the context of multi-domain network slices, multiple domains need to work together to provide a service. The problem of determining which part of the service fits within which domain is referred to as slice partitioning. The partitioning of multi-domain network slices poses a challenging problem, particularly when striving to strike the right balance between inter-domain and intra-domain costs, as well as ensuring optimal load distribution within each domain. To approach the optimal partition solution while maintaining load balance between domains, a framework has been proposed. This framework not only generates partition plans with various characteristics but also employs a Graph Neural Network solver, which significantly reduces the plan generation time. The proposed approach is promising in generating partition plans for multi-domain network slices and is expected to improve the overall performance of the network. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_15342 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Multi-domain Network Slice Partitioning: A Graph Neural Network Algorithm Wu, Zhouxiang Ishigaki, Genya Gour, Riti Li, Congzhou Khanure, Divya Jue, Jason P. Networking and Internet Architecture In the context of multi-domain network slices, multiple domains need to work together to provide a service. The problem of determining which part of the service fits within which domain is referred to as slice partitioning. The partitioning of multi-domain network slices poses a challenging problem, particularly when striving to strike the right balance between inter-domain and intra-domain costs, as well as ensuring optimal load distribution within each domain. To approach the optimal partition solution while maintaining load balance between domains, a framework has been proposed. This framework not only generates partition plans with various characteristics but also employs a Graph Neural Network solver, which significantly reduces the plan generation time. The proposed approach is promising in generating partition plans for multi-domain network slices and is expected to improve the overall performance of the network. |
| title | Multi-domain Network Slice Partitioning: A Graph Neural Network Algorithm |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2408.15342 |