• Title/Summary/Keyword: High-throughput analysis

Search Result 552, Processing Time 0.041 seconds

Study on High Speed Routers(II)-Performance Analysis on Various Network Topology of STC104 (고속 라우터에 대한 고찰(II)-STC104의 망 구성에 따른 성능분석)

  • Lee, Hyo-Jong
    • The KIPS Transactions:PartA
    • /
    • v.8A no.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.

  • PDF

HSDPA Sector Throughput Analysis With Modified Link Budget (Link budget을 이용한 HSDPA 시스템의 sector throughput 분식)

  • Yi Yo-Serb;Kim Sang-Bum;Hong Dae-Hyung;Jang Byung-Lyerl;Moon Soon-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5A
    • /
    • pp.469-474
    • /
    • 2006
  • In this paper, we develop a method that derive the average sector throughput of HSDPA system. This proposed method reflects the effects of AMC, scheduling and multi-code transmission, and is performed by simple calculation procedures such as link budget analysis. Link budget table is used to estimate a cell coverage in general. We modify the link budget table in order to calculate C/I of the user according to the location of the user in CDMA packet system employing AMC. Furthermore, we utilize the proposed method to analyze the effects of scheduling and multi-code transmission.

Throughput Performance Analysis of Transmission System with SR-ARQ Scheme in Burst Home Network Channel (버스트 홈 네트워크 채널에서 SR-ARQ 기법을 적용한 전송 시스템의 Throughput 성능 분석)

  • Roh, Jae-Sung;Chang, Tae-Hwa
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.894-897
    • /
    • 2008
  • This paper analyzes the throughput performance of a selective repeat (SR)/automatic repeat request (ARQ) scheme to transmit packet data in burst home network channel. To combat the high degree of error caused by transmission of home network data a robust error control scheme is a necessity. Basically, error control schemes can be divided in two categories: ARQ schemes and forward error correction (FEC) schemes. ARQ schemes are often used for reliable data transmission. The performance of packet transmission using SR-ARQ schemes for bursty channels is analyzed and simple analytical expressions of its throughput are presented. Theoretic analysis and numerical results indicate that a small number of packet sizes can get good performance in bursty home network channel.

  • PDF

Protein-protein Interaction Networks: from Interactions to Networks

  • Cho, Sa-Yeon;Park, Sung-Goo;Lee, Do-Hee;Park, Byoung-Chul
    • BMB Reports
    • /
    • v.37 no.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.

Development of new agrochemicals by quantitative structure-activity relationship (QSAR) methodology. III. 3D QSAR methodologies and computer-assisted molecular design (CAMD) (정량적인 구조-활성상관 (QSAR) 기법에 의한 새로운 농약의 개발. III. 3D QSAR 기법들과 컴퓨터를 이용한 분자설계(CAMD))

  • Sung, Nack-Do
    • The Korean Journal of Pesticide Science
    • /
    • v.7 no.1
    • /
    • pp.1-11
    • /
    • 2003
  • Acoording to improvement of HTOS (high throughput organic synthesis) and HTS (high throughput screening) technique, the CoMFA (comparative molecular field analysis), CoMSIA (comparative molecular similarity indeces analysis) and molecular HQSAR (hologram quantitative structure-activity relationship) analysis techniques as methodology of computer assisted molecular design (CAMD) were introduced generally and summarized for some application cases.

MAC Throughput Analysis of MAC Aggregation and Block ACK in IEEE 802.11n (MAC 프레임 집합 전송과 블록 ACK 사용에 따른 IEEE 802.11n 수율 분석)

  • Moon, Kuk-Hyun;Chung, Min-Young;Cho, Kang-Yun
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • 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.

  • PDF

Dynamic Prime Chunking Algorithm for Data Deduplication in Cloud Storage

  • Ellappan, Manogar;Abirami, S
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.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.

Analytic Throughput Model for Network Coded TCP in Wireless Mesh Networks

  • Zhang, Sanfeng;Lan, Xiang;Li, Shuang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.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.