The search functionality is under construction.

Author Search Result

[Author] Rong-Ruey LEE(2hit)

1-2hit
  • A Novel Cell Scheduler with QoS Guarantee for Services in ATM Networks

    Wen-Tsuen CHEN  Rong-Ruey LEE  Horng-Jong LIN  

     
    PAPER-Communication Systems and Transmission Equipment

      Vol:
    E82-B No:2
      Page(s):
    447-454

    Real-time services, including constant bit rate (CBR) and real-time variable bit rate traffic (rt-VBR), have become increasingly important owing to the rapid proliferation of multimedia applications. A cell multiplexing method capable of handling real-time traffic should satisfy related quality of service (QoS) requirements, including cell transfer delay (CTD), cell delay variation (CDV) and cell loss ratio (CLR). In this paper, we present an efficient cell multiplexing method, called longest delay beyond expectation (LDBE), to schedule real-time and non-real-time traffic in ATM networks. For the real-time traffic, LDBE scheme can minimize the CDV, and reduce the CLR and CTD, particularly when different CDV tolerance (CDVT) values are applied at each node along the path of a connection. Simulation results demonstrate that the proposed LDBE performs better than other multiplexing methods regarding these CLR, CDV and CTD criteria for real-time traffic. Furthermore, the proposed LDBE is also suitable for scheduling non-real-time traffic by providing a low CLR for non-real-time variable bit rate (nrt-VBR) and minimizing the CTD for unspecified bit rate (UBR) traffic.

  • A Cell Scheduler for Non-Real-Time Traffic with Service Fairness in ATM Networks

    Wen-Tsuen CHEN  Rong-Ruey LEE  

     
    PAPER-Switching

      Vol:
    E83-B No:7
      Page(s):
    1465-1473

    Non-real-time (NRT) services such as nrt-VBR, ABR and UBR traffic are intended for data applications. Although NRT services do not have stringent QoS requirements for cell transfer delay and cell delay variation, ATM networks should provide NRT services while considering other criteria to ensure an excellent performance such as cell loss ratio (CLR), buffer size requirement and service fairness. Service fairness means that networks should treat all connections fairly. That is, connections with low arrival rates should not be discriminated against. In addition, given a fixed buffer size for a connection, reducing the maximum number of cells in a buffer during the lifetime of a connection can lead to a low CLR due to buffer overflow. Thus, these criteria should be considered as much as possible when designing a cell scheduler to provide NRT services. Whereas most of the conventional cell scheduling schemes are usually appropriate for one performance criterion, but inappropriate for another one. In this work, we present a novel cell scheduling scheme, called buffer minimized and service fairness (BMSF), to schedule NRT services in ATM networks. Using probability constraints and selecting a connection with the longest buffer size to transmit first allow BMSF to attain a satisfactory performance with respect to maximum buffer size requirement, CLR, and service fairness in terms of the maximum buffer size and cell waiting delay criteria. Simulation results demonstrate that BMSF performs better than some conventional schemes in terms of these criteria, particularly when NRT services have diverse arrival rates. Thus, the BMSF scheme proposed herein can feasibly schedule NRT services in ATM networks.