Toru Mano

Toru Mano

Auto-generated profile, based on publicly available information

Toru Mano

NTT Network Innovation Laboratories, Yokosuka, Japan

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 December 2022 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
TMToru Mano
Toru Mano
TITakeru Inoue
Takeru Inoue
KMKimihiro Mizutani
Kimihiro Mizutani
OAOsamu Akashi
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.

1 August 2014
Verified
Conference Paper
Closed access
TMToru Mano
Toru Mano
TITakeru Inoue
Takeru Inoue
DIDai Ikarashi
Dai Ikarashi
KHKoki Hamada
Koki Hamada
KMKimihiro Mizutani
Kimihiro Mizutani
OAOsamu Akashi
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.

23 September 2021 in IEEE Networking Letters
Verified
Journal Article
Closed access
TMToru Mano
Toru Mano
TITakeru Inoue
Takeru Inoue
YWYitu Wang
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.


1 March 2021 in NTT Technical Review
Verified
Journal Article
Open access
TMToru Mano
Toru Mano
TITakeru Inoue
Takeru Inoue
KMKimihiro Mizutani
Kimihiro Mizutani
OAOsamu Akashi
Osamu Akashi

20 October 2026 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
JKJun-Ichi Kani
Jun-Ichi Kani
TMToru Mano
Toru Mano
SOSadaichiro Ogushi
Sadaichiro Ogushi
KFKazutomo Fujiyama
Kazutomo Fujiyama
KNKentaro Nakamura
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.