• Title/Summary/Keyword: 종단간 처리량

Search Result 33, Processing Time 0.025 seconds

Deployment and Performance Analysis of Data Transfer Node Cluster for HPC Environment (HPC 환경을 위한 데이터 전송 노드 클러스터 구축 및 성능분석)

  • Hong, Wontaek;An, Dosik;Lee, Jaekook;Moon, Jeonghoon;Seok, Woojin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.9
    • /
    • pp.197-206
    • /
    • 2020
  • Collaborative research in science applications based on HPC service needs rapid transfers of massive data between research colleagues over wide area network. With regard to this requirement, researches on enhancing data transfer performance between major superfacilities in the U.S. have been conducted recently. In this paper, we deploy multiple data transfer nodes(DTNs) over high-speed science networks in order to move rapidly large amounts of data in the parallel filesystem of KISTI's Nurion supercomputer, and perform transfer experiments between endpoints with approximately 130ms round trip time. We have shown the results of transfer throughput in different size file sets and compared them. In addition, it has been confirmed that the DTN cluster with three nodes can provide about 1.8 and 2.7 times higher transfer throughput than a single node in two types of concurrency and parallelism settings.

Trajectory Information-based Routing Protocol for Mobile Mesh Router in Wireless Mesh Networks (무선 메쉬 네트워크에서 이동 메쉬 라우터의 이동 경로 정보를 고려한 라우팅 프로토콜)

  • Cho, Yong-Jin;Jeong, Hong-Jong;Kim, Dong-Kyun;Ryu, Kwan-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.912-923
    • /
    • 2011
  • In this paper, we propose a routing protocol for WMNs to provide passengers in public transportation vehicles (e.g., bus and tram) with Internet access service. In order to support end users with a reliable Internet connection despite the mobility of vehicles, we assume that mesh router, called mobile mesh router (MMR), is installed in a vehicle and manages a route to Internet Gateway (IGW). We therefore propose an efficient routing protocol and its routing metric, called ETT-TR, considering trajectory information of vehicle as well as link quality in order to find a route between them. Using NS-2 simulations, we observe that our proposed routing protocol reduces the end-to-end delay and improves throughput performance.

Automatic Word Spacing of the Korean Sentences by Using End-to-End Deep Neural Network (종단 간 심층 신경망을 이용한 한국어 문장 자동 띄어쓰기)

  • Lee, Hyun Young;Kang, Seung Shik
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.11
    • /
    • pp.441-448
    • /
    • 2019
  • Previous researches on automatic spacing of Korean sentences has been researched to correct spacing errors by using n-gram based statistical techniques or morpheme analyzer to insert blanks in the word boundary. In this paper, we propose an end-to-end automatic word spacing by using deep neural network. Automatic word spacing problem could be defined as a tag classification problem in unit of syllable other than word. For contextual representation between syllables, Bi-LSTM encodes the dependency relationship between syllables into a fixed-length vector of continuous vector space using forward and backward LSTM cell. In order to conduct automatic word spacing of Korean sentences, after a fixed-length contextual vector by Bi-LSTM is classified into auto-spacing tag(B or I), the blank is inserted in the front of B tag. For tag classification method, we compose three types of classification neural networks. One is feedforward neural network, another is neural network language model and the other is linear-chain CRF. To compare our models, we measure the performance of automatic word spacing depending on the three of classification networks. linear-chain CRF of them used as classification neural network shows better performance than other models. We used KCC150 corpus as a training and testing data.

Analysis of the TCP performance over IEEE1394 based Home Networkings (IEEE1394 기반의 홈 네트워킹에서의 TCP 성능 분석)

  • 장종욱
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.4
    • /
    • pp.706-715
    • /
    • 2001
  • TCP typically offers reasonable end-to-end performance to users regardless of the bandwidth and error characteristics of particular network technology, The robustness of TCP has contributed to its success in the internet environment. The role of communications is already well established in the office environment. With the advent of cheap, affordable broadband communications and the increasing complexity of consumer goods, it seems natural to extend the network into homes. In-home networking means a high-speed communication among the digital appliances within a home. Introduction of application over high-speed home network using TCP/IP protocol is increasing. The integrated environment of internet and home network is demanding as well. We have validated TCP model over high speed home network environment, investigated the throughput behavior of TCP over IEEE 1399 home networks, and evaluated a potential solution for high performance of TCP over IEEE 139t home networks. The simulation model has produced several interesting results in the performance of TCP over IEEE 1394 home network.

  • PDF

TCP Performance Control Method for the Wireless Link by using Extended ECN Mechanism (확장된 ECN 메커니즘을 사용한 무선 링크에서의 TCP성능 제어 기법)

  • Yun, You-Hun;Kim, Tai-Yun
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.3
    • /
    • pp.336-343
    • /
    • 2002
  • Nowadays, after appearance of wireless network the existent internet environment is changing into the united wire/wireless network. But the present TCP regards all of the packet losses on transmission as the packet tosses due to the congestion. When it is applied on the wireless path, it deteriorates the end-to-end TCP throughput because it regards the packet loss by handoff or bit error as the packet loss by the congestion and it reduces the congestion window. In this paper, for solving these problems we propose the method that controls the performance of TCP on the wireless link by extending ECN which is used as a congestion control mechanism on the existent wire link. This is the method that distinguished the packet loss due to the congestion from due to bit error or handoff on the wireless network, so it calls the congestion control mechanism only when there occurs the congestion in the united wire/wireless network.

