• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.143-150
• /
• 2009

In trust-based networks, it is very important how to decide a node is trustworthy when one node performs communications with other node. In current networks based on trust, a node creates a new trust value from observation and then establishes an intercommunication path through the process of evaluating a targeted communication node. In our paper, we propose four trust models in which a new node enters a cluster and finds a target node to create a communication in ad-hoc networks. The proposed models have been classified according to the existence of reputation server and the trust evaluation functions. Through the proposed model, we found that new node finds target node more quickly in which there exists a reputation server in the cluster and considers neighbor node's recommendation as well as own experience information when calculates trust values. As our performance analysis, we focus the communication delay time to generate a final trust value for each trust model.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2786-2800
• /
• 1997

In this paper, we investigate how well the channel memory (statistical dependence in the occurrence of transmission errors) can be used in the evaluation of widely used error control schemes. For this we assume a special case named as the simplest Markovian block-error pattern with two states, in which each block is classified into two classes of whether the block transmission is in error or not. We apply the derived pattern to the performance evaluation of the practical link-level procedures, LAPB/D/M with multi-reject options, and investigate both throughput and user-perceived response time behaviors on the discrete-time domain to determine how much the performance of error recovery action is improved under burst error condition. Through numerical examples, we show that the simplest Markovian block-error pattern tends to be superior in throughput and delay characteristics to the random error case. Also, instead of mean alone, we propose a new measure of the response time specified as mean plus two standard deviations 50 as to consider user-perceived worst cases, and show that it results in much greater sensitivity to parameter variations than does mean alone.

• The Journal of the Korea Contents Association
• /
• v.6 no.6
• /
• pp.1-8
• /
• 2006

This paper presents an intelligent pattern matching method that can be used to acquire the reliable calibration data for automatic PCB pattern inspection. The inaccurate calibration data is often acquired by geometric pattern variations and selecting an inappropriate model manual. It makes low the confidence of inspection and also the inspection processing time has been delayed. In this paper, the geometric features of PCB patterns are utilized to calculate the accurate calibration data. An appropriate model is selected automatically based on the geometric features, and then the calibration data to be invariant to the geometric variations(translation, rotation, scaling) is calculated. The method can save the inspection time unnecessary by eliminating the need for manual model selection. As the result, it makes a fast, accurate and reliable inspection of PCB patterns.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.19 no.3
• /
• pp.95-105
• /
• 2009

Spam call is one of the main security threat in VoIP services. In this paper, we have designed simulation model for performance evaluation of VoIP spam defense mechanism. The simulation model has functions for performance evaluation such as calls generation and input/output comparison. Four representative caller models have been developed for performance evaluation and each model has its own characteristics as statistical parameters. The target mechanism of performance evaluation is SPIT(Spam over Internet Telephony) level decision algorithm, and we have derived SPIT levels of caller models. The performance evaluation model is designed using the DEVS formalism and DEVSJAVA$^{TM}$ is exploited for development and execution of simulation models.

• Journal of Internet of Things and Convergence
• /
• v.10 no.2
• /
• pp.77-84
• /
• 2024

Over the past few years, IoT edges have begun to emerge based on new low-latency communication protocols such as 5G. However, IoT edges, despite their enormous advantages, pose new complementary threats, requiring new security solutions to address them. In this paper, we propose a cloud environment-based IoT edge architecture model that complements IoT systems. The proposed model acts on machine learning to prevent security threats in advance with network traffic data extracted from IoT edge devices. In addition, the proposed model ensures load and security in the access network (edge) by allocating some of the security data at the local node. The proposed model further reduces the load on the access network (edge) and secures the vulnerable part by allocating some functions of data processing and management to the local node among IoT edge environments. The proposed model virtualizes various IoT functions as a name service, and deploys hardware functions and sufficient computational resources to local nodes as needed.

• Development and Reproduction
• /
• v.11 no.1
• /
• pp.13-20
• /
• 2007

In all female mammals, reproductive system is one of the first biological systems to show age-related decline. Female mammals in reproductive aging, though the phenomena is somewhat species-specific, start to show declining fertility and changes of numerous physiological functions. This review will present a current information on the aging of the female reproductive hormonal axis and introduce three useful rodent models for studying this field. Middle age($8{\sim}12$ months old) in female rats and mice is comparable to the stage prior to the entry of menopause in human. In this period pulsatile and surge GnRH secretion from hypothalamus gradually attenuated, then reduced pulsatile and surge LH secretion is followed consequently. This age-related defects in GnRH-LH neuroendocrine axis seem to be highly correlated with the defects in brain signals which modulate the activities of GnRH neuron. Many researchers support the idea which the age-related hypothalamic defects are the main cause of reproductive aging, but some ovarian factors such as inhibin response also could contribute to the induction of reproductive senescence. Some rodent models are quite valuable in studying the reproductive aging. The follitropin receptor knockout(FORKO) mice, both of null and haploinsufficient state, could produce depletion of oocyte/follicle with age. Dioxin/aryl hydrocarbon receptor(AhR) knockout mice also show severe ovarian defects and poor reproductive success early in their life compared to the age-matched normal mice. Further studies on the reproductive aging will be a great help to evaluate the benefits and risks of hormone replacement therapy(HRT) and to improve the safety of HRT.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.37-45
• /
• 2004

