• 제목/요약/키워드: Network Performance Evaluation

Search Result 1,870, Processing Time 0.03 seconds

Performance Evaluation of Tree Routing in Large-Scale Wireless Sensor Networks (대규모 센서네트워크에서의 트리라우팅 성능평가)

  • Beom-Kyu Suh;Ki-Il Kim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.2
    • /
    • pp.67-73
    • /
    • 2023
  • Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

The Comparison of Performance Hierarchical Routing Protocols in Wide Area Sensor Field

  • Park, SeaYoung;Jung, KyeDong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.5 no.1
    • /
    • pp.8-15
    • /
    • 2016
  • Studies have been made for the wireless sensor network protocols by a number of researchers to date. In particular, the studies as to the hierarchical protocol LEACH algorithm was concentrated. Various studies have been derived for the performance of the protocol is based on the LEACH protocol have been made. Improved algorithms have been proposed continuously. On the other hand, The performance comparison and evaluation of the improved algorithm is insufficient. Therefore, we compared the performance for the ML-LEACH (Multi Hop-Layered) and DL-LEACH (Dual Hop-Layered) been derived mainly LEACH. scalability, energy consumption, CH elected, network lifetime were selected as a Performance evaluation items.

Fuzzy Closed BCMP Queueing Network Model for Performance Evaluation of Centralized Distributed Processing System (집중형 분산처리시스템의 성능평가를 위한 퍼지 폐쇄형 BCMP 큐잉네트워크모델)

  • Choo, Bong-Jo;Jo, Jung-Bok;Woo, Chong-Ho
    • The KIPS Transactions:PartA
    • /
    • v.9A no.1
    • /
    • pp.45-52
    • /
    • 2002
  • This paper proposes the fuzzy closed RCMP queueing network model using fuzzy set theory for the performance evaluation of centralized distributed processing system with ambiguous system factors in the network environments. This model can derive the measures for system performances such as the job spending time, the system throughput, average job number and server utilizations using fuzzy mean value analysis which can process the fuzzy factors. Computer simulation has been performed centralized distributed system with fuzzy service requirement time for verifying the effectiveness of derived equations of performance evaluation according to the numbers of clients, and the results were analyzed. The proposed model provides more and flexible realistic than performance evaluation of conventional method when we evaluated system performance with ambiguous factors.

Large-Scale Integrated Network System Simulation with DEVS-Suite

  • Zengin, Ahmet
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.452-474
    • /
    • 2010
  • Formidable growth of Internet technologies has revealed challenging issues about its scale and performance evaluation. Modeling and simulation play a central role in the evaluation of the behavior and performance of the large-scale network systems. Large numbers of nodes affect simulation performance, simulation execution time and scalability in a weighty manner. Most of the existing simulators have numerous problems such as size, lack of system theoretic approach and complexity of modeled network. In this work, a scalable discrete-event modeling approach is described for studying networks' scalability and performance traits. Key fundamental attributes of Internet and its protocols are incorporated into a set of simulation models developed using the Discrete Event System Specification (DEVS) approach. Large-scale network models are simulated and evaluated to show the benefits of the developed network models and approaches.

System Architecture for Performance Management in ATM Network (ATM 통신망의 성능관리를 위한 시스템구조)

  • Hyeog In Kwon
    • The Journal of Society for e-Business Studies
    • /
    • v.6 no.2
    • /
    • pp.25-38
    • /
    • 2001
  • ATM is the transport method for the broadband integrated services digital networks(B-ISDN). It may replace existing LAN, MAN and WAN technologies such as CSMA/CD, FDDI, Frame relay, X.25, etc. But it is more complicate than existing network technologies. One of the main difficulties in ATM network is performance management. Specifically, the problems are evaluating the performance and tuning the values of the performance parameters, The goal of this paper is to introduce a system architecture designed for ATM network performance management, The major ingredients of the system are generic performance parameters In be measured from ATM network, performance evaluation models and decision criteria concerning the network performance. In this paper, general requirements for performance management application in ATM network are discussed.

  • PDF

