TMToru Mano

Toru Mano

*This is an algorithmically generated author record based on publicly available information.

Toru Mano has a total of 20 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Application and recent extensions of the OpenROADM MSA specifications for theOpen All-Photonic Network

    by Jun-Ichi Kani, Toru Mano, Sadaichiro Ogushi, Kazutomo Fujiyama, Kentaro Nakamura

    This paper describes how the OpenROADM MSA specifications support end-to-end optical networking services in which DWDM network endpoints are located at user sites. To enable such services, the OpenROADM specifications have recently been extended in two ways: (1) the optical specifications that support placement and remote control of transponders at user sites and (2) the network model that supports a turn-back function, which enables direct connections between user sites under the same ROADM. This paper also describes implementation options for user-site transponders and their remote control and introduces an optical transceiver prototype that integrates the remote-control function, which is suitable for IP-over-DWDM deployments. These specification enhancements and enabling technologies are expected to accelerate the deployment of on-demand, end-to-end optical networking services.

  • Redesigning the Nonblocking Clos Network to Increase Its Capacity

    by Toru Mano, Takeru Inoue, Kimihiro Mizutani, Osamu Akashi

    The Clos network has been studied for decades as a class of nonblocking switching networks. However, the structure is based on assumptions made at the time of its design, and the assumptions may not remain entirely valid. For instance, an optimal Clos network usually consists of non-square switches (numbers of input and output ports differ), though the switches available today are square ones. In addition, all paths have to be of the same length in Clos networks (presumably to simplify signal setting), but this assumption is no longer valid since signals can be dynamically established nowadays. This paper carefully identifies the implicit assumptions of the Clos network and redesigns it to increase its capacity. Although the conventional Clos network using square switches has to leave several ports unused to realize the nonblocking property, our network has almost no unused ports, which greatly increases network capacity. In addition, our network does not fix the path length and well utilizes shortcut connections if available. Comprehensive theoretical analyses show that our network has a larger capacity than the Clos network under most conditions. Numerical evaluations demonstrate that our network increases the capacity 15% on average and up to 50% at most.


  • Open Access

    Dynamic optical path provisioning for alien access links: architecture, demonstration, and challenges

    by Hideki Nishizawa, Takeo Sasai, Takeru Inoue, Kazuya Anazawa, Toru Mano, Kei Kitamura, Yoshiaki Sone, Tetsuro Inui, Koichi Takasugi

    With the spread of Data Center Interconnect (DCI) and local 5G, there is a growing need for dynamically established connections between customer locations through high-capacity optical links. However, link parameters such as signal power profile and amplifier gains are often unknown and have to be measured by experts, preventing dynamic path provisioning due to the time-consuming manual measurements. Although several techniques for estimating the unknown parameters of such alien access links have been proposed, no work has presented architecture and protocol that drive the estimation techniques to establish an optical path between the customer locations. Our study aims to automatically connect customer-owned transceivers via alien access links with optimal quality of transmission (QoT). We first propose an architecture and protocol for cooperative optical path design between a customer and carrier, utilizing a state-of-the-art technique for estimating link parameters. We then implement the proposed protocol in a software-defined network (SDN) controller and white-box transponders using an open API. The experiments demonstrate that the optical path is dynamically established via alien access links in 137 seconds from the transceiver's cold start. Lastly, we discuss the QoT accuracy obtained with this method and the remaining issues.

  • NP-Hardness Boundary of Virtual Network Embedding With Node Location Constraints

    by Toru Mano, Takeru Inoue, Yitu Wang

    Virtual network embedding (VNE) is the optimization problem of finding the minimum cost mapping between virtual and substrate networks. Although most VNE variants are NP-hard, some variants are not. VNE is polynomially solvable if the substrate network supports splittable routing and each virtual node has only one candidate substrate node due to location constraints. However, it is unknown to what extent, this polynomial region can be enlarged. This paper clarifies the boundary by showing that we cannot enlarge the polynomial region unless P = NP. VNE is NP-hard, even if each virtual node has just two candidate substrate nodes.


  • Open Access

    Increasing Capacity of a Strictly Non-blocking Clos Network Composed of Optical Switches

    by Toru Mano, Takeru Inoue, Kimihiro Mizutani, Osamu Akashi

  • Efficient virtual network optimization across multiple domains without revealing private information

    by Toru Mano, Takeru Inoue, Dai Ikarashi, Koki Hamada, Kimihiro Mizutani, Osamu Akashi

    Building optimal virtual networks across multiple domains is an essential technology to offer flexible network services. However, existing research is founded on an unrealistic assumption; providers will share their private information including resource costs. Providers, as is well known, never actually do that to remain competitive. Technically, secure multiparty computation, which is a computational technique based on the cryptography, can be used to secure optimization, but it is too time-consuming. This paper presents a novel method to optimize virtual networks built over multiple domains, with great efficiency but without revealing any private information. Our method employs secure multi-party computation but only for masking sensitive values; it can optimize virtual networks under limited information without any time-consuming technique. It is solidly based on the theory of optimality, and is assured of finding reasonably optimal solutions. Experiments show that our method is fast and optimal in practice even concealing private information; it finds nearly optimal solutions in just a few minutes for large virtual networks with tens of nodes. This is the first work that can be implemented in practice for building optimal virtual networks across multiple domains.