Dr. Yamanaka’s paper about interoperability activities for photonic networks was accepted for COIN2008 invited presentation.

Title: “Interoperability activities for photonic networks in Japan”
Authors: Naoaki Yamanaka(1), Masatoshi Suzuki(2), Takeshi Akaike(3), and Satoru Okamoto(1)
1: Keio University, 3-14-1 Hiyoshi, Kouhokuku, Yokohama, 223-8522 Japan
2: KDDI R&D Laboratories, 2-1-15 Ohara Fujimino-shi, Saitama 356-8502, Japan
3: NTT Laboratories, 3-9-11 Midoricho Musashino-shi, Tokyo 180-8585, Japan
Abstract: This paper details the leading edge photonic GMPLS inter-carrier interface interoperability testing of Layer-2 switching and Path Computation Element. These activities are promoted by the Interoperability Working group of the Kei-han-na Info-Communication Open Laboratories

Mr. Kikuta and Ms. Akagi’s papers were accepted for COIN2008 presentations.

**************************************************************
Title: “Implementation of VLAN Path Signaling with Domain Tag Swapping for GMPLS controlled Wide Area Layer-2 Network”
Authors: Kou Kikuta, Masahiro Nishida, Daisuke Ishii, Satoru Okamoto, and Naoaki Yamanaka
Abstract: Multi-domain GMPLS layer-2 switch capable network with VLAN tag swapping is demonstrated. In this demonstration, we verify three features, establishing path with designating VLAN ID, swapping VLAN ID on software switch, and management of VLAN IDs per domain.

**************************************************************
Title: “Cooperating Superpeers based Service-Parts Discovery for Ubiquitous Grid Networking (uGrid)”
Authors: Motomi Akagi, Ryota Usui, Yutaka Arakawa, Satoru Okamoto, Naoaki Yamanaka
Abstract: In a ubiquitous Grid networking (uGrid), discovery of service-parts and resources is essential. In this paper, cooperating superpeers based service-parts discovery which can increase the success rate of discovery is proposed.

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.

Dr. Okamoto presents his paper about the optical layer protection at PS2008.

Title: “10 GE optical layer protection evaluation using PLZT optical switches”
Authors: Satoru Okamoto, Yutaka Arakawa, Naoaki Yamanaka
Abstract: The frame loss periods of the optical layer protection switching using PLZT optical switches, which can provide 10 ns order switching time, is evaluated. Experimental results show that 60 us guard time after switching is required for 10 Gbps Ethernet which uses commercial available XFP modules.

Mr.Kasahara’s paper and Ms. Terasawa’s paper were also accepted for presentations at PS2008.
Mr.Kasahara’s news
Ms.Terasawa’s news

Mr. Ishikawa, Mr. Irie, Mr. Usui, Mr. Kihara, Mr.Nishida’s papers were accepted for APCC2008 presentations.

**************************************************************
Title: “Fast Replica Allocation Method by Parallel Calculation on DAPDNA-2”
Authors: Hiroyuki Ishikawa, Sho Shimizu, Yutaka Arakawa, Naoaki Yamanaka, and Kosuke Shiba
Abstract: This paper proposes a fast calculation method of the replica placement problem, which is implemented on reconfigurable processor DAPDNA-2 of IPFlex Inc. Our proposed method divides the combination optimally and performs pipeline operation. Beeler’s algorithm can calculate all combinations in ascending order but it has data dependence. It’s difficult to calculate any pattern because each data increases irregularly. In order to solve this problem, we propose the new algorithm that generates any order pattern. In addition, the optimal number of partitions depends on the number of combinations and calculation clocks of Beeler’s algorithm. In order to solve this problem, we think about the optimal division number in theory. While the time complexity of conventional method is proportional to the number of combinations, that of proposed method is proportional to the square root of the number of combinations. Experimental results show that the proposed algorithm reduces the execution time by 40 times compared to Intel Pentium 4 (2.8GHz).

**************************************************************
Title: “Efficient Contents Delivery Method with Scheduled Unicast and Multicast”
Authors: Kazuki IRIE, Yutaka ARAKAWA, Satoru OKAMOTO, and Naoaki YAMANAKA
Abstract: We propose the efficient contents delivery method with scheduled unicast and multicast to reduce the load of contents server and network congestion. In our proposed method, the timing of transmitting contents is arranged when many users access the contents in short period of time.Furthermore, the method of transmitting contents is switched from unicast to multicast. The simulation results show that average download time can be reduced in our proposed method.

**************************************************************
Title: “A Novel Distributed Data Access Scheme Considering with Link Resources and Metric in Lambda Grid Networks”
Authors: Ryota Usui, Hiroyuki Miyagi, Yutaka Arakawa, Satoru Okamoto, Naoaki Yamanaka
Abstract: A link load balancing technique that uses a normalized link metric based on a new wavelength utilization and link metric is proposed. The new normalized link metric is a combination of a previous link metric and wavelength utilization. In this paper, we propose a novel server selection method for parallel downloading in WDM networks. The server selection method creates link load balancing and suppresses bottleneck links. Computer simulations show that the proposed scheme can reduce bottleneck link number and the blocking probability by up to 90%.

**************************************************************
Title: “Fast Link-Disjoint Path Algorithm on Parallel Reconfigurable Processor DAPDNA-2”
Authors: Taku KIHARA, Sho SHIMIZU, Yutaka ARAKAWA, Naoaki YAMANAKA, Kosuke SHIBA
Abstract: This paper proposes fast parallel link-disjoint path algorithm using dynamically reconfigurable processor and implements it on DAPDNA-2 (IPFlex Inc) which is newly structured. The conventional k-shortest path algorithm finds multiple link-disjoint paths between the source node and the destination node. When the network scale is large, the calculation time of k-shortest path algorithm increases rapidly. Moreover, in the worst case, k-shortest path algorithm can not find optimum link-disjoint path pair because this algorithm always finds the shortest path at first and removes those links from network. Our proposed algorithm collects all path information in the network and calculates optimum link-disjoint path pair (i.e. minimum cost link-disjoint path pair) at high speed by using parallel operation. Additionally, our proposed algorithm finds optimum link-disjoint path pair at a high rate in a limited of calculation time. The evaluation shows our proposed algorithm can decrease the calculation clock about 90%.

**************************************************************
Title: “Adaptive Resource Reservation Protocol for High-speed Resource Information Advertisement”
Author: Masahiro Nishida, Hiroyuki Ishikawa, Sho Shimizu, Yutaka Arakawa, Satoru Okamoto, and Naoaki Yamanaka
Abstruct: This paper proposes an adaptive resource reservation protocol for high-speed resource information advertisement. The adaptive resource reservation protocol (ARRP) is a protocol that adaptively decides whether to uses a 1-way reservation scheme or 2-way reservation scheme on the basis of resource information in the route calculation. It is indicated that the number of the control packets in proposed method is one digit less than that in the conventional OSPF-TE. Compared to the OSPF-TE, the proposed method keeps low blocking probability even when traffic occurs more frequently.

Dr. Okamoto’s paper about activities of the Keihana Open Laboratories was accepted for MPLS2008 presentation.

Title: “Interoperability Effort for Ubiquitous GMPLS Controlled Optical Networks”
[Temporal] Authors: Satoru Okamoto, Tomohiro Otani