• 제목/요약/키워드: queuing models

검색결과 42건 처리시간 0.021초

Bandwidth Management of WiMAX Systems and Performance Modeling

  • Li, Yue;He, Jian-Hua;Xing, Weixi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제2권2호
    • /
    • pp.63-81
    • /
    • 2008
  • WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, large service coverage, and flexible quality of services (QoS). Due to the large number of connections and flexible QoS supported by WiMAX, the uplink access in WiMAX networks is very challenging since the medium access control (MAC) protocol must efficiently manage the bandwidth and related channel allocations. In this paper, we propose and investigate a cost-effective WiMAX bandwidth management scheme, named the WiMAX partial sharing scheme (WPSS), in order to provide good QoS while achieving better bandwidth utilization and network throughput. The proposed bandwidth management scheme is compared with a simple but inefficient scheme, named the WiMAX complete sharing scheme (WCPS). A maximum entropy (ME) based analytical model (MEAM) is proposed for the performance evaluation of the two bandwidth management schemes. The reason for using MEAM for the performance evaluation is that MEAM can efficiently model a large-scale system in which the number of stations or connections is generally very high, while the traditional simulation and analytical (e.g., Markov models) approaches cannot perform well due to the high computation complexity. We model the bandwidth management scheme as a queuing network model (QNM) that consists of interacting multiclass queues for different service classes. Closed form expressions for the state and blocking probability distributions are derived for those schemes. Simulation results verify the MEAM numerical results and show that WPSS can significantly improve the network’s performance compared to WCPS.

MQTT 기반 IoT 환경에서의 PCA와 LightGBM을 이용한 공격 탐지 및 분류 방안 (Attack Detection and Classification Method Using PCA and LightGBM in MQTT-based IoT Environment)

  • 이지구;이수진;김영원
    • 융합보안논문지
    • /
    • 제22권4호
    • /
    • pp.17-24
    • /
    • 2022
  • 최근 머신러닝 기반의 사이버 공격 탐지 및 분류 연구가 활발히 이루어지고 있으며, 높은 수준의 탐지 정확도를 달성하고 있다. 그러나 저 사양 IoT 기기, 대규모의 네트워크 트래픽 등은 IoT 환경에서 머신러닝 기반의 탐지모델 적용을 어렵게 하고 있다. 따라서 본 논문에서는 국방분야에서도 활용되고 있는 MQTT(Message Queuing Telementry Transport) IoT 프로토콜 환경에서 수집된 데이터세트를 대상으로, 차원축소 기법인 PCA(Principal Component Analysis)와 LightGBM(Light Gradient Boosting Model)을 이용하여 IoT 공격을 효울적으로 탐지 및 분류하는 방안을 제안하였다. 실험을 통해 제안하는 분류모델의 성능을 확인한 결과 원본 데이터세트를 약 15%로 축소하였음에도 원본 전체를 모두 사용한 모델과 거의 유사한 성능을 나타냈으며, 본 논문에서 선정한 4가지 차원축소기법과의 비교 평가에서도 가장 우수한 성능을 나타냈다.

A Performance Analysis Model of PC-based Software Router Supporting IPv6-IPv4 Translation for Residential Gateway

  • Seo, Ssang-Hee;Kong, In-Yeup
    • Journal of Information Processing Systems
    • /
    • 제1권1호
    • /
    • pp.62-69
    • /
    • 2005
  • This paper presents a queuing analysis model of a PC-based software router supporting IPv6-IPv4 translation for residential gateway. The proposed models are M/G/1/K or MMPP-2/G/1/K by arrival process of the software PC router. M/G/1/K is a model of normal traffic and MMPP-2/G/1/K is a model of burst traffic. In M/G/1/K, the arriving process is assumed to be a Poisson process, which is independent and identically distributed. In MMPP-2/G/1/K, the arriving process is assumed to be two-state Markov Modulated Poisson Process (MMPP) which is changed from one state to another state with intensity. The service time distribution is general distribution and the service discipline of the server is processor sharing. Also, the total number of packets that can be processed at one time is limited to K. We obtain performance metrics of PC-based software router for residential gateway such as system sojourn time blocking probability and throughput based on the proposed model. Compared to other models, our model is simpler and it is easier to estimate model parameters. Validation results show that the model estimates the performance of the target system.

