Optimal graph partitioning for time-sensitive flow scheduling towards digital twin networks

Wang, S; Kua, Jonathan; Jin, J; Kulkarni, A; Jayaraman, PP; Cao, X

Optimal graph partitioning for time-sensitive flow scheduling towards digital twin networks

conference contribution

posted on 2024-06-05, 06:05 authored by S Wang, Jonathan KuaJonathan Kua, J Jin, A Kulkarni, PP Jayaraman, X Cao

Optimal graph partitioning for time-sensitive flow scheduling towards digital twin networks

History

Pagination

7-12

Location

Sydney, N.S.W.

Publisher DOI

https://doi.org/10.1145/3566099.3569003

Start date

2022-10-17

End date

2022-10-17

ISBN-13

9781450397841

Language

English

Notes

Part of MOBICOM '22

Publication classification

E1 Full written paper - refereed

Title of proceedings

AIIOT 2022 : Proceedings of the 1st Workshop on Digital Twin and Edge AI for Industrial IoT 2022

Event

Digital Twin & Edge AI for Industrial IoT. Workshop (1st : 2022 : Sydney, N.S.W.)

Publisher

ACM

Place of publication

New York, N.Y.

Publication URL

http://dx.doi.org/10.1145/3566099.3569003

Usage metrics

Keywords

digital twin networks time sensitive networks flow scheduling graph partitioning integer linear programming

Optimal graph partitioning for time-sensitive flow scheduling towards digital twin networks

History

Pagination

Location

Publisher DOI

Start date

End date

ISBN-13

Language

Notes

Publication classification

Title of proceedings

Event

Publisher

Place of publication

Publication URL

Usage metrics

Categories

Keywords

Licence

Exports