• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.1-10
• /
• 2004

This study discusses Application-layer FEC using erasure codes. Because of the simple decoding process, erasure codes are used effectively in Application-layer FEC to deal with Packet-level errors. The large number of parity packets makes the loss rate to be small, but causes the network congestion to be worse. Thus, a redundancy control algorithm that can adjust the number of parity packets depending on network conditions is necessary. In addition, it is natural that high-priority frames such as I frames should produce more parity packets than low-priority frames such as P and B frames. In this paper, we propose a redundancy control algorithm that can adjust the amount of redundancy depending on the network conditions and depending on data priority, and test the performance in simple links and congestion links.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.1
• /
• pp.32-43
• /
• 2000

In this paper, we investigate the existing medium access control (MAC) protocols to integrate the voice and data services in packet-based CDMA networks and furthermore, propose a new approach to circumvent the operational limits inherent in them. We propose the $P^2R$-CDMA (Prioritized Packet Reservation Code Division Multiple Access) protocol for the uplink in the synchronous multi-code CDMA system, which employs the centralized frame-based slot reservation along with the dynamic slot assignment in the base station using the QoS-oriented dynamic priority of individual terminal. The simulation results show that, as compared with the existing scheme based on the adaptive permission probability control (APC), the proposed approach can significantly improve the system capacity while guaranteeing the real-time requirement of voice service.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.179-182
• /
• 1991

In this paper, we survey traffic control issues for the B-ISDN based on the ATM. We first investigate traffic descriptors to represent the characteristics of various ATM traffics in a standardized form. Also, we examine key issues related to the connection admission control, usage parameter control, network parameter control, priority control, and congestion control.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.130-131
• /
• 2007

Wireless Sensor Network typically incorporates diverse applications within the same network. A sensor node may have multiple sensors i.e. light, temperature, seismic etc with different transmission characteristics. Each application has different characteristics and requirements in terms of transmission rates, bandwidth, packet loss and delay demands may be initiated towards the sink. In this paper we propose Heterogeneous Traffic Oriented Rate Control Protocol (HTRCP) which ensures efficient rate control for diverse applications according to the priority specified by the sink. Moreover. HTRCP ensures the node priority based hop by hop dynamic rate adjustment for high link utilization.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.771-788
• /
• 1996

A CDMA-based cellular mobile telecommunication system has already been developed and is expected to provide more stable mobile communication services for much more users than traditional analog mobile systems. As a natural course of development, the CDMA mobile system is expected to provide ISDN services in the near future. In this paper, we analyze several traffic control policies for the voice-data integrated traffic in the cellular CDMA system. We first select four admission control policies which take differences in traffic and QOS characteristics between voice and data into account, and then develop modelling and analysis techniques, which can be used directly to analyze the chosen control policies. Our approach is based on so-called threshold model. Numerical computation results obtained under the typical traffic situation are also given. Through these computation results we could tentatively conclude that the cutoff priority policy, which can provide the priority for handoff voice cells while effectively utilizing unused channels, seems to be most effective among the four policies.

• Asian-Australasian Journal of Animal Sciences
• /
• v.33 no.12
• /
• pp.1905-1911
• /
• 2020

Objective: Tibetan pigs, an excellent species unique to China, face serious threats, which in turn affects the development and utilization of the outstanding advantages of plateau hypoxia adaptability and reduces their genetic diversity. Therefore, a discussion of measures to conserve this genetic resource is necessary. The method, based on genetic diversity, genetic divergence and total genetic contribution rate of population, reflects the priority conservation order and varies depending on the three different purposes of conservation. Methods: We analyzed mitochondrial DNA control region (D-loop) variation in 1,201 individuals from nine Tibetan pig populations across five provinces and downloaded 564 mtDNA D-loop sequences from three indigenous pig breeds in Qinghai, Sichuan, and Yunnan Provinces distributed near the Tibetan pigs. Results: We analyzed three different aspects: Changdu Tibetan pigs have the highest genetic diversity, and from the perspective of genetic diversity, the priority conservation is Changdu Tibetan pigs. Hezuo Tibetan pigs have the highest genetic contribution, so the priority conservation is Hezuo Tibetan pigs in the genetic contribution aspect. Rkaze Tibetan pigs were severely affected by indigenous pig breeds, so if considering from the perspective of introgression, the priority conservation is Rkaze Tibetan pigs. Conclusion: This study evaluated genetic diversity and comprehensively assessed conservation priority from three different aspects in nine Tibetan pig populations.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2001.11a
• /
• pp.111-112
• /
• 2001

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.9
• /
• pp.19-24
• /
• 2010

The number of automobiles are continuously increasing in Korea since 1990's and it causes frustrating commuting traffic and holyday traffic. Meanwhile, the obsolete traffic signal control system is still under static control based on the aggregated traffic statistics thus it is not sufficiently adaptive in real world traffic situation that changes in real time. Thus, in this paper, we propose an adaptive signal control system using fuzzy control technology that can react to real time traffic situations. The method computes the priority of signal phases based on the number of waiting automobiles and occupying time on intersection using fuzzy membership functions. The phase with highest priority obtains "proceed" signal. Also, the duration of this "proceed" signal is determined based on the ratio of number of waiting automobiles of given phase and total number of waiting automobiles on intersection. In experiment, we show that the proposed fuzzy control system is better than the static control system for all sorts of traffic congestion situations by simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.10
• /
• pp.855-868
• /
• 2004

There are several types of singularities in controlling robotic manipulators: kinematic singularity, algorithmic singularity, semi-kinematic singularity, semi-algorithmic singularity, and representation singularity. The kinematic and algorithmic singularities have been investigated intensively because they are not predictable or difficult to avoid. The problem with these singularities is an unnecessary performance reduction in non-singular region and the difficulty in performance tuning. Tn this paper, we propose a method of avoiding kinematic and algorithmic singularities by applying a task reconstruction approach while maximizing the task performance by calculating singularity measures. The proposed method is implemented by removing the component approaching the singularity calculated by using singularity measure in real time. The outstanding feature of the proposed task reconstruction method (TR-method) is that it is based on a local task reconstruction as opposed to the local joint reconstruction of many other approaches. And, this method has dynamic task priority assignment feature which ensures the system stability under singular regions owing to the change of task priority. The TR-method enables us to increase the task controller gain to improve the task performance whereas this increase can destabilize the system for the conventional algorithms in real experiments. In addition, the physical meaning of tuning parameters is very straightforward. Hence, we can maximize task performance even near the singular region while simultaneously obtaining the singularity-free motion. The advantage of the proposed method is experimentally tested by using the 7-dof spatial manipulator, and the result shows that the new method improves the performance several times over the existing algorithms.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.125-133
• /
• 2008

In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.