COMPARATIVE ANALYSIS OF ROUTING SCHEMES ON QUANTUM KEY DISTRIBUTION NETWORK BASED ON SOFTWARE DEFINED NETWORKING

• Main Author: Rambu Hada Nuhamara, Beatrix
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/35671
• Institution: Institut Teknologi Bandung

Quantum Key Distribution is a security enhancement mechanism to overcome key distribution problems. Quantum Key Distribution (QKD) has network characteristics that require an authentication and message encryption process so it requires a short processing time. In addition, secure keys continue to be generated during the transmission process. The existing QKD network uses OSPF routing. The disadvantages of routing are consuming a lot of secure keys. However, the concept of SDN is brings changes in centralized network control, which routing in the classical network can still be used. Utilizing the advantages of SDN, routing schemes can be adjusted by a controller who has the task of controlling the routing so that it can save the use of secure keys. The controller used in this study is ONOS. Optimization in path selection with routing schemes carried out in this study is Link State and Distance Vector. The test results are expected to be suitable with the characteristics of the QKD network based on the results of the test, Link State has a key usage that is linear with respect to the number of hops that go through, ranging from 5 to 14 keys while Distance Vector has a constant key usage that is 5 keys. Both routing also have different processing times, namely 1.19 seconds for Link State and 0.85 seconds for Distance Vector.