• Title/Summary/Keyword: 분배성능

Search Result 603, Processing Time 0.025 seconds

Improved MSI Based Scheduling and Admission Control Algorithm for IEEE 802.l1e Wireless LAN (IEEE 802.l1e 무선랜에서 MSI를 이용한 개선된 스케줄링 및 수락제어 알고리즘)

  • Yang, Geun-Hyuk;Ok, Chi-Young;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.99-109
    • /
    • 2007
  • IEEE 802.lie is being proposed to improve QoS by IEEE 802.11 working group. HCCA (HCF Controlled Channel Access) a centralized polling based mechanism of IEEE 802.11e, needs a scheduling algorithm that decides on how the available radio resources are allocated to the polled STAs. In IEEE 802.l1e standard Reference Scheduler is presented. Reference Scheduler Polls all STAs in a polling list by the same interval that causes ineffectively frequent polling. It increases not only the overhead but it decreases the TXOP (Transmission Opportunity) utilization. In this paper, we propose the scheduling and admission control algorithm that poll stations depending on the MSI (Maximum Service Interval)o( stations to solve these shortcomings. In our proposed algorithm a station is polled by an interval close to its MSI, so polling overhead decrease and TXOP utilization increases than Reference Scheduler. Simulation results show that our algorithm outperforms Reference Scheduler. Our algorithm maintains higher aggregate throughput and services mere stations than Reference Scheduler.

A MAC Scheme for Multimedia Services over ATM-based PON (ATM 기반 PON에서 멀티미디어 서비스를 제공하기 위한 매체 접근 제어방식)

  • 고예윤;조규섭
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.1
    • /
    • pp.9-14
    • /
    • 2003
  • APON, the subscriber network using bus or tree topology, requires MAC protocol, because it shares the uplink channel for many subscribers to transmit data to OLT. Although various MAC schemes, which consider each QoS characteristics of traffic are proposed considering transmission characteristics of ATM traffic class, existing schemes reduce the network efficiency by increasing transmission overhead in frame. In this paper, we propose new MAC scheme, which shows similar performance as those of existing schemes but does not increase transmission overhead. To prevent increasing transmission overhead, the proposed scheme encodes the information about each cell information of traffic of the local queue in RAU transmitted periodically from ONU to OLT Thus, the proposed MAC scheme shows similar performance as those of existing ones and increases efficiency of entire network.

  • PDF

A Design of MAC Protocol for Dynamic WDM Channel and Bandwidth Allocation in TDM-PON (TDM-PON에서 동적 WDM 채널 및 대역폭 할당을 위한 MAC 프로토콜 설계 연구)

  • Lee Sung-Kuen;Kim Eal-Lae;Lee Yong-Won;Lee Sang-Rok;Jung Dae-Kwang;Hwang Seong-Taek;Oh Yun-Je;Park Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9B
    • /
    • pp.777-784
    • /
    • 2006
  • In this paper, we propose the PON-based access network based on conventional TDM-PON architecture, which utilizes WDM wavelength channel and bandwidth dynamically. It is also described a dynamic MAC protocol in order to increase the number of subscribers and efficiency of resource utilization. Of particular importance in the proposed approach for MAC protocol is that the wavelength channel and time slot for up/downlink is dynamically allocated according to the required QoS level and the amount of data in data transmission, through the dedicated control channel between OLT and ONU. We evaluate the performance of average packet end-to-end delay in a statistical analysis and numerical analysis. In addition, through simulations with various traffic models, we verified the superior performance of the proposed approach by comparing with the results of other E-PONs.

Data Replication and Migration Scheme for Load Balancing in Distributed Memory Environments (분산 인-메모리 환경에서 부하 분산을 위한 데이터 복제와 이주 기법)

  • Choi, Kitae;Yoon, Sangwon;Park, Jaeyeol;Lim, Jongtae;Bok, Kyoungsoo;Yoo, Jaesoo
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.1
    • /
    • pp.44-49
    • /
    • 2016
  • Recently, data has been growing dramatically along with the growth of social media and digital devices. A distributed memory processing system has been used to efficiently process large amounts of data. However, if a load is concentrated in a certain node in distributed environments, a node performance significantly degrades. In this paper, we propose a load balancing scheme to distribute load in a distributed memory environment. The proposed scheme replicates hot data to multiple nodes for managing a node's load and migrates the data by considering the load of the nodes when nodes are added or removed. The client reduces the number of accesses to the central server by directly accessing the data node through the metadata information of the hot data. In order to show the superiority of the proposed scheme, we compare it with the existing load balancing scheme through performance evaluation.

Advanced Key Management Architecture Based on Tree Structure for Secure SCADA Communications (안전한 SCADA 통신을 위한 트리 기반의 효율적인 키 관리 구조)

  • Choi, Dong-Hyun;Lee, Sung-Jin;Jeong, Han-Jae;Kang, Dong-Joo;Kim, Hak-Man;Kim, Kyung-Sin;Won, Dong-Ho;Kim, Seung-Joo
    • The KIPS Transactions:PartC
    • /
    • v.16C no.1
    • /
    • pp.37-50
    • /
    • 2009
  • The SCADA(Supervisory Control And Data Acquisition) system is a control system for infrastructure of nation. In the past, the SCADA system was designed without security function because of its closed operating environment. However, the security of the SCADA system has become an issue with connection to the open network caused by improved technology. In this paper we review the constraints and security requirements for SCADA system and propose advanced key management architecture for secure SCADA communications. The contributions of the present work are that our scheme support both message broadcasting and secure communications, while the existing key management schemes for SCADA system don't support message broadcasting. Moreover, by evenly spreading much of the total amount of computation across high power nodes (MTU or SUB-MTU), our protocol avoids any potential performance bottleneck of the system while keeping the burden on low power (RTU) nodes at minimal.

Structural Performance of Double Rip Decks Reinforced with Inverted Triangular Truss Girders (역삼각 트러스 거더로 보강된 더블 골 데크 성능 평가)

  • Son, Hong-Jun;Kim, Young-Ho;Chung, Kyung-Soo;Kim, Dae-Jin
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.30 no.6
    • /
    • pp.559-566
    • /
    • 2017
  • This paper proposes a new composite deckplate system reinforced with inverted triangular truss girders(called 'D Deck'), which does not require the use of temporary supports at construction stage. The proposed system retains increased stiffness and strength while keeping the absolute floor height change to a minimum level and can be utilized as floor systems of various types beam members such as the conventional wide-flange and U-shaped composite beams. In order to evaluate the performance of the proposed system, five specimens with a span of 5.5 m were fabricated and tested under field loading conditions consisting of several intermediate steps. The load-deflection curves of each specimen were plotted and compared with the nonlinear three-dimensional finite element analysis results. The comparison showed that the effective load sharing between the truss girders and floor deck occurs and the maximum deflection under construction stage loading is well below the limit estimated by the provisions in Korea Building Code.

Performance Evaluation of Group Key Management Scheme Blocking Collusion Attack (공모공격의 차단기능을 갖는 그룹 키 관리기법의 성능평가)

  • Chung, Jong-In
    • The Journal of Korean Association of Computer Education
    • /
    • v.9 no.2
    • /
    • pp.111-124
    • /
    • 2006
  • Multicast services are provided on the Internet in fast increasing. Therefore it is important to keep security for multicast communication. If a member of the group is removed, new group key has to be generated and distributed to all remaining members of group. Minimizing number of messages and operation cost for generation of the composite keys to be used to encrypting group key are important evaluating criteria of multicast key management scheme since generation and distribution of new keys for rekeying require expensive operation. Periodic batch rekeying can reduce these important parameters rather than rekeying sequentially in fashion one after another. In this paper, Hamming distance is calculated between every members to be removed. In batch rekeying the members with Hamming distance less than threshold are selected for rekeying procedure. With running the round assignment algorithm in the case of removing several members simultaneously, our scheme has advantages of reducing messages and operation cost for generation of the composite keys and eliminating possibility of collusion attack for rekeying. We evaluate performance of round assignment algorithm through simulation and show that our scheme is excellent after performance comparison of existent schemes and our scheme.

  • PDF

Analysis of Performance and IKEv2 Authentication Exchange model in Mobile IPv6 Network (MIPv6망에서 IKEv2 인증 교환 모텔 및 성능 분석)

  • Ryu, Dong-Ju;Kim, Gwang-Hyun;Kim, Dong-Kook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11A
    • /
    • pp.1085-1091
    • /
    • 2006
  • For an experiment in this paper, designed test bed to secure confidentiality of data and safe transmission that Mobile node exchanges in Mobile network. And, For IPsec use that support basically in MIPv6, modeling and experimented IKEv2 protocol that is used for reliable authentication key management and distribution between End Point. When Mobile node handoff in Mobile network, analyzed effect that authentication key re-exchange and limited bandwidth that happen often get in key exchange. And studied about Performance and latency about authentication setting and exchange process that use multi interface. To conclusion, when Mobile node transmits using IPSec, re-authentication of key confirmed that re-setting by limit of bandwidth that existent Mobile network has can be impossible. According to other result, proposed MN's multi interface is expected to minimise key exchange latency by hand-off when transmit IPSec.

Development of FPGA Based HIL Simulator for PMS Performance Verification of Natural Liquefied Gas Carriers (액화천연가스운반선의 PMS 성능 검증을 위한 FPGA 기반 HIL 시뮬레이터 개발)

  • Lee, Kwangkook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.7
    • /
    • pp.949-955
    • /
    • 2018
  • Hardware-in-the-loop (HIL) simulation is a technique that can be employed for developing and testing complex real-time embedded systems. HIL simulation provides an effective platform for verifying power management system (PMS) performance of liquefied natural gas carriers, which are high value-added vessels such as offshore plants. However, HIL tests conducted by research institutes, including domestic shipyards, can be protracted. To address the said issue, this study proposes a field programmable gate array (FPGA) based PMS-HIL simulator that comprises a power supply, consumer, control console, and main switchboard. The proposed HIL simulation platform incorporated actual equipment data while conducting load sharing PMS tests. The proposed system was verified through symmetric, asymmetric, and fixed load sharing tests. The proposed system can thus potentially replace the standard factory acceptance tests. Furthermore, the proposed simulator can be helpful in developing additional systems for vessel automation and autonomous operation, including the development of energy management systems.

Efficient Flooding Mechanisms with Considering Data Transmission Characteristics of the Wireless Sensor Network (무선 센서 네트워크의 데이터 전송 특성을 고려한 효율적인 플러딩 기법)

  • Ahn, Sang-Hyun;Lim, Yu-Jin;Kim, Mahn-Hee
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.209-216
    • /
    • 2009
  • In the wireless sensor network, flooding is required for the dissemination of queries and event announcements. The simple flooding causes the implosion and the overlap problems, so the simple flooding may result in the reduced network lifetime. Therefore, in this paper, we propose the flooding overlay structure (FOS) so that the overhead caused by flooding can be reduced. We propose two variants of FOS mechanisms, the centralized FOS (CFOS) and the distributed FOS (DFOS). In CFOS, the sink collects the network topology information and selects forwarding nodes based on that information. On the other hand, DFOS allows each sensor node to decide whether to act as a forwarding node or not based on its local information. For the performance evaluation of our proposed mechanisms, we carry out NS-2 based simulations and compare ours with the simple flooding and the gossiping. The simulation results indicate that the proposed FOS mechanisms outperform the simple flooding in terms of the network lifetime and the gossiping in terms of the data delivery ratio.