A COMPUTATION METHOD IN PERFORMANCE EVALUATION IN CELLULAR COMMUNICATION NETWORK UNDER THE GENERAL DISTRIBUTION MODEL

  • Kim, Kyung-Sup
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.12 no.2
    • /
    • pp.119-131
    • /
    • 2008
  • The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

  • PDF

A Performance Evaluation for IPoIB Protocol in Channel based Network (채널기반형 네트웍에서의 IPoIB 프로토콜 성능평가)

  • Jeon, Ki-Man;Min, Soo-Young;Kim, Young-Wan
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.687-689
    • /
    • 2004
  • As using of network increases rapidly, performance of system has been deteriorating because of the overhead and bottleneck. Nowadays, High speed I/O network standard, that is a sort of PCI Express, HyperTransport, InfiniBand, and so on, has come out to improve the limites of traditional I/O bus. The InfiniBand Architecture(IBA) provides some protocols to service the applications such as SDP, SRP and IPoIB. In our paper, We explain the architecture of IPoIB (IP over InfiniBand) and its features in channel based I/O network. And so we provide a performance evaluation result of IPoIB which is compared with current network protocol. Our experimental results also show that IPoIB is batter than TCP/IP protocol. For this test, We use the dual processor server systems and Linux Redhat 9.0 operating system.

  • PDF

Performance Evaluation of a Multistage Interconnection Network with Output-Buffered ${\alpha}{\times}{\alpha}$ Switches (출력 버퍼형${\alpha}{\times}{\alpha}$스위치로 구성된 다단 연결망의 성능 분석)

  • 신태지;양명국
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.6
    • /
    • pp.738-748
    • /
    • 2002
  • In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches is Proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch with output-buffers. The performance of the multiple-buffered${\alpha}{\times}{\alpha}$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes, Two important parameters of the network performance, throughput and delay, are then evaluated, To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.

Performance Evaluation for TCP/IP over UBR (UBR 위에서 동작하는 TCP/IP 성능 평가)

  • Ahn, Sung-Soo;Yu, Hyung-Sik;Whang, Sun-Ho;Lee, Jun-Won;Kim, Sung-Un
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.1
    • /
    • pp.76-87
    • /
    • 2000
  • ATM is a key technology of integration of multimedia service. Recently, Many study have been concentrated on performance testing for evaluation network performance are stronger everyday. The performance testing is on evaluation of maximal throughput of network by measuring and analyzing of various performance parameters. There are two ways to test ATM network performance; one is using QoS in cell level on the point of network's view, and the other is using metric in frame level in the point of user's view. And, the standardization process is also under way. In this paper, we derive a performance requirement of TCP in TCP/IP data transmission over ATM UBR service. By applying the derived requirements to ATM and packet networks, we evaluate the performance of TCP over UBR based on the result of our simulations. Therefore, we evaluate the result of simulation and find degradation of network throughput by interaction between TCP congestion control and ATM cell drop policy. So we suggest the accelerated Vegas that modify traditional TCP Vegas in congestion control mechanism for batter network throughput.

  • PDF

Performance Evaluation for a Multistage Interconnection Network with Buffered $a{\times}a$ Switches under Hot-spot Environment (핫스팟을 발생시 출력 버퍼형 $a{\times}a$ 스위치로 구성된 다단 연결망의 성능분석)

  • Kim, Jung-Yoon;Shin, Tae-Zi;Yang, Myung-Kook
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.3
    • /
    • pp.193-202
    • /
    • 2007
  • In this paper, a performance evaluation model of the Multistage Interconnection Network(MIN) with the multiple-buffered crossbar switches under Hot-spot environment is proposed and examined. Buffered switch technique is well known to solve the data collision problem of the MIN. The proposed evaluation model is developed by investigating the transfer patterns of data packets in a switch. The performance of the multiple-buffered $a{\times}a$ crossbar switch is analyzed. Steady state probability concept is used to simplify the analyzing processes. Two important parameters of the network performance, throughput and delay, are then evaluated. To validate the proposed analysis model, the simulation is carried out on a Baseline network that uses the multiple buffered crossbar switches. Less than 2% differences between analysis and simulation results are observed. It is also shown that the network performance is significantly improved when the small number of buffer spaces is given. However, the throughput elevation is getting reduced and network delay becomes increasing as more buffer spaces are added in a switch.