The search functionality is under construction.

Author Search Result

[Author] Takafumi TANAKA(6hit)

1-6hit
  • Policy-Based Grooming, Route, Spectrum, and Operational Mode Planning in Dynamic Multilayer Networks

    Takafumi TANAKA  Hiroshi HASEGAWA  

     
    PAPER-Fiber-Optic Transmission for Communications

      Pubricized:
    2022/11/30
      Vol:
    E106-B No:6
      Page(s):
    489-499

    In this paper, we propose a heuristic planning method to efficiently accommodate dynamic multilayer path (MLP) demand in multilayer networks consisting of a Time Division Multiplexing (TDM) layer and a Wavelength Division Multiplexing (WDM) layer; the goal is to achieve the flexible accommodation of increasing capacity and diversifying path demands. In addition to the grooming of links at the TDM layer and the route and frequency slots for the elastic optical path to be established, MLP requires the selection of an appropriate operational mode, consisting of a combination of modulation formats and symbol rates supported by digital coherent transceivers. Our proposed MLP planning method defines a planning policy for each of these parameters and embeds the values calculated by combining these policies in an auxiliary graph, which allows the planning parameters to be calculated for MLP demand requirements in a single step. Simulations reveal that the choice of operational mode significantly reduces the blocking probability and demonstrate that the edge weights in the auxiliary graph allow MLP planning with characteristics tailored to MLP demand and network requirements. Furthermore, we quantitatively evaluate the impact of each planning policy on the MLP planning results.

  • Rapid Restoration Sequence of Fiber Links and Communication Paths from Catastrophic Failures

    Akihiro KADOHATA  Takafumi TANAKA  Wataru IMAJUKU  Fumikazu INUZUKA  Atsushi WATANABE  

     
    PAPER

      Vol:
    E99-A No:8
      Page(s):
    1510-1517

    This paper addresses the issue of implementing a sequence for restoring fiber links and communication paths that have failed due to a catastrophe. We present a mathematical formulation to minimize the total number of steps needed to restore communication paths. We also propose two heuristic algorithms: Minimum spanning tree - based degree order restoration and Congestion link order restoration. Numerical evaluations show that integer linear programming based order restoration yields the fewest number of restoration steps, and that the proposed heuristic algorithms, when used properly with regard to the accommodation rate, are highly effective for real-world networks.

  • Learners' Self Checking and Its Effectiveness in Conceptual Data Modeling Exercises

    Takafumi TANAKA  Hiroaki HASHIURA  Atsuo HAZEYAMA  Seiichi KOMIYA  Yuki HIRAI  Keiichi KANEKO  

     
    PAPER

      Pubricized:
    2018/04/20
      Vol:
    E101-D No:7
      Page(s):
    1801-1810

    Conceptual data modeling is an important activity in database design. However, it is difficult for novice learners to master its skills. In the conceptual data modeling, learners are required to detect and correct errors of their artifacts by themselves because modeling tools do not assist these activities. We call such activities self checking, which is also an important process. However, the previous research did not focus on it and/or the data collection of self checks. The data collection of self checks is difficult because self checking is an internal activity and self checks are not usually expressed. Therefore, we developed a method to help learners express their self checks by reflecting on their artifact making processes. In addition, we developed a system, KIfU3, which implements this method. We conducted an evaluation experiment and showed the effectiveness of the method. From the experimental results, we found out that (1) the novice learners conduct self checks during their conceptual data modeling tasks; (2) it is difficult for them to detect errors in their artifacts; (3) they cannot necessarily correct the errors even if they could identify them; and (4) there is no relationship between the numbers of self checks by the learners and the quality of their artifacts.

  • Distance-Adaptive Path Allocation in Elastic Optical Path Networks Open Access

    Bartlomiej KOZICKI  Hidehiko TAKARA  Takafumi TANAKA  Yoshiaki SONE  Akira HIRANO  Kazushige YONENAGA  Masahiko JINNO  

     
    PAPER

      Vol:
    E94-B No:7
      Page(s):
    1823-1830

    We describe a concept and realization of distance-adaptive (DA) resource allocation in spectrum-sliced elastic optical path network (SLICE). We modify the modulation format and cross-connection bandwidth of individual fixed-bit rate optical paths to optimize performance with respect to transmission distance. The shorter paths are allocated a smaller amount of resources which allows reducing the spectrum occupied by the channel. We show in calculation a reduction in required spectral resources of more than 60% when compared to the traditional traffic allocation schemes based on ITU-T grid. The concept is verified experimentally.

  • Recent Advances in Elastic Optical Networking Open Access

    Takafumi TANAKA  Masahiko JINNO  

     
    INVITED PAPER

      Vol:
    E97-B No:7
      Page(s):
    1252-1258

    Many detailed studies ranging from networking to hardware as well as standardization activities over the last few years have advanced the performance of the elastic optical network. Thanks to these intensive works, the elastic optical network has been becoming feasible. This paper reviews the recent advances in the elastic optical network from the aspects of networking technology and hardware design. For the former, we focus on the efficient elastic network design technology related to routing and spectrum assignment (RSA) of elastic optical paths including network optimization or standardization activities, and for the latter, two key enabling technologies are discussed: elastic transponders/regenerators and gridless optical switches. Making closely-dependent networking and hardware technologies work synergistically is the key factor in implementing truly effective elastic optical networks.

  • Differential Reliability Path Accommodation Design and Reconfiguration in Virtualized Multi-Layer Transport Network

    Akihiro KADOHATA  Takafumi TANAKA  Atsushi WATANABE  Akira HIRANO  Hiroshi HASEGAWA  Ken-ichi SATO  

     
    PAPER

      Vol:
    E98-B No:11
      Page(s):
    2151-2159

    Multi-layer transport networks that utilize sub-lambda paths over a wavelength path have been shown to be effective in accommodating traffic with various levels of granularity. For different service requirements, a virtualized network was proposed where the infrastructure is virtually sliced to accommodate different levels of reliability. On the other hand, network reconfiguration is a promising candidate for quasi-dynamic and multi-granular traffic. Reconfiguration, however, incurs some risks such as service disruption and fluctuations in delay. There has not yet been any study on accommodating and reconfiguring paths according to different service classes in multi-layer transport networks. In this paper, we propose differentiated reconfiguration to address the trade-off relationship between accommodation efficiency and disruption risk in virtualized multi-layer transport networks that considers service classes defined as a combination of including or excluding a secondary path and allowing or not allowing reconfiguration. To implement the proposed network, we propose a multi-layer redundant path accommodation design and reconfiguration algorithm. A reliability evaluation algorithm is also introduced. Numerical evaluations show that when all classes are divided equally, equipment cost can be reduced approximately by 6%. The proposed reconfigurable networks are shown to be a cost effective solution that maintains reliability.