• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• 한국통신학회논문지
• /
• 제31권5A호
• /
• pp.469-474
• /
• 2006

본 논문에서는 High Speed Data Packet Access(HSDPA) 시스템의 평균 sector throughput 분석 방법을 개발하였다. 제안하는 성능 분석 방법은 Adaptive Modulation and Coding(AMC)와 scheduling 기법, multi-code 전송의 영향을 반영할 수 있으며, link budget을 응용한 간단한 계산 과정들을 통해, HSDPA의 성능을 분석할 수 있다. 일반적으로, link budget은 셀 coverage를 산출하는 목적으로 사용되었으나, 본 논문에서는 AMC가 적용되는 CDMA 시스템 환경에서 특정 위치에 있는 사용자의 C/I를 계산할 수 있도록 변형하였다. 또한, 개발된 분석 방법을 활용하여, scheduling 기법과 multi-code 전송이 HSDPA 시스템 성능에 미치는 영향을 분석하였다.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2008년도 추계종합학술대회 B
• /
• pp.894-897
• /
• 2008

본 논문에서는 버스트 홈 네트워크 채널에서 패킷 데이터 전송을 위한 SR-ARQ (Selective Repeat-Automatic Repeat Request) 기법의 처리율 성능을 분석한다. 홈 네트워크 전송에서는 데이터 전송에 의한 에러를 극복하기 위하여 강력한 에러 제어 기술이 필요하다. 기본적으로 ARQ와 FEC기법이 주로 사용되며 ARQ 기법은 신뢰성 있는 데이터 전송에서 주로 사용된다. 버스트 채널에서 SR-ARQ를 사용한 패킷 데이터 전송의 성능을 분석하고 처리율 분석을 위한 간단한 방식을 제시한다. 분석을 통하여 적은 크기의 패킷 데이터 전송은 버스트 홈 네트워크 채널에서 우수한 성능을 얻을 수 있었다.

• BMB Reports
• /
• 제37권1호
• /
• pp.45-52
• /
• 2004

The goal of interaction proteomics that studies the protein-protein interactions of all expressed proteins is to understand biological processes that are strictly regulated by these interactions. The availability of entire genome sequences of many organisms and high-throughput analysis tools has led scientists to study the entire proteome (Pandey and Mann, 2000). There are various high-throughput methods for detecting protein interactions such as yeast two-hybrid approach and mass spectrometry to produce vast amounts of data that can be utilized to decipher protein functions in complicated biological networks. In this review, we discuss recent developments in analytical methods for large-scale protein interactions and the future direction of interaction proteomics.

• 농약과학회지
• /
• 제7권1호
• /
• pp.1-11
• /
• 2003

새로운 농약을 탐색하고 개발하는데 있어서 고효율 유기함성 (HTOS) 기술과 고효율 검색 (HTS) 기술 등의 발전과 더불어 컴퓨터 화학을 이용한 분자설계 (CAMD) 방법으로 보편화되고 있는 비교 분자장 분석(CoMFA)과 비교 분자 유사성 지수분석(CoMSIA) 등, 3D QSAR 기법들을 위시하여 분자 홀로그램 구조 - 활성관계 (HQSAR) 분석방법 등, QSAR 기법들을 요약하고 그 활용 사례들을 간략하게 소개하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.467-469
• /
• 2006

In wireless network environments, as users' demands on high-speed data communications due to increase of multi-media services, the necessity of new high-speed WLAN technologies has appeared. Nowaday, IEEE is standardizing a new WLAN protocol caned as IEEE 802.11n. To effectively use wireless resources, IEEE 802.11n introduces MAC aggregation function which is similar to that in IEEE 802.11e. In case of transmitting several frames without MAC aggregation, the frames include individual frame header and trailer, and their corresponding acknowledgement frames can appear on wireless link. However, if they are aggregated into single MAC frame, we can reduce the number of used bits due to frame headers/trailers and also remove redundant acknowledgement frames. In this paper, we explain two different MAC frame aggregation methods for IEEE 802.11e and IEEE 802.11n and evaluate their throughput by simulations.

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2009년도 정기총회 및 동계학술연구발표회
• /
• pp.61-61
• /
• 2009

• 한국미생물학회:학술대회논문집
• /
• 한국미생물학회 2007년도 International Meeting of the Microbiological Society of Korea
• /
• pp.143-143
• /
• 2007

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1342-1359
• /
• 2021

The data deduplication technique identifies the duplicates and minimizes the redundant storage data in the backup server. The chunk level deduplication plays a significant role in detecting the appropriate chunk boundaries, which solves the challenges such as minimum throughput and maximum chunk size variance in the data stream. To provide the solution, we propose a new chunking algorithm called Dynamic Prime Chunking (DPC). The main goal of DPC is to dynamically change the window size within the prime value based on the minimum and maximum chunk size. According to the result, DPC provides high throughput and avoid significant chunk variance in the deduplication system. The implementation and experimental evaluation have been performed on the multimedia and operating system datasets. DPC has been compared with existing algorithms such as Rabin, TTTD, MAXP, and AE. Chunk Count, Chunking time, throughput, processing time, Bytes Saved per Second (BSPS) and Deduplication Elimination Ratio (DER) are the performance metrics analyzed in our work. Based on the analysis of the results, it is found that throughput and BSPS have improved. Firstly, DPC quantitatively improves throughput performance by more than 21% than AE. Secondly, BSPS increases a maximum of 11% than the existing AE algorithm. Due to the above reason, our algorithm minimizes the total processing time and achieves higher deduplication efficiency compared with the existing Content Defined Chunking (CDC) algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3110-3125
• /
• 2014

Network coding improves TCP's performance in lossy wireless networks. However, the complex congestion window evolution of network coded TCP (TCP-NC) makes the analysis of end-to-end throughput challenging. This paper analyzes the evolutionary process of TCP-NC against lossy links. An analytic model is established by applying a two-dimensional Markov chain. With maximum window size, end-to-end erasure rate and redundancy parameter as input parameters, the analytic model can reflect window evolution and calculate end-to-end throughput of TCP-NC precisely. The key point of our model is that by the novel definition of the states of Markov chain, both the number of related states and the computation complexity are substantially reduced. Our work helps to understand the factors that affect TCP-NC's performance and lay the foundation of its optimization. Extensive simulations on NS2 show that the analytic model features fairly high accuracy.