• Title/Summary/Keyword: Real-Time Traffic Information

Search Result 1,144, Processing Time 0.026 seconds

Operator Revenue Maximizing Heuristics with QoS Guarenetees for Real Time Traffic in 4G Networks

  • Poudyal, Neeraj;Lee, Ha-Cheol;Lee, Byung-Seub
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.976-998
    • /
    • 2011
  • This paper attempts to maximize the operator's revenue while simultaneously providing a multi-constraint, multi-hop and deterministic QoS provisioning for real time traffic in IEEE 802.16m based 4G networks. The optimal solution to such a problem is NP-complete and therefore not feasible to be solved in a tolerable polynomial time. For this reason, we also provide a simple price based greedy heuristic to be used along with the admission control. Simulation results for different QoS schemes show that the heuristic produces a revenue that is very close to the optimal revenue, and is far more aggressive than the size based and other common algorithms that are computationally feasible to be implemented in IEEE 802.16m.

Design Factors of Communication Channel for Real Time Service (실시간 서비스를 위한 채널의 설계 요소)

  • Choe, Young-Han;Kim, Jang-Kyung;Jang, Woong;Chin, Byong-Moon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.2 no.3
    • /
    • pp.401-408
    • /
    • 1998
  • Recently there comes out various applications on real time control, audio/video conference, medical image and so on. These applications request certain Quality of Service(QoS) to their underlying communication subsystem. In these cases those communication subsystems should provide real time communication service on their QoS request as well as good performance to maintain best effort traffic. In this paper firstly we briefly look over bandwidth, traffic parameters on point to point network secondly we analyze on real time channel and propose design factors in real time channel protocol for multimedia applications.

  • PDF

A Study on Analysis Characteristic Self-similar for Network Traffic with Multiple Time Scale (다중화된 네트워크 트래픽의 self-similar 특성 분석에 관한 연구)

  • Cho, Hyun-Seob;Han, Gun-Hee
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.11
    • /
    • pp.3098-3103
    • /
    • 2009
  • In this paper, self-similar characteristics over statistical approaches and real-time Ethernet network traffic measurements are estimated. It is also shown that the self-similar traffic reflects real Ethernet traffic chareacteristics by comparing TCP-MT source model which is exactly self-similar model to the traditional Poisson model.

Multiple Path-Finding Algorithm in the Centralized Traffic Information System (중앙집중형 도로교통정보시스템에서 다중경로탐색 알고리즘)

  • 김태진;한민흥
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.6
    • /
    • pp.183-194
    • /
    • 2001
  • The centralized traffic information system is to gather and analyze real-time traffic information, to receive traffic information request from user, and to send user processed traffic information such as a path finding. Position information, result of destination search, and other information. In the centralized traffic information system, a server received path-finding requests from many clients and must process clients requests in time. The algorithm of multiple path-finding is needed for a server to process clients request, effectively in time. For this reason, this paper presents a heuristic algorithm that decreases time to compute path-finding requests. This heuristic algorithm uses results of the neighbor nodes shortest path-finding that are computed periodically. Path-finding results of this multiple path finding algorithm to use results of neighbor nodes shortest path-finding are the same as a real optimal path in many cases, and are a little different from results of a real optimal path in non-optimal path. This algorithm is efficiently applied to the general topology and the hierarchical topology such as traffic network. The computation time of a path-finding request that uses results of a neighbor nodes shortest path-finding is 50 times faster than other algorithms such as one-to-one label-setting and label-correcting algorithms. Especially in non-optimal path, the average error rate is under 0.1 percent.

  • PDF

A QoS policy experimentation and evaluation on Optical subscriber network Test bed for deploying TPS(Triple Play Service) (TPS를 고려한 광가입자망에서의 QoS 고찰)

  • Lee, Dong-Yeal;Seung, Min-Mo;Kim, Hee-Dong
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2009.08a
    • /
    • pp.63-67
    • /
    • 2009
  • In this paper we propose a QoS policy, which is based on both DSCP and SPQ, appropriate to TPS users on optical subscriber network. Then we experiment and evaluate QoS policy through the test bed which emulates real optical subscriber network. In order to perform effective and real experiment on test bed we make test traffic equivalent to 400 TPS users and give it to test bed. The experimental result shows that no packet loss in real time service traffic such as voice, IPTV occurs during more than 4 hours. We think that our proposed QoS policy is a proper method which guarantees the service quality of real time services on optical subscriber network.

  • PDF

A study on slot allocation for supporting multimedia on wireless ATM network (무선 ATM 망에서 멀티미디어 지원을 위한 슬롯 할당에 관한 연구)

  • 안영화;장경훈;박상현;김덕진
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.1
    • /
    • pp.1-13
    • /
    • 1998
  • The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.

  • PDF

Real-time Visualization of Ship and Buoy Motions Coupled with Ocean Waves in a Ship Handling Simulator (선박 운항 시뮬레이터에서 해양파와 연동된 선박 및 부표 운동의 실시간 가시화)

  • Yeo, Dong-Jin;Cha, Moo-Hyun;Mun, Du-Hwan
    • Korean Journal of Computational Design and Engineering
    • /
    • v.16 no.3
    • /
    • pp.227-235
    • /
    • 2011
  • Ship handling simulator should have capabilities of calculating ship motions (heave, pitch, and roll) at given sea state and displaying the calculated motions through a real-time 3D visualization system. Motion solver of a ship handling simulator generally calculates those motions in addition to position for an own ship, a main simulation target, but provides only position information for traffic ships. Therefore, it is required to simulate real-time traffic ship and buoy motions coupled with ocean waves in a ship handling simulator for the realistic visualization. In the paper, the authors propose a simple dynamics model by which ship and buoy motions are calculated with the input data of wave height and discuss a method for the implementation of a ship and buoy motions calculation module.

An Application of Dynamic Route Choice Model Using Optimal Control Theory (최적제어이론을 이용한 동적 통행배정 모형의 적용에 관한 연구)

  • 전경수;오세현
    • Journal of Korean Society of Transportation
    • /
    • v.13 no.4
    • /
    • pp.5-29
    • /
    • 1995
  • Advanced Traveler Inoformation Systems*ATIS) , as a subsystem of ITS influence the travel choices of dreivers by providing them with historical, real-time and predictive information to supprot travel decisions and consequently improves the speed and quality of travel. For thesuccessul accomplishment of ATIS, the time-dependent variations of traffic in a road network and travel times of vehicles during their journey must be predicted . The purpose of this study is to evaluate the past developments in the dynamic route choice models and to apply the instantaneous dynamic user optimal route choice model. recently formulated with flow propagation constraints by Ran, Boyce and LeBlanc, to the real transportation network of Seocho-Ku in Seoul. As input data for this application, the time-dependent travel rates are estimated and the link travel time function is derived. The modelis validated from three view points : the efficiency of model itself the ability to predict traffic volume and travel time on links, and the optimal traffic control.

  • PDF

Robust Traffic Monitoring System by Spatio-Temporal Image Analysis (시공간 영상 분석에 의한 강건한 교통 모니터링 시스템)

  • 이대호;박영태
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.11
    • /
    • pp.1534-1542
    • /
    • 2004
  • A novel vision-based scheme of extracting real-time traffic information parameters is presented. The method is based on a region classification followed by a spatio-temporal image analysis. The detection region images for each traffic lane are classified into one of the three categories: the road, the vehicle, and the shadow, using statistical and structural features. Misclassification in a frame is corrected by using temporally correlated features of vehicles in the spatio-temporal image. Since only local images of detection regions are processed, the real-time operation of more than 30 frames per second is realized without using dedicated parallel processors, while ensuring detection performance robust to the variation of weather conditions, shadows, and traffic load.

The Estimation of Road Delay Factor using Urban Network Map and Real-Time Traffic Information (도로망도와 실시간 교통정보를 이용한 도로 지연계수 산정)

  • Jeon, Jeongbae;Kim, Solhee;Kwon, Sungmoon
    • Journal of Cadastre & Land InformatiX
    • /
    • v.51 no.1
    • /
    • pp.97-110
    • /
    • 2021
  • This study estimated the delay factor, which is the ratio of travel time at the speed limit and travel time at the actual speed using real-time traffic information in Seoul. The actual travel speed on the road was lower than the maximum speed of the road and the travel speed was the slowest during the rush hour. As a result of accessibility analysis based on travel speed during the rush hour, the travel time at the actual speed was 37.49 minutes on average. However, the travel time at the speed limit was 15.70 minutes on average. This result indicated that the travel time at the actual speed is 2.4 times longer than that at the speed limit. In addition, this study proposedly defined the delay factor as the ratio of accessibility by the speed limit and accessibility to actual travel speed. As a result of delay factor analysis, the delay factor of Seoul was 2.44. The results by the administrative district showed that the delay factor in the north part areas of the Han River is higher than her south part areas. Analysis results after applying the relationship between road density and traffic volume showed that as the traffic volume with road density increased, the delay factor decreased. These results indicated that it could not be said that heavy traffic caused longer travel time. Therefore, follow-up research is needed based on more detailed information such as road system shape, road width, and signal system for finding the exact cause of increased travel time.