ICC 2023 - IEEE International Conference on Communications 2023
DOI: 10.1109/icc45041.2023.10278585
|View full text |Cite
|
Sign up to set email alerts
|

TAS Scheduling with Network Domain Division

Yuhei Kawakami,
Hideo Kawata,
Natsuki Yasuhara
et al.
Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…In the computation of TAS scheduling, the SMT problem is commonly solved. In our previous work [12], we classified the patterns of unschedulability in TAS scheduling into two patterns. In the first pattern, no solution satisfies the SMT problem (unsat).…”
Section: Research Challengementioning
confidence: 99%
See 1 more Smart Citation
“…In the computation of TAS scheduling, the SMT problem is commonly solved. In our previous work [12], we classified the patterns of unschedulability in TAS scheduling into two patterns. In the first pattern, no solution satisfies the SMT problem (unsat).…”
Section: Research Challengementioning
confidence: 99%
“…In the second pattern, the computation of the SMT problem does not finish within a finite time (unknown). In our previous work [12], we proposed a method to partition the NW into some domains to solve the first problem (unsat). It reduced the rate of unschedulability due to timeslot collisions and improved the capacity ratio.…”
Section: Research Challengementioning
confidence: 99%