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

Keyword Search Result

[Keyword] width control(13hit)

1-13hit
  • Adaptive Bandwidth Control for Dynamic Spectrum Control Aided Spectrum Sharing in Private Wireless Networks

    Tomomi AOKI  Shinsuke IBI  Seiichi SAMPEI  

     
    PAPER

      Vol:
    E95-B No:4
      Page(s):
    1093-1099

    This paper proposes an adaptive bandwidth control scheme for the private wireless networks. Carrier sense multiple access with collision avoidance (CSMA/CA), which is commonly used within the private networks, is not efficient in terms of spectral efficiency due to its strict collision avoidance process. In order to relax the collision avoidance rule, this paper employs dynamic spectrum control (DSC), in which a certain number of discrete spectra having the higher channel gain is selected in a selfish manner with each link allowing a partial band interference. Such interference may be suppressed by the equalizer at the receiver. Aiming at optimal selection of the bandwidth for the selfish DSC according to channel realizations, in the sense of throughput maximization, this paper proposes a channel capacity maximization-based BAR control scheme. Computer simulations validate that the proposed scheme achieves high throughput efficiency.

  • Low Pass Filter-Less Pulse Width Controlled PLL Using Time to Soft Thermometer Code Converter Open Access

    Toru NAKURA  Kunihiro ASADA  

     
    PAPER-Integrated Electronics

      Vol:
    E95-C No:2
      Page(s):
    297-302

    This paper demonstrates a pulse width controlled PLL without using an LPF. A pulse width controlled oscillator accepts the PFD output where its pulse width controls the oscillation frequency. In the pulse width controlled oscillator, the input pulse width is converted into soft thermometer code through a time to soft thermometer code converter and the code controls the ring oscillator frequency. By using this scheme, our PLL realizes LPF-less as well as quantization noise free operation. The prototype chip achieves 60 µm 20 µm layout area using 65 nm CMOS technology along with 1.73 ps rms jitter while consuming 2.81 mW under a 1.2 V supply with 3.125 GHz output frequency.

  • Stability-Guaranteed Width Control for Hot Strip Mill

    Cheol Jae PARK  I Cheol HWANG  

     
    LETTER-Systems and Control

      Vol:
    E91-A No:3
      Page(s):
    883-886

    We propose a stability-guaranteed width control (SGWC) for the hot strip finishing mill. It is shown that the proposed SGWC guarantees the stability of the width controller by the universal approximation of the neural network. It is shown through the field test in the hot strip mill of POSCO that the stability of the width controller is guaranteed by the proposed control scheme.

  • On the Effectiveness of Rate-Limiting Methods to Mitigate Distributed DoS (DDoS) Attacks

    Takanori KOMATSU  Akira NAMATAME  

     
    PAPER

      Vol:
    E90-B No:10
      Page(s):
    2665-2672

    It has been widely observed that high-bandwidth traffic aggregates often occur by flooding-based distributed denial-of-service (DDoS) attacks. Several congestion control methods have been proposed for bandwidth controls. These methods are also considered to be important in order to avoid collapse of network services by DDoS attacks. We perform simulation studies of these well-known crowd management methods in order to minimize the damage caused by DDoS attacks with bandwidth control. Internet topologies have many facets in terms of the focus of the observation. Therefore, we need to conduct simulation of DDoS attacks in different Internet topologies, including the tiers model, the transit-stub model, and the Barabasi-Albert model. Using RED, CHOKe, and pushback with ACC as congestion control methods, we evaluate network resistance against DDoS attacks and similar overflow problems.

  • Network Supported Bandwidth Control for TCP in Hierarchical Mobile Internet

    Yosuke MATSUSHITA  Takahiro MATSUDA  Miki YAMAMOTO  

     
    PAPER-Internet

      Vol:
    E88-B No:1
      Page(s):
    266-273

    In the mobile Internet, a handover brings significant performance degradation of TCP due to bursty packet losses during handover processing. In this paper, we propose a new bandwidth control for improving the TCP performance. In the proposed system, when a mobile node changes its accessing base station, an intermediate router suppresses an available bandwidth to the corresponding TCP flow. Because suppressing the bandwidth results in reducing mis-forwarded packets to the old base station, the bursty packet losses can be avoided. In the hierarchical mobile network structure, which is recently developed in order to realize micro-mobility protocol, all packets transferred to mobile nodes are converged to several gateways such as mobility anchor points (MAP) in hierarchical Mobile IPv6 (HMIPv6). Therefore, the proposed system is suited to the hierarchical structure because it can be easily implemented at such gateways. Computer simulation results show that the proposed system can improve the TCP performance degradation especially in a situation where handovers frequently occur.

  • Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch

    Hiroyuki YOKOYAMA  Hajime NAKAMURA  

     
    PAPER-ATM Networks

      Vol:
    E81-B No:11
      Page(s):
    2072-2080

    Priority control and call admission control are indispensable traffic management methods to guarantee each QoS requirement of connections in ATM networks. The key technique of call admission control under priority control is to estimate required bandwidth of each connection to satisfy all QoSs of calls in progress. In this paper, we propose a novel approximation method to calculate the required bandwidth of ATM connections through priority queues and show a practical call admission control scheme using the proposed method. The essence of the approximation method is to model prioritized parallel queues as a series of queues in tandem with no priority control by focusing on the number of cells in queues. The tandem queue approximation method enables us to model each queue under priority control as a single non-priority FIFO queue in terms of its queue length. This results in that effective bandwidth techniques are applicable to priority queues. The effectiveness of the proposed scheme is evaluated by some numerical examples.

  • A Study on Vertically Installed Planar (VIP) Combline Bandpass Filters via 3D-FDTD Method

    Chuandong ZHAO  Ikuo AWAI  

     
    PAPER-Components

      Vol:
    E81-C No:4
      Page(s):
    602-607

    A two stage Combline Bandpass Filter (C-BPF) of the Vertically Installed Planar (VIP) structure has been investigated, which is essentially composed of a strongly coupled microstrip lines terminated with a planar fin and through-hole combined with the tapping feed approach. The principle and performance of this filter is studied approximately by an equivalent circuit model and also by the normalized 3D-FDTD method more exactly. The time domain iteration in the FDTD analysis is performed in an expanded time dimension resulting in a reduced CPU time. Some of the obtained numerical results are compared well with the measured ones. A modified VIP combline BPF has the advantages of simple structure, easy tuning, low cost, versatile bandwidth control and good skirt characteristics brought about by two attenuation poles.

  • VP Control for ATM Networks with Call-Level QoS (Quality of Service) Guarantees

    Kyamakya KYANDOGHERE  

     
    PAPER-Switching and Communication Processing

      Vol:
    E81-B No:1
      Page(s):
    32-44

    In this paper, a design concept that offers ATM-VP connections with different protection levels is presented. The users have the choice to select the protection level they wish, the network transport service they need, and the worst cell loss they can tolerate at call set up time, and pay accordingly. Besides, an advanced adaptive traffic control scheme that simplifies call and cell processing is also presented. Many important functions such as call admission, VC-bandwidth reservation, cell-level congestion control, etc. are efficiently performed at the boundary of the backbone network. In this way is given a suitable answer to the important question: "How can future telecommunication networks based on ATM provide services with customized availability ?" A platform that outlines the potential interaction between restoration methods and congestion avoidance schemes is also obtained.

  • Dynamic VP Rearrangement in an ATM Network

    Ayano YAMASHITA  Ryutaro KAWAMURA  Hisaya HADAMA  

     
    PAPER-Network and traffic control

      Vol:
    E80-B No:2
      Page(s):
    289-295

    In this paper, we introduce a VP rearrangement scheme to realize the dynamic control of ATM network. We demonstrate its effectiveness for the transport of B-ISDN traffic which is both fluctuous and hard to predict. First, we present a strategy for the ATM network provisioning, used to manage both the logical VP network and the underlying physical transport network. We then propose a VP rearrangement scheme and discuss its performance. Lastly, we analyze the proposed scheme by simulations, and confirm that its performance, in comparison to the conventional, dynamic VP bandwidth control scheme, is superior.

  • LAN Internetworking through Broadband ISDN

    Masayuki MURATA  Hideo MIYAHARA  

     
    INVITED PAPER

      Vol:
    E77-B No:3
      Page(s):
    294-305

    A local area network (LAN) can now provide high-speed data communications in a local area environment to establish distributed processing among personal computers and workstations, and the need for interconnecting LANs, which are geographically distributed, is naturally arising. Asynchronous Transfer Mode (ATM) technology has been widely recognized as a promising way to provide the high-speed wide area networks (WAN) for Broadband Integrated Services Digital Network (B-ISDN), and the commercial service offerings are expected in the near future. The ATM network seems to have a capability as a backbone network for interconnecting LANs, and the LAN interconnection is expected to be the first service in ATM networks. However, there remain some technical challenges for this purpose; one of the main difficulties in LAN interconnection is the support of connectionless traffic by the ATM network, which is basically a connection-oriented network. Another one is the way of achieving the very high-speed data transmission over the ATM network. In this paper, we first discuss a LAN internetworking methodology based on the current technology. Then, the recent deployments of LAN interconnection methods through B-ISDN are reviewed.

  • Analysis of Dynamic Bandwidth Control for LAN Interconnection through ATM Networks

    Yoshihiro OHBA  Masayuki MURATA  Hideo MIYAHARA  

     
    PAPER

      Vol:
    E77-B No:3
      Page(s):
    367-377

    In this paper, we study a dynamic bandwidth control which is expected an effective use of network resources in transmitting highly bursty traffic generated by, e.g., interconnected LAN systems. First, a new LAN traffic model is proposed in which correlation of not only packet interarrival times but also packet lengths are considered. An analytic model for a LAN-ATM gateway is next introduced. It employs the dynamic bandwidth control using the proposed LAN traffic model and some performance measures are derived by it. The analytic model takes into account the probability that a bandwidth increase request may be rejected. Finally, some numerical examples are provided using the analysis method and performance comparisons between the dynamic and fixed bandwidth controls are made. As a result, it is quantitatively indicated that () if the equivalent bandwidth is used in average, the dynamic bandwidth control keeps packet and cell loss rates one to two orders lower than the fixed bandwidth control, () when the more strict QOS in terms of loss rate is requested, the dynamic bandwidth control can become more effective.

  • Fast VP-Bandwidth Management with Distributed Control in ATM Networks

    Ryutaro KAWAMURA  Hisaya HADAMA  Ken-ichi SATO  Ikuo TOKIZAWA  

     
    PAPER-Communication Networks and Service

      Vol:
    E77-B No:1
      Page(s):
    5-14

    This paper proposes a high-speed VP bandwidth control scheme for ATM networks that utilizes a distributed control mechanism. First, the characteristics of VPs are compared with those of digital paths in STM networks. A distributed control scheme is adopted for rapid control. The basic elements and the necessary distributed function, the control algorithm, and the message transmission mechanism, are elucidated. The bandwidth alteration time with the proposed algorithm is estimated by considering network element processing and queuing delay. The proposed VP bandwidth control scheme can be applied to both public networks and leased line services. Finally, this paper focuses on its application to leased line services, and discusses the resource reduction effects of the proposed scheme.

  • Centralized Virtual Path Bandwidth Allocation Scheme for ATM Networks

    Michael LOGOTHETIS  Shigeo SHIODA  

     
    PAPER-Communication Networks and Service

      Vol:
    E75-B No:10
      Page(s):
    1071-1080

    This paper deals with a network architecture based on a backbone network, using ATM switches (ATM-SW) and ATM Cross-Connect Systems (ATM-XC). The backbone network is efficiently utilized by multiple-routing scheme. The performance of the network is controlled, exploiting the concept of Virtual Paths (VP) in ATM technology. The network is controlled by allocating the bandwidth of VPs so as to minimize the worst call blocking probability of all ATM-SW pairs, under the constraints of the ATM-SW capacities and the bandwidths of transmission paths in the backbone network. To improve network performance, we use a trunk reservation scheme among service classes. We propose a heuristic approach to solve the problem of non-linear integer programming. Evaluation of the proposed optimization scheme, in comparison to other optimal methods, shows the efficiency of the present scheme.