Multi-domain Network Slice Partitioning: A Graph Neural Network Algorithm
<|reference_start|>Multi-domain Network Slice Partitioning: A Graph Neural Network Algorithm: 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.<|reference_end|>
@article{wu2024multi-domain,
    title={Multi-domain Network Slice Partitioning: A Graph Neural Network
  Algorithm},
    author={Zhouxiang Wu, Genya Ishigaki, Riti Gour, Congzhou Li, Divya Khanure
  and Jason P. Jue},
    journal={arXiv preprint arXiv:2408.15342},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.15342},
    primaryClass={cs.NI}
}