Pradittasnee, Lapas

Preferred name

Pradittasnee, Lapas

Main Affiliation

School of Information Technology

lapas.pr@kmitl.ac.th

Now showing 1 - 7 of 7

Some of the metrics are blocked by your
consent settings
Efficient Route Update and Maintenance for Reliable Routing in Large-Scale Sensor Networks
(2017-02-01)
Pradittasnee, Lapas
;
Camtepe, Seyit
;
Tian, Yu Chu
Reliable data transmissions are challenging in industrial wireless sensor networks as channel conditions change over time. Rapid changes in channel conditions require accurate estimation of the routing path performance and timely update of the routing information. However, this is not well fulfilled in existing routing approaches. Addressing this problem, this paper presents combined global and local update processes for efficient route update and maintenance, and incorporates them with a hierarchical proactive routing framework. While the global process updates the routing path with a relatively long period, the local process with a shorter period checks potential routing path problems. A theoretical modeling is developed to describe the processes. Through simulations, the presented approach is shown to reduce end-to-end delay up to 30 times for large networks, while improving packet reception ratio (PRR) in comparison with hierarchical and proactive routing protocols ROL/NDC, DSDV, and DSDV with IPv6 Routing Protocol for Low-Power and Lossy Networks' Trickle algorithm. Compared with reactive routing protocols AODV and Ad Hoc On-demand Multipath Distance Vector, it provides similar PRR while reducing end-to-end delay over 15 times.
Some of the metrics are blocked by your
consent settings
Algorithm to Balance Load of Controllers in Software-Defined Network
(2019-09-01)
Srisamarn, Ukrist
;
Kitsuwan, Nattapong
;
Pradittasnee, Lapas
This paper proposes an algorithm to resolve the imbalance state in a software-defined network in which orchestrated multiple-controller architecture is applied. In the orchestrated multiple-controller architecture, a super-controller recognizes load of all controllers in the network and run a load balancing process. Controllers process flow requests from switches based on the decision of the super-controller. The load of a controller in this paper includes a propagation delay and the number of packet-in messages, since the controller needs to wait for a response from the instruction requested switch for a flow installation. The load balancing is a technique to efficiently use the resources, to increase throughput, to reduce the response time for a request, and to avoid the imbalance state of all controllers. When the imbalance state is detected by the super-controller, requests of a switch in a controller with the maximum load are transferred to process at another available controller. Load of the maximum controller is reduced. A load balancing algorithm to pair switch and controller is introduced to minimize the maximum load of all controllers. Computer simulation result shows that the proposed algorithm reduces up to 79.11% of the average standard deviation, which indicates the imbalance state, of all controllers, compared to a conventional scheme.
Some of the metrics are blocked by your
consent settings
Predicting path quality with cross-layer information in multi-hop wireless networks
(2015-01-01)
Pradittasnee, Lapas
Routing path quality is an important parameter that can be used to characterize the reliability of data transmissions in multi-hop wireless networks. An accurate method to predict path quality can provide a valuable insight into the routing process design for supporting reliable transmissions in various types of wireless network implementations. Existing studies describe the data transmission process based only on the information from Network layer. However, Data link layer also affects the outcomes of the data transmissions too. In this paper, a theoretical mathematical model for predicting path quality in term of Packet Reception Ratio (PRR) is presented. The proposed mathematical model is based on the cross-layer information from both the network layer and the data link layer. The proposed model is validated with the results from NS2 simulator and the results from existing model. The results from the comparisons show that the proposed model can provide the estimated PRR values that are much closer to the simulation results than the existing model.
Some of the metrics are blocked by your
consent settings
A Study of Improving Traffic Distribution Mechanism in Software-Defined Networking
(2018-07-02)
Srisamarn, Ukrist
;
Pradittasnee, Lapas
Recently, computer networks become one of the main components of the business processes in most organizations in the world. The size and complexity of network systems also continue to rapidly grow every year. When the networks become larger, many traffic flows are likely to propagate in the network at the same time. This event can lead to multiple performance problems, such as congestion, and slow response time. Traffic distribution mechanism is one of the main solutions for solving congestion problem. It aims to reduce the probability of congestion by splitting the traffic load into multiple paths. Furthermore, applying traffic distribution technique with Software-Defined Networking (SDN) is a promising solution that can effectively support both large-scale network implementation and also does not add high level of complexity to the network system. In this paper, the traffic distribution mechanism based on modified OpenFlow is proposed. The proposed method aims to decrease response time that a SDN switch must wait for the control message back from the SDN controller. It can be achieved by allowing the SDN controller to add the new flow entries for distributing the traffic load before the packet arrives at the SDN switch. The simulation experiments are conducted in Mininet to compare the performance between the proposed traffic distribution mechanism (TD<inf>m</inf>) and the traffic distribution mechanism based on OpenFlow (TD<inf>o</inf>). The results from the experiments show that TD<inf>m</inf> can provide much better performance in term of End-to-End delay (E2E delay) and Packet delivery ratio (PDR) than TD<inf>o</inf> in most of the experiment scenarios. However, both traffic distribution mechanisms (TD<inf>o</inf> and TD<inf>m</inf>) cannot provide good performance in term of E2E delay and PDR when the data transmission rate equals or higher than 500 Mbps. As a result, Time-Sleep mechanism is proposed to implement in SDN controller. The results from the simulation experiments show that Time-Sleep mechanism can notably improve the overall performance of both TD<inf>o</inf> and TD<inf>m</inf> even when the data transmission rate is high.
Some of the metrics are blocked by your
consent settings
Improving performance of route maintenance processes in RPL protocol
(2017-07-01)
Pradittasnee, Lapas
Currently, there is a rapid increase in the implementation of Internet of Thing (IoT) systems in many areas such as smart building, and smart cities. This type of network has different sets of requirements than other network types. It needs to effectively work with unreliable wireless channel condition. IETF proposed IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) for addressing lossy environment problem. However, many important mechanisms of RPL protocol are underspecified. In this paper, we examine the performance of the route maintenance processes that are provided in RPL protocol (the combination of Neighbor Unreachability Detection Mechanism (NUD), Objective Function Zero (OF0) and The Minimum Rank with Hysteresis Objective Function (MRHOF)). Both practical and simulation experiments are conducted. The results from the practical experiments shows that the performance in term of Packet Reception Ratio from the combination between NUD and MRHOF is better than the combination between NUD and OF0. Moreover, the simulation experiments are also conducted to explore the best approach to improve the route maintenance processes by modifying two parameters in NUD and MRHOF mechanisms. The results from the simulation experiments indicate that when the data rate is low, modifying the value of the parameter in MRHOF can significantly improve the performance of the route maintenance processes but the careful consideration is required.
Some of the metrics are blocked by your
consent settings
Resolving Load Imbalance State for SDN by Minimizing Maximum Load of Controllers
(2021-10-01)
Srisamarn, Ukrist
;
Pradittasnee, Lapas
;
Kitsuwan, Nattapong
This paper proposes a scheme to practically resolve the load imbalance state for orchestrated multiple controllers architecture in software-defined networks (SDN). Multiple controllers architecture is crucial to SDN implementation in large scale networks because this architecture provides efficient performance for end-to-end services, such as reliability and scalability in SDN networks. However, when there are multiple SDN controllers in the network, a load imbalance state may occur. The load imbalance problem can notably degrade service level in some parts of the network because the SDN controllers in those network areas have much higher amount of processing load. Existing works solved the load imbalance problem by migrating the load to multiple SDN controllers in order to maintain an acceptable level of load in all SDN controllers. Nevertheless, most of these works did not consider propagation delay and processing time in their load definition. In large-scale networks, high propagation delay is likely to cause late response from the SDN controller, which may result in a degraded performance in the SDN networks. In this paper, a new load balancing scheme is proposed. The proposed scheme is formulated as an integer linear programming problem (ILP). It defines SDN controller’s load based on propagation delay, processing time at the controller and the number of request messages in order to provide an accurate representation of load in practical environments. Generally, ILP may take a long period of time to process. Therefore, a heuristic algorithm that bases on the proposed load balancing scheme is also developed to provide shorter processing time. Computer simulations and practical implementation in Pica8 switch show that the proposed scheme reduces the average maximum load by at least 9.85%, compared to a conventional scheme.
Some of the metrics are blocked by your
consent settings
A study of the neighbor unreachability detection mechanism to improve performance of RPL protocol
(2017-02-23)
Pradittasnee, Lapas
Recently, there is a rapid increase in the deployment of Internet of Thing (IoT) networks in many areas such as smart building, industrial plants and agriculture fields. However, this type of network need to be carefully operated because there are many constraints that can impede the performance of the network such as the unreliable wireless channel conditions, and the limited processing capability of sensor motes. Internet Engineering Task Force (IETF) proposed IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL), which is designed for IoT devices but some mechanisms defined in the RPL standard document (RFC 6550) are underspecified. This issue can lead to interoperability problem between multiple hardware platforms. In this paper, we focus on one of the underspecified mechanisms in RPL, Neighbor Unreachable Detection (NUD) mechanism. Two approaches for improving NUD mechanism are proposed and implement in Zolertia Z1 motes: NUD with hello packets and NUD with DIO messages. The results from the experiments that vary the interference levels and consider node moving scenario show that both of the proposed NUD mechanisms can provide much better performance in term of Packet Reception Ratio (PRR) than the original NUD implementation in ContikiOS. The NUD implementation with DIO messages cannot match the similar level of performance of the NUD implementation with hello packets but it can be implemented without adding more complexity to the RPL protocol.

Pradittasnee, Lapas

Filters

Settings

Sort By

Results per page