• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.2
• /
• pp.455-461
• /
• 2008

Enhanced Distributed Channel Access (EDCA) is a channel access scheme adopted by the IEEE 802.11e draft standard for QoS-enabled wireless local area networks. It classifies traffic into separate Access Categories (ACs) and achieves service differentiation by allowing each AC to have its own values of channel access parameters. This paper proposes a scheme to dynamically adapt the EDCA parameters to traffic environment so that they both maximize the throughput of non real-time traffics and meet the delay and throughput constraints of real-time traffics. For this purpose, we develop a design algorithm for efficient exploration of the EDCA parameter space. Using the algorithm, we derive a Pareto curve fur delay-throughput trade-off in each anticipated traffic environment. The Pareto database can then be used to optimally adjust the parameter according to the traffic environment and administrative policies. Simulation results show that compared with the default parameter configuration, the proposed scheme is better for delay, throughput guarantee and can improve the throughput of non real-time traffics by 12% on average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1639-1649
• /
• 1998

For mobile multimedia services, wireless ATM(Asynchronous transfer Mode) network is studied actively. In wireless ATM network, the existing signaling protocols generate heavy traffics for HLR due to the centralized structure that all signaling loads mush be handled in HLR(Home Location Register). Also, centralized structure causes critical connection setup delays. Thus, it is important that wireless ATM reduces the connection setup delays occurred due to high traffic loads of signaling based on distributed processing. In this thesis, we propose a cache strategy for call delivery as well as the cache updates of registration based on ATM multicasting and compares the cost of cache scheme with that of conventional scheme. Our study shows that cache scheme has better performance than the conventional methods in the case that the portable mobility is low and traffic density is large.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.4
• /
• pp.831-840
• /
• 2010

While Wireless Internet services were activated, many users got possible to use various Internet services without limitation in location. In particular, the demands to Wireless Internet Services are getting expanded because mobile devices that support high mobility are getting smarter. However, if a user uses various wireless networks, much limitation occurs in network setting when they move to another network. This is because there are few appropriate Handover Mechanisms to support Heterogeneous Network. So, this paper propose that Fast-Handover for Vertical Network Handover with MIH in PMIPv6 to support heterogeneous network and to reduce the handover latency time. Analysis result presented in this paper shows that by carefully selecting suitable system configuration model and parameters, suggestion has reduced latency time of 26% and packet losses of 90% (Avg.) at the maximum in comparison with original PMIPv6 handover.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.512-515
• /
• 2010

SIGINT(SIGnal INTelligence) includes several parameters intercepted by measurement and analysis of the RF(Radio frequency) signal from free space. One of the important parameters is frequency information. Expecially, in order to perform instantaneous frequency measurement of Radar and Missile seeker's RF signals, we use dedicated RF modules as a DFD(Digital Frequency Discriminator) to provide frequency information by measurement of the relative phase difference between signals via intended RF delay lines. It must measure and provide realtime based frequency information on short pulsed RF signal up to 100 nSec or less. This document proposes Ultra wideband DFD consisted of a RF input section of Wideband 4 channel RF delay line and correlator, a digital processing section to measure and provide frequency information from I/Q signal, and a frequency calibration section. Also, it will show design suitability based on test results measured under test condition of very short input pulse signals.

• Journal of the Korean Geographical Society
• /
• v.38 no.4
• /
• pp.575-590
• /
• 2003

It was the landscape phase that social relations were extended by production of landscapes during the 16C～17C. Core lineage groups in study area had extended socio-spatial nexus through making of the landscape of ‘authority-ostentation’(권력-과시형 경관) and of ‘kindness-civilization’(시혜ㆍ교화형 경관). Therefore they could gain a result that their power and authority took root in community perfectly. In the case of the Kims of Kwangsan(광산김씨), the first landscape of ‘kindness-civilization’ was Jungheodang(the learning room Jungheo), and next it was built Yangsungdang(the learning room Yangsung), and Imlijung(the pavilion Imli). Through this landscape production, the consciousness of scholastic genealogy was born, and this genealogy consciousness could be deepened and extended in regional scale. One more important feature in this phase is the point that the Kims of Kwangsan in Yeonsan area and the Songs of Unjin(은진송씨) in Hoiduk area could unite socially by the landscape production of ‘kindness-civilization type’ becoming intermediation. And these social union, that is to say, it do connote enlargement of the territoriality. It tells that community of ‘regional’ scale was formed by of core lineage groups of ‘local’ uniting each other.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.11
• /
• pp.675-690
• /
• 2003