동적 네트워크 로딩 방법 및 적용에 관한 연구 (Dynamic Network Loading Method and Its Application)

  • 한상진
    • 대한교통학회지
    • /
    • 제20권1호
    • /
    • pp.101-110
    • /
    • 2002
  • 본 연구는 통행배분 모형과 네트워크 로딩의 일반적인 원리 및 그 관계를 규명하고. 시간을 고려한 네트워크 로딩방법 즉, 동적네트워크 로딩 방법을 소개한다. 우선 본 연구에서는, 동적 네트워크 로딩을 올바로 구현하기 위해 인과성 (causality), FIFO(First-In-First-Out), 교통량전파(flow propagation), 교통류보존(flow conservation) 등의 조건이 만족되어야 함을 제기한다. 그리고, 구체적인 동적 네트워크 로딩 방법을 알고리즘 형식으로 설명하였으며, 이후 링크 비용함수로써 결정적 대기행렬모형을 도입하여 가상 네트워크 속에서 동적 네트워크 로딩이 어떻게 이루어지는지를 수치적으로 보여준다.

Performance Analysis of Distribution-based and Replication-based Model for High Performance Grid Information Service

  • Quan, Cheng-Hao;Kim, Hie-Cheol;Lee, Kang-Woo;Lee, Yong-Doo
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅲ
    • /
    • pp.1621-1624
    • /
    • 2003
  • As the entities participating Grid become larger, performance requirement for the LDAP-based GIS(Grid Information Service) goes beyond that provided by a stand-alone single LDAP server. This entails the exploration of distributed LDAP systems. This paper presents the performance evaluation respectively for a distribution-based and a replication-based LDAP model. The analysis is based on an analytic performance model for each distributed system which is obtained by applying the M/M/1 queuing model. The performance evaluation made to these analytic models reveals that the distribution-based and the replication-based model show a significant tradeoff in their performance with respect to the system size as well as the amount of system load.

  • PDF

Evaluation of Packet Loss Rate in Optical Burst Switching equipped with Optic Delay Lines Buffer

  • ;;황원주
    • 한국멀티미디어학회:학술대회논문집
    • /
    • 한국멀티미디어학회 2012년도 춘계학술발표대회논문집
    • /
    • pp.166-167
    • /
    • 2012
  • High packet loss rate and impatience of messages passing through optical switches are essential characteristics in Optical Burst Switching system equipped with Optic Delay Lines buffer, which have not been solved efficiently yet by current existing models. In order to capture both effects, this paper introduces an analytical model from the viewpoint of classical queuing theory with impatient customers. We then apply it to evaluate and compare two wavelength-sharing cases, (1) all delay lines share a common wavelength resource and (2) each wavelength is associated with a number of delay lines. Our numerical results suggest to implement the first case because of lower packet loss rate for a fairly broad range of traffic load.

  • PDF

경찰감사 기획과정시 관리과학기법 응용방안 (A Study on Applied Orientations of Management Science Technique in Police Audit Planning Process)

  • 김정헌;송건섭
    • 시큐리티연구
    • /
    • 제5호
    • /
    • pp.109-130
    • /
    • 2002
  • As proceeding Munmin and Kukmin's government, it is to bring in regionalism of genernal public administration and police administration, specialization, efficiency issue, demand inventing of audit technique to meet this trends. Especially, according to supporting qualitative improvement of the audit, its environment faced that orienting performance audit emphasis on not the legality but the efficiency more systematic and scientific theory or technique. In order to attain police audit's efficiency through performance audit, this study discussed that scientific management techniques should be applied police audit. Accordingly, the primary purpose of this study is to apply public audit to scientific management technique, bring to light limits in public sector(especially, police sector). To be efficiency audit(namely, performance audit), 1) OR techniques are explained linear programming, network modeling, PERT/CPM, queuing matrix model, simulation, 2) Statistical analysis methods are argued delphi technique, data envelopment analysis(DEA), analytic hierarchical process(AHP), time series analysis models etc.

  • PDF

