• Title/Summary/Keyword: queuing model

Search Result 150, Processing Time 0.02 seconds

Comparative Performance Analysis of Network Security Accelerator based on Queuing System

  • Yun Yeonsang;Lee Seonyoung;Han Seonkyoung;Kim Youngdae;You Younggap
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.269-273
    • /
    • 2004
  • This paper presents a comparative performance analysis of a network accelerator model based on M/M/l queuing system. It assumes the Poisson distribution as its input traffic load. The decoding delay is employed as a performance analysis measure. Simulation results based on the proposed model show only $15\%$ differences with respect to actual measurements on field traffic for BCM5820 accelerator device. The performance analysis model provides with reasonable hardware structure of network servers, and can be used to span design spaces statistically.

  • PDF

CO-CLUSTER HOMOTOPY QUEUING MODEL IN NONLINEAR ALGEBRAIC TOPOLOGICAL STRUCTURE FOR IMPROVING POISON DISTRIBUTION NETWORK COMMUNICATION

  • V. RAJESWARI;T. NITHIYA
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.4
    • /
    • pp.861-868
    • /
    • 2023
  • Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x(a,b)→ax2+bx2 = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

Simulation of Storage Capacity Analysis with Queuing Network Models (큐잉 네트워크 모델을 적용한 저장용량 분석 시뮬레이션)

  • Kim, Yong-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.221-228
    • /
    • 2005
  • Data storage was thought to be inside of or next to server cases but advances in networking technology make the storage system to be located far away from the main computer. In Internet era with explosive data increases, balanced development of storage and transmission systems is required. SAN(Storage Area Network) and NAS(Network Attached Storage) reflect these requirements. It is important to know the capacity and limit of the complex storage network system to got the optimal performance from it. The capacity data is used for performance tuning and making purchasing decision of storage. This paper suggests an analytic model of storage network system as queuing network and proves the model though simulation model.

  • PDF

Merged-Packet based Effective Queuing Mechanism for Underwater Networks (결합패킷 활용기반 수중네트워크 전송 큐 관리 기법)

  • Shin, Soo Young;Park, Soo-Hyun;Namgung, Jung Il
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.2
    • /
    • pp.61-67
    • /
    • 2017
  • In this paper, an adaptive MAC technique for various underwater environment with narrow-bandwidth and low transmission speed was proposed. In previously published Underwater Packet Flow Control (UPFC) technique, three transmission types (normal, block and parallel transmission) had been proposed using the number of transmission and transmission time. In addition to the UPFC, the proposed technique is an improved version of UPFC having more effective queuing technique for merge transmission. A mathematical model of the proposed queuing theory was constructed and its increased efficiency per unit transmission number was also verified based on simulations.

A Generalized Markov Chain Model for IEEE 802.11 Distributed Coordination Function

  • Zhong, Ping;Shi, Jianghong;Zhuang, Yuxiang;Chen, Huihuang;Hong, Xuemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.2
    • /
    • pp.664-682
    • /
    • 2012
  • To improve the accuracy and enhance the applicability of existing models, this paper proposes a generalized Markov chain model for IEEE 802.11 Distributed Coordination Function (DCF) under the widely adopted assumption of ideal transmission channel. The IEEE 802.11 DCF is modeled by a two dimensional Markov chain, which takes into account unsaturated traffic, backoff freezing, retry limits, the difference between maximum retransmission count and maximum backoff exponent, and limited buffer size based on the M/G/1/K queuing model. We show that existing models can be treated as special cases of the proposed generalized model. Furthermore, simulation results validate the accuracy of the proposed model.

A Case Study on BIM Operating and Performance Measurement in Construction Phase (시공현장 BIM 운영 및 성과측정을 위한 사례분석)

  • Ham, Nam-Hyuk;Kim, Jae-Jun
    • Journal of KIBIM
    • /
    • v.5 no.2
    • /
    • pp.1-11
    • /
    • 2015
  • Despite a lot of research on BIM, there is no quantitative study to measure accurately the performance of BIM coordination service. Thus, this study suggested method to measure the performace of BIM coordination services, applying queueing models in the field of management science. To analyze queuing system of BIM coordination services, a group of BIM coordinator were selected. Through focus group interviews with experts were used in the analysis to derive mean arrival rate(${\lambda}$), mean service rate(${\mu}$) of BIM coordination services. Single-server queuing model(M/M/1), multiple server queuing model(M/M/s) is utilized for the BIM coordination services performance measurement in construction phase. This study has significant quantitative performance measurement approaches that can be utilized in the decision-making for the improvement of the BIM coordination services and to support the review of the alternatives accordingly. But There is a limit but it is difficult to take into account the increase or decrease of the cost of alternatives according to the review.

The Analysis of Priority Output Queuing Model by Short Bus Contention Method (Short Bus contention 방식의 Priority Output Queuing Model의 분석)

  • Jeong, Yong-Ju
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.459-466
    • /
    • 1999
  • I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

  • PDF

Analysis of 3D Laser Scanner Input Performance in Structual Safety Diagnosis (구조안전진단에서의 3D 레이저 스캐너 투입 성과 분석)

  • Seong, Do-Yun;Baek, In-Soo;Kim, Jea-Jun;Ham, Nam-Hyuk
    • Journal of KIBIM
    • /
    • v.11 no.3
    • /
    • pp.34-44
    • /
    • 2021
  • This study quantitatively analyzes the work performance of the structural safety diagnosis team that diagnoses pipe racks. To this end, a method for evaluating the performance of the structural safety diagnosis team using the queuing model was proposed. For verification, the case of applying the existing method and the method of introducing a 3D laser scanner for one site was used. The period, number of people, and initial investment cost of each project were collected through interviews with case project experts. As a result of analyzing the performance of the structural safety diagnosis team using the queuing model, it was possible to confirm the probability of delay in the work of each project and the amount of delayed work. Through this, the cost (standby cost) when the project was delayed was analyzed. Finally, economic analysis was conducted in consideration of the waiting cost, labor cost, and initial investment cost. The results of this study can be used to decide whether to introduce 3D laser scanners.

CONTINUOUS-TIME MARKOV MODEL FOR GERIATRIC PATIENTS BEHAVIOR. OPTIMIZATION OF T도 BED OCCUPANCY AND COMPUTER SIMULATION

  • Gorunescu, Marina;Gorunescu, Florin;Prodan, Augustin
    • Journal of applied mathematics & informatics
    • /
    • v.9 no.1
    • /
    • pp.185-195
    • /
    • 2002
  • Previous research has shown that the flow of patients around departments of geriatric medicine and ex-patients in the community may be-modelled by the application of a mixed-exponential distribution. In this proper we considered a ave-compartment model using a continuous-time Markov process to describe the flow of patients. Using a M/ph/c queuing model, we present a way of optimizing the number of beds in order to maintain an acceptable delay probability a sufficiently low level. Finally, we constructed a Java computer simulation, using data from St George's Hospital, London.

Queuing Analysis of Opportunistic in Network Selection for Secondary Users in Cognitive Radio Systems

  • Tuan, Le Ahn;Hong, Choong-Seon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06d
    • /
    • pp.265-267
    • /
    • 2012
  • This paper analyzes network selection issues of secondary users (SUs) in Cooperative Cognitive Radio Networks (CRNs) by utilizing Queuing Model. Coordinating with Handover Cost-Based Network selection, this paper also addresses an opportunity for the secondary users (SUs) to enhance QoS as well as economics efficiency. In this paper, network selection of SUs is the optimal association between Overall System Time Minimization Problem evaluation of Secondary Connection (SC) and Handover Cost-Based Network selection. This will be illustrated by simulation results.