• Title/Summary/Keyword: 네트워크 성능평가

Search Result 2,002, Processing Time 0.029 seconds

Performance Evaluation of Improved Localization Algorithm for Wireless Sensor Network (무선 센서 네트워크를 위한 위치인식 알고리즘 성능개선 및 평가)

  • Han, Wang-Won;Lee, Seung-Jae;Byeon, Yeong-Taik;Kim, Young-Man
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.05a
    • /
    • pp.800-803
    • /
    • 2008
  • 언제 어디서나 사람이나 사물과 같은 객체의 위치를 인식하고 이를 기반으로 유용한 서비스를 제공하는 유비쿼터스 위치기반 서비스가 중요한 응용 서비스로 대두되고 있다. 그러나 현재 무선 센서네트워크를 구성하는 노드들의 위치는 매우 유용한 정보로서 수많은 서비스에서 사용될 수 있기 때문에 다양한 형태의 위치인식 알고리즘이 고안되었다. 이러한 위치인식 알고리즘에는 Gradient, MLE[1], MDS[2], dwMDS[3]등이 있다. 본 논문에서는 기존의 알고리즘에 대해 간략히 설명하고, 기존 알고리즘성능을 개선하기 위한 두 가지 방법을 제안한다. 그리고 제안한 방법의 성능을 증명하기 위해 시뮬레이션 모듈을 구현하고 시뮬레이션 결과를 바탕으로 각 위치인식 알고리즘의 성능을 비교 평가한다.

The Development of Mobile Grid System and Performance Evaluation (모바일 그리드 시스템의 개발 및 성능평가)

  • Kim Tae-Kyung;Kim Hee-Seung;Lee Hyun-Joo;Chung Tai-Myung
    • The KIPS Transactions:PartC
    • /
    • v.12C no.4 s.100
    • /
    • pp.581-588
    • /
    • 2005
  • The performance of mobile devices and wireless networks is improved rapidly and Mobility management skills such as Mobile IP and ad-hoc technology were developed. So the requirement of processing the distributed computing is highly increased in any place and any time or in the state of movement. Therefore we studied the mobile grid system to process the distributed applications properly in wireless networks. In addition to typical computational resources, Mobile Grid brings new resources such as sensor, mobile devices or other wireless devices to distributed computing for the purpose of resource-sharing. In this paper, we design and implement the mobile grid system in wireless lan network environment for the providing the grid service. Also, we evaluate the performance of mobile grid system using the processing the distributed applications in implemented mobile grid environments.

Multi-Domain Security Management Framework and Its Performance Evaluation for Protecting BcN Infrastructure (BcN 인프라 보호를 위한 다중 도메인 보안 관리 프레임워크와 성능평가)

  • Jang Jung-Sook;Jeon Yong-Hee;Jang Jong-Soo
    • The KIPS Transactions:PartC
    • /
    • v.12C no.6 s.102
    • /
    • pp.817-826
    • /
    • 2005
  • BcN(Broadband convergence Network) is being developed in order to support a variety of network applications, with enhanced capabilities of QoS(Quality of Service) provisioning and security, and IPv6. In a high-speed network environment such as BcN, it if more likely for the network resources to be exposed to various intrusion activities. The propagation speed of intrusion is alto expected to be much faster than in the existing Internet In this paper, we present a multi-domain security management framework which my be used for a global intrusion detection at multiple domains of BcN and describe its characteristics. For the performance evaluation, we first present test results for the security node and compare with other products. Then we design and Implement an OPNET simulator for the proposed framework, and present some simulation results. In the simulation model, we focus on the performance of alert information in the security overlay network.

Performance Evaluation of the new AODV Routing Protocol with Cross-Layer Design Approach (교차 계층 설계 기법을 사용한 새로운 AODV 라우팅 프로토콜 설계 및 성능평가)

  • Jang, Jaeshin;Wie, Sunghong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.6
    • /
    • pp.768-777
    • /
    • 2020
  • In this paper, we describe recent research results on AODV routing protocol, which is widely deployed at mobile ad hoc networks, and AODV related routing protocols with multi-path routing schemes. We suggest the critical problems which minimum hop routing schemes have, such as AODV routing protocol, and then, propose a new C-AODV routing protocol with two routing metrics: the primary metric is the hop count, the secondary metric is the sum of link delay times. We implemented C-AODV protocol by modifying AODV at the NS-3, and thus, elaborate on how we change the original AODV source code of NS-3 in order to implement the C-AODV scheme. We show numerical comparison of C-AODV scheme with the original AODV scheme and then, discuss how much the C-AODV enhances routing performance over AODV protocol. In conclusion, we present future research items.

Performance Evaluation in Combination of Wired and Wireless Mesh Networks (메쉬 네트워크 기반의 유무선 통합망 성능 평가)

  • Han, Jin-Young;Jung, Hee-Dong;Im, Young-Bin;Lee, Jeong-Keun;Ryu, Ji-Ho;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.778-782
    • /
    • 2008
  • The performance in combination of wired and wireless mesh network which will be a main access network in future internet is directly linked with service quality to users. In this paper, we evaluate variant TCP performance and analyze traffic characteristics on Wireless (Seoul National University Mesh testbed) - Wired (KOREN/Abilene) - Wireless (HP Mesh testbed in the USA) Network. We found that RTT is proper in this network to serve a VoIP service. Also we propose an enhanced TCP protocol which can perform well in both wireless network which has many packet losses and wired network which has high bandwidth and long delay.