Fitting acyclic phase-type distributions by orthogonal distance

  • Pulungan, Reza;Hermanns, Holger
    • Advances in Computational Design
    • /
    • 제7권1호
    • /
    • pp.37-56
    • /
    • 2022
  • Phase-type distributions are the distributions of the time to absorption in finite and absorbing Markov chains. They generalize, while at the same time, retain the tractability of the exponential distributions and their family. They are widely used as stochastic models from queuing theory, reliability, dependability, and forecasting, to computer networks, security, and computational design. The ability to fit phase-type distributions to intractable or empirical distributions is, therefore, highly desirable for many practical purposes. Many methods and tools currently exist for this fitting problem. In this paper, we present the results of our investigation on using orthogonal-distance fitting as a method for fitting phase-type distributions, together with a comparison to the currently existing fitting methods and tools.

Performance Modeling of an EPC Information Service System

  • Kim, So-Jung;Kang, Yong-Shin;Son, Kyung-Won;Lee, Yong-Han;Rhee, Jong-Tae;Hong, Sung-Jo
    • Industrial Engineering and Management Systems
    • /
    • 제9권3호
    • /
    • pp.285-293
    • /
    • 2010
  • To obtain visible and traceable information from the supply chain, HW/SW standards for the EPC global network, which process electronic product code (EPC) data read from Radio frequency identification (RFID) tags, are regarded as the de facto industry standard. Supply chain participants install information service systems and provide logistics information to partners by following the EPCglobal architecture framework. Although quality of service (QoS) is essential for providing dependable and scalable services as pointed out by Auto-ID Lab, only a few models for the performance analysis of QoS-related work have been developed in the context of EPC information service systems. Specifically, doing so allows alternative design choices to be tested in an easy and cost-effective manner and can highlight potential performance problems in designs long before any construction costs are incurred. Thus, in this study we construct a model of an EPC information service system for the purposes of performance analysis and designing a dependable system. We also develop a set of building blocks for analytical performance models. To illustrate how the model works, we determine the characteristics of an EPC information service system and then select a combination of these proven modeling concepts. We construct a performance model that considers the response time and shows how to derive meaningful performance values. Finally, we compare the analytical results to measurements of the EPC information service system.

무선 패킷 데이터를 위한 Burst switching의 모델링 및 분석 (Modeling and Analysis of Burst Switching for Wireless Packet Data)

  • 박경인;이채영
    • 대한산업공학회지
    • /
    • 제28권2호
    • /
    • pp.139-146
    • /
    • 2002
  • The third generation mobile communication needs to provide multimedia service with increased data rates. Thus an efficient allocation of radio and network resources is very important. This paper models the 'burst switching' as an efficient radio resource allocation scheme and the performance is compared to the circuit and packet switching. In burst switching, radio resource is allocated to a call for the duration of data bursts rather than an entire session or a single packet as in the case of circuit and packet switching. After a stream of data burst, if a packet does not arrive during timer2 value ($\tau_{2}$), the channel of physical layer is released and the call stays in suspended state. Again if a packet does not arrive for timerl value ($\tau_{1}$) in the suspended state, the upper layer is also released. Thus the two timer values to minimize the sum of access delay and queuing delay need to be determined. In this paper, we focus on the decision of $\tau_{2}$ which minimizes the access and queueing delay with the assumption that traffic arrivals follow Poison process. The simulation, however, is performed with Pareto distribution which well describes the bursty traffic. The computational results show that the delay and the packet loss probability by the burst switching is dramatically reduced compared to the packet switching.