Browsing by Author "Hu, Kai-Wen"

Now showing 1 - 3 of 3

A Fuzzy Logic-Based Routing for Delay-Tolerant Heterogeneous Networks
(2009)
Huang, Chenn-Jung
;
Shen, Hung-Yen
;
Liao, Jia-Jian
;
Hu, Kai-Wen
;
Yang, Dian-Xiu
Delay Tolerant Network (DTN) is an intermittently connected mobile wireless network in which the connectivity between nodes changes frequently due to nodes\' movement. Recently, there have been a lot of researches working on this area. However, to the best of our knowledge, no work has addressed on the DTN routing which focuses on the heterogeneous network environment in the literature. In this work, we propose a prediction based routing protocol for the heterogeneous delay tolerant networks wherein edge servers are distributed over the borders of the different network domains. A location prediction algorithm based on the user online logs to intelligently estimate the most possible future location of the destination, if the destination is currently unavailable. Then an edge server selection algorithm based on fuzzy logic system is exploited to select the close-by intermediate node on the path to the destination so that the messages can be saved temporarily for the destination after the location of the destination is predicted. The experimental results exhibit that the proposed routing protocol can efficiently deliver the message under limited buffer space, comparing with two representative delay tolerant network routing protocols in the literature. The scalability of the proposed work is also confirmed in the simulations.
A hybrid priority-based video-on-demand resource sharing scheme
(2008-06-25)
Huang, Chenn-Jung
;
Chuang, Yi-Ta
;
Guan, Chih-Tai
;
Luo, Yun-Cheng
;
Hu, Kai-Wen
Video-on-demand (VoD) environments frequently batch video requests to decrease I/O demand and increase throughput. Since users may leave due to waiting too long, a good video scheduling policy has to consider not only the batch size, but also the user defection probabilities and waiting times. Moreover, a practical VoD resource sharing scheme should endeavor to provide some free streams to serve a high-priority clients requests immediately, since the high-priority clients might pay for the requested video. To tackle these problems, this work proposes a hybrid resource sharing model that integrates controlled multicasting and hatching. The proposed hybrid model applies a bandwidth borrowing and reserving scheme to give high-priority clients a prompt service, while still providing low-priority clients with a reasonable service. Furthermore, a novel probability model-based scheduling policy is proposed to alleviate the user defection behavior and unfairness issue. Experimental results demonstrate that the proposed resource sharing scheme is effective and feasible in terms of blocking probability of high-priority clients, the defection probability, service delay time and fairness to low-priority users. (C) 2008 Elsevier B.V. All rights reserved.
A SCALABLE ROUTING FOR DELAY-TOLERANT HETEROGENEOUS NETWORKS
(2012-01-01)
Huang, Chenn-Jung
;
Chen, Heng-Ming
;
Lin, Chin-Fa
;
Liao, Jia-Jian
;
Hu, Kai-Wen
A Delay Tolerant Network (DTN) is an intermittently connected mobile wireless network in which the connectivity between nodes changes frequently, due to the nodes' movement. Recently, there have been a lot of researchers working in this area. However, to the best of our knowledge, no work has addressed itself specifically to DTN routing within heterogeneous network environments. In this work, we propose a prediction-based routing protocol for heterogeneous delay tolerant networks, wherein edge servers are distributed over the borders of the different network domains. First, a location prediction algorithm based on user online logs is used to intelligently estimate the most probable future location of a destination, if the destination is currently unavailable. Then, an edge server selection algorithm, based on fuzzy logic, is employed to select a close-by intermediate node along the path to the destination, so that messages can be saved temporarily once the destination's location has been predicted. The experimental results show that the proposed routing protocol can efficiently deliver a message under limited buffer space, compared with other two representative delay tolerant network routing protocols found in the literature. The scalability of the proposed model is also confirmed in the simulations.