The search functionality is under construction.

Author Search Result

[Author] Yuki KAMADO(2hit)

1-2hit
  • A Measured-Traffic-Based Bandwidth Dimensioning Method for Internet ATM Backbone Networks

    Yuki KAMADO  Kou MIYAKE  

     
    PAPER-Control and performance

      Vol:
    E81-B No:2
      Page(s):
    449-458

    A traffic engineering method has been developed to meet the requirements for efficient bandwidth dimensioning and for a practical and consolidated network design method. It characterizes the offered-traffic burstiness on a transit link by using time-series measurement of the aggregate traffic. It estimates future traffic characteristics based on the average traffic volume at that time which is easily derived from trend analysis, i. e. , an x% increase in bandwidth each year and gives the required link capacity. Simulation showed that the parameters estimated using this method fit the actual behavior of a network well. This method enables an appropriate bandwidth to be allocated to a transit link without having to estimate the specific traffic characteristics for each connection over the link. Once the burstiness parameter and its trend have been identified based on this method, it is possible to use a simple traffic measurement method to detect changes in network traffic and feed them back to the engineering procedure.

  • Method of Implementing GFR Service in Large-Scale Networks Using ABR Control Mechanism and Its Performance Analysis

    Ryoichi KAWAHARA  Yuki KAMADO  Masaaki OMOTANI  Shunsaku NAGATA  

     
    PAPER-Communication Networks and Services

      Vol:
    E82-B No:12
      Page(s):
    2081-2094

    This paper proposes implementing guaranteed frame rate (GFR) service using the available bit rate (ABR) control mechanism in large-scale networks. GFR is being standardized as a new ATM service category to provide a minimum cell rate (MCR) guarantee to each virtual channel (VC) at the frame level. Although ABR also can support MCR, a source must adjust its cell emission rate according to the network congestion indication. In contrast, GFR service is intended for users who are not equipped to comply with the source behavior rules required by ABR. It is expected that many existing users will fall into this category. As one implementation of GFR, weighted round robin (WRR) with per-VC queueing at each switch is well known. However, WRR is hard to implement in a switch supporting a large number of VCs because it needs to determine in one cell time which VC queue should be served. In addition, it may result in ineffective bandwidth utilization at the network level because its control mechanism is closed at the node level. On the other hand, progress in ABR service standardization has led to the development of some ABR control algorithms that can handle a large number of connections. Thus, we propose implementing GFR using an already developed ABR control mechanism that can cope with many connections. It consists of an explicit rate (ER) control mechanism and a virtual source/virtual destination (VS/VD) mechanism. Allocating VSs/VDs to edge switches and ER control to backbone switches enables us to apply ABR control up to the entrance of a network, which results in effective bandwidth utilization at the network level. Our method also makes it possible to share resources between GFR and ABR connections, which decreases the link cost. Through simulation analysis, we show that our method can work better than WRR under various traffic conditions.