• 제목/요약/키워드: Real time transport

검색결과 597건 처리시간 0.02초

Design and Implementation of Advanced Traffic Monitoring System based on Integration of Data Stream Management System and Spatial DBMS

  • Xia, Ying;Gan, Hongmei;Kim, Gyoung-Bae
    • Journal of Korea Spatial Information System Society
    • /
    • 제11권2호
    • /
    • pp.162-169
    • /
    • 2009
  • The real-time traffic data is generated continuous and unbounded stream data type while intelligent transport system (ITS) needs to provide various and high quality services by combining with spatial information. Traditional database techniques in ITS has shortage for processing dynamic real-time stream data and static spatial data simultaneously. In this paper, we design and implement an advanced traffic monitoring system (ATMS) with the integration of existed data stream management system (DSMS) and spatial DBMS using IntraMap. Besides, the developed ATMS can deal with the stream data of DSMS, the trajectory data of relational DBMS, and the spatial data of SDBMS concurrently. The implemented ATMS supports historical and one time query, continuous query and combined query. Application programmer can develop various intelligent services such as moving trajectory tracking, k-nearest neighbor (KNN) query and dynamic intelligent navigation by using components of the ATMS.

  • PDF

TCP-friendly RTP Rate Control

  • 하상석;정선태
    • Proceedings of the IEEK Conference
    • /
    • 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
    • /
    • pp.255-258
    • /
    • 2003
  • TCP is taking over 95% among the Internet traffics. Recently the demands of multimedia services in the Internet has been increasing. These multimedia services mostly need real-time deliverly, and then RTP has been a de facto to transmission protocol for these real-time multimedia services. RTP uses UDP as its underlying transport protocol, and thus it does not support any rate and congestion control. Thus, for fair use of the Internet bandwidth with TCP traffics. RTP also needs a rate control. One constraint of RTP is that the feedback information(delivered by, RTP's twin protocol, RTCP) is recommended to be sent no less than 5 seconds. In this paper, we propose a TCP-friendly RTP rate control which use only RTCP feedback information at every 5 seconds. The experiment results show that our proposed algorithm works. But, it is found that we need more time to test the effects of parameters and policies of the algorithms, which will be reported later.

  • PDF

Analysis on the Characteristics of Hazardous Chemical Transport Vehicle Accidents in Korea (국내 유해화학물질 운송차량사고 특성분석)

  • Jeong, Jae-uk;Lee, Sang-jae
    • Journal of the Society of Disaster Information
    • /
    • 제16권2호
    • /
    • pp.310-317
    • /
    • 2020
  • Purpose: In this study, the characteristics of hazardous chemical transport vehicle accidents during the last six years from 2014 to 2019 was analyzed. This study is to prevent chemical transport accidents. Method: Using statistics from the Ministry of Environment, chemical transport vehicle accidents were classified into accident type, accident cause and vehicle type. Result: Of the total 506 cases chemical accidents, 105 cases were caused by transport vehicle. More than 20 percent of total accidents were reported. Most of the accidents were caused by spill·leak. The main causes of the accident were traffic accidents(49 cases) and management negligence(29 cases). This was more than 74% of all transport vehicle accidents. By vehicle type, 57 cases(54%) were most common in tank lorries, followed by trucks (39 cases, 37%) and trailers (9 cases, 9%). Conclusion: In order to prevent accident of transport vehicle, thorough inspection of the transport vehicle is required and safe operation of the driver. In addition, the government needs to expand real-time monitoring of transport vehicles and comprehensively manage different systems by the relevant ministries.

A Study of Correcting Technology based POI for Pedestrian Location-information Detecting in Traffic Connective Transferring System (교통 연계 환승 시스템의 보행자 위치정보 수집을 위한 POI 기반 위치 보정 기술 연구)

  • Jung, Jong-In;Lee, Sang-Sun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제10권2호
    • /
    • pp.84-93
    • /
    • 2011
  • In order to provide the real time and proper information to the pedestrian who is using the transport connection and transfer center through data collecting and processing process, the design of the test-bed (Gimpo airport)'s communication construction and the technology of the pedestrian location tracking has been researched. The design of the communication construction should make sure that it can provide believable data to the user of the transfer center. At the same time, the location tracking should also be considered, so that the require of the communication efficiency and the location tracking efficiency can be met together. In order to make the efficient location tracking technology, the problems related to the commercial technology based real time location identification will be resolved and the new approach method was proposed and be applied and analysed to the test-bed. The wireless access points can be located in the most real-world situation which has added the characteristics of the real building to the electronic map, and through the analysis of theirs location, they can be set as the mainly necessary points for the communication construction design and the location tracking and the method to locate that points has been proposed. How to set, how to apply it to the test-bed and the examination result will be introduced in this paper.

A Study of Travel Time Prediction using K-Nearest Neighborhood Method (K 최대근접이웃 방법을 이용한 통행시간 예측에 대한 연구)

  • Lim, Sung-Han;Lee, Hyang-Mi;Park, Seong-Lyong;Heo, Tae-Young
    • The Korean Journal of Applied Statistics
    • /
    • 제26권5호
    • /
    • pp.835-845
    • /
    • 2013
  • Travel-time is considered the most typical and preferred traffic information for intelligent transportation systems(ITS). This paper proposes a real-time travel-time prediction method for a national highway. In this paper, the K-nearest neighbor(KNN) method is used for travel time prediction. The KNN method (a nonparametric method) is appropriate for a real-time traffic management system because the method needs no additional assumptions or parameter calibration. The performances of various models are compared based on mean absolute percentage error(MAPE) and coefficient of variation(CV). In real application, the analysis of real traffic data collected from Korean national highways indicates that the proposed model outperforms other prediction models such as the historical average model and the Kalman filter model. It is expected to improve travel-time reliability by flexibly using travel-time from the proposed model with travel-time from the interval detectors.

Implementation of Low-priced Bicycle Black Box Using 6-axis Sensor (6축 센서를 이용한 저가형 자전거 블랙박스 구현)

  • Weon, La-Kyoung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제18권5호
    • /
    • pp.171-182
    • /
    • 2019
  • Bicycles are a pollution-free means of transportation. In addition to leisure, the use of bicycles is increasing as alternative eco-friendly transportation. Accordingly, bicycle accidents are also increasing. The purpose of this study is to implement bicycle black box technology to identify situation when a bicycle accident occurs. Currently, bicycle black box products are mainly based on video cameras, and are commercially available by adding various functions mainly on high resolution cameras and are sold at high prices. If a bicycle accident occurs, quantitative data on the accident location at the time of the accident and the state of the bicycle at the time of the accident is required. In this study, IMU sensor used to obtain acceleration and slope, and time and coordinates are obtained. In addition, real-time acceleration and tilt data while is stored in memory card and by using Bluetooth transmit to the smart phone owned by the in real time to prevent accidents and to monitor status.

Hybrid Monitoring Scheme for End-to-End Performance Enhancement of Real-time Media Transport (실시간 미디어 전송의 종단간 성능 향상을 위한 혼성 모니터링 기법)

  • Park Ju-Won;Kim JongWon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제30권10B호
    • /
    • pp.630-638
    • /
    • 2005
  • As real-time media applications based on IP multicast networks spread widely, the end-to-end QoS (quality of service) provisioning for these applications have become very important. To guarantee the end-to-end QoS of multi-party media applications, it is essential to monitor the time-varying status of both network metrics (i.e., delay, jitter and loss) and system metrics (i.e., CPU and memory utilization). In this paper, targeting the multicast-enabled AG (Access Grid) group collaboration tool based on multi-Party real-time media services, a hybrid monitoring scheme that can monitor the status of both multicast network and node system is investigated. It combines active monitoring and passive monitoring approaches to measure multicast network. The active monitoring measures network-layer metrics (i.e., network condition) with probe packets while the passive monitoring checks application-layer metrics (i.e., user traffic condition by analyzing RTCP packets). In addition, it measures node system metrics from system API. By comparing these hybrid results, we attempt to pinpoint the causes of performance degradation and explore corresponding reactions to improve the end-to-end performance. The experimental results show that the proposed hybrid monitoring can provide useful information to coordinate the performance improvement of multi-party real-time media applications.

The Estimation of Link Travel Time for the Namsan Tunnel #1 using Vehicle Detectors (지점검지체계를 이용한 남산1호터널 구간통행시간 추정)

  • Hong Eunjoo;Kim Youngchan
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제1권1호
    • /
    • pp.41-51
    • /
    • 2002
  • As Advanced Traveler Information System(ATIS) is the kernel of the Intelligent Transportation System, it is very important how to manage data from traffic information collectors on a road and have at borough grip of the travel time's change quickly and exactly for doing its part. Link travel time can be obtained by two method. One is measured by area detection systems and the other is estimated by point detection systems. Measured travel time by area detection systems has the limitation for real time information because it Is calculated by the probe which has already passed through the link. Estimated travel time by point detection systems is calculated by the data on the same time of each. section, this is, it use the characteristic of the various cars of each section to estimate travel time. For this reason, it has the difference with real travel time. In this study, Artificial Neural Networks is used for estimating link travel time concerned about the relationship with vehicle detector data and link travel time. The method of estimating link travel time are classified according to the kind of input data and the Absolute value of error between the estimated and the real are distributed within 5$\~$15minute over 90 percent with the result of testing the method using the vehicle detector data and AVI data of Namsan Tunnel $\#$1. It also reduces Time lag of the information offered time and draws late delay generation and dissolution.

  • PDF

A Real-time Traffic Control Scheme for ATM network:RCT (ATM망을 위한 실시간 트래픽 제어 기법:RCT)

  • Lee, Jun-Yeon;Lee, Hae-Wan;Kwon, Hyeog-In
    • The Transactions of the Korea Information Processing Society
    • /
    • 제4권11호
    • /
    • pp.2822-2831
    • /
    • 1997
  • A B-ISDN network based on ATM must support several kinds of transport services with different traffic characteristics and service requirements. There is neither link-by-link flow control nor error control in the ATM layer. For different services, different flow/error controls could be performed at the AAL layer or at a higher Iayer(e.g. transport layer). In traditional data networks, the window now control mechanism combined with error control was used prevalently. But, the window flow control mechanism might be useless in ATM networks because the propagation delay is too large compared with the transmission rate. In this paper, we propose a simple flow control mechanism, called RCT(Rate Control for end-to-end Transport), for end-to-end data transport. The RCT shows acceptable performance when the average overload period is bounded by a certain time.

  • PDF

Development of One-to-One Shortest Path Algorithm Based on Link Flow Speeds on Urban Networks (도시부 가로망에서의 링크 통행속도 기반 One-to-One 최단시간 경로탐색 알고리즘 개발)

  • Kim, Taehyeong;Kim, Taehyung;Park, Bum-Jin;Kim, Hyoungsoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제11권5호
    • /
    • pp.38-45
    • /
    • 2012
  • Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.