Presentations

—This paper proposes a source-based high-speed wavelength-path protection scheme configuring a tree-shaped backup path in WDM networks. In the proposed scheme, a failure-detecting node on a primary path starts protection by sending a failure notification to a source node of the primary path through the tree-shaped backup path. Intermediate nodes on the backup path and the source node which receive the failure notification switch to the backup path autonomously. Therefore, the proposed scheme provides high-speed protection. The simulation results revealed that the proposed scheme reduces the failure-recovery time compared with the conventional protection schemes.

次世代メトロ/アクセス統合網であるエラスティックλアグリゲーション網(EλAN)が提案されている. 本稿では, 有線光網であるEλANにおける大規模災害時の救済を実現する光アドホックネットワーク実現手法を提案する.

次世代メトロ/アクセス統合網であるエラスティックλアグリゲーション網(EλAN)が提案されている. 本論文では, 有線光網であるEλANにおける大規模災害時の救済を実現する光アドホックネットワークを実現するためのキー装置となるリモートONUの構成手法を提案する.

本論文では頻繁な経路変更に対応するために，光回線直結を用いるデータセンターアーキテクチャを対象に，10−9s 単位での切り替えが可能なPLZT Plomb Lanthanum Zirconate Titanate) 光スイッチを導入した光回線交換データセンターアーキテクチャを提案した．また，PLZT 光スイッチを用いた光回線交換通信を行うために，TDM(Time Division Multiplexing) 型光回線多重による帯域割り当てを提案した．計算機シミュレーションを用いて評価した結果，提案手法は従来手法のアーキテクチャと比較して光回線利用効率を 向上させ，消費電力を最大で45%削減することを示した．

Recently, the IoT (Internet of Things) is attracting a considerable attention. IoT is an idea of connecting all physical devices to the Internet and allowing them to communicate with each other in order to achieve mutual controls or to provide new services. In the future, it is expected that real-time data items acquired from various IoT sensors such as cameras and thermometers will be on the market. However, a real-time data transaction plat- form which supports fair and reliable billing is yet to be developed. MQTT (Message Queue Telemetry Transport) and WebRTC (Web Real-Time Communication) are two protocols considered eligible for use in IoT era. However, because MQTT adopts centralized architecture, the central server may suffer from large load due to the increase in the number of IoT devices or the size of each data item. On the other hand, WebRTC, which achieves scalability by supporting P2P transactions, has a problem with fair billing of participating users. Therefore, in this paper, we propose an IoT data transaction platform using extended WebRTC protocol which enables real-time transactions and fair billing of participating users.

In recent years, household solar panels are rapidly spreading in Japan, and it is one research issue to utilize unstable solar panel. Renewable energy is unstable. So the prediction of power generation amount by solar panels is very important. We propose a prediction service of household solar power output. There are many prediction methods for big solar power plants. However, there are no prediction methods for household solar power output within our investigation. We propose a prediction service for household solar power output. We show comparison between actual power and forecast and estimate the number of data for machine learning to mature.

In Information-centric Networking (ICN) and Content-centric Networking (CCN), content placement is very important because the closer contents and users are, the higher their Quality of Service (QoS) will be when they request these contents. Furthermore, optimum linked-content placement can improve users QoS more and more. When a content is requested by a user, moving related contents i.e. linked-content closer to the user can improve the user’s QoS because the user is likely to request these contents as well. However, multiple-content placement optimization is proven to be NP-complete, and even finding a suboptimal solution often has high calculation complexity. On the other hand, biologically inspired attractor selection model utilizes random noises in order to solve complex problem with low calculation complexity. Therefore, we evaluated applicability of attractor selection model to solving a linked-content placement problem.

NICT委託研究エラスティック光アグリゲーションネットワークの研究開発における慶應義塾大学の取り組み紹介

