• Title/Summary/Keyword: internet traffic data

Search Result 604, Processing Time 0.026 seconds

Analysis of Highway Traffic Indices Using Internet Search Data (검색 트래픽 정보를 활용한 고속도로 교통지표 분석 연구)

  • Ryu, Ingon;Lee, Jaeyoung;Park, Gyeong Chul;Choi, Keechoo;Hwang, Jun-Mun
    • Journal of Korean Society of Transportation
    • /
    • v.33 no.1
    • /
    • pp.14-28
    • /
    • 2015
  • Numerous research has been conducted using internet search data since the mid-2000s. For example, Google Inc. developed a service predicting influenza patterns using the internet search data. The main objective of this study is to prove the hypothesis that highway traffic indices are similar to the internet search patterns. In order to achieve this objective, a model to predict the number of vehicles entering the expressway and space-mean speed was developed and the goodness-of-fit of the model was assessed. The results revealed several findings. First, it was shown that the Google search traffic was a good predictor for the TCS entering traffic volume model at sites with frequent commute trips, and it had a negative correlation with the TCS entering traffic volume. Second, the Naver search traffic was utilized for the TCS entering traffic volume model at sites with numerous recreational trips, and it was positively correlated with the TCS entering traffic volume. Third, it was uncovered that the VDS speed had a negative relationship with the search traffic on the time series diagram. Lastly, it was concluded that the transfer function noise time series model showed the better goodness-of-fit compared to the other time series model. It is expected that "Big Data" from the internet search data can be extensively applied in the transportation field if the sources of search traffic, time difference and aggregation units are explored in the follow-up studies.

Traffic Characterization and Analysis for AO/DI Internet Services (AO/DI 인터넷 서비스 도입을 위한 트랙픽 분석 연구)

  • 이강원;국광호;정광재;김태일
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.3
    • /
    • pp.65-79
    • /
    • 2000
  • Based on the results of the internet service survey, the traffic demand forecasts of the AO/DI internet service and N-ISDN service have been performed for each channel(B-channel and D-channel). These traffic forecasts can be used as useful input data for investigating packet processing capacity of the TDX-10A switching system and suggesting guideline for capacity increasement.

  • PDF

An Efficient Online RTP Packet Classification Method for Traffic Management In the Internet (인터넷상에서 트래픽 관리를 위한 효율적인 RTP 패킷 분류 방법)

  • Roh Byeong-hee
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.39-48
    • /
    • 2004
  • For transporting real-time multimedia traffic, RTP is considered as one of the most promising protocols operating at application layer. In order to manage and control the real-time multimedia traffic within networks, network managers need to monitor and analyze the traffic delivering through their networks. However, conventional traffic analyzing tools can not exactly classify and analyze the real-time multimedia traffic using RTP on the basis of real-time as well as non-real-time operations. In this paper, we propose an efficient online classification method of RTP packets, which can be used on high-speed network links. The accuracy and efficiency of the proposed methodhave been tested using captured data from a KIX node with 100 Mbps links, which interconnects between domestic and overseas Internet networks and is operated by NCA.

  • PDF

Traffic Analysis of Statistics based on Internet Application Services (인터넷 응용 서비스의 통계에 근거한 트래픽 분석)

  • 정태수;최진섭;정중수;김정태;김대영
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.5
    • /
    • pp.995-1003
    • /
    • 2004
  • A number of Internet application services are used with the development of Internet backbone nowadays. Well-known services such as WWW, ]n, email are provided at first time. Tremendous unwell-known services are presented according to the demands of various contents. After analyzing PDU information of the packet using unwell-known port travelling on the internet, searching internet service type and its statistical data is provided with internet traffic analyst as very useful information. This paper presents the mechanism to extract the internet application services operated on (un)well-known port of UDP or TCP used occasionally through netflow and tcpdump method introduced by ethereal and the operation scheme of the service. Afterwards to get the detailed statistics of the analyzed application service, the agent and the server environment, the agent gathering raw data traffics and the server adapting the traffic received from the agent BNF(Backus-Naur Form) method, is also introduced. Adapting the presented mechanism eve. LAN of Andong national university, the internet traffic service type and the detailed statistics of the analyzed application services which provides with internet traffic analyst are presented as very useful information.

