Sittichivapak, Suvepon

Loading...
Thumbnail Image
Preferred name
Sittichivapak, Suvepon
Alternative Name
Sittichivapak, S.
Sittichivapak, Suvepol
Main Affiliation
Email
suvepon.si@kmitl.ac.th

Settings

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    Prioritized resolvable‐contention‐ring access control scheme
    (1992-01-01)
    Sittichivapak, Suvepon
    ;
    Okada, Hiromi
    ;
    Tezuka, Yoshikazu
    ;
    Maekawa, Sadao
    This paper proposes a prioritized resolvable‐contention‐ring scheme for high‐speed optical communication networks and investigates its performance. The priority mechanism is based on the time‐token control scheme. This mechanism attempts to guarantee the frame delay of time‐critical traffic by controlling the frame transmission of noncritical traffic. The noncritical frame can be transmitted only if token rotation time is faster than target rotation time. This paper examines the priority mechanism in the case of two priority levels and also in the case of four priority levels. System performance is studied using a computer simulation method with a time‐continuous simulator. The validity of the priority mechanism is demonstrated in a comparison with a fiber distributed data interface (FDDI) and the nonprioritized resolvable‐contention ring. Efficient operation of the priority mechanism is investigated by considering the buffer overflow rate of each priority class. The proposed scheme performs effectively. Moreover, the performance of FDDI is comparatively degraded because of long token waiting time and large token capture time. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A numerical analysis for contention resolution in contention slots of wireless DOCSIS
    (2016-10-01)
    Pawasopon, Thanyawarat
    ;
    Sittichivapak, Suvepon
    Wireless DOCSIS was developed for an enhanced version of DOCSIS by a group of cable operators. It is used in broadband wireless applications on CATV network. In this paper presents a numerical analysis that is used to resolve the contention in contention slots of Wireless DOCSIS. This method assigns each user access to the each contention slot with difference persistent value. It can resolve the contention in contention slots. Furthermore, we also separate user and contention slot into many groups and assign the user in each group access to contention slot in each group with different persistent value. This method can reduce opportunity that many users access in same arbitrary contention slot. In this paper, we analyze the performances of method with the value of successful probability of system.