• Title/Summary/Keyword: 도착율

Search Result 141, Processing Time 0.025 seconds

Study on the Appropriate Time for Leading Pedestrian Intervals (보행자 우선 출발신호의 적정 시간 산출 연구)

  • Kim, Daekyung;Yoon, Suyoung;Yoon, Jinsoo;Kim, Sang-Ock;Yun, Ilsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.19 no.3
    • /
    • pp.1-13
    • /
    • 2020
  • When pedestrians cross a pedestrian crossing during a pedestrian signal, there is a problem that pedestrians are exposed to the danger of traffic accidents due to permissive-left turning and right-turning vehicles. In order to solve this problem, there is an increasing demand to improve the traffic signal system to increase pedestrian safety at the signal crossing. This study aims to examine the feasibility of introducing a leading pedestrian interval(LPI) to prevent conflict between unprotected left and right turn vehicles and pedestrians. In this study, the need for LPI was surveyed by experts and the general public. As a result of the survey, many opinions indicated that the introduction of LPI was necessary. In addition, after selecting the non-protected left and right turn pilot operation targets, LPI was installed on two signal intersections. After installation, the speed analysis of the arrival vehicle in the pedestrian crossing and the violation rate of the pedestrian signal were analyzed. As a result of analysis, when the walking signal was equalized, the speed of the arriving vehicle in the pedestrian crossing was reduced, and the violation rate of the walking signal was improved.

Design and Evaluation of a Reservation-Based Hybrid Disk Bandwidth Reduction Policy for Video Servers (비디오 서버를 위한 예약기반 하이브리드 디스크 대역폭 절감 정책의 설계 및 평가)

  • Oh, Sun-Jin;Lee, Kyung-Sook;Bae, Ihn-Han
    • The KIPS Transactions:PartB
    • /
    • v.8B no.5
    • /
    • pp.523-532
    • /
    • 2001
  • A Critical issue in the performance of a video-on-demand system is the required I/O bandwidth of the Video server in order to satisfy clients requests, and it is the crucial resource that may cause delay increasingly. Several approaches such as batching and piggybacking are used to reduce the I/O demand on the video server through sharing. Bathing approach is to make single I/O request for storage server by grouping the requests for the same object. Piggybacking is th policy for altering display rates of requests in progress for the same object to merge their corresponding I/O streams into a single stream, and serve it as a group of merged requests. In this paper, we propose a reservation-based hybrid disk bandwidth reduction policy that dynamically reserves the I/O stream capacity of a video server for popular videos according to the loads of video server in order to schedule the requests for popular videos immediately. The performance of the proposed policy is evaluated through simulations, and is compared with that of bathing and piggybacking. As a result, we know that the reservation-based hybrid disk bandwidth reduction policy provides better probability of service, average waithing time and percentage of saving in frames than batching and piggybacking policy.

  • PDF

A Distributed Real-Time Concurrency Control Scheme using Transaction the Rise of Priority (트랜잭션 우선 순위 상승을 이용한 분산 실시간 병행수행제어 기법)

  • Lee, Jong-Sul;Shin, Jae-Ryong;Cho, Ki-Hyung;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.484-493
    • /
    • 2001
  • As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

  • PDF

A Scheduling Method to Ensure a Stable Delay Variation of Video Streaming Service Traffic (영상 스트리밍 서비스 트래픽의 안정적인 전달 지연변이 보장을 위한 스케줄링 방안)

  • Kim, Hyun-Jong;Choi, Won-Seok;Choi, Seong-Gon
    • The KIPS Transactions:PartC
    • /
    • v.18C no.6
    • /
    • pp.433-440
    • /
    • 2011
  • In this paper, we propose a new scheduling method that can guarantee reliable jitter by minimizing the queue length variation in the streaming service provisioning such as IPTV and VoD. The amount of traffic to be delivered within a certain time is very fluid because MPEG-4 and H.264 encoders use VBR(Variable Bit Rate) for delivering video streaming traffic. This VBR characteristic increases the end-to-end propagation delay variation when existing scheduling methods are used for delivering video frames. Therefore, we propose the new scheduling method that can minimize change rate of queue length by adaptively controling service rate taking into account the size of bulk incoming packets and arrival rate for bulk streaming traffic. Video frames can be more reliably transmitted through the minimization of the queue length variation using the proposed method. We use the queueing model and also carry out OPNET simulation to validate the proposed method.

