• Title/Summary/Keyword: Input Waiting Time

Search Result 44, Processing Time 0.023 seconds

PERFORMANCE ANALYSIS OF THE LEAKY BUCKET SCHEME WITH QUEUE LENGTH DEPENDENT ARRIVAL RATES

  • Choi, Doo-Il;Lee, Sang-Min
    • Bulletin of the Korean Mathematical Society
    • /
    • v.43 no.3
    • /
    • pp.657-669
    • /
    • 2006
  • In this paper, we analyze a leaky bucket (LB) scheme with queue length dependent arrival rates. In other words, if the queue length exceeds an appropriate threshold value on buffer, the arrivals need to be controlled. In ATM networks, if the congestion occurs, the input traffics must be controlled (reduced) for congestion resolution. By the bursty and correlated properties of traffics, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the loss probability and the waiting time distribution for arbitrary cell. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effects of our proposed LB scheme.

QUEUEING ANALYSIS FOR TRAFFIC CONTROL WITH COMBINED CONTROL OF DYNAMIC MMPP ARRIVALS AND TOKEN RATES

  • Choi, Doo Il
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.17 no.2
    • /
    • pp.103-113
    • /
    • 2013
  • We analyze the queueing model for leaky bucket (LB) scheme with dynamic arrivals and token rates. In other words, in our LB scheme the arrivals and token rates are changed according to the buffer occupancy. In telecommunication networks, the LB scheme has been used as a policing function to prevent congestion. By considering bursty and correlated properties of input traffic, the arrivals are assumed to follow a Markov-modulated Poisson process (MMPP). We derive the distribution of system state, and obtain the loss probability and the mean waiting time. The analysis is done by using the embedded Markov chain and supplementary variable method. We also present some numerical examples to show the effect of our proposed model.

A Simulation Study Based on the Continuous Berth Utilization in Inchon Port (선석의 연속접안을 고려한 인천항의 시뮬레이션 연구)

  • 최현규;이창호
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2000.11a
    • /
    • pp.95-99
    • /
    • 2000
  • The domestic ports become less competitive for the out of dated equipments and inefficient information system. Specially, Inchon Port, which is the second largest port of Korea, has the point at issue such as the excessive logistics cost because of the limit of handling capacity and the chronic demurrage. In this paper to develope the simulation programs the basic input parameters such as arrival intervals, cargo tons, service rates are analyzed and the probability density functions for there variable are estimated. Also to perform the conception of continuous berth utilization, the berth and cargo classification is reconstructed. And the more actual simulation is realized by using more detailed depth representation of water The simulation model is executed based on the knowledge base and database, and is constructed using Visual Basic and Access database. Simulation results reveal that this study suitably reflect the real berth operation and waiting time of ships is shortened.

  • PDF

A discrete Time Priority Queueing Model with Bursty Arrivals (돌발적인 도착이 있는 우선순위 이산 큐잉 모델)

  • 이미정
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.10
    • /
    • pp.2014-2027
    • /
    • 1994
  • A queueing model with two input streams of different service priorities is studied. Specifically, IBP+BP/D/1 with head-of-line priority is analyzed. IBP and BP stand for Interrupted Bernoulli Process and Bernoulli Process respectively. The BP-stream customers have the higher service priority over the IBP-stream customers. An exact analysis of this priority queue is presented to derive the distributions of the state of the system at steady state, the waiting time distributions for each class of customers, and the interdeparture time distributions. The numerical results of the analysis are presented to show how the various parameters of the low and high priority arrival processes affect the performance of the system.

  • PDF

Development of A Traffic Network Controller using Fuzzy Logic (퍼지 논리를 사용한 교통망 제어기의 개발)

  • Kim, Jong-Wan;Han, Byung-Joon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2908-2914
    • /
    • 1998
  • This paper presents an intelligent signal for controling the traffic lights on traffic junction network with dynamic traffic flow, When a junction is connected to adjacent junctions on four sides. Prior researches have been done on the single traffic junction. However, it is dificult to apply single junction controller to real traffic situation. In this paper, we develop a fuzzy taffic network controller which adjusts the extension time of current green phase by using teh fuzzy input variables such as the number of entering cars at the green light, the number of waiting cars during the red light, and the traffic volume. The proposed method was compared to the existing junction signal control methods on controllers in terms of average delay time of cars and the cost function defined in this paper.

  • PDF

