Effect of the correlated color temperature of a phosphor-converted LED on indoor visible light communication.

Correlated color temperature (CCT) is an important parameter of the phosphor-converted LED (PC-LED); international standards specify its range in different scenarios. However, little has been done to investigate the effect of CCT on the performance of visible light communication (VLC). In this paper, we propose an analytical model for the transmission performance of an LED VLC system based on the dual components of blue and yellow light from the luminescence mechanism of the PC-LED. On this basis, the effects of CCT on the PC-LED's input current and output optical power between the dual components are analyzed. The simulation results show that the increase of CCT expands the modulation bandwidth of the PC-LED, and the trend of the BER with CCT is also related to the transmission data rate. In addition, the maximum data rate of the PC-LED with CCT from 2700 K to 6500 K under a certain transmission distance is also simulated in this paper.

Column generation algorithms for virtual network embedding in flexi-grid optical networks.

Network virtualization provides means for efficient management of network resources by embedding multiple virtual networks (VNs) to share efficiently the same substrate network. Such virtual network embedding (VNE) gives rise to a challenging problem of how to optimize resource allocation to VNs and to guarantee their performance requirements. In this paper, we provide VNE algorithms for efficient management of flexi-grid optical networks. We provide an exact algorithm aiming to minimize the total embedding cost in terms of spectrum cost and computation cost for a single VN request. Then, to achieve scalability, we also develop a heuristic algorithm for the same problem. We apply these two algorithms for a dynamic traffic scenario where many VN requests arrive one-by-one. We first demonstrate by simulations for the case of a six-node network that the heuristic algorithm obtains very close blocking probabilities to exact algorithm (about 0.2% higher). Then, for a network of realistic size (namely, USnet) we demonstrate that the blocking probability of our new heuristic algorithm is about one magnitude lower than a simpler heuristic algorithm, which was a component of an earlier published algorithm.