Mr. Okamoto, Mr. Tokuhashi and Mr. Kihara will make presentations at the IEICE Technical Meeting on Photonic Network in August.
The titles and authors are as follows.

08/08 Technical Meeting on Photonic Network @Asari Classe Hotel(Hokkaido, Otaru)

Title: “Experiment of the in-band GMPLS message Channel for GELS network”
Authors: Satoru Okamoto, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka
Abstract: For realizing the carrier grade GMPLS controlled Ethernet, a data communication network (DCN) based on the in-fiber in-band communication channel technique should be realized. In this article, a GMPLS controlled Ethernet switch prototype system which supports in-fiber in-band DCN is reported. The prototype system provides an in-band message communication channel (IMCC) function, Mac-in-Mac frame transport mechanism, and VLAN path control function.

Title: “A study on optical access network with active optical switches”
Authors: Kazumasa Tokuhashi, Ko Kikuta, Daisuke Ishii, Yutaka Arakawa, Satoru Okamoto, Naoaki Yamanaka
Abstract: We study a novel optical access network architecture with active optical switches that is not the enhancement of Passive Optical Network (PON). Our proposed architecture can increase the number of subscribers per Optical Line Terminal (OLT) as well as stretch the distance between OLT and Optical Network Units (ONUs).
In this paper, we focus on the discovery process of Multi-Point Control Protocol (MPCP) defined in IEEE 802.3av.

Title: “A Study on High Speed Method of Link-Disjoint Path Calculation. A Parallel Multi-layer Path Calculation on DAPDNA-2”
Authors: Taku KIHARA, Sho SHIMIZU, Gao SHAN, Yutaka ARAKAWA, and Naoaki YAMANAKA
Abstract: K Disjoint-Paths Pairs (KDPPs) is widely used as a link-disjoint path search algorithm to keep survivability. It is known that KDPPs often fails to obtain optimal solution. However, there are few researches which discuss that issue. Therefore, the accuracy of KDPPs on various topologies is investigated in this paper. We propose a parallel link-disjoint path search algorithm for multi-layer networks. Simulation results show that the calculation time of the proposed algorithm decreases by 99.6% compared to KDPPs.