ATM 교환기 연결 절단율 추정을 위한 시뮬레이터 개발

  • 정명기;고재상;최성훈
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1997.04a
    • /
    • pp.65-65
    • /
    • 1997
  • 가입자가 B-ISDN(Broadband Integrated Services Digital Network) 서비스에 대한 shb은 수준의 품질 및 안정적인 서비스 제공을 요구함에 따라, 이러한 서비스를 제공하기 위한 ATM (Asynchronous Transfer Mode) 교환기에 대한 신뢰성 설계의 중요성은 증가하 고 있다. 교환기의 중요한 신뢰성 성능 척도 중의 하나인 연결 절단율 (Cutoff connection rate)은 총 연결시간 동안 절단된 연결수로 정의되며, 연결 절단은 호 설정 (Call setup) 단 계를 지나 서비스 중인 연결이 사용자의 요구가 아닌 시스템의 고장으로 종료될 때 발생한 다. 연결 절단율 추정 문제는 기존의 신뢰도 또는 가용도 예측을 위한 시뮬레이션과는 달리 시스템 구성 유니트들의 고장율, 수리율, 그리고 요구된 연결의 트래픽 특성 부분이 혼합된 문제이다. 따라서, B-ISDN 서비스의 중요한 특징인 다양한 트래픽 특성과 시스템의 구성 (Configuration)을 고려하여 연결 절단율을 해석적인 방법을 통하여 추정하는 데네는 어려 움이 있으며 시뮬레이션에 의한 방법이 적절하다. 본 고에서는 B-ISDN 서비스의 트래픽 특 성과 ATM 교환기의 시스템 구성 및 신뢰도 데이터로부터 시스템의 연결 절단율을 추정하 기 위한 시뮬레이터의 기능 및 구조, 시뮬레이션 수행 결과 등을 제시한다. 시뮬레이터는 AweSim 시뮬레이션과 CUser Written Code를 사용하여 개발하였다. 시뮬레이터의 구성 모듈은 크게 호 도착 모듈, 연결 제어 및 자원 할당 모듈, 유니트 고장 및 수리 모듈, 통계 량 수집 모듈 등으로 구성된다. 개발된 시뮬레이터는 B-ISDN 트래픽 파라메터와 연결 절단 율의 상호 관계 규명 및 시스템 설계 대안 (Design alternatives)에 대한 비교/평가에 활용 된다., 수중생물의 경우는 특히 수온, 수량 영양원등이다.(중략). 본 연구의 접근방법으로는 ASRS의 개념적인 Reference Model을 수립하고 이 Reference Model에 대한 Formal Model로 DEVS(Discrete Event System Specification)을 이용하여 시스템을 Modeling하였다. 이의 Computer Simulation을 위하여 DEVS형식론 환경에서의 Simulation Language인 DEVSim ++ⓒ를 이용하여 시스템을 구현하였다.. 실형 결과로는 먼저 선형 상미분방정식의 예로 mass-damper-spring system, 비선형 상미분방정식의 예로는 van der Pol 방정식, 연립 상미분방정식의 예로는 mixing tank problem 등을 보였으며, 그의 공학에서 일어나는 여러 가지 문제들도 다루었다.화물에 대한 방어력이 증가되어 나타난 결과로 여겨지며, 또한 혈청중의 ALT, ALP 및 LDH활성을 유의성있게 감소시키므로서 감잎 phenolic compounds가 에탄올에 의한 간세포 손상에 대한 해독 및 보호작용이 있는 것으로 사료된다.반적으로 홍삼 제조시 내공의 발생은 제조공정에서 나타나는 경우가 많으며, 내백의 경우는 홍삼으로 가공되면서 발생하는 경우가 있고, 인삼이 성장될 때 부분적인 영양상태의 불충분이나 기후 등에 따른 영향을 받을 수 있기 때문에 앞으로 이에 대한 많은 연구가 이루어져야할 것으로 판단된다.태에도 불구하고 [-wh]의미의 겹의문사는 병렬적 관계의 합성어가 아니라 내부구조를 지니지 않은 단순한 단어(minimal $X^{0}$ elements)로 가정한다. 즉, [+wh] 의미의 겹의문사는 동일한 구성요 소를 지닌 병렬적 합성어([$[W1]_{XO-}$ $[W1]_{XO}$ ]$_{XO}$

  • PDF

The Study of Bus Information System's Efficiency (버스정보시스템의 효율성에 관한 연구)

  • Lee, Jeong-Keun;Choi, Suk-Woo;Hwang, Beyung-Ok
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.5 no.3 s.11
    • /
    • pp.1-12
    • /
    • 2006
  • Nowdays ITS is being installed in each local autonomous entity, and BIS installation and operation is prior to other ITS sub systems for the public service. The methods of positioning md wireless communication in BIS are DSRC+DSRC, GPS+wireless communication, Beacon+Beacon, which are chosen and operated as the local features. Before this study, the before and after survey of BIS' quality have only been done without performance evaluation of BIS. So the method of BIS' evaluation have been established including performance test in this paper. And the evaluation of some BIS' reliability and efficiency have been done using the reliability of arriving data and the wireless communication response rates after choosing typical BIS' sub system.

  • PDF

QoS Improvement Analysis Call Admission Control(CAC) Algorithm based on 3GPP PBNM (3GPP 정책기반에서 호 수락 제어(CAC) 알고리즘 적용에 따른 QoS 성능개선)

  • Song, Bok-Sob;Wen, Zheng-Zhu;Kim, Jeong-Ho
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.4
    • /
    • pp.69-75
    • /
    • 2012
  • In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

Fuzzy Logic Based Buffer Management Algorithm to Improve Performance of Internet Traffic over ATM Networks (ATM 네트워크에서 인터넷 트래픽 성능 향상을 위한 퍼지기반 버퍼 관리 알고리즘)

  • 김희수;김관웅;박준성;배성환;전병실
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.9
    • /
    • pp.358-365
    • /
    • 2003
  • To support Internet traffic efficiently over ATM networks, Guaranteed Frame Rate(GFR) has been proposed in the ATM Forum. GFR provides minimum rate guarantees to VCs and allows any excess bandwidth in the network to be shared among the contending VCs in a fair manner. In this paper, we proposed a new fuzzy logic based buffer management algorithm that provides MCR guarantee and fair sharing to GFR VCs. A key feature of proposed algorithm is its ability to accept or drop a new incoming packet dynamically based on buffer condition and load ratio of VCs. This is achieved by using fuzzy logic controller for the production of a drop factor. Simulation results show that proposed scheme significantly improves fairness and TCP throughput compared with previous schemes.

A Stable Random Access Protocol For A Computer Network (안정된 컴퓨터 통신망을 위한 임의 접근 프로토콜)

  • Lee, Sang-Geon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.2
    • /
    • pp.515-522
    • /
    • 1997
  • A neat prefect stable random access protocol for a broadcast channel,the distributed queuing random access protocol(DQRAP)is presented and evaluated.The DQRAP prootcol utilizes minisolts to provide termaty chan-nel feedback and two distributed queues to:9a) resolve contention and (b) to schedute the transmission of messages.Three minislots are sufficient to resolve collisions faster than the tranmission times of all inboled mecages.Three minislots are suffcient to resolve collisions faster than the tranmission times of all inbolved arrivals when ternary minislot feedback is used.Modelingand simulation indicate that the DQRAP protocol, using as few as three minislits,achives a performance level which approaches that of hypothetical perfect cheduling protocol,ie,the M/D/I system,with respect to propagation delay,thus offers the potential of improved performance over current protocols in satellite,metropolitan and packet radio networks.

  • PDF

A Design and Implementation of Parking Guidance and Information System in u-City (U-City 주차 유도 및 정보 시스템 설계 및 구현)

  • Song, Kyu-Seog;Ryou, Jae-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.6B
    • /
    • pp.940-947
    • /
    • 2010
  • A Parking Guidance and Information Service System is to provide real-time parking-information and the shortest parking-path for increasing the user's convenience, relieving traffic congestion, reducing illegal parking, and maximizing the efficiency of parking management. This paper discusses the result of the needs analysis, design, and implementation of the Parking Guidance and Information Service System. Furthermore, it analyzes and compares the parking time and vehicle turnover rate before and after the system installation.