IEEE/ICACT20240378 Slide.11        [Big Slide]       Oral Presentation
Since both the resource demand and the service time vary from specific request r, neither the service rate nor the queue length is accurate in representing a repeater node¡¯s service capability. Instead, we use the whole waiting time of current requests in a node to characterize its availability. Using time parameters in the previous page, the departure time of requests being serviced currently can be sequentially predicted, revealing the next task to be completed and the number of qubits it will release. Afterwards, the moment when the next task is able to enter the system is determined according to its resource demand, and then its departure time is also confirmed by service time. This process is repeated until the completion time of all tasks is obtained, the latest time among which is the availability attribute.

[Go to Next Slide]
Select Voice: