• Title/Summary/Keyword: 고속네트워크

Search Result 885, Processing Time 0.034 seconds

Performance Evaluation of iSER on Storage system using Infiniband fabric (인피니밴드기반 저장장치에서의 iSER(iSCSI Extension for RDMA) 성능평가)

  • Kim, Young Hwan;Son, Jae-Gi;Jung, Hye-Dong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.148-150
    • /
    • 2013
  • 최근 TCP/IP에서 세션을 통하여 노드들 간의 통신을 연결하는 방식에서 현재는 하나의 채널을 통해 고속의 I/O가 가능하도록 하는 인피니밴드 같은 기술이 많이 연구되고 있다. 인피니밴드는 프로세싱 노드와 입출력 장치 사이의 통신, 프로세스간 통신에 대한 산업 표준이 되고 있고 프로세싱 노드와 입출력 장치를 연결하기 위해 스위치 기반의 상호 연결은 전통적인 버스 입출력을 대체하는 새로운 입출력 방식이다. 또한 인피니밴드에서는 현재 이슈가 되고 있는 RDMA 방식을 이용해 원격지 서버들간에 직접 메모리 접근 방식을 통해 CPU와 OS의 로드를 최소화하고 있다. 본 논문에서는 인피니밴드 네트워크를 이용하는 저장장치 접근 프로토콜인 iSER(iSCSI Extension RDMA Protocol)와 기존 이더넷망에서 사용되는 iSCSI(Internet SCSI) 프로토콜을 이용하여 서버와 저장장치 간의 IOPS 와 초당 데이터 전송량에 대한 성능을 평가한다. 우리는 성능평가를 위해 Intel에서 제공하는 저장장치 I/O 성능평가 도구인 IO meter를 이용했다.

New Scheduling Algorithm for Fairness Criteria of ATM ABR (ATM ABR의 공평성들을 위한 새로운 스케쥴링 알고리즘)

  • Chung, Kyung-Taek;Park, Jun-Seong;Park, Hyun;Chon, Byoung-Sil
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.4
    • /
    • pp.188-200
    • /
    • 2002
  • The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, scheduling algorithm allocates network resources fairly to each VC. However, WRR algorithm shows worse performance on bursty traffic. Because it schedules input traffics according to predetermined weight, it can not satisfies fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, defined by ATM Forum TM 4.1 specification. The Nabeshima et al algorithm is not adapt to network status rapidly because it is not compensate the weights of unused bandwidth to VCs and assign the unused bandwidth to VCs by RR method. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation. According to the simulation results, the proposed algorithm shows higher fairness and more rapid convergence than other algorithms.

News Editing and Transferring System in a Distant Region (원격 뉴스 편집 전송 시스템)

  • Yang, Ki-Sun;Jeon, Seong-Qyu;Lee, Man-Kyu;Kim, Hee-Jung;Park, Sung-Choon
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.243-249
    • /
    • 2007
  • In this paper we introduce a system that assists news reporters to easily edit source video anywhere, and transfer the result from a remote site to the station. Presently reporters are bothered to edit source materials, compress and transfer using several separate tools. Moreover such tools have lots of too complicated features to use only for news production. We have integrated file sending and video editing functions together for seamless workflow. News programs usually need promptness in production. For this reason our system is designed to make it possible the one-stop production of news items outside the TV station. Also the system reflects the demands of field workers, that is, easy usage for the beginner and features for speedy news production. One of the most focused is that the reliability of the system is guaranteed in the process of transfer. To achieve this end, we have implemented several error-resilient schemes for unexpected network errors. Our system consists of remote laptop editing terminals and a newsgathering server. DV-format based editing and analog-to-DV converting device are adopted to capture video from not only lightweight DV camcorders but also old-fashioned ENG cameras into laptop computers. We expect that news reporters and cameramen can take terminals anywhere the Internet is available and both editing and sending will be done on the spot. This will help increase the competitive power of our news production.

  • PDF