As Internet technologies are mature, many new applications that are different characteristics are emerging. Recently we see wide use of P2P(Peer to Peer) applications of which traffic shows different statistical characteristics compared with traditional application such as web(HTTP) and FTP(File Transfer Protocol). In this paper, we measured subscriber network of KT(Korea Telecom) to analyze P2P traffic characteristics. We show flow characteristics of measured traffic. We also estimate Hurst parameter of P2P traffic and compare self-similarity with web traffic. Analysis results indicate that P2P traffic is much bustier than web traffic and makes both upstream traffic and downstream traffic be symmetric. To predict parameters related QoS such as packet loss and delays we model P2P traffic using two self-similar traffic models and predict both loss probability and mm delay then compare their accuracies. With simulation we show that the self-similar traffic models we derive predict the performance of P2P traffic accurately and thus when we design a network or evaluate its performance, we can use the P2P traffic model as reference input traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1064-1073
• /
• 2002

In this paper, we design and implement the Wireless Transaction Protocol (WTP) proposed by the Wireless Application Protocol (WAP) forum using a protocol development tool, SDL Development Tool (SDT). And we conduct a comparative performance evaluation of the WTP implementation with other three implementations that are based on different implementation models respectively: the server model, the coroutine model, and the activity-thread model. To implement WTP, we first use Unified Modeling Language (UML) for analyzing the protocol requirement and defining the protocol engine architecture. Next, we use Software Development Language (SDL) to design the protocol engine in details and then generate the WTP implementation automatically with the aid of SDT The code size of the WTP implementation generated by SDT is 62% larger than the other three implementations. However, its throughput and system response time for transaction processing is almost equal to the other three implementations when the number of concurrent clients is less than 3,000. If more than 5,000 concurrent clients tries, the transaction success rate abruptly decreases to 10% and system response time increases to 1,500㎳, due to the increased protocol processing time. But, it comes from the fact that the load overwhelms the capacity of the PC resource used in this experimentation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.8
• /
• pp.719-729
• /
• 2000

Prefetching aims at reducing memory latency by fetching, in advance, data that are likely to be requested by the processor in a near future. The effectiveness of prefetching is determined by how accurate the prediction on the needed instructions and data is. Most previous studies on prefetching were limited to proposing a particular prefetch scheme and its performance evaluation, paying little attention to theoretical aspects of prefetching. This paper focuses on the theoretical aspects of instruction prefetching. For this purpose, we propose a clairvoyant prefetch model that makes use of perfect history information. Based on this theoretical model, we analyzed upper limits on the prefetch prediction accuracies of the SPEC benchmarks. The results show that the prefetch prediction accuracy is very high when there is no cache. However, as the size of the instruction cache increases, the prefetch prediction accuracy drops drastically. For example, in the case of the spice benchmark, the prefetch prediction accuracy drops from 53% to 39% when the cache size increases from 2Kbyte to 16Kbyte (assuming 16byte block size). These results indicate that as the cache size increases, most localities are captured by the cache and that instruction prefetching based on the information extracted from the references that missed in the cache suffers from prediction inaccuracies

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.6
• /
• pp.106-112
• /
• 2001

Unfortunately, the area without economical efficiency, especially the far distance sea, is much lower than that of a urban area-built-up area. It should be promoted the equivalent level to a urban area in the light of future-oriented universal service. Actually, Because propagation environment of mobile communication in the sea is greatly different from that for inland focused on built-up area, a propagation prediction model in the sea should be distinguished from inland-based one. Accordingly, the purpose of this study is to suggest the propagation prediction model for the sea service as a method to minimize unnecessary facilities investment and maintenance caused by additional or new building of a base station. If mobile phone service for far distance sea is provided by expanding limited communication zone of narrow band CDMA mobile communication whose spread band FA is 1.2288MHz. Suggested propagation prediction model includes five parameters to minimize facilities investment of a base station and maximize channel capacity: equivalent line of sight, chip delay by PN code, antenna altitude, power of base station and gain of antennas. Finally, suggested propagation prediction model is simulated and, the results are examined for its utility by comparing with loss of free space.