Pavarangkoon, Praphan
Loading...
Preferred name
Pavarangkoon, Praphan
Main Affiliation
Email
praphan.pa@kmitl.ac.th
2 results
Now showing 1 - 2 of 2
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Routing algorithms with adaptive weight function based on total wavelengths and expected available wavelengths in optical WDM networks(2005-01-01); ; Varakulsiripunth, RuttikornThis paper studies routing and wavelength assignment in wavelength-routed (WR) optical WDM networks which are circuit-switched in nature. When a session request is given, (be hard task of routing and wavelength assignment (RWA) is to calculate the satisfiable path between two nodes, and also to assign an available set of wavelengths along this path. Therefore, we have proposed a new routing and wavelength assignment algorithm, called Total wavelengths and Expected available wavelengths (TEW) algorithm in order to achieve the effective routing and wavelength assignment that can guarantee the service for user's requirement. The link weight function is considered as the main factor for route selection in TEW algorithm. This function is calculated by using a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the least number of link weights by using Dijkstra's shortest path algorithm. This means that the selected lightpath will have the minimum utilization and maximum expected available wavelengths. The impact of proposed link weight computing function on the blocking probability is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed TEW algorithm can achieve better performance in terms of the blocking probability. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, An efficient dynamic multicast routing algorithm with advance resource reservation awareness(2004-06-28); ; Varakulsiripunth, RuttikornReserving 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.