Real-Time Fixed Pattern Noise Suppression using Hardware Neural Networks in Infrared Images Based on DSP & FPGA (DSP & FPGA 기반의 적외선 영상에서 하드웨어 뉴럴 네트워크를 이용한 실시간 고정패턴잡음 제어)

  • Park, Chang-Han;Han, Jung-Soo;Chun, Seung-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.94-101
    • /
    • 2009
  • In this paper, we propose design of hardware based on a high speed digital signal processor (DSP) and a field programmable gate array (FPGA) for real-time suppression of fixed pattern noise (FPN) using hardware neural networks (HNN) in cooled infrared focal plane array (IRFPA) imaging system FPN appears a limited operation by temperature in observable images which applies to non-uniformity correction for infrared detector. These have very important problems because it happen serious problem for other applications as well as degradation for image quality in our system Signal processing architecture for our system operates reference gain and offset values using three tables for low, normal, and high temperatures. Proposed method creates virtual tables to separate for overlapping region in three offset tables. We also choose an optimum tenn of temperature which controls weighted values of HNN using mean values of pixels in three regions. This operates gain and offset tables for low, normal, and high temperatures from mean values of pixels and it recursively don't have to do an offset compensation in operation of our system Based on experimental results, proposed method showed improved quality of image which suppressed FPN by change of temperature distribution from an observational image in real-time system.

A Study on Real Time Traffic Performance Improvement Considering QoS in IEEE 802.15.6 WBAN Environments (IEEE 802.15.6 WBAN 환경에서 QoS를 고려한 실시간 트래픽 성능향상에 관한 연구)

  • Ro, Seung-Min;Kim, Chung-Ho;Kang, Chul-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.4
    • /
    • pp.84-91
    • /
    • 2011
  • Recently, WBAN(Wireless Body Area Network) which has progressed standardization based on IEEE 802.15.6 standardization is a network for the purpose of the short-range wireless communications within around 3 meters from the inner or outer human body. Effective QoS control technique and data efficient management in limited bandwidth such as audio and video are important elements in terms of users and loads in short-range wireless networks. In this paper, for high-speed WBAN IEEE 802.15.6 standard, the dynamic allocation to give an efficient bandwidth management and weighted fair queueing algorithm have been proposed through the adjustment of the super-frame about limited data and Quality of Service (QoS) based on the queuing algorithm. Weighted Fair Queueing(WFQ) Algorithm represents the robust performance about elements to qualitative aspects as well as maintaining fairness and maximization of system performance. The performance results show that the dynamic allocation expanded transmission bandwidth five times and the weighted fair queueing increased maximum 24.3 % throughput and also resolved delay bound problem.

Implementation of a TCP/IP Offload Engine Using Lightweight TCP/IP on an Embedded System (임베디드 시스템상에서 Lightweight TCP/IP를 이용한 TCP/IP Offload Engine의 구현)

  • Yoon In-Su;Chung Sang-Hwa;Choi Bong-Sik;Jun Yong-Tae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.413-420
    • /
    • 2006
  • The speed of present-day network technology exceeds a gigabit and is developing rapidly. When using TCP/IP in these high-speed networks, a high load is incurred in processing TCP/IP protocol in a host CPU. To solve this problem, research has been carried out into TCP/IP Offload Engine (TOE). The TOE processes TCP/IP on a network adapter instead of using a host CPU; this reduces the processing burden on the host CPU. In this paper, we developed two software-based TOEs. One is the TOE implementation using an embedded Linux. The other is the TOE implementation using Lightweight TCP/IP (lwIP). The TOE using an embedded Linux did not have the bandwidth more than 62Mbps. To overcome the poor performance of the TOE using an embedded Linux, we ported the lwIP to the embedded system and enhanced the lwIP for the high performance. We eliminated the memory copy overhead of the lwIP. We added a delayed ACK and a TCP Segmentation Offload (TSO) features to the lwIP and modified the default parameters of the lwIP for large data transfer. With the aid of these modifications, the TOE using the modified lwIP shows a bandwidth of 194 Mbps.

Design and Implementation of Initial OpenSHMEM Based on PCI Express (PCI Express 기반 OpenSHMEM 초기 설계 및 구현)

  • Joo, Young-Woong;Choi, Min
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.6 no.3
    • /
    • pp.105-112
    • /
    • 2017
  • PCI Express is a bus technology that connects the processor and the peripheral I/O devices that widely used as an industry standard because it has the characteristics of high-speed, low power. In addition, PCI Express is system interconnect technology such as Ethernet and Infiniband used in high-performance computing and computer cluster. PGAS(partitioned global address space) programming model is often used to implement the one-sided RDMA(remote direct memory access) from multi-host systems, such as computer clusters. In this paper, we design and implement a OpenSHMEM API based on PCI Express maintaining the existing features of OpenSHMEM to implement RDMA based on PCI Express. We perform experiment with implemented OpenSHMEM API through a matrix multiplication example from system which PCs connected with NTB(non-transparent bridge) technology of PCI Express. The PCI Express interconnection network is currently very expensive and is not yet widely available to the general public. Nevertheless, we actually implemented and evaluated a PCI Express based interconnection network on the RDK evaluation board. In addition, we have implemented the OpenSHMEM software stack, which is of great interest recently.

