• 제목/요약/키워드: Queue

검색결과 1,258건 처리시간 0.029초

과포화 시 대기행렬길이 균형화를 통한 교통신호제어 전략수립 (Development of Traffic Signal Control Strategy by Balancing Queue Lengths for Oversaturated Traffic Condition)

  • 김홍진;김영찬;김정현
    • 한국ITS학회 논문지
    • /
    • 제2권2호
    • /
    • pp.13-22
    • /
    • 2003
  • 기존의 신신호 시스템에서 문제점으로 지적되고 있는 과포화 상태에서의 신호제어전략을 개선할 수 있는 방안으로서, 기존의 포화도를 기준으로 한 방식이 아닌 대기행렬의 길이를 균형화 하는 방식을 개발하였다. 이 방식은 대기행렬의 길이를 각 방향별로 동일하게 유지하면서 전체적인 대기행렬의 길이를 감소시킬 수 있는 것으로 나타났다. 또한 이 방식을 신호주기 산출 및 현시분할에도 적용하는 방법을 개발하였다. 이 방식은 기존의 방식과 비교하여 거시적으로는 대기행렬의 길이를 감소시킴과 동시에 미시적으로는 차량의 평균지체를 감소시키는 효과를 나타내었다.

  • PDF

A Dynamic Queue Management for Network Coding in Mobile Ad-hoc Network

  • Kim, Byun-Gon;Kim, Kwan-Woong;Huang, Wei;Yu, C.;Kim, Yong K.
    • International journal of advanced smart convergence
    • /
    • 제2권1호
    • /
    • pp.6-11
    • /
    • 2013
  • Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.

일반적 큐의 큐길이 분포에 대한 근사방법 M+$\Sigma$NjDj/M/1 큐에의 응용 (Approximate Queue Length Distribution of General Queues: Application to The M+$\Sigma$NjDj/M/1 Queue)

  • 이규석;김영섭;박홍식
    • 한국통신학회논문지
    • /
    • 제19권5호
    • /
    • pp.833-841
    • /
    • 1994
  • 본 논문에서는 일반적인 큐잉 시스팀의 큐길이 분포에 대한 근사 이론을 제안하였다. 제안된 근사 이론은 하한치와 상한치를 단계적으로 찾는 2단계 해석적인 근사 방법을 기초로 한다. 이를 이용하면 다양한 트래픽원이 다중화된 모델의 큐길이 분포를 신속히 계산할 수 있다. 본 논문에서는 M+ N D /M / 1 큐잉 시스팀에서 도착하는 고객이나 떠나는 고객이 관측한 큐길이 분포를 계산하고 시뮬레이션을 통해 얻은 결과와 비교하여 제안된 근사이론이 시뮬레이션 결과에 근접함을 확인하였다. 특히 M/M/1큐에 대해 근사이론으로 유도된 공식은 정해와 같았으며, D/M/1 큐에 대해서는 간단한 해석적인 공식을 얻을 수 있었다.

  • PDF

확산 Markov 프로세스 모델을 이용한 Queueing System 기반 지능 부하관리에 관한 연구 (A Study on the Intelligent Load Management System Based on Queue with Diffusion Markov Process Model)

  • 김경동;김석현;이승철
    • 전기학회논문지
    • /
    • 제58권5호
    • /
    • pp.891-897
    • /
    • 2009
  • This paper presents a novel load management technique that can lower the peak demand caused by package airconditioner loads in large apartment complex. An intelligent hierarchical load management system composed of a Central Intelligent Management System(CIMS) and multiple Local Intelligent Management Systems(LIMS) is proposed to implement the proposed technique. Once the required amount of the power reduction is set, CIMS issues tokens, which can be used by each LIMS as a right to turn on the airconditioner. CIMS creates and maintains a queue for fair and proper allocation of the tokens among the LIMS requesting tokens. By adjusting the number tokens and queue management policies, desired power reduction can be achieved smoothly. The Markov Birth and Death process and the Balance Equations utilizing the Diffusion Model are employed for evaluation of queue performances during transient periods until the static balances among the states are achieved. The proposed technique is tested using a summer load data of a large apartment complex and give promising results demonstrating the usability in load management while minimizing the customer inconveniences.

