Category Archives: news

Mr. Kasahara’s Paper and Mr. Ishi’s Paper Were Accepted for Oral Presentation at OFC2008

Mr. Kasahara’s paper about optical switch and Mr. Ishi’s paper about controlling Ethernet by GMPLS were accepted for oral presentation at OFC2008.

Mr. Kasahara’s paper
Paper title: “GMPLS-Based High-Speed Optical Slot Switching System Using PLZT Ultra-High Speed Optical Switch for HDTV Contents Delivery Network”
Authors: Teruo Kasahara, Tomohiro Tsuji, Daisuke Ishii, Yutaka Arakawa, Satoru Okamoto, Hiroyuki Tsuda, Naoaki Yamanaka, Keiichi Nashimoto
Abstract: We design and implement a new High-speed HDTV content delivery network with GMPLS-based Optical Slot Switching system which consists of 10ns switching PLZT optical switch and Ethernet/Optical Slot protocol converter as edge router.

Mr. Ishi’s paper
Paper title: “An Experiment of Controlling Gigabit Wide Area Ethernet by GMPLS Supporting Layer-2 Switching Capability”
Authors: Daisuke Ishii, Kou Kikuta, Satoru Okamoto, Naoaki Yamanaka
Abstract: An experiment of virtual private line setup over GMPLS controlled Wide Area Ethernet is presented. It was confirmed that four usage types of Layer-2 label switched paths supposed in Wide Area Ethernet were successfully established.

Asoc. Prof. Okamoto Presented 2 Papers at the IEICE Society Conference

Asoc. Prof. Okamoto presented 2 papers at the IEICE society conference.

Title: “Proposal of the Ubiquitous Grid Networking Environment (uGrid)”
Authors: Satoru Okamoto, Yutaka Arakawa, and Naoaki Yamanaka (Keio University)

BP-2-7 (Panel Discussion)
Title: “Layer 1 and Layer 2 technologies for new generation backbone networks”
Author: Satoru Okamoto (Keio University)

Mr.Kihara, Mr.Nishida and Mr.Usui Will Make Presentations at OECC 2007 Student Workshop

Mr.Kihara, Mr.Nishida and Mr.Usui will make presentations at OECC 2007 student workshop.
Presentation will be about the following.

Name: Taku Kihara

Title: “New Parallel Shortest Path Searching Algorithm based on Reconfigurable Processor and Implementation on OSPF router”

Keywords: OSPF, Shortest path routing , parallel path search

Abstract: Recently OSPF (Open Shortest Path First) is widely used on a large-scale network. In OSPF, Dijkstra’s algorithm is used for shortest path routing. In today’s network, shortest path routing is becomes more and more complex because of increasing network scale. However, Dijkstra’s algorithm is unsuitable for these complex calculations because of its sequential process. Then, resolving this problem, I propose parallel shortest path search algorithm that uses Dynamic reconfigurable processor DAPDNA2. Proposed algorithm greatly shortens the computing time and reduce CPU load in a simulation.Moreover, I introduce the new OSPF router which adopted our proposed algorithm using DAPDNA2.

Name: Ryota Usui

Title: “The Distributed Data Access Schemes in λ Grid Networks”

Keywords: lambda grid, parallel downloading, WDM

Abstract: In the lambda grid system, to distribute the load, replica files are stored many servers. Parallel downloading is promising to decrease downloading time and distribute load to many servers. However, parallel downloading triggers many bottleneck links in the network, since many links are used in simultaneity. Therefore the blocking probability of new light path set up becomes high. Then we propose a server selection method for parallel downloading in WDM network which considers the wavelength availabilities of each links to decrease bottleneck links. The proposed scheme can select optimal servers and reduce the blocking probability by considering both wavelength availability for each link and original costs.

Name: Masahiro Nishida

Title: “Fast Unreserved Resource Information Advertising Method”

Keywords: Traffic Engineering ,GMPLS, RSVP-TE

Abstract: In GMPLS the route is explicit, because it can decide route with the source edge rooter. GMPLS becomes possible to correspond to the change of the resource. Resource information is spread by OSPF-TE. With OSPF-TE it becomes necessary to transmit many update packets to correspond to a frequent change. By the proposed method, edge router transmits lumping together the unreserved resource information of route at the time of the route establishment and release of RSVP-TE. It becomes possible to inform about the unreserved resource the edge router in high speed, and to decrease the amount of the update packet.

Mr. Kasahara and Mr. Tsuji Will Make Presentations at OECC

Mr. Kasahara and Mr. Tsuji will make presentations at OECC.
Presentation will be about the following.

Title: “Prefetching Protocol Proxy with Optimal Mirror Selection and Burst Transmission”

Authors: Tomohiro Tsuji, Junichiro Honma, Sho Shimizu, Yutaka Arakawa, and Naoaki Yamanaka

Abstract: In this paper, we propose a new accelerated download mechanism for huge data such as rich contents that can reduce the download time by about seventy percent as compared with the conventional manual operation.

Session Title: Optical Network Design
Session Time: 11:00-12:30
Room: A
Program No.: 13A2-5
Presentation Day: Fri., July 13
Presentation Time: 12:00-12:15

Title: “SubFrame-Based Slot Reservation Scheme for Minimizing Transmission Delay in Optical Slot Switching Network”

Authors: Fumiko Uehara, Teruo Kasahara, Masahiro Hayashitani, Daisuke Ishii, Yutaka Arakawa, Satoru Okamoto, and Naoaki Yamanaka

Abstract: We propose SubFrame-based slot reservation scheme for minimizing the transmission delay in optical slot switching (OSS) network. The computer simulation shows that our proposed scheme can reduce the transmission delay about 25% by using SubFrames.

Session Title: Optical Packet Switching
Session Time: 14:00-15:30
Room: A
Program No.: 13A3-4
Presentation Day: Fri., July 13
Presentation Time: 14:45-15:00

Traffic Engineering in GMPLS

With the rapid extension of broadband communication service, it is very difficult to estimate the increase and fluctuation of the traffic in network accurately and, research and development of the traffic engineering which utilizes the network resource effectively is advanced. Traffic engineering (TE: Traffic Engineering) It is of processing which selects the pass for data traffic in order to optimize the usage condition and traffic performance of the network resource simultaneously, and to promote the reliable network operation. With the traffic engineering, there is the traffic oriented which designates minimization of packet loss and communication delay and the largest conversion of throughput as purpose and the resource oriented which designates the optimization of coefficient of use of the network resource as purpose. Common performance target to two is to suppress congestion in the network to the minimum. If congestion can be suppressed to minimum, the packet loss and the communication delay decrease, and the improvement of throughput can be achieved. As a result, communication quality at user level means to improve rapidly. In order to actualize the traffic engineering, it is necessary to allocate of the resource which considers the state of the network. The case where the traffic engineering is executed, supervision of the resource, analysis of traffic quality, model of traffic and control of traffic become necessary. The high-level traffic engineering it becomes actualization possible by the fact that 4 items above are done accurately.