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

검색결과 248건 처리시간 0.022초

버스정보 결측시 검지기 자료를 통한 버스 통행시간의 산정 (Estimation of Bus Travel Time Using Detector for in case of Missed Bus Information)

  • 손영태;김원기
    • 한국ITS학회 논문지
    • /
    • 제4권3호
    • /
    • pp.51-59
    • /
    • 2005
  • 버스의 서비스 질을 향상시키기 위해서 시행중인 버스정보시스템은 버스의 도착 예정시간을 산정하기 위해서 일정주기동안 통행한 버스의 데이터를 바탕으로 신경망 모형, 칼만필터링, 이동평균법등의 알고리즘을 사용하여 예측한다. 하지만 버스의 데이터 결측으로 인하여 버스의 도착 예정 시간을 산정하기 어려울 때는 버스의 시간대별 패턴 데이터를 구축하여 이를 활용하지만, 일반적으로 오차의 범위가 크다. 따라서 본 연구에서는 도착 예정 시간을 산정하기 위해 링크에 설치된 대기행렬 검지기 자료를 이용하여 버스의 링크통행 시간을 산정한다. CORSIM Version 5.1 시뮬레이션 패키지를 이용하여 검지기 지점 속도를 보정하여 검지기 지점속도를 바탕으로 버스의 통행시간을 산정한다.

  • PDF

Improvement in DRX Power Saving for Non-real-time Traffic in LTE

  • Kawser, Mohammad Tawhid;Islam, Mohammad Rakibul;Islam, Khondoker Ziaul;Islam, Mohammad Atiqul;Hassan, Mohammad Mehadi;Ahmed, Zobayer;Hasan, Rafid
    • ETRI Journal
    • /
    • 제38권4호
    • /
    • pp.622-633
    • /
    • 2016
  • A discontinuous reception (DRX) operation is included in the Long Term Evolution (LTE) system to achieve power saving and prolonged battery life of the user equipment. An improvement in DRX power saving usually leads to a potential increase in the packet delay. An optimum DRX configuration depends on the current traffic, which is not easy to estimate accurately, particularly for non-real-time applications. In this paper, we propose a novel way to vary the DRX cycle length, avoiding a continuous estimation of the data traffic when only non-real-time applications are running with no active real-time applications. Because a small delay in non-real-time traffic does not essentially impact the user's experience adversely, we deliberately allow a limited amount of delay in our proposal to attain a significant improvement in power saving. Our proposal also improves the delay in service resumption after a long period of inactivity. We use a stochastic analysis assuming an M/G/1 queue to validate this improvement.

칸반시스템에서 수요와 도착간격 변동에 따른 컨테이너 크기에 관한 시뮬레이션 연구 (A simulation study of container size based on the variance of demand and interarrival time in Kanban systems)

  • 손권익;함성호
    • 산업기술연구
    • /
    • 제19권
    • /
    • pp.301-312
    • /
    • 1999
  • The purpose of this paper is to study the effects of container size with multi-stage and multi-item on average inventory and customer service level in Kanban systems. We use the different distributions of demand and interarrival time for each item to show that we had better to change the container size depending on different type of item for this simulation study. The small lot size can be used for container size of a single item if there is no setup time. The container size should be identical with average order size as setup time increases. The fill rate increases if the container size is large with multi-item. However, it is difficult to establish the effective container size because the effects of the container size on the order queue time are not clear. It is suitable to use the average order size as the container size for each item if the variance of demand and interarrival time of each item is relatively small. It is effective to sue the average container size if the variance of them is relatively large.

  • PDF

