• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.127-130
• /
• 2006

EPON의 상향 전송 방식에서는 다수의 ONU가 OLT로부터 공유된 채널에 대한 권한을 할당받아 데이터를 전송하게 되므로 EPON에서는 각각의 ONU들에게 공유된 대역폭을 공평하고 효율적으로 할당하기 위한 DBA 알고리즘이 필수적이다. 우리는 본 논문에 앞서 기존의 DBA알고리즘들의 문제점을 보안하여 Request-Counter Dynamic Bandwidth Assignment 알고리즘을 새롭게 제안하여 성능평가 및 비교 분석을 하였다. 본 논문에서는 제안된 RC-DBA 알고리즘을 적용하여 OLT의 MAC 스케줄러를 설계하고 Corebell 사의 LDS2000 FPCA ver.1.0 보드에 구현하였다. 또한 이를 검증하기 위해서 임베디드 리눅스 기반의 검증 시스템을 개발하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2421-2433
• /
• 1997

In this paper, based on the relative logical storage cost of each movie by the difference of service request probability, we propose and implement the SDU(Separate Data Use) method and the EDU(Existing Data Use) method to provide FF(Fast Forward) and FR(Fast Reverse) function in efficiently through analysing MPEG bit stream and frame characteristics. By selecting and applying the FF/FR function providing method based on the service request probability of movie, the proposed method can reduce the cost of FF/FR functions for total serviced movies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.705-706
• /
• 2014

This paper proposes a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system. In the XG-PON system, an ONU (optical network unit) does not explicitly send it request to an OLT (optical line termination). The OLT monitors the upstream bandwidth usage of the ONU to estimate the request of the ONU. Then the OLT performs a dynamic bandwidth allocation process based on the estimated requests.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.693-694
• /
• 2014

This paper proposes a new pipelined dynamic bandwidth allocation algorithm for XG-PON (10-Gbps-capable passive optical network) passive optical networks) system. The pipelined algorithm is used when a dynamic bandwidth allocation algorithm cannot finished in an unit time. In the proposed mechanism, the request is immediately transferred to each pipeline block to improve performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.152-153
• /
• 2014

This paper proposes a new dynamic bandwidth allocation algorithm for an XG-PON (10-Gbps-capable passive optical network) system in which an ONU (optical network unit) does not explicitly send its request to an OLT (optical line termination). To estimate the request of the ONU, the OLT monitors the upstream bandwidth usage of the ONU and periodically allocates a probe slot to the ONU.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4771-4787
• /
• 2019

Aimed at the disclosure risk of mobile terminal user's location privacy in location-based services, a location-privacy protection scheme based on similar trajectory substitution is proposed. On the basis of the anonymized identities of users and candidates who request LBS, this scheme adopts trajectory similarity function to select the candidate whose trajectory is the most similar to user's at certain time intervals, then the selected candidate substitutes user to send LBS request, so as to protect user's privacy like identity, query and trajectory. Security analyses prove that this scheme is able to guarantee such security features as anonymity, non-forgeability, resistance to continuous query tracing attack and wiretapping attack. And the results of simulation experiment demonstrate that this scheme remarkably improve the optimal candidate' trajectory similarity and selection efficiency.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1774-1776
• /
• 2010

Solid State Device(SSD)는 플래시 메모리 모듈을 기반으로한 차세대 저장장치로서 디스크 회전방식의 Hard Disk Drive(HDD)를 대체하는 장치로 주목받고 있다. 하지만, 현재의 운영체제 I/O 스케줄러는 HDD 에 최적화되어 있기 때문에 플래시 모듈 기반의 SSD 의 성능을 최대한 끌어내지 못하는 한계를 갖고 있다. 따라서, 본 논문에서 우리는 SSD 의 성능을 끌어올리기 위해 SSD 의 특징을 분석하고 이를 바탕으로 SSD 에 최적화된 I/O 스케줄러를 고안하였다. 새로운 스케줄러(NSCHED)는 I/O Request 를 두 그룹으로 분류하고 각 요청에 타이머를 설정함으로써 I/O Request 를 빠르게 처리함과 동시에 기아방지를 위한 기법을 가진다. 우리는 Linux 2.6.30 에서 NSCHED 스케줄러를 구현하여 Postmark 벤치마크를 통해 성능평가를 수행했으며, NSCHED 스케줄러가 기본 Linux I/O 스케줄러보다 30% 가량 낮은 응답 시간이 소요됨을 확인했다.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.129-139
• /
• 1996

The processor allocation problem in mesh multicamputers is to recognize and locate a free submesh that can accommodate a request for a submesh of a specified size. An efficient submesh allocation strategy is required for achieving high performance on mesh multicomputers. In this paper, we propose a new best-fit submesh allocation strategy for mesh multicomputers. The proposed strategy maintains and uses a free submesh list to get global information for free submeshes. For an allocation request the proposed strategy tries to allocate a best-fit submesh which causes the least amount of potential processor fragmentation so as to preserve the large free submeshes as many as possible for later requests. For this purpose, we introduce a novel function for quantifying the degree of potential fragmentation of submeshes. The proposed strategy has the complete submesh recognition capability. Extensive simulation is carried out t compare the proposed strategy with the previous strategies and experimental results indicate that the proposed strategy exhibits the best performance along with about 10% to 30% average improvement over the best previous strategy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4207-4222
• /
• 2016

In a P2P (Peer-to-Peer) VoD (video-on-Demand) streaming system, the nodes' load is an important factor which affects the system performance. In the system, some nodes may receive too many requests, which leads to overload. On the other hand, some other nodes may receive too few requests, which leads to low utilization. Therefore, designing a reasonable load balancing strategy is important. However, existing related studies cannot handle this problem effectively, because they don't have an efficient dynamic load information management mechanism, and they don't distinguish the difference of requests when transfer the nodes' load. In this paper, to manage the dynamic load information efficiently, we design a load management table for each node. Based on the load information, we propose a load balancing strategy which uses a request migration algorithm (LBRM). Through simulations, our scheme can handle the load imbalance problem effectively and improve the users' playback fluency.

• IE interfaces
• /
• v.16 no.4
• /
• pp.421-431
• /
• 2003

Due to the increasing complexity of the information systems environment, modern information systems are facing more difficult and various security risks than ever, there by calling for a higher level of security safeguard. In this paper, an information technology security risk management model, which modified by adopting the concept of business processes, is applied to client/server distributed systems. The results demonstrate a high level of risk-detecting performance of the model, by detecting various kinds of security risks. In addition, a practical and efficient security control safeguard to cope with the identified security risks are suggested. Namely, using the proposed model, the risks on the assets in both of the I/O stage(on client side) and the request/processing stage(on server side), which can cause serious problems on business processes, are identified and the levels of the risks are analyzed. The analysis results show that maintenance of management and access control to application systems are critical in the I/O stage, while managerial security activities including training are critical in the request/processing stage.