In this paper, we present the virtual dancing studio for distributed virtual environment. In this system, geographically distributed user shares the virtual dancing hall and interacts with each other. The participating object can be a graphical avatar or a live video stream. It allows the coexistence of graphic objects and real images in the shared virtual space. One of the main technical challenges in developing the distributed virtual environment is to handle excessive network traffic. In an effort to effectively reduce the network traffic, we propose a scheme to adjust the QoS of each object with respect to the distance from the observer in the virtual space. The server maintains the QoS vector for each client's shared space and controls the packet traffic to individual clients based on its QoS vectors. We develop a proto-type virtual dancing environment. Java based development enables the client to be platform independent. The result of experiment shows that the adoption of hierarchical QoS management significantly reduces the overall network traffic.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1404-1417
• /
• 1999

웹과 같은 분산 환경에서는, 웹 브라우저 상에서 SQL 형식의 공간 질의를 수행시키는 것과 또한 서버로부터 그 질의 결과를 보는 것이 가능하다. 그러나, 격자 이미지(raster image)와 같은 대용량 공간 데이타를 포함하는 질의 결과를 웹 브라우징할 때 발생하는 많은 문제점들 중에서, 사용자 응답 시간의 지연은 매우 중요한 문제이다. 본 논문에서는 사용자의 재요청(callback) 접근 패턴이 공간적 근접성(spatial locality)을 따른다는 가정하에서의, 사용자 응답 시간을 최소화하기 위한 새로운 프리페치(prefetch) 전략에 대해서 서술한다. 본 논문의 프리페치 전략은 다음과 같이 요약될 수 있다. 첫째, 프리페치 알고리즘은 사용자의 접근 패턴을 잘 반영하는 힐버트 곡선(Hilbert-curve) 모델을 바탕으로 한다. 둘째, 프리페치 전송 비용을 줄이기 위해서 사용자의 재요청 시간 간격(think time)을 이용한다. 본 논문에서는, 힐버트 곡선을 이용한 프리페치 전략의 성능 평가를 위해서 다양한 실험을 하였으며, 그 결과로 프리페치를 하지 않는 방식보다 높은 성능 향상이 있음을 보인다.Abstract In distributed environment(e.g., WWW), it would be possible for the users to submit SQL-like spatial queries and to see their query results from the server on the Web browser. However, of many obstacles which result from browsing query results including large spatial data such as raster image, the delay of user response time is very critical. In this paper we present a new prefetch policy which can alleviate user response time on the assumption that user's callback access pattern has spatial locality. Our prefetch policy can be summerized as follows: 1) our prefetch algorithm is based on the Hibert-curve model which well replects user's access pattern, and 2) it utilizes user's callback interval to reduce prefetch network transmission cost. In this paper we conducted diverse experiments to show that our prefetch policy achieves higher performance improvement compared to other non-prefetch methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2099-2104
• /
• 2010

In this paper, HRV signal which was appeared RR intervals from ECG was analyzed using return-map during anesthesia. We intended to estimate the depth of anesthesia observing the change of autonomic nervous activity(ANS) because HRV showed change of cardio-vascular system of the body according to state of ANS. Return-map analysis is to reconstruct time series of HRV to phase space after calculating delay time and embedded time. After approximating the signal distribution which was reconstructed in phase space in elliptic, we calculated the lengths of major and minor axises of the elliptic and the values was used to estimate the depth of anesthesia. Stages of the anesthesia were 7 levels to evaluate the depth of anesthesia. At induction stage of strong external stimulation, the length of major and minor axis were statistically high and at the operation stage of non-external stimulation, the values were statistically low. Conclusively, the stages of anesthesia were discriminated by HRV signal mapped in the phase space during operation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.121-126
• /
• 2009

Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

• Spatial Information Research
• /
• v.23 no.4
• /
• pp.1-11
• /
• 2015

Since the Spatial Information Open Platform service started in January 2012, the number of service users and the size of the system has increased significantly. However, we could not know the analysis result about how much the hardware resources of the Open Platform system can handle user services. Thereafter, whenever the number of service users are rapidly increased, we simply have solved the service delays using the hardware extension. So, this study presents the obvious solution to avoid the same problem in the future, by pinpointing the system performance of the Open Platform. In this study, through the performance analysis of hardware using NMON and the load test of web service using nGrinder, we intend to get an accurate performance of the Open Platform system. Then we intend to present the resource reallocation method in order to provide better performance of the system.