The recent development of network technologies that offer centralized control of explicit routes opens the door to the online optimization of explicit routing. For this kind of Traffic Engineering optimization, raising the calculation speeds by using multi-core processors with effective parallel algorithms is a key goal. This paper proposes an effective parallel algorithm for General purpose Programming on Graphic Processing Unit (GPGPU); its massively parallel style promises strong acceleration of calculation speed. The proposed algorithm parallelizes not only the search method of the Genetic Algorithm, but also its fitness functions, which calculate the network congestion ratio, so as to fully utilize the power of modern GPGPUs. Concurrently, each execution is designed for thread-block execution on the GPU with consideration of thread occupancy, local resources, and SIMT execution to maximize GPU performance. Evaluations show that the proposed algorithm offers, on average, a nine fold speedup compared to the conventional CPU approach.

Elastic Optical Networks (EONs) enable optical circuits to be assigned distinct numbers of spectrum slices. Individual circuits can then be assigned an optimal number of slices to best match their target transmission rates. A well-known drawback of EONs is spectrum fragmentation and its resulting uneven blocking probability, which circuit requests experience when the available spectrum slices in the fiber are insufficient or not contiguous. Capturing this spectrum fragmentation problem analytically is a challenging problem. Not surprisingly, most of the existing studies at this time mainly use simulationbased techniques to quantify blocking probability in EONs. In this paper, the authors present a Markov Chain (MC) model that attempts to characterize the fragmentation problem in a simplified scenario, i.e., only two types of circuit services are allowed over a single fiber link. Despite its limited scope, this initial analytical effort is able to accurately capture the nonmonotonic behavior of the blocking probability in EONs for the first time.

This paper proposes a new two-wavelength design for large-enterprise access links. The goal of this design is to lower power consumption and equipment costs without having a significant impact on performance. In our design, one wavelength is used as part of a lower-rate static circuit for general-purpose IP traffic, while the second wavelength is dynamically configured into a high-rate circuit for large dataset transfers whenever needed. A few provider-router ports are shared among a larger number of customers given that large dataset transfers are relatively infrequent. This leads to potential start-time delays, but results in significant power and cost savings. Using analytical models, we provide a quantitative power-and-cost comparison of our dynamic solution with the static always-on high-rate single-circuit solution used currently. The number of shared provider-router ports is kept large enough based on the number of customers to ensure that the probability of start-time delay exceeding a threshold is less than 1%.

Multi- (layer, path, and resources) Dynamically Optimized Routing (MiDORi) network which aggregates traffic by Traffic Engineering (TE) and reduce power consumption by on / off of port-by-port of network equipments have been proposed. Energy Efficient Ethernet (EEE) to perform the power reduction of the link as a related study has been attracting attention in recent years, technology called Low Power Idle (LPI) is adopted as a mechanism for power saving techniques EEE. We consider a network power-saving technique by path re-allocation algorithm that takes into account the LPI power characteristics in Japan Photonic Networks(JPN) in this paper. It is a technique for reducing power consumption in the entire network by changing the path to a high link-usage link from a low link-usage link. In JPN models matching the Japanese geography information, we consider the comparison for conventional method and proposed method in terms of power consumption.

On most campus networks, outdated computational resources are not used. This paper proposes a Hadoop-based resource allocation scheme for leveraging these outdated resources. The proposed scheme splits a computational job into tasks using appropriate splitting ratios based on computer processing performance and network resource availability. We compare our resource allocation scheme with a conventional scheme, which divides a job equally without consideration of computer processing performance and network resource availability. Both experiments and simulations are used to compare our proposed scheme and the conventional scheme. Simulation results show that the proposed scheme outperforms the conventional scheme in terms of job execution time.

In Smart Grid, renewable energy such as photovoltaic power and wind power has been rapidly introducing. Then, the power grid has been shifting from the tree 1:N structure with centralized power plants to the N:M structure with various kind of power resources. In this case, to realize matching control among N supply resources including unstable renewable energy and M consumers, the scalable real time matching method is necessary. In this paper, we propose a novel scalable real time matching algorithm to reduce the transmission loss by distributed P2P communication that is the P2P Interactive Agent eXtensions (PIAX) platform. Then, we show that the proposed method utilizing PIAX enables the real time matching and can reduce the transmission loss similar as centralized control method.