Woei Lin

National Chung Hsing University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Chin‐Chi Wu

Nan Kai University of Technology

Hsien-Ming Wu

National Chung Hsing University

Ding‐Jyh Tsaur

National Chung Hsing University

Chia-Lung Liu

Industrial Technology Research Institute

Uei‐Ren Chen

Hsiuping University of Science and Technology

Kuan-Hung Chou

ITRI International

Chuan-lin Wu

The University of Texas at Austin

Chou‐Chen Yang

National Chung Hsing University

Chita R. Das

Pennsylvania State University

Tsang‐Ling Sheu

National Sun Yat-sen University

Cooperative Institutions

National Chung Hsing University

Pennsylvania State University

National Taipei University

The University of Texas at Austin

National Yang Ming Chiao Tung University

Czech Academy of Sciences, Institute of Computer Science

Zhejiang University

University of Maryland, Baltimore

Park University

Jilin University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

An Adjustable Target Coverage Method in Directional Sensor Networks

Uei‐Ren Chen Bo-Sheng Chiou Jyun-Ming Chen Woei Lin

The coverage problem for targets with directional sensor nodes has been studied in this paper. To improve the coverage rate for targets, we propose a Weighted Centralized Greedy Algorithm (WCGA). The weight function added in the WCGA could be adjusted according to different density of sensor nodes in directional sensor networks. A serious of experiments have been performed to evaluate the performance of the proposed method. Simulation results show the improvement of the target coverage rate and the effectiveness of the proposed method.

10.1109/apscc.2008.37

Cite

Citations (27)

A DDRR-Based Scheduler to Achieve Proportional Delay Differentiation in Terabit Network

Chin‐Chi Wu Hsien-Ming Wu Chia-Lung Liu Woei Lin

In recent years much attention has been given to providing the proportional delay differentiation through the packet scheduling. The issue of the performance of the scheduling algorithms also increases in importance when the line speed increases significantly as a result of the optical technology. In this paper we propose an efficient packet scheduling scheme modified from the dynamic deficit round-robin (DDRR) scheduling algorithm. The new scheme not only provides the tuning knob for adjusting the relative QoS in the packet delay but also performs scheduling at O(1) complexity and with very small overhead. Simulation results show the effectiveness of the modified algorithm.

Terabit

10.1109/aina.2005.18

Cite

Citations (4)

Delivering relative differentiated services in future high-speed networks using hierarchical dynamic deficit round robin

Multimedia Systems (2007)

Chin‐Chi Wu Hsien-Ming Wu Woei Lin

10.1007/s00530-007-0084-y

Cite

Citations (1)

A Frame-Based Architecture with Shared Buffers for Slotted Optical Packet Switching

Guan-Hong Jhou Woei Lin

Because of the lack of random access memory in optical domain, optical buffering implemented by fiber delay lines is currently a main way. Typical optical buffering architecture falls into two categories: feed-forward and feedback buffering. Both have advantages and disadvantages. In this paper, we propose an effective hybrid buffering architecture based on output-buffered feed-forward and feedback shared buffering architecture. The proposed architecture employs feed-forward output buffers to connect packets to form a variable-length frame, and employs a feedback shared buffer with a large storage frame to handle frames behind feed-forward output buffers. This scheme uses a frame concept to reduce the control complexity and increase the buffer depth. Our simulation results show that the proposed architecture improves the switch performance and outperforms an existing hybrid buffering architecture, partially shared buffering architecture, in terms of packet loss probability.

Packet Switching

Buffer (optical fiber)

10.1109/hpcc.2009.73

Cite

Citations (2)

Optimal adaptive controllers for unknown Markov chains

IEEE Transactions on Automatic Control (1982)

P. Ramakanth Kumar Woei Lin

We consider the problem of adaptively controlling an unknown Markov chain. No prior information regarding the values of the transition probabilities is provided us (except for a list of forbidden, zero-probability transitions, which is usually obtained as a byproduct of the modeling process itself). The goal is to design an adaptive controller to adequately control the unknown system when its performance is measured by the average cost incurred over a long operating time period. Our main result is the exhibition of a family of adaptive controllers which, when applied to the unknown system, will result in a performance precisely equal to the optimal performance attainable if the system, i.e., the transition probabilities, were known. Hence, the adaptive controllers proposed here are truly optimal, even when operating on an unknown system. The results presented here extend similar results in [1] where we assume to be initially provided with a finite set of possible models, one of which is guaranteed to be the true one. This paper directly addresses those practical situations where a finite set of possible models with such a guarantee is hard to come by.

Finite set

10.1109/tac.1982.1103017

Cite

Citations (72)

Performance Evaluation of the Parallel Packet Switch with a Sliding Window Scheme

Lecture notes in computer science (2006)

Chia-Lung Liu Chiou Moh Chin‐Chi Wu Woei Lin

Sliding window protocol

Packet Switching

Fast packet switching

10.1007/11751588_118

Cite

Citations (0)

Reconfiguration Procedures for a Polymorphic and Partitionable Multiprocessor

IEEE Transactions on Computers (1986)

Woei Lin Chuan-Lin Wu

This correspondence presents a collection of reconfiguration procedures for a multiprocessor which employs multistage interconnection networks. These procedures are used to dynamically partitipn the multiprocessor into many subsystems, and reconfigure them to form a variety commonly used topologies to match task graphs. By examining the switching capability of the interconnection network, design rules for avoiding connection conflicts are exploited. Then, on the basis of these rules, parallel procedures are designed. With the procedures, a subsystem can be reconfigured in the form of the desired topologies without interfering with other subsystems. In addition, the reconfiguration of a subsystem can be accomplished in constant time, independently of subsystem size.

Control reconfiguration

10.1109/tc.1986.1676683

Cite

Citations (20)

Configuring group-multicast rings with randomly selected nodes on binary n-cubes

Computer Communications (1997)

Woei Lin Wen-Shyen E. Chen

Disjoint sets

10.1016/s0140-3664(97)00083-2

Cite

Citations (0)

3D-VOQ Switch Design and Evaluation

Ding‐Jyh Tsaur Xicheng Lu Chin‐Chi Wu Woei Lin

Input buffered switches with virtual output queues (VOQ) design to avoid head-of-line problems, is a primary design of switches that can be scalable to very high speeds. However, this design requires a complex and iterative scheduling approach and does not meet quality of service (QoS) requirements during operation. In this paper, a three-dimensional virtual output queue (3D-VOQ) switch is proposed and a scheduling algorithm under new architecture that improves the competitive transfer of service. Analysis and simulation are employed to verify the performance of 3D-VOQ, and supports high/low QoS requirements, and then improves switch performance.

10.1109/aina.2005.10

Cite

Citations (2)

A practical matching of output queueing with a 3D-VOQ switch.

Ding‐Jyh Tsaur Chin-Hsi Yu Hsuan-Kuei Cheng Chin‐Chi Wu Woei Lin

Source

Cite

Citations (0)