Security Analysis and Implementation of Fast Inter-LMA domain Handover Scheme in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 LMA도메인 간 핸드오버 기법의 보안성 분석 및 구현)

  • Chai, Hyun-Suk;Jeong, Jong-Pil
    • The KIPS Transactions:PartC
    • /
    • v.19C no.2
    • /
    • pp.99-118
    • /
    • 2012
  • In PMIPv6-based network, mobile nodes can be made smaller and lighter because the network nodes perform the mobility management-related functions on behalf of the mobile nodes. The one of the protocols, Fast Handovers for Proxy Mobile IPv6(FPMIPv6)[1] has studied by the Internet Engineering Task Force(IETF). Since FPMIPv6 adopts the entities and the concepts of Fast Handovers for Mobile IPv6(FMIPv6) in Proxy Mobile IPv6(PMIPv6), it reduces the packet loss. Conventional scheme has proposed that it cooperated with an Authentication, Authorization and Accounting(AAA) infrastructure for authentication of a mobile node in PMIPv6, Despite the best efficiency, without begin secured of signaling messages, PMIPv6 is vulnerable to various security threats such as the DoS or redirect attAcks and it can not support global mobility between PMIPv. In this paper, we analyze Kang-Park & ESS-FH scheme, and then propose an Enhanced Security scheme for FPMIPv6(ESS-FP). Based on the CGA method and the pubilc key Cryptography, ESS-FP provides the strong key exchange and the key independence in addition to improving the weaknesses for FPMIPv6. The proposed scheme is formally verified based on Ban-logic, and its handover latency is analyzed and compared with that of Kang-Park scheme[3] & ESS-FH and this paper propose inter-domain fast handover sheme for PMIPv6 using proxy-based FMIPv6(FPMIPv6).

Performance Evaluation of Output Queueing ATM Switch with Finite Buffer Using Stochastic Activity Networks (SAN을 이용한 제한된 버퍼 크기를 갖는 출력큐잉 ATM 스위치 성능평가)

  • Jang, Kyung-Soo;Shin, Ho-Jin;Shin, Dong-Ryeol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2484-2496
    • /
    • 2000
  • High speed switches have been developing to interconnect a large number of nodes. It is important to analyze the switch performance under various conditions to satisfy the requirements. Queueing analysis, in general, has the intrinsic problem of large state space dimension and complex computation. In fact, The petri net is a graphical and mathematical model. It is suitable for various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a framework for modeling and analyzing ATM switch using stochastic activity networks (SANs). In this paper, we provide the ATM switch model using SANs to extend easily and an approximate analysis method to apply A TM switch models, which significantly reduce the complexity of the model solution. Cell arrival process in output-buffered Queueing A TM switch with finite buffer is modeled as Markov Modulated Poisson Process (MMPP), which is able to accurately represent real traffic and capture the characteristics of bursty traffic. We analyze the performance of the switch in terms of cell-loss ratio (CLR), mean Queue length and mean delay time. We show that the SAN model is very useful in A TM switch model in that the gates have the capability of implementing of scheduling algorithm.

  • PDF

Analysis of Level and Capacity for Multi-piconet in Koinonia High-Rate WPAN (Koinonia 고속 WPAN의 다중 피코넷 레벨 몇 용량 분석)

  • Jung Ssang-Bong;Yim Soon-Bin;Lee Tae-Jin;June Sun-Do;Lee Hyeon-Seok;Kwon Tai-Gil;Cho Jin-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3B
    • /
    • pp.216-223
    • /
    • 2006
  • The KOINONIA is developed to communicate with connection of the short-range devices by the technique of the WPAN. The piconet consists of one master and slaves above one, the multi-poconet consists of parent piconet and child piconets which is formed the basis of parent piconet. The child piconet consists of the child master and slaves. The child master takes a role of the master in the child piconet and the slave in the parent piconet. In this paper, the multi-piconet is made as above, then we estimate the max capacity of assigned CTA by level, number of slaves in child piconet. A super-frame is the maximum 65.535ms of usable capacity. Because of it is a fued number, We suggested quantitatively the fixed reduction of an usable capacity by increases of number of slave and child-master in the piconet. And we analyze the reduction of an available capacity by the increase of number of child piconet.