Optimization Algorithm for Minimizing Network Energy Consumption with Traffic Redundancy Elimination (트래픽 중복 제거로 네트워크 에너지 소비를 최소화하기 위한 최적화 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.7
    • /
    • pp.930-939
    • /
    • 2021
  • In recent years, the use of broadband bandwidth and redundant links for stable transmission in networks has resulted in excessive energy consumption and reduced transmission efficiency. In this paper, we propose an optimization algorithm that reduces the number of transmission links and minimizes transmission energy by removing redundant traffic in networks where traffic redundancy is allowed. The optimization algorithm proposed in this paper uses the meta-heuristic method using Tabu search algorithm. The proposed optimization algorithm minimizes transmission energy by designing a neighborhood generation method that efficiently routes overlapping traffic. The performance evaluation of the proposed optimization algorithm was performed in terms of the number of links used to transmit all traffic generated in the network and the transmission energy consumed. From the performance evaluation results, it was confirmed that the proposed algorithm is superior to other algorithms previously proposed.

A Performance Evaluation for SDP(Socket Direct Protocol) in Channelbased Network (고속의 채널기반네트웍에서 SDP프로토콜성능평가)

  • Kim Young-Hwan;Park Chang-Won;Jeon Ki-Man
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.137-141
    • /
    • 2004
  • 네트워크 사용자의 급속한 증가로 네트워크 내의 부하를 감당하기에는 많은 어려움을 가져왔다. 이와 같은 이유로 기존의 TCP/IP에서 세션을 통하여 노드들 간의 통신을 연결하는 방식에서 현재는 하나의 채널을 통해 고속의 I/O가 가능하도록 하는 기술이 많이 연구되고 있다. 그 대표적인 것으로 인피니밴드가 있다. 인피니밴드는 프로세싱 노드와 입출력 장치 사이의 통신, 프로세스간 통신에 대한 산업 표준이 되고 있고 프로세싱 노드와 입출력 장치를 연결하기 위해 스위치 기반의 상호 연결은 전통적인 버스 입출력을 대체하는 새로운 입출력 방식이 사용된다. 또한 인피니밴드에서는 현재 많은 이슈가 되고 있는 RDMA 방식을 이용해 원격지 서버들 간에 직접 메모리 접근 방식을 통해 CPU와 OS의 로드를 최소화하고 있다. 본 논문에서는 RDMA를 적용한 새로운 채널 기반 네트웍의 프로토콜인 SDP(Socket Direct Protocol)를 구현하여 SDP_STREAM의 패킷 처리량에 대한 성능을 평가한다. 그리고 이에 대한 성능 평가를 위해서 Netperf 툴을 이용했다. 특히 Zero-Copy방식을 사용하지 않는 일반적인 소켓 API을 이용한 TCP_STREAM과 Zero-Copy방식을 이용한 SDP_STREAM의 패킷 처리량을 비교했으며 성능 평가 결과는 기존의 TCP_STREAM 패킷 처리량에 비해 약 3배 이상 향상된 결과를 나타냈다.

  • PDF

A Study on Efficient Ethereum Smart Contract (효율적인 이더리움 스마트 콘트랙트에 관한 연구)

  • Kim, Dae Han;Choi, KwangHoon;Kim, Kangseok;Kim, Jai-Hoon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.82-84
    • /
    • 2018
  • 본 논문은 이더리움 네트워크에 트랜잭션 발행 시 발생하는 부하(비용)을 줄이기 위해 스마트 콘트랙트를 효율적으로 구성하는 방식에 대해 연구한다. 이더리움 네트워크에 부하를 줄이기 위해서는 발생되는 트랜잭션의 양도 중요하지만 발생하는 트랜잭션의 크기가 작은 효율적인 스마트 콘트랙트 배포와 간단한 구조를 가진 함수를 호출하는 것도 중요하다. 그렇기 때문에 이더리움 스마트 콘트랙트의 구조에 따른 성능 평가를 진행하여 최적의 성능을 보이는 스마트 컨트랙트 구성 방법에 대해 연구를 진행한다. 최적의 성능은 동일한 데이터를 넣을 수 있는 상황에 대해 평가하며 평가 방식은 데이터를 블록체인에 저장 할 때 발생하는 가스 비용 비교를 통해 결정한다. 스마트 콘트랙트의 성능 평가 항목으로는 콘트랙트 배포와 함수 호출시 데이터의 구조, 개수에 따른 가스 비용의 비교 분석을 통해 최저의 가스 비용으로 함수 호출 및 스마트 콘트랙트 생성 및 배포 시키는 구조에 대해 연구를 진행한다.

Analytical Models and Performance Evaluations of Network Management Systems (네트워크 관리 시스템의 해석적 모델 및 성능 평가)

  • Jung Woo, Lee;Jae Hyuk, Choi;Woo Seok, Lee;Sang Bang, Choi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.9
    • /
    • pp.17-28
    • /
    • 2004
  • Since the Internet has grown into a large communication infrastructure, the network management system to systematically manage the large number of network components has become an essential part of the Internet. The rapid growth of network size has brought into question the scalability of the existing centralized model, such as SNMP (Simple Network Management Protocol) and CMIP (Common Management Information Protocol). Thus, for efficient network management, researches about mobile agent have also been performed recently. This paper presents analytical models of centralized approach based on SNMP protocol, distributed approach based on mobile agent, and mixed mode to make up for shortcomings of SNMP and mobile agent. We compare the performance of these analytical models based on network management response time. Experiment results show that performance of mobile agent and the mixed mode is less sensitive to the delay in WAN network environment. However, SNMP is more efficient for the simple network environment like LAN.

Performance Evaluation of a Fat-tree Network with Output-Buffered $a{\times}b$ Switches (출력 버퍼형 $a{\times}b$스위치로 구성된 Fat-tree 망의 성능 분석)

  • 신태지;양명국
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.520-534
    • /
    • 2003
  • In this paper, a performance evaluation model of the Fat-tree Network with the multiple-buffered crossbar switches is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the switch network. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. Two important parameters of the network performance, throughput and delay, are then evaluated. The proposed model takes simple and primitive switch networks, i.e., no flow control and drop packet, to demonstrate analysis procedures clearly. It, however, can not only be applied to any other complicate modern switch networks that have intelligent flow control but also estimate the performance of any size networks with multiple-buffered switches. To validate the proposed analysis model, the simulation is carried out on the various sizes of Fat-tree networks that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed.