KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Settings

Author: search.filters.author.Varakulsiripunth, RuttikornSubject: search.filters.subject.Algorithm

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    An efficient dynamic multicast routing algorithm with advance resource reservation awareness
    (2004-06-28)
    Pavarangkoon, Praphan
    ;
    Gunabhibal, Apipol
    ;
    Pornavalai, Chotipat
    ;
    Varakulsiripunth, Ruttikorn
    Reserving the resources for the requested applications is one of the most effective schemes that were proposed to offer the time-critical multimedia applications recently. Because the resource is limited, an ability to provide resource reservation in advance is essential in multi-party applications with dynamic accessing and leaving of user such as modern integrated (voice, video and data) collaboration system. Modified Greedy (MG) algorithm was proposed for multicast routing in advance reservation environment (time of joining in and leaving from multicast group need to be informed to source node). However, MG algorithm has an assumption that member of multicast group join in and leave from multicast session punctually. In this work, we propose the late version of MG algorithm that yields a good performance in the situation that the inaccuracy of information given by user might be happened, as shown in our simulation results.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Publication,
    A congestion-control policy on the Internetwork gateway
    (1986-01-01)
    Varakulsiripunth, Ruttikorn
    ;
    Shiratori, Norio
    ;
    Noguchi, Shoichi
    A new approach to congestion-control policy for the interconnected networks system, called "FCP", is proposed. The main purpose of the FCP policy is to avoid the congestion of a network as well as to guarantee the performance of each network up to the desired value. In FCP policy, the traffic that arrives at aateway is restricted by that gateway in compliance with the acceptable rate, called "PAR", corresponding to its destination network. And the PAR corresponding to a network is determined based on the performance requirement of that network. The determination of PAR in FCP policy is presented and analyzed quantitatively in terms of network throughput, whereby the queuing models for a gateway and a network are developed. The result of the analytical evaluation of FCP policy is reduced to the problem of solving simultaneous non-linear equations with several variables and of a higher degree. Therefore, the systematic algorithm for computing PARs in FCP policy is also given. The numerical applications demonstrate the good efficiency of FCP policy to achieve the desired performance for each network. © 1986.