Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless...Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.展开更多
This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adap...This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.展开更多
基金Supported by the National Natural Science Foundation of China （No. 60903156）, and the National Science and Technology Major Project of the Ministry of Science and Technology of China （No. 2010ZX03004-001-02）.
文摘Network coding has been considered as one of the effective strategies that improve the throughput of multi- hop wireless networks. In order to effectively apply network coding techniques to the real multi-hop wireless networks, a practical network coding aware routing protocol is proposed in this paper, for unicast sessions in multi- hop wireless networks. The protocol is based on a novel routing metric design that captures the characteristics of network coding and unicast sessions. To ensure the novel routing mettle can operate with practical and widely available path calculation algorithms, a unique mapping process is used to map a real wireless network to a virtual network. The mapping process ensures that the paths with the biggest coding opportunities will be selected by commonly used path calculation algorithms. Simulation results show that the proposed routing protocol is effective to improve the network throughput.
基金Supported by the National Natural Science Foundation of China (No.60472057).
文摘This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultane- ously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simula- tion results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.