Performance Analysis of Futurebus+ based Multiprocessor Systems with MESI Cache Coherence Protocol (MESI 캐쉬 코히어런스 프로토콜을 사용하는 Futurebus+ 기반 멀티프로세서 시스템의 성능 평가)

  • 고석범;강인곤;박성우;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.12
    • /
    • pp.1815-1827
    • /
    • 1993
  • In this paper, we evaluate the performance of a Futurebus based multiprocessor system with MESI cache coherence protocol for four bus transaction types. Graphical symbols and compiler of SLAM II are used in modeling and simulation. A steady-state probability of each state for MESI protocol is computed by a Markov chain. The probability of each state is used as an input value for a correct simulation. Processor utilization, memory utilization, bus utilization, and the waiting time for bus arbitration are measured in terms of the number of processors, the hit ratio of cache memory, the probability of internal operation, and bus bandwidth.

  • PDF

The Development of Medical Information Management System of Radiation Oncology Department (방사선종양학과 의료정보관리시스템 개발)

  • Lee, Dong-Hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.655-662
    • /
    • 2010
  • By using lotus notes server-client system, the database related to general information of cancer patients, radiation treatment simulation, cancer treatment information and all kinds of information of radiation oncology department need to be developed for effective information management and also user interface was developed for input and output of information. This database also could be used for clinical study, patient care research and medical education. By the development of this electronic chart of the department of radiation oncology, the clinic datum and medical information management could be connected effectively and treatment information according to treatment machine also could be acquired and contributed for improving treatment efficiency, cutting down the waiting time for clinic.

A Fuzzy Traffic Controller with Asymmetric Membership Functions (비대칭적인 소속 함수를 갖는 퍼지 교통 제어기)

  • Kim, Jong-Wan;Choi, Seung-Kook
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2485-2492
    • /
    • 1997
  • Nowadays the traffic conditions have been getting worse due to continuous increase in the number of vehicles. So it has become more important to manage traffic signal lights efficiently. Recently fuzzy logic is introduced to control the cycle time of traffic lights adaptively. Conventional fuzzy logic controller adjusts the extension time of current green phase by using the fuzzy input variables such as the number of entering vehicles at the green light and the number of waiting vehicle during the red light. However this scheme is inadequate for an intersection with variable traffic densities. In this paper, a new FLC with asymmetric membership functions that reflects more exactly traffic flows than other FLCs with symmetric ones regardless of few control rules is propsed. The effectiveness of the proposed method was shown through simulation of a single intersection. The experimental results yielded the superior performance of the proposed FLC in terms of the average delay time, the number of passed vehicles, and the degree of saturation.

  • PDF

SDINS Closed Loop Self-Alignment Algorithm using Pseudo Initial Position (가상의 초기위치를 이용한 SDINS 폐루프 자체 정렬 알고리즘)

  • Kim, Taewon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.45 no.6
    • /
    • pp.463-472
    • /
    • 2017
  • Inertial Navigation System Alignment is the process to determine direction cosine matrix which is the transformation matrix between the INS body frame and navigation frame. INS initial position value is necessary to INS attitude calculation, so that user should wait until he get such value to start the INS alignment. To remove the waiting time, we propose an alignment algorithm that immediately starts after the INS power on by using pseudo initial position input and then is completed with attitude error compensation by entering true position later. We analyse effect of INS sensor error on attitude in process of time and verify the performance and usefulness of the close-loop alignment algorithm which corrects attitude error from the change of initial position.

Unifying User Requests for Multimedia Storage Systems (멀티미디어 저장 시스템을 위한 사용자 요청 통합)

  • Hwang, In-Jun
    • Journal of KIISE:Databases
    • /
    • v.29 no.1
    • /
    • pp.15-26
    • /
    • 2002
  • Most work on multimedia storage systems has assumed that client will be serviced using a round-robin strategy. The server services the clients in rounds and each client is allocated a time slice within that round. Furthermore, most such algorithms are evaluated on the basis of a tightly coupled cost function. This is the basis of well-known algorithm such as FCFS, SCAN, SCAN-EDF, etc. In this paper, we describe a scheduling module called Request Unifier(RU) that takes as input, a set of client request, and a set of constraints on the desired performance such as client waiting time or maximum disk bandwidth, and a cost function. It produces as output a Unified Read Request(URR), telling the storage server which data items to read and when these data items to be delivered to the clients. Given a cost function, a URR is optimal if there is no other URR satisfying the constraints with a lower cost. We present three algorithms in this paper that can accomplish this kind of request merging and compare their performance through an experimental evaluation.