사례분석을 활용한 시공단계 BIM 인력 투입 성과 분석 (Performance Analysis of BIM Labor using Case Analysis)

  • 김형진;유무영;김재준;최창식
    • 한국BIM학회 논문집
    • /
    • 제7권3호
    • /
    • pp.31-39
    • /
    • 2017
  • BIM is effective to improve the labor productivity of construction participants. From this point of view, it is important to analyze the outcome related with BIM Labor which covers most of the BIM investment costs. This research focuses on BIM RFI which is one of the major task of the BIM labor and analyze the outcomes. In addition, this research was quantitatively analyzed by the standby time and related cost caused by BIM labor, which affect the results of the project participants. To this end, analytical standby queue model was utilized to analyze the labor focusing on micros TASK. 11 projects were selected to analyze the results of BIM labor and RFI that the project participants requested to the BIM labor was collected. Through this, it collected variables for analyzing results, and Finally, we pulled out 4 projects for analysis. In this study, the basic results analysis of RFI processing of the BIM labor, the probabilistic analysis of BIM labor service status, and the economic analysis of BIM labor optimal inputs were performed by using the research model presented. The results of this study can be utilized to formulate the optimal strategy for BIM labor inputs(e.g. number of employees, level, time point, etc.) of the construction phase. Moreover, it can contribute to ensuring the credibility of the BIM ROI results by presenting the cost of BIM services in BIM ROI analysis and the standby cost of project participants.

방공작전 예비체계의 QoS 지원 (QoS Support in the Air Defense Alternative System)

  • 심동섭;이영란;김기형
    • 한국군사과학기술학회지
    • /
    • 제13권5호
    • /
    • pp.903-909
    • /
    • 2010
  • ADAS is the air defense control system performing air surveillance and identification of ROK and near air. This system is self-developed by Air Force, currently operated successfully as the alternative system of MCRC. ADAS processes converting and combining transferred the real time radar data detected by radars. additionally, it displays significant radar data as producing in tracks. Then, it uses the message queue for IPC(Inter Process Communication). the various tactical data processed in the server is ultimately send to the network management process through the message queue for transmitting to the weapon director console. the weapon director receives this transmitted tactical data through the console to execute air defense operations. However, there is a problem that data packet is delayed or lost since the weapon Director does not receive as the amount of tactical data from the server overflowed with air tracks and missions increased. This paper improved the algorism to display and transmit the various tactical data processed from ADAS server to numbers of the weapon director console in the real time without any delay or lost. Improved the algorism, established at exercise, the development server in the real operation network and the weapon director console, is proved by comparing the number of sending tactical data packets in the server and receiving packets in the weapon director.

Ethernet PON에서 서비스 클래스별 우선 순위를 고려한 상향 채널 대역 할당 기법 (A Design of Bandwidth Allocation Scheme with Priority Consideration for Upstream Channel of Ethernet PON)

  • 이호숙;유태환;문지현;이형호
    • 한국통신학회논문지
    • /
    • 제28권11A호
    • /
    • pp.859-866
    • /
    • 2003
  • 본 논문에서는 Ethernet PON에서 서비스 우선 순위를 고려한 상향 채널 대역 할당 기법을 설계하였다. 제안된 대역 할당 기법의 목적은 광 라인 장치인 OLT(Optical Line Termination) 또는 광 단말 장치인 ONU(Optical Network Unit)에서 전송 제어시 서비스의 우선 순위를 고려하도록 하여 차별화 된 전송 품질을 제공하는데 있다. 이를 위하여 OLT 측에 이중 스케줄링 기법을 적용하여 전송 지연에 민감한 서비스에 대해서는 고정 대역 할당기법을, 전송 지연에 덜 민감한 best-effort 서비스에 대해서는 동적 대역 할당 기법을 동시에 제공할 수 있도록 하고, 동적 대역 할당에 의해 허락된 전송 지속 시간 동안 ONU에서 트래픽 특성별로 계층화된 우선 순위를 적용하여 전송을 제어하도록 하였다. 따라서 제안된 전송 제어 알고리즘에 의해 T$_1$, E$_1$등의 고정 대역 서비스와 전용선 서비스, best-effort 서비스 내에서 실시간과 비 실시간 서비스 등을 서비스 특성에 따라 차별화 된 전송 품질로 제공할 수 있다. 본 논문에서는 OPNET을 이용한 모델링과 시뮬레이션 결과를 통해 기존 대역 할당 기법과 제안된 대역 할당 기법의 성능을 비교하였다.

