• Title/Summary/Keyword: efficient throughput

Search Result 709, Processing Time 0.024 seconds

OXC structure for MPλS merging implementation based on WDM network (WDM망 기반의 MPλS merging 구현을 위한 OXC 구조)

  • Kim, Kyeong-Mok;Cho, Yang-Hyuon;Oh, Young-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.3B
    • /
    • pp.183-190
    • /
    • 2003
  • The explosion of the Internet has brought an acute need for efficient operation, which becomes to develop several technologies based on optical networks. By matching merging technology using wavelength multiplexing, an efficient administration with limited wavelength can provide scalability of network. The merging in optical layer has limitation of devices since the merging can not be performed in this layer. Hence the merging must be implemented in electronic layer. When the merging is implemented, the delay time would be increased in OXC (Optical Cross Connection), but the improvement of throughput rate will be expected in the process of explosive traffic due to reduction of optical channel supporting large bandwidth. In this thesis, we proposed an OXC of dual module having a merging function. We considered the optimum merging point with the largest in system performance and confirmed results using the simulation.

The Efficient AES-CCM Architecture for a hardware library in the WAVE (WAVE 하드웨어 암호 라이브러리에 적합한 효율적인 AES-CCM 구조 설계)

  • Lee, Yeon-Cheol;Seo, Hwa-Jeong;Kim, Ho-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.2899-2905
    • /
    • 2013
  • According to developing wireless communications in vehicle, various security threat in the WAVE(Wireless access in vehicular environments) is increased. To protect this, IEEE 1609.2 specify services as for prevent message from attacks such as spoofing, eavesdropping and replay. It is possible to implement a hardware library for defending these attacks. In this paper, we proposed a efficient AES-CCM architecture for the hardware library in the WAVE. We compare our architecture to the previous one in the same FPGA. And our design uses less slices than 27 % of it and less slices than 45 % of it if we share registers that were used by other modules in the library. We also achieves a throughput of 1355 Gbits/s in xc5vlx110t-2ff1136.

An Efficient Reactive Routing Protocol based on the Multi-rate Aware MAC for Mobile Ad Hoc Networks (이동 애드 혹 망에서 다중 전송속도를 갖는 MAC 기반의 효율적인 반응형 라우팅 프로토콜)

  • Lee, Jae-Hwoon;Lim, Yu-Jin;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.15C no.1
    • /
    • pp.45-50
    • /
    • 2008
  • Mobile ad hoc networks (MANETs) allow mobile nodes to communicate among themselves via wireless multiple hops without the help of the wired infrastructure. Therefore, in the MANET, a route setup mechanism that makes nodes not within each other's transmission range communicate is required and, for this, the Ad-hoc On-demand Distance Vector (AODV) was proposed as one of the reactive routing protocols well suited for the characteristics of the MANET. AODV uses the hop count as the routing metric and, as a result, a node selects the farthest neighbor node as its next hop on a route, which results in a problem of deteriorating the overall network throughput because of selecting a relatively low data rate route. In this paper, we propose an efficient reactive routing protocol based on the multi-rate aware MAC. Through the simulations, we analyze the performance of our proposed mechanism and, from the simulation results, we show that our proposed mechanism outperforms the existing mechanism.

Provisioning Scheme of Large Volume File for Efficient Job Execution in Grid Environment (그리드 환경에서 효율적인 작업 처리를 위한 대용량 파일 프로비저닝 방안)

  • Kim, Eun-Sung;Yeom, Beon-Y.
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.8
    • /
    • pp.525-533
    • /
    • 2009
  • Staging technique is used to provide files for a job in the Grid. If a staged file has large volume, the start time of the job is delayed and the throughput of job in the Grid may decrease. Therefore, removal of staging overhead helps the Grid operate more efficiently. In this paper, we present two methods for efficient file provisioning to clear the overhead. First, we propose RA-RFT, which extends RFT of Globus Toolkit and enables it to utilize RLS with replica information. RA-RFT can reduce file transfer time by doing partial transfer for each replica in parallel. Second, we suggest Remote Link that uses remote I/O instead of file transfer. Remote link is able to save storage of computational nodes and enables fast file provisioning via prefetching. Through various experiments, we argue that our two methods have an advantage over existing staging techniques.

A Modified E-LEACH Routing Protocol for Improving the Lifetime of a Wireless Sensor Network

  • Abdurohman, Maman;Supriadi, Yadi;Fahmi, Fitra Zul
    • Journal of Information Processing Systems
    • /
    • v.16 no.4
    • /
    • pp.845-858
    • /
    • 2020
  • This paper proposes a modified end-to-end secure low energy adaptive clustering hierarchy (ME-LEACH) algorithm for enhancing the lifetime of a wireless sensor network (WSN). Energy limitations are a major constraint in WSNs, hence every activity in a WSN must efficiently utilize energy. Several protocols have been introduced to modulate the way a WSN sends and receives information. The end-to-end secure low energy adaptive clustering hierarchy (E-LEACH) protocol is a hierarchical routing protocol algorithm proposed to solve high-energy dissipation problems. Other methods that explore the presence of the most powerful nodes on each cluster as cluster heads (CHs) are the sparsity-aware energy efficient clustering (SEEC) protocol and an energy efficient clustering-based routing protocol that uses an enhanced cluster formation technique accompanied by the fuzzy logic (EERRCUF) method. However, each CH in the E-LEACH method sends data directly to the base station causing high energy consumption. SEEC uses a lot of energy to identify the most powerful sensor nodes, while EERRCUF spends high amounts of energy to determine the super cluster head (SCH). In the proposed method, a CH will search for the nearest CH and use it as the next hop. The formation of CH chains serves as a path to the base station. Experiments were conducted to determine the performance of the ME-LEACH algorithm. The results show that ME-LEACH has a more stable and higher throughput than SEEC and EERRCUF and has a 35.2% better network lifetime than the E-LEACH algorithm.

