The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] path assignment(4hit)

1-4hit
  • 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.

  • Prototype System of SLAMNet: Implementation and Performance Analysis of Signaling-Free Wavelength Path Switching Network

    Hiroyuki YOKOYAMA  Hajime NAKAMURA  Shinichi NOMOTO  

     
    PAPER-Network

      Vol:
    E87-B No:4
      Page(s):
    932-939

    This paper describes the implementation of an optical switch control system for best-effort multi-wavelength path assignment in DWDM networks based on the SLAMNet (Statistical Lambda Multiplexing Network) that provides dynamic path assignment capabilities without signaling between nodes. The platform of the prototype system consists of a hardware and operation system that are commercially available in the market. We developed the control functions of the SLAMNet as application software to run on the platform. The control function monitors the instantaneous bit rate of the traffic in the wavelength paths and autonomously sets up or releases optical channels in an independent and distributed manner. We demonstrate that the prototype system achieves a switching time of less than 28 milliseconds, which can respond to the burst traffic that emerges and disappears within a fraction of a second in backbone networks. This result indicates that the network architecture SLAMNet is applicable for best-effort multi-wavelength path assignment as an overlay network built on a legacy infrastructure that has no signaling capabilities. The design description and detail hardware configuration are presented. The control mechanisms and performance analysis are also included.

  • Power Distribution Algorithm in DS/CDMA Distributed Power Cellular System

    Hiroshi TAJIRI  Shin'ichi TACHIKAWA  

     
    PAPER

      Vol:
    E81-A No:7
      Page(s):
    1415-1422

    In this paper, we propose a novel power distribution method which can be adopted in case of the nonuniform distribution for mobiles in DS/CDMA distributed power cellular system. DS/SS distributed power cellular system has been proposed for achieving RAKE reception in micro-cellular environment. In forward link of this system, optimum power distribution method which can minimize the required total transmitting power has been discussed. The performance of this system has been shown in case of the uniform distribution for mobiles. In this paper, first, we propose a novel method in case of the nonuniform distribution. In the proposed method, replacing the path and its combinations of signals from base stations successively, we can find a new condition of less power distribution which is passed over in a conventional distribution method. We adopt simple distribution models for mobiles and compare the proposed method with the other methods by computing the total transmitting power and the quantity of calculations. As a result, we show that it is possible to almost obtain optimum power distribution by using the proposed method. Next, we adopt a nonuniform distribution model, in which the difference of the number of users exists only in the center cell. Using this model, we compare the proposed method with the other methods by computing the total transmitting power, the quantity of calculations, and a probability of impossible power distribution. Finally, in order to simplify and decrease the quantity of calculations of the proposed method, we propose a modified calculation algorithm which is applicable in case of that a new mobile station has increased. And we show the performance of this algorithm.

  • Dynamic Path Assignment for Broadband Networks Based on Neural Computation

    Akira CHUGO  Ichiro IIDA  

     
    PAPER

      Vol:
    E75-B No:7
      Page(s):
    634-641

    This paper describes the application of a neural network to the optimal routing problem in broadband multimedia networks, where the objective is to maximize network utilization while considering the performance required for each call. In a multimedia environment, the performance required for each call is different, and an optimal path must be found whenever a call arrives. A neural network is appropriate for the computation of an optimal path, as it provides real-time solutions to difficult optimization problems. We formulated optimal routing based on the Hop field neural network model, and evaluated the basic behavior of neural networks. This evaluation confirmed the validity of the neural network formulation, which has a small computation time even if there are many nodes. This characteristic is especially suitable for a large-scale system. In addition, we performed a computer simulation of the proposed routing scheme and compared it with conventional alternate routing schemes. The results show the benefit of neural networks for the routing problem, as our scheme always balances the network load and attains high network utilization.