Analyzing the Impact of Social Distancing on the Stoning Ritual of the Islamic Pilgrimage

  • Ilyas, Qazi Mudassar;Ahmad, Muneer;Jhanjhi, Noor Zaman;Ahmad, Muhammad Bilal
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권6호
    • /
    • pp.1953-1972
    • /
    • 2022
  • The COVID-19 pandemic has resulted in a profound impact on large-scale gatherings throughout the world. Social distancing has become one of the most common measures to restrict the spread of the novel Coronavirus. Islamic pilgrimage attracts millions of pilgrims to Saudi Arabia annually. One of the mandatory rituals of pilgrimage is the symbolic stoning of the devil. Every pilgrim is required to perform this ritual within a specified time on three days of pilgrimage. This ritual is prone to congestion due to strict spatiotemporal requirements. We propose a pedestrian simulation model for implementing social distancing in the stoning ritual. An agent-based simulation is designed to analyze the impact of inter-queue and intra-queue spacing between adjacent pilgrims on the throughput and congestion during the stoning ritual. After analyzing several combinations of intra-queue and inter-queue spacings, we conclude that 25 queues with 1.5 meters of intra-queue spacing result in an optimal combination of throughput and congestion. The Ministry of Hajj in Saudi Arabia may benefit from these findings to manage and plan pilgrimage more effectively.

신호교차로 분석시 초기대기행렬이 총지체도에 미치는 영향에 관한 연구 (The Study on Effects Caused by the Initial Queue to the Total Delay Estimation in Analyzing Signalized Intersection)

  • 박순표;김기혁
    • 대한토목학회논문집
    • /
    • 제29권5D호
    • /
    • pp.563-570
    • /
    • 2009
  • 본 연구는 신호교차로 분석시 추가지체 산정을 위하여 적용하는 초기 대기차량이 총 지체도에 얼마나 영향을 미치는지 분석하기 위한 목적으로 실시하였다. 평균교차로 지체시간을 측정하기위하여 통과차량과 대기행렬이 측정되었다. 분석결과, 시험차량의 평균 지체도가 60초/대 미만 일 경우에는 세가지 지체도 산정방법이 모두 유사한 것으로 분석되었으나, 60~70초/대는 초기 대기차량을 적용한 지체도만 시험차량의 평균지체도와 유사한 것으로 분석되었다.

ANALYSIS OF DYNAMIC PRIORITY QUEUE WITH APPLICATIONS IN ATM NETWORKS

  • Choi, Doo-Il;Lee, Yu-Tae
    • Journal of applied mathematics & informatics
    • /
    • 제7권2호
    • /
    • pp.617-627
    • /
    • 2000
  • ATM networks support diverse traffic types with different service requirement such as data, voice, video and image. This paper analyzes a dynamic priority queue to satisfy Quality of Service (QoS) requirements of traffic. to consider the burstiness of traffic, we assume the arrival to be a Markovian arrival process(MAP) . Performance measures such as loss and delay are derived, Finally, some numerical results show the performance of the system.

ON APPROXIMATIONS FOR GI/G/c RETRIAL QUEUES

  • Shin, Yang Woo;Moon, Dug Hee
    • Journal of applied mathematics & informatics
    • /
    • 제31권1_2호
    • /
    • pp.311-325
    • /
    • 2013
  • The effects of the moments of the interarrival time and service time on the system performance measures such as blocking probability, mean and standard deviation of the number of customers in service facility and orbit are numerically investigated. The results reveal the performance measures are more sensitive with respect to the interarrival time than the service time. Approximation for $GI/G/c$ retrial queues using $PH/PH/c$ retrial queue is presented.

Sliding Mode Active Queue Management Algorithm

  • Roudsari, Farzad Habibipour;Jalili-Kharaajoo, Mahdi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.227-231
    • /
    • 2004
  • In this paper, a robust Sliding Mode Variable Structure (SMVS) controller is designed for Active Queue Management (AQM). This type of controller is insensitive to noise and variance of the parameters, thus it is suitable to time varying network systems. Simulation results conform the robust performance of SMVS controller against the disturbance. At the same time, a complete comparison between SMVS and PI controllers is made. The conclusion is that both transient and steady state performance of SMVS controller is better than that of PI one.

  • PDF

BUSY PERIOD DISTRIBUTION OF A BATCH ARRIVAL RETRIAL QUEUE

  • Kim, Jeongsim
    • 대한수학회논문집
    • /
    • 제32권2호
    • /
    • pp.425-433
    • /
    • 2017
  • This paper is concerned with the analysis of the busy period distribution in a batch arrival $M^X/G/1$ retrial queue. The expression for the Laplace-Stieltjes transform of the length of the busy period is well known, but from this expression we cannot compute the moments of the length of the busy period by direct differentiation. This paper provides a direct method of calculation for the first and second moments of the length of the busy period.