• Title/Summary/Keyword: Recent Traffic

Search Result 582, Processing Time 0.025 seconds

Traffic Accident Analysis using Fuzzy Rules (퍼지규칙을 이용한 교통사고분석)

  • Park, Kwang-Che;Bae, Cheol-Soo
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.1
    • /
    • pp.23-27
    • /
    • 2015
  • Nowdays, in order to reduce recent traffic accident the traffic accident research which uses IT techniques is plentifully advanced. But, when running away traffic accident occurs, the assault vehicle the searching is difficult very from site. Respected a traffic accident investigation scientification RFID techniques and type expense to use an ubiquitous theory constructs the traffic accident preventive system which is efficient the algorithm which proposed. Especially in this paper, It simulated that every hour changes road follows produces the optimum traffic safety speed which in situation and weather condition.

Self-Similarity Characteristic in Data traffic (데이터 트래픽 Self-Similar 특성에 관한 연구)

  • 장우현;오행석
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2000.10a
    • /
    • pp.272-277
    • /
    • 2000
  • The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction, However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially hem the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

  • PDF

Mobile Communications Data traffic using Self-Similarity Characteristic (Self-Similar 특성을 이용한 이동전화 데이터 트래픽 특성)

  • 이동철;양성현;김기문
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.7
    • /
    • pp.915-920
    • /
    • 2002
  • The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish yon that it makes out about the characteristics of actual data traffic more easily.

  • PDF

Self-Similarity Characteristic in Data traffic (Self-Similar특성을 이용한 데이터 트래픽 특성에 관한 연구)

  • 이동철;김기문;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.173-178
    • /
    • 2001
  • The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

  • PDF

Self-Similarity Characteristic in Data traffic (Self-Similar특성을 이용한 데이터 트래픽 특성에 관한 연구)

  • 이동철;김기문;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.454-459
    • /
    • 2001
  • The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

  • PDF

Self-Similarity Characteristic in Mobile Communications Data traffic (이동전화 데이터 트래픽에서의 Self-Similar 특성)

  • 이동철;정인명;김기문;김동일
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.468-471
    • /
    • 2001
  • The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

  • PDF

Game Traffic Classification Using Statistical Characteristics at the Transport Layer

  • Han, Young-Tae;Park, Hong-Shik
    • ETRI Journal
    • /
    • v.32 no.1
    • /
    • pp.22-32
    • /
    • 2010
  • The pervasive game environments have activated explosive growth of the Internet over recent decades. Thus, understanding Internet traffic characteristics and precise classification have become important issues in network management, resource provisioning, and game application development. Naturally, much attention has been given to analyzing and modeling game traffic. Little research, however, has been undertaken on the classification of game traffic. In this paper, we perform an interpretive traffic analysis of popular game applications at the transport layer and propose a new classification method based on a simple decision tree, called an alternative decision tree (ADT), which utilizes the statistical traffic characteristics of game applications. Experimental results show that ADT precisely classifies game traffic from other application traffic types with limited traffic features and a small number of packets, while maintaining low complexity by utilizing a simple decision tree.

Performance Analysis of ABR Congestion Control Algorithm using Self-Similar Traffic

  • Kim, Dong-Il;Jin, Sung-Ho
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.1
    • /
    • pp.15-21
    • /
    • 2004
  • One of the most important issues in designing a network and realizing a service is dealing with traffic characteristics. Recent experimental research on LAN, WAN, and VBR traffic properties has highlighted that real traffic specificities can not be displayed because the current models based on the Poisson assumption under estimate the long range dependency of network traffic and self-similar peculiarities. Therefore, a new approach using self-similarity characteristics as a real traffic model was recently developed. In This paper we discusses the definition of self-similarity traffic. Moreover, real traffic was collected and we generated self-similar data traffic like real traffic to background load. On the existing ABR congestion control algorithm transmission throughput with the representative ERICA, EPRCA and NIST switch algorithm show the efficient reaction about the burst traffic.

Real-Time Stochastic Optimum Control of Traffic Signals

  • Lee, Hee-Hyol
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.1
    • /
    • pp.30-44
    • /
    • 2013
  • Traffic congestion has become a serious problem with the recent exponential increase in the number of vehicles. In urban areas, almost all traffic congestion occurs at intersections. One of the ways to solve this problem is road expansion, but it is difficult to realize in urban areas because of the high cost and long construction period. In such cases, traffic signal control is a reasonable method for reducing traffic jams. In an actual situation, the traffic flow changes randomly and its randomness makes the control of traffic signals difficult. A prediction of traffic jams is, therefore, necessary and effective for reducing traffic jams. In addition, an autonomous distributed (stand-alone) point control of each traffic light individually is better than the wide and/or line control of traffic lights from the perspective of real-time control. This paper describes a stochastic optimum control of crossroads and multi-way traffic signals. First, a stochastic model of traffic flows and traffic jams is constructed by using a Bayesian network. Secondly, the probabilistic distributions of the traffic flows are estimated by using a cellular automaton, and then the probabilistic distributions of traffic jams are predicted. Thirdly, optimum traffic signals of crossroads and multi-way intersection are searched by using a modified particle swarm optimization algorithm to realize real-time traffic control. Finally, simulations are carried out to confirm the effectiveness of the real-time stochastic optimum control of traffic signals.

Self-Similarity Characteristic in Data traffic (데이터 트래픽에서의 Self-Similar 특성)

  • 김창호;황인수;최삼길;김동일;이동철;박기식
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1999.05a
    • /
    • pp.146-151
    • /
    • 1999
  • The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

  • PDF