ICACT20220402 Question.1
Questioner: tomayoon@ieee.org 2022-02-14 오후 5:49:11 |
ICACT20220402 Answer.1
Answer by Auhor namacabale@gmail.com 2022-02-14 오후 5:49:11
Chrome  Click!! |
| First of all, thank you for the good research paper and presentation contents. I would like to know more about the research environment used in this study, and also in detail about the equipment & operating systems, development languages and software libraries you used. |
Thank you for your appreciation of our work. We used ns2.34 simulator running in a previous version Ubuntu 10.10. The hardware is Intel(R) Core(TM) i5-9400 CPU @ 2.90GHz and 8.00 GB RAM. Have a nice day, stay safe. |
ICACT20220402 Question.2
Questioner: nalzaben@smu.edu 2022-02-15 오후 2:39:50 |
ICACT20220402 Answer.2
Answer by Auhor namacabale@gmail.com 2022-02-15 오후 2:39:50
Chrome Click!! |
| Hello sir, thank you for a very clear presentation.
My question is did your proposed approach consider preemption when the network is under high congestion and if it did on which base would you preempt a packet? |
Hello. Thank you for your question. Our proposed scheme is about load or congestion-aware routing metric. The routing metric is used by the routing algorithm to compute the least cost path from one source towards a destination. Preemption could be part of the routing algorithm. We did not touch the routing algorithm, although this is equally an interesting topic. Hence, preemption is not part of this work. Have a wonderful day, and stay safe. |
ICACT20220402 Question.3
Questioner: 20180922@sungshin.ac.kr 2022-02-16 오전 11:37:14 |
ICACT20220402 Answer.3
Answer by Auhor namacabale@gmail.com 2022-02-16 오전 11:37:14
Chrome Click!! |
| Thank you for presenting an interesting topic.
The worst-case scenario of CLM is explained as when there is no interference traffic at the center, is the reason why it is the worst condition because CLM-based routing does not go through the center or because there is a delay due to calculation? |
Hello. Thank you for finding our work interesting. It is the worst condition because the most apparent reason would be due to routing oscillation. However, we found it more to be due to the inability of the routing algorithm to converge or to its tendency to build routing loops. Simulations show that the routes behaved this way because of the zero or near-zero load weights for idle regions. In this case, when a node sent traffic towards a particular destination, the channel load weights of the regions along the path was relatively far greater than the zero or near-zero load weights of the idle regions. Consequently, the idle regions became better paths. The cost of the paths through the idle regions remained better, even if the route went back and forth in a loop within a set nodes, than the cost of the path where the current traffic was traversing. Thanks again. |
ICACT20220402 Question.4
Questioner: ruigelwang@163.com 2022-02-16 오전 11:35:42 |
ICACT20220402 Answer.4
Answer by Auhor namacabale@gmail.com 2022-02-16 오전 11:35:42
Chrome Click!! |
| Is the stability of load-adaptive routing the same in dense and sparse networks? Please elaborate the reason. |
Hello. The stability of a load-adaptive routing depends more on the routing algorithm that computes the least cost path and and the metric that is used to compute the cost. Assuming that a load-adaptive routing has addressed the causes of instability, stability should be the same whether the network is dense or sparse. However, what the topology of a network can reveal is the weakness or weaknesses of a certain routing scheme when it comes routing stability. A mesh network that amply covered geographic area can do that more than a network that has partially covered the same area. Thank you and stay safe. |
