Now 484 visitors
Today:0 Yesterday:0
Total: 124059 216S 51P 6R
2026-10-23, Week 43
Member Login
TACT Journal Homepage
Call for Paper
Committee
Find My Paper
Author Homepage
Statistics & History
Welcome Message
Paper Procedure
FAQ
Paper Archives
Outstanding Papers
Program & Proceedings
Presentation Platform
Hotel & Travel Info
Photo Gallery
Scheduler Login
Seminar
Archives Login
Sponsors




















Paper Number Author:
Paper Title
Keyword
Q&A Number **Select your question number !!
Questioner eMail:
Question
Answer
by
Author
Save Q&A

* Edit or answer any Q&A by selecting Q&A number Hyper Link below + Write button (Save)
ICACT20240378 Question.10
Questioner: hieu.nguyen@ucdenver.edu    2024-02-12 ¿ÀÈÄ 1:21:33
ICACT20240378 Answer.10
Answer by Auhor htzustc@mail.ustc.edu.cn   2024-02-12 ¿ÀÈÄ 1:21:33
Chrome Click!!
How do you evaluate the scalability of your work? We evaluate the scalability of our work by adjusting the network scale, number of memory qubits in each node and the end-to-end request generation rate to create different simulation environment.
ICACT20240378 Question.8
Questioner: abdo_samy@mail.ustc.edu.cn    2024-02-05 ¿ÀÀü 11:46:11
ICACT20240378 Answer.8
Answer by Auhor htzustc@mail.ustc.edu.cn   2024-02-05 ¿ÀÀü 11:46:11
Chrome Click!!
How does the proposed model based on queuing theory help in characterizing the availability of quantum repeater nodes? Quantum network nodes possess much less memory capacity compared with nodes in classical networks, resulting in severe resource contention under multi-request circumstances. It¡¯s likely for a newly arrived request to find all repeaters unavailable to provide enough memory qubits, and the model is proposed to distinguish the availability of those busy nodes. In the proposed model, the whole waiting time(i.e. the last departure time) of current requests in a node is used to characterize its availability, for both the resource demand and the service time vary from specific node request. In other words, the availability of a quantum repeater node is defined as the amount of time until all memory qubits in it are available, which is calculated by a recursive algorithm.