Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Contention-Based Limited Deflection Routing Protocol in Optical Burst-Switched Networks

Published

Author(s)

SuKyoung Lee, Kotikalapudi Sriram, H S. Kim, J S. Song

Abstract

We have implemented a quantum key distribution (QKD) system with polarization encoding at 850 nm over 1 km of optical fiber. The high-speed management of the bit-stream, generation of random numbers and processing of the sifting algorithm are all handled by a pair of custom data handling circuit boards. As a complete system using a clock rate of 1.25 Gbit/s, it produces sifted keys at a rate of 1.1 Mb/s with an error rate lower than 1.3% while operating at a transmission rate of 312.5 Mbit/s and a mean photon number 5 = 0.1. With a number of proposed improvements this system has a potential for a higher key rate without an elevated error rate.
Citation
IEEE Journal on Selected Areas in Communications
Volume
23
Issue
8

Keywords

burst contention, burst loss mitigation, deflection routing, optical burst switching, optical Internet, performance

Citation

Lee, S. , Sriram, K. , Kim, H. and Song, J. (2005), Contention-Based Limited Deflection Routing Protocol in Optical Burst-Switched Networks, IEEE Journal on Selected Areas in Communications (Accessed October 7, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created July 31, 2005, Updated October 12, 2021
Was this page helpful?