Fog Computing 환경에서의 최적화된 컨테이너 배포 정책 (An Optimal Container Deployment Policy in Fog Computing Environments)

  • 진성근;전인걸
    • 한국산업정보학회논문지
    • /
    • 제26권3호
    • /
    • pp.1-7
    • /
    • 2021
  • Fog Computing (FC) 호스트의 새로운 요청 도착에 대처하기 위해 적절한 컨테이너가 배포된다. 이 경우 두 가지 시나리오를 고려할 수 있다. (1) 컨테이너 배포를 위한 충분한 자원이 준비될 때까지 요청이 대기열에 추가될 수 있다. (2) FC 호스트는 자원이 제한되거나 부족하여 새 컨테이너 배포를 수용할 수 없는 경우 도착한 서비스 요청을 근처 FC 호스트로 전송할 수 있다. 여기서, 더 많은 인접 FC 호스트를 사용할수록 각 FC 호스트의 컨테이너 배포 시간이 더 짧아 진다. 반면, FC 호스트 수가 증가할수록 더 많은 FC 호스트를 거쳐가야 하므로 서비스 요청이 전달되는데 더 긴 시간이 걸릴 수 있다. 이러한 이유로 활용되는 FC 호스트의 수에 따라 컨테이너 배포 시간에 따른 트레이드오프 관계가 성립한다. 결과적으로, 우리는 최적의 인접 FC 호스트 수를 사용하기 위해 트레이드오프 관계를 분석한다.

AN ANALYSIS OF MMPP/D1, D2/1/B QUEUE FOR TRAFFIC SHAPING OF VOICE IN ATM NETWORK

  • CHOI, DOO IL
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제3권2호
    • /
    • pp.69-80
    • /
    • 1999
  • Recently in telecommunication, BISDN ( Broadband Integrated Service Digital Network ) has received considerable attention for its capability of providing a common interface for future communication needs including voice, data and video. Since all information in BISDN are statistically multiplexed and are transported in high speed by means of discrete units of 53-octet ATM ( asynchronous Transfer Mode ) cells, appropriate traffic control needs. For traffic shaping of voice, the output cell discarding scheme has been proposed. We analyze the scheme with a MMPP/$D_1$, $D_2$/1/B queueing system to obtain performance measures such as loss probability and waiting time distribution.

  • PDF

Stochastic Traffic Congestion Evaluation of Korean Highway Traffic Information System with Structural Changes

  • Lee, Yongwoong;Jeon, Saebom;Park, Yousung
    • Asia pacific journal of information systems
    • /
    • 제26권3호
    • /
    • pp.427-448
    • /
    • 2016
  • The stochastic phenomena of traffic network condition, such as traffic speed and density, are affected not only by exogenous traffic control but also by endogenous changes in service time during congestion. In this paper, we propose a mixed M/G/1 queuing model by introducing a condition-varying parameter of traffic congestion to reflect structural changes in the traffic network. We also develop congestion indices to evaluate network efficiency in terms of traffic flow and economic cost in traffic operating system using structure-changing queuing model, and perform scenario analysis according to various traffic network improvement policies. Empirical analysis using Korean highway traffic operating system shows that our suggested model better captures structural changes in the traffic queue. The scenario analysis also shows that occasional reversible lane operation during peak times can be more efficient and feasible than regular lane extension in Korea.

3-노(盧)드 유한 버퍼 일렬대기행렬에서의 최적 버퍼 크기에 대한 분석 (Analysis of Optimal Buffer Capacities in 3-node Tandem Queues with Blocking)

  • 서동원
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
    • /
    • pp.881-889
    • /
    • 2005
  • In this study, we consider characteristics of waiting times in single-server 3-node tandem queues with a Poisson arrival process, finite buffers and deterministic or non-overlapping service times at each queue. There are three buffers: one at the first node is infinite and the others are finite. The explicit expressions of waiting times in all areas of the systems, which are driven as functions of finite buffer capacities, show that the sojourn time does not depend on the finite buffer capacities and also allow one to compute and compare characteristics of waiting times at all areas of the system under two blocking policies: communication and manufacturing blocking. As an application of these results, moreover, an optimization problem which determines the smallest buffer capacities satisfying predetermined probabilistic constraints on waiting times is considered. Some numerical examples are also provided.

  • PDF