Browsing by Author "Lee, Sheng-Chieh"

Now showing 1 - 2 of 2

Aggregating Small Packets in M2M Networks: An OM2M Implementation
(2016-01-01)
Lee, Sheng-Chieh
;
Wu, Kun-Ru
;
Hsu, Ching-Kuo
;
Chang, Po-Yen
;
Liang, Jia-Ming
IoT (Internet of Things) and M2M (machine to machine) have attracted a lot of attention since more and more devices are expected to connect to the Internet for special purposes such as environment monitoring, home automation, industrial surveillance, and e-Health care. Currently, the OM2M (Open source platform for M2M communication) is a promising project which implements oneM2M and SmartM2M standards as an open-source platform for integrating various M2M services, applications, and devices. However, the individual data generated from those IoT/M2M devices is usually quite small, which incurs a lot of control overhead and thus decreases network performance significantly. Therefore, in this work we design and implement an OM2M 'plugin' that can aggregate small IoT data effectively. We will show how the plugin works and verify the effectiveness on the network bandwidth in this demonstration.
Efficient and Consistent Flow Update for Software Defined Networks
(2018-03-01)
Wu, Kun-Ru
;
Liang, Jia-Ming
;
Lee, Sheng-Chieh
;
Tseng, Yu-Chee
;
資訊工程學系
Software defined network (SDN) provides flexible and scalable routing by separating control plane and data plane. With centralized control, SDN has been widely used in traffic engineering, link failure recovery, and load balancing. This work considers the flow update problem, where a set of flows need to be migrated or rearranged due to change of network status. During flow update, efficiency and consistency are two main challenges. Efficiency refers to how fast these updates are completed, while consistency refers to prevention of blackholes, loops, and network congestions during updates. This paper proposes a scheme that maintains all these properties. It works in four phases. The first phase partitions flows into shorter routing segments to increase update parallelism. The second phase generates a global dependency graph of these segments to be updated. The third phase conducts actual updates and then adjusts dependency graphs accordingly. The last phase deals with deadlocks, if any, and then loops back to phase three if necessary. Through simulations, we validate that our scheme not only ensures freedom of blackholes, loops, congestions, and deadlocks during flow updates, but is also faster than existing schemes.