Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Itsuro Morita

dblp:08/9102 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2013
0000-0001-9919-245XORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Optical networks · 39% Software-defined and programmable networks · 30% Network optimization and economics · 30%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
control plane
0.212013
Design and Experimental Validation of a GMPLS/PCE Control Plane for Elastic CO-OFDM Optical Networks · IEEE J. Sel. Areas Commun. 2013
Optical networks
elastic optical networks
0.212013
Design and Experimental Validation of a GMPLS/PCE Control Plane for Elastic CO-OFDM Optical Networks · IEEE J. Sel. Areas Commun. 2013
Network optimization and economics › resource allocation
spectrum allocation
0.212013
Design and Experimental Validation of a GMPLS/PCE Control Plane for Elastic CO-OFDM Optical Networks · IEEE J. Sel. Areas Commun. 2013
Optical networks › coherent optical communication
coherent optical OFDM
0.012013
Design and Experimental Validation of a GMPLS/PCE Control Plane for Elastic CO-OFDM Optical Networks · IEEE J. Sel. Areas Commun. 2013

Methods — techniques the papers use, named apart from their topics

path computation element · 0.2GMPLS · 0.2
YearPublicationVenuePosition
2013 GPU-accelerated hash and wildcard hybrid flow switching for tackling massive flow entries
abstract
GPU-accelerated high performance switching design using hybrid flow tables allocated in host and GPU memories is proposed based on LightFlow architecture. In this work, careful placement of hash and wildcard tables is proposed considering overhead of data copy during lookup process, in order to tackle massive flow entries using commodity hardware. Experimental results show that the proposal achieves 14.6 Mpps which is the fastest record of the software flow switch operated under a large scale reaching 4 million flow entries. With this proposal, it is also demonstrated that the average processing delay is about one forth compared with Open vSwitch.
Nobutaka Matsumoto, Michiaki Hayashi, Itsuro Morita
HPSR3
2013 Design and Experimental Validation of a GMPLS/PCE Control Plane for Elastic CO-OFDM Optical Networks
abstract
ITU-T Recommendation G.694.1 defines normative DWDM frequency grids, each being a reference set of values that correspond to allowed nominal central frequencies, obtained using a fixed channel spacing (e.g., 12.5 GHz, 25 GHz, 50 GHz or 100 GHz). This rigid, grid-based approach does not seem well adapted for data rates beyond 100 Gb/s, is particularly inefficient when a whole wavelength is assigned to a lower rate optical path, and is not flexible enough for multi-rate systems . Consequently, the next generation of optical networks will require a flexible, highly efficient and adaptive management of the optical spectrum, along with advanced optical modulation schemes that efficiently use allocated spectrum slots, and recent progress on optical network technology justifies research on both new optical transmission systems as well as the applicability of control and management frameworks to such networks. We design and deploy a GMPLS control plane for flexible optical networks with coherent optical orthogonal frequency-division multiplexing (O-OFDM) transmission; we detail its functional architecture, which combines a centralized entity that performs path routing and modulation assignment, with a distributed spectrum allocation. The centralized entity (i.e., a path computation element) uses pre-configured static path characterizations, based on exhaustive OFDM transmission simulations, when performing dynamic path computation in line with GMPLS constrained shortest path mechanisms. The distributed spectrum allocation assigns frequency ranges (slots) to connection requests, by using dynamic signaling procedures and applying slot assignment policies. We summarize the control plane protocol extensions involved in the main functional aspects: routing and topology dissemination, path computation, signaling and resource reservation. We experimentally validate and evaluate the integrated centralized PCE and GMPLS control plane in a control plane testbed, obtaining key performance indicators such as path setup latency and blocking probability for different frequency slot assignment policies.
Ramon Casellas, Raul Muñoz 0001, Josep M. Fabrega, Michela Svaluto Moreolo, Ricardo Martínez 0001, Lei Liu 0050, Takehiro Tsuritani, Itsuro Morita
IEEE J. Sel. Areas Commun.8