| Summary: | 碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 94 === The demand for bandwidth is rapidly increasing due to the explosive growth of network traffic. In order to avoid a fully-meshed architecture, a switching device is considered to build a realistic network which can handle the explosive growth of network traffic. Every kind of switches is presented. Blocking in a data-network can lead a serious problem if the data happens to be important. Therefore, the drawback of the switching device is mainly focused on the blocking problem.
Quantum information science is a relatively new field of study. Quantum computers were first discussed in the early 1980’s [1-3]. Since then, a great deal of research has been focused on this topic. Hence, my thesis wanted to use quantum technique dealing with the blocking problem of switch.
Our previous studies have presented the solutions in the quantum context to avoid blocking at the expense of increasing packet loss [21], the exponential size of quantum SWAP gates [13] and the high propagation delay time complexity [22]. Hence, we improved the above-mentioned drawbacks and designed a Fully Non-blocking Quantum Switch which is composed of two parts in our thesis. The one is quantum SWAP gates and the other is quantum control gate. The payload of the packet is passed through quantum SWAP gates and the header of packet is passed through quantum control gates. We just need linear size of quantum SWAP gates in our thesis and using Quantum Karnaugh mapping method to construct the quantum control gates. After that we compared performance with previously proposed quantum self-routing packet switch [21] & quantum switching and quantum merge sorting [22] in terms of the hardware complexity, the propagation delay time complexity, auxiliary qubit complexity and packet loss probability.
|
|---|