Performance Analysis of Flow Control Method Using Virtual Switchs on ATM (ATM에서 가상 스위치를 이용한 흐름 제어 방식의 성능 분석)

  • 조미령;양성현;이상훈
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.1
    • /
    • pp.85-94
    • /
    • 2002
  • EMRCA(Explicit Max_min Rate Control Algorithm) switch, which has been proposed in the ATM(Asychronous Transfer Mode) standard, controls the ABR(Available Bit Rate) service traffic in the ATM networks. The ABR service class of ATM networks uses a feedback control mechanism to adapt to varying link capacities. The VS/VD(Virtual Source/Virtual Destination) technique offers the possibility to segment the otherwise end-to-end ABR control loop into separate loops. The improved feedback delay and the control of ABR traffic inside closed segments provide a better performance and QoS(Quality of Service) for ABR connections with respect to throughput, delay, and jitter. This paper is study of an ABR VS/VD flow control method. Linear control theory offers the means to derive correct choices of parameters and to assess performance issues, like stability of the system, during the design phase. The performance goals are a high link utilization, fair bandwidth distribution and robust operation in various environments, which are verified by discrete event simulations. The major contribution of this work is the use of linear control theory to model and design an ABR flow control method tailored for the special layout of a VS/VD switch, the simulation shows that this techniques better than conventional method.

  • PDF

Distance and Probability-based Real Time Transmission Scheme for V2V Protocol using Dynamic CW allocation (V2V 프로토콜에서 실시간 전송을 위한 동적 CW 할당 기법)

  • Kim, Soo-Ro;Kim, Dong-Seong;Lee, Ho-Kyun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.2
    • /
    • pp.80-87
    • /
    • 2013
  • This paper proposes a CW (Contention window) allocation scheme for real-time data transmission of emergency data on VANET (Vehicle to vehicle Ad hoc Network, V2V) protocol. The proposed scheme reduces the probability of packet collisions on V2V protocol and provides bandwidth efficiency with short delay of emergency sporadic data. In the case of high density traffic, the proposed scheme provides a decrease of recollision probability using dynamic CW adjustments. For the performance analysis, a throughput, end-to-end delays, and network loads were investigated on highway traffic. Simulation results show the performance enhancements in terms of the throughput, end-to-end delays, and network loads.

Network Operation Support System on Graph Database (그래프데이터베이스 기반 통신망 운영관리 방안)

  • Jung, Sung Jae;Choi, Mi Young;Lee, Hwasik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.05a
    • /
    • pp.22-24
    • /
    • 2022
  • Recently, Graph Database (GDB) is being used in wide range of industrial fields. GDB is a database system which adopts graph structure for storing the information. GDB handles the information in the form of a graph which consists of vertices and edges. In contrast to the relational database system which requires pre-defined table schema, GDB doesn't need a pre-defined structure for storing data, allowing a very flexible way of thinking about and using the data. With GDB, we can handle a large volume of heavily interconnected data. A network service provider provides its services based on the heavily interconnected communication network facilities. In many cases, their information is hosted in relational database, where it is not easy to process a query that requires recursive graph traversal operation. In this study, we suggest a way to store an example set of interconnected network facilities in GDB, then show how to graph-query them efficiently.

  • PDF

An Efficient TCP Buffer Tuning Algorithm based on Packet Loss Ratio(TBT-PLR) (패킷 손실률에 기반한 효율적인 TCP Buffer Tuning 알고리즘)

  • Yoo Gi-Chul;Kim Dong-kyun
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.121-128
    • /
    • 2005
  • Tho existing TCP(Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high RDP(Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT(Automatic TCP fluffer Tuning) attempts to assure the buffer size of TCP sender according to its current congestion window size but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer tuning technique(called TBT-PLR: TCP buffer tuning algorithm based on packet loss ratio) since we adopt the ATBT mechanism and the TBT-PLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBT-PLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.

Resource Allocation to Support QoE in Hierarchical Macrocell-Femtocell Networks (계층화된 매크로-펨토셀 망에서 QoE를 지원하기 위한 자원할당 방법)

  • Lee, Gi-Sung;Lee, Jong-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.12
    • /
    • pp.708-715
    • /
    • 2016
  • Quality of experience (QoE) for multimedia services in macro-femtocell networks is one of the key issues for 5G mobile and wireless communications. A service management structure needs to guarantee the QoE for mobile users based on end-to-end negotiation to support service continuity. Resource management is necessary to maintain the QoE requirements of different multimedia applications, because service continuity may be impeded by delays. This paper proposes four types of resource management scheme to support consistent QoE for different multimedia services. For this purpose, a QoE structure is suggested, and a resource allocation scheme is proposed by utilizing a fixed amount of radio resources reserved for dedicated use to support QoE. Various multimedia services with different requirements (such as voice, image, and data) can be serviced simultaneously, because QoE can be provided under our proposed scheme. Simulation results show that our scheme provides better performance than a conventional scheme with respect to outage probability and total data throughput.