• Title/Summary/Keyword: Queue Inference

Search Result 7, Processing Time 0.018 seconds

An Inference Method of a Multi-server Queue using Arrival and Departure Times (도착 및 이탈시점을 이용한 다중서버 대기행렬 추론)

  • Park, Jinsoo
    • Journal of the Korea Society for Simulation
    • /
    • v.25 no.3
    • /
    • pp.117-123
    • /
    • 2016
  • This paper presents inference methods for inner operations of a multi-server queue when historical data are limited or system observation is restricted. In a queueing system analysis, autocorrelated arrival and service processes increase the complexity of modeling. Accordingly, numerous analysis methods have been developed. In this paper, we introduce an inference method for specific situations when external observations exhibit autocorrelated structure and and observations of internal operations are difficult. We release an assumption of the previous method and provide lemma and theorem to guarantee the correctness of our proposed inference method. Using only external observations, our proposed method deduces the internal operation of a multi-server queue via non-parametric approach even when the service times are autocorrelated. The main internal inference measures are waiting times and service times of respective customers. We provide some numerical results to verify that our method performs as intended.

Ana1ysis of Unobservable Queueing Model with Arrival and Departure Points: LCFS (도착 및 이탈시점에 근거한 관측 불가능한 후입선출 대기행렬 모형의 분석)

  • Kim, Yun-Bae;Park, Jin-Soo
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.2
    • /
    • pp.75-81
    • /
    • 2007
  • Previous queue inference has been studied with some limits. Larson's inference engine, which is the basis for this paper, also processed with basic assumption that arrival process is poisson process. Our inference method, which relaxes the poisson process assumption, must be a useful tool for looking into unobservable inside of queueing systems, as well as calculating accurate system performance. This paper employs these inference methods and proves the validity. Then we apply this method to system analysis for more complicated models. At first, we suggest methods to system with known number of servers, then expand to unknown number of servers. For validating our inference approach, we run some simulation models and compare true values with our results.

  • PDF

Lyapunov-based Fuzzy Queue Scheduling for Internet Routers

  • Cho, Hyun-Cheol;Fadali, M. Sami;Lee, Jin-Woo;Lee, Young-Jin;Lee, Kwon-Soon
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.3
    • /
    • pp.317-323
    • /
    • 2007
  • Quality of Service (QoS) in the Internet depends on queuing and sophisticated scheduling in routers. In this paper, we address the issue of managing traffic flows with different priorities. In our reference model, incoming packets are first classified based on their priority, placed into different queues with different capacities, and then multiplexed onto one router link. The fuzzy nature of the information on Internet traffic makes this problem particularly suited to fuzzy methodologies. We propose a new solution that employs a fuzzy inference system to dynamically and efficiently schedule these priority queues. The fuzzy rules are derived to minimize the selected Lyapunov function. Simulation experiments show that the proposed fuzzy scheduling algorithm outperforms the popular Weighted Round Robin (WRR) queue scheduling mechanism.

Performance Management of Token Bus Networks for Computer Integrated Manufacturing (컴퓨터 통합생산을 위한 토큰버스 네트워크의 성능관리)

  • Lee, Sang-Ho;Lee, Suk
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.13 no.6
    • /
    • pp.152-160
    • /
    • 1996
  • This paper focuses on development and evaluation of a performance management algorithm for IEEE 802.4 token bus networks to serve large-scale integrated manufacturing systems. Such factory automation networks have to satisfy delay constraints imposed on time-critical messages while maintaining as much network capacity as possible for non-time-critical messages. This paper presents a network performance manager that adjusts queue capacity as well as timers by using a set of fuzzy rules and fuzzy inference mechanism. The efficacy of the performance management has been demonstrated by a series of simulation experiments.

  • PDF

Fuzzy Network Performance Manager for Token Bus Networks by timer & Queue Capacity Adjustment (큐용량과 시간 할당에 의한 토큰버스 네트워크의 퍼지 성능관리기)

  • Lee, Sang-Ho;Yoon, Jung-A;Lee, Seok
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.664-669
    • /
    • 1994
  • This paper focuses on development and implementation of a performance management algorithm for IEEE802.4 token bus networks to serve large-scale integrated manufacturing systems. Such factory automation networks have to satisgy delay constraints imposed on time-critical messages while maintaining as much network capacity as possible for non-time-critical messages. This paper presents a network perfomance manager that adjusts queue apacity as well as timers by using a set of fuzzy rules and fuzzy inference mechanism. The efficacy of the performance management has been demonstrated by a series of simulation experiments.

  • PDF

Hardware Implementation of a Logic Based Expert System for Power System Fault Diagnosis (전력계통 고장진단을 위한 논리기반 전문가시스템의 하드웨어 구현)

  • Park, Young-Moon;Jung, Queue-Wan
    • Proceedings of the KIEE Conference
    • /
    • 1997.07c
    • /
    • pp.930-932
    • /
    • 1997
  • Logic Based Expert System (LBES) has the advantage of real-time inference. This paper shows a LBES for fault diagnosis of power system and proposes the hardware implementation of LBES. Besides, having a power system topology in memory chip, proposed system is apt to be applicable to other system with low changing cost.

  • PDF

Analysis of Unobservable RSS Queueing Systems (관측불가능한 임의순서규칙 대기행렬시스템 분석)

  • Park, Jin-Soo;Kim, Yun-Bae
    • Journal of the Korea Society for Simulation
    • /
    • v.17 no.2
    • /
    • pp.75-82
    • /
    • 2008
  • The times of service commencement and service completion had been used for inferring the queueing systems. However, the service commencement times are difficult to measure because of unobservable nature in queueing systems. In this paper, for inferring queueing systems, the service commencement times are replaced for arrival times which can be easily observed. Determining the service commencement time is very important in our methods. The methods for first come first served(FCFS), last come first served(LCFS) queueing discipline are already developed in our previous work. In this paper, we extend to random selection for service(RSS) queueing discipline. The performance measures we used are mean queueing time and mean service time, the variances of two. The simulation results verify our proposed methods to infer queueing systems under RSS discipline.

  • PDF