An Energy-Efficient Self-organizing Hierarchical Sensor Network Model for Vehicle Approach Warning Systems (VAWS) (차량 접근 경고 시스템을 위한 에너지 효율적 자가 구성 센서 네트워크 모델)

  • Shin, Hong-Hyul;Lee, Hyuk-Joon
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.4
    • /
    • pp.118-129
    • /
    • 2008
  • This paper describes an IEEE 802.15.4-based hierarchical sensor network model for a VAWS(Vehicle Approach Warning System) which provides the drivers of vehicles approaching a sharp turn with the information about vehicles approaching the same turn from the opposite end. In the proposed network model, a tree-structured topology, that can prolong the lifetime of network is formed in a self-organizing manner by a topology control protocol. A simple but efficient routing protocol, that creates and maintains routing tables based on the network topology organized by the topology control protocol, transports data packets generated from the sensor nodes to the base station which then forwards it to a display processor. These protocols are designed as a network layer extension to the IEEE 802.15.4 MAC. In the simulation, which models a scenario with a sharp turn, it is shown that the proposed network model achieves a high-level performance in terms of both energy efficiency and throughput simultaneously.

  • PDF

A Design of Parameterized Viterbi Decoder for Multi-standard Applications (다중 표준용 파라미터화된 비터비 복호기 IP 설계)

  • Park, Sang-Deok;Jeon, Heung-Woo;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.6
    • /
    • pp.1056-1063
    • /
    • 2008
  • This paper describes an efficient design of a multi-standard Viterbi decoder that supports multiple constraint lengths and code rates. The Viterbi decoder is parameterized for the code rates 1/2, 1/3 and constraint lengths 7,9, thus it has four operation nodes. In order to achieve low hardware complexity and low power, an efficient architecture based on hardware sharing techniques is devised. Also, the optimization of ACCS (Accumulate-Subtract) circuit for the one-point trace-back algorithm reduces its area by about 35% compared to the full parallel ACCS circuit. The parameterized Viterbi decoder core has 79,818 gates and 25,600 bits memory, and the estimated throughput is about 105 Mbps at 70 MHz clock frequency. Also, the simulation results for BER (Bit Error Rate) performance show that the Viterbi decoder has BER of $10^{-4}$ at $E_b/N_o$ of 3.6 dB when it operates with code rate 1/3 and constraints 7.

A Design of AES-based Key Wrap/Unwrap Core for WiBro Security (와이브로 보안용 AES기반의 Key Wrap/Unwrap 코어 설계)

  • Kim, Jong-Hwan;Jeon, Heung-Woo;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.7
    • /
    • pp.1332-1340
    • /
    • 2007
  • This paper describes an efficient hardware design of key wrap/unwrap algorithm for security layer of WiBro system. The key wrap/unwrap core (WB_KeyWuW) is based on AES (Advanced Encryption Standard) algorithm, and performs encryption/decryption of 128bit TEK (Traffic Encryption Key) with 128bit KEK (Key Encryption Key). In order to achieve m area-efficient implementation, two design techniques are considered; First, round transformation block within AES core is designed using a shared structure for encryption/decryption. Secondly, SubByte/InvSubByte blocks that require the largest hardware in AES core are implemented by using field transformation technique. As a result, the gate count of the WB_KeyWuW core is reduced by about 25% compared with conventional LUT (Lookup Table)-based design. The WB_KeyWuW con designed in Verilog-HDL has about 14,300 gates, and the estimated throughput is about $16{\sim}22-Mbps$ at 100-MHz@3.3V, thus the designed core can be used as an IP for the hardware design of WiBro security system.

Study on Functional Assessment of Oversea Container Terminal by Data Analysis on Container Handling (컨테이너터미널의 하역데이터 분석에 의한 기능성 평가에 관한 연구)

  • Kim, Hwa-Young
    • Journal of Korea Port Economic Association
    • /
    • v.23 no.2
    • /
    • pp.121-144
    • /
    • 2007
  • In general, the design of container yard and container handling system on container terminal are focused on operation of shipside than service about chassis from outside(C/O). It is not efficient for chassis from outside. The purpose of this paper is functional assessment of efficient container terminal and for higher performance of container terminal. first, the items which are concerned with container handling at the planning of container terminal are investigated and extracted through the practical data analysis of container terminal. Also, verified problems of planning and present condition through the functional assessment. Secondly, the improvements for container throughput in container yard are proposed and examined the effectiveness of improvements about queuing time of chassis from outside and service time of transfer crane by the evaluation decision model based upon multi criteria objectives.

  • PDF

An Adolescent PeriodFunctional Cosmetics Trend Analysis System Using SNS BigData (SNS 자료를 이용한 청소년기 기능성 화장품 기호분석시스템)

  • Lee, Sang Moon;Seo, Jeong Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.175-180
    • /
    • 2013
  • In this paper, we proposed that the functionality of teenage school girl cosmetics to improve the performance of the new product development and efficient production of information, analysis and policy analysis system for the SNS. The proposed system functional cosmetics of high school girls on the SNS efficient algorithms to analyze the content and methodology proposed to maximize the throughput of the system, to minimize the execution time of each task. In addition, functional cosmetics of high school girls in the state by identifying the symbols, the analytical results in the development and production of products to reflect propose a visual methodology. Therefore, the proposed system only in cosmetics, as well as an analysis similar to rapidly changing consumer preferences in the manufacturing sector can be applied in various ways.