Author Search Result

[Author] Takayuki KURODA(3hit)

1-3hit
  • An Effective QoS Control Scheme for 3D Virtual Environments Based on User's Perception

    Takayuki KURODA  Takuo SUGANUMA  Norio SHIRATORI  

     
    PAPER-Media Communication

      Vol:
    E91-D No:6
      Page(s):
    1604-1612

    In this paper, we present a new three-dimensional (3D) virtual environment (3DVE) system named "QuViE/P", which can enhance quality of service (QoS), that users actually feel, as good as possible when resources of computers and networks are limited. To realize this, we focus on characteristics of user's perceptual quality evaluation on 3D objects. We propose an effective QoS control scheme for QuViE/P by introducing relationships between system's internal quality parameters and user's perceptual quality parameters. This scheme can appropriately maintain the QoS of the 3DVE system and it is expected to improve convenience when using 3DVE system where resources are insufficient. We designed and implemented a prototype of QuViE/P using a multiagent framework. The experiment results show that even when the computer resource is reduced to 20% of the required amount, the proposed scheme can maintain the quality of important objects to a certain level.

  • An Intent-Based System Configuration Design for IT/NW Services with Functional and Quantitative Constraints Open Access

    Takuya KUWAHARA  Takayuki KURODA  Takao OSAKI  Kozo SATODA  

     
    PAPER

      Pubricized:
    2021/02/04
      Vol:
    E104-B No:7
      Page(s):
    791-804

    Network service providers need to appropriately design systems and carefully configuring the settings and parameters to ensure that the systems keep running consistently and deliver the desired services. This can be a heavy and error-prone task. Intent-based system design methods have been developed to help with such tasks. These methods receive service-level requirements and generate service configurations to fulfill the given requirements. One such method is search-based system design, which can flexibly generate systems of various architectures. However, it has difficulty dealing with constraints on the quantitative parameters of systems, e.g., disk volume, RAM size, and QoS. To deal with practical cases, intent-based system design engines need to be able to handle quantitative parameters and constraints. In this work, we propose a new intent-based system design method based on search-based design that augments search states with quantitative constraints. Our method can generate a system that meets both functional and quantitative service requirements by combining a search-based design method with constraint checking. Experimental results show that our method can automatically generate a system that fulfills all given requirements within a reasonable computation time.

  • Scalable State Space Search with Structural-Bottleneck Heuristics for Declarative IT System Update Automation Open Access

    Takuya KUWAHARA  Takayuki KURODA  Manabu NAKANOYA  Yutaka YAKUWA  Hideyuki SHIMONISHI  

     
    PAPER

      Pubricized:
    2018/09/20
      Vol:
    E102-B No:3
      Page(s):
    439-451

    As IT systems, including network systems using SDN/NFV technologies, become large-scaled and complicated, the cost of system management also increases rapidly. Network operators have to maintain their workflow in constructing and consistently updating such complex systems, and thus these management tasks in generating system update plan are desired to be automated. Declarative system update with state space search is a promising approach to enable this automation, however, the current methods is not enough scalable to practical systems. In this paper, we propose a novel heuristic approach to greatly reduce computation time to solve system update procedure for practical systems. Our heuristics accounts for structural bottleneck of the system update and advance search to resolve bottlenecks of current system states. This paper includes the following contributions: (1) formal definition of a novel heuristic function specialized to system update for A* search algorithm, (2) proofs that our heuristic function is consistent, i.e., A* algorithm with our heuristics returns a correct optimal solution and can omit repeatedly expansion of nodes in search spaces, and (3) results of performance evaluation of our heuristics. We evaluate the proposed algorithm in two cases; upgrading running hypervisor and rolling update of running VMs. The results show that computation time to solve system update plan for a system with 100 VMs does not exceed several minutes, whereas the conventional algorithm is only applicable for a very small system.

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.