Hybrid CSA optimization with seasonal RVR in traffic flow forecasting

  • Shen, Zhangguo;Wang, Wanliang;Shen, Qing;Li, Zechao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4887-4907
    • /
    • 2017
  • Accurate traffic flow forecasting is critical to the development and implementation of city intelligent transportation systems. Therefore, it is one of the most important components in the research of urban traffic scheduling. However, traffic flow forecasting involves a rather complex nonlinear data pattern, particularly during workday peak periods, and a lot of research has shown that traffic flow data reveals a seasonal trend. This paper proposes a new traffic flow forecasting model that combines seasonal relevance vector regression with the hybrid chaotic simulated annealing method (SRVRCSA). Additionally, a numerical example of traffic flow data from The Transportation Data Research Laboratory is used to elucidate the forecasting performance of the proposed SRVRCSA model. The forecasting results indicate that the proposed model yields more accurate forecasting results than the seasonal auto regressive integrated moving average (SARIMA), the double seasonal Holt-Winters exponential smoothing (DSHWES), and the relevance vector regression with hybrid Chaotic Simulated Annealing method (RVRCSA) models. The forecasting performance of RVRCSA with different kernel functions is also studied.

A Low Complexity PTS Technique using Threshold for PAPR Reduction in OFDM Systems

  • Lim, Dai Hwan;Rhee, Byung Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2191-2201
    • /
    • 2012
  • Traffic classification seeks to assign packet flows to an appropriate quality of service (QoS) class based on flow statistics without the need to examine packet payloads. Classification proceeds in two steps. Classification rules are first built by analyzing traffic traces, and then the classification rules are evaluated using test data. In this paper, we use self-organizing map and K-means clustering as unsupervised machine learning methods to identify the inherent classes in traffic traces. Three clusters were discovered, corresponding to transactional, bulk data transfer, and interactive applications. The K-nearest neighbor classifier was found to be highly accurate for the traffic data and significantly better compared to a minimum mean distance classifier.

Performance Improvement of Signature-based Traffic Classification System by Optimizing the Search Space (탐색공간 최적화를 통한 시그니쳐기반 트래픽 분석 시스템 성능향상)

  • Park, Jun-Sang;Yoon, Sung-Ho;Kim, Myung-Sup
    • Journal of Internet Computing and Services
    • /
    • v.12 no.3
    • /
    • pp.89-99
    • /
    • 2011
  • The payload signature-based traffic classification system has to deal with large amount of traffic data, as the number of internet-based applications and network traffic continue to grow. While a number of pattern-matching algorithms have been proposed to improve processing speedin the literature, the performance of pattern matching algorithms is restrictive and depends on the features of its input data. In this paper, we studied how to optimize the search space in order to improve the processing speed of the payload signature-based traffic classification system. Also, the feasibility of our design choices was proved via experimental evaluation on our campus traffic trace.

A Real Time Traffic Flow Model Based on Deep Learning

  • Zhang, Shuai;Pei, Cai Y.;Liu, Wen Y.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2473-2489
    • /
    • 2022
  • Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

An Adaptive Proportional Integral Active Queue Management Algorithm based on Self-Similar Traffic Rate Estimation in WSN

  • Liu, Heng;Wang, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.1946-1958
    • /
    • 2011
  • Wireless Sensor Network (WSN) is made up of a number of sensor nodes and base stations. Traffic flow in WSN appears self-similar due to its data delivery process, and this impacts queue length greatly and makes queuing delay worse. Active queue management can be designed to improve QoS performance for WSN. In this paper, we propose self-similar traffic rate estimating algorithm named Power-Law Moving Averaging (PLMA) to regulate packet marking probability. This algorithm improves the availability of the rate estimation algorithm under the self-similar traffic condition. Then, we propose an adaptive Proportional Integral algorithm (SSPI) based on the estimation of the Self-Similar traffic rate by PLMA. Simulation results show that SSPI can achieve lower queue length jitter and smaller setting time than PI.

Performance Analysis of Internet Traffic Forecasting Model (인터넷 트래픽 예측 모형 성능 분석 연구)

  • Kim, S.;Ha, M.H.;Jung, J.Y.
    • The Korean Journal of Applied Statistics
    • /
    • v.24 no.2
    • /
    • pp.307-313
    • /
    • 2011
  • In this paper, we compare performance of three models. The Holt-Winters, FARIMA and ARGARCH models, are used in predicting internet traffic data for analysis of traffic characteristics. We first introduce the time series models and apply them to real traffic data to forecast. Finally, we examine which model is the most suitable for explaining the long memory, the characteristics of the traffic material, and compare the respective prediction performance of the models.