• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 가을 학술발표논문집 Vol.30 No.2 (3)
• /
• pp.49-51
• /
• 2003

Developers of network games have used several prediction techniques for hiding transmission delay to support the real­time requirement of network games. Nowadays many researches that are related with network game are in progress to solve delay problems more radically, such as to propose new routers architecture and transport protocols suitable to characteristics of network game traffic. So for these advanced researches the tasks to grasp the traffic characteristics of a network game are needed. In this paper we aimed to capture the traffic of MMORPG and present the statistical analysis of measured data. The measurement and the analysis were accomplished with the server of 'Lineage' that regarded as the most successful MMORPG. Next, we have implemented a traffic generator that reflects the characteristics of MMORPG and shown that the trace generated by MMORPG traffic generator had identical characteristics with actual traffic using statistical testing method. We expect that this traffic generator can be used in many researches related with a network game.

• 대한교통학회지
• /
• 제24권7호
• /
• pp.81-90
• /
• 2006

교통사고를 줄이기 위한 방안으로써 교통사고와 다양한 요인과의 관계를 규명하는 것이 시급한 현실의 과제일 것이다. 본 연구에서는 전북권의 교통사고가 가장 많고, 치사율이 가장 높은 국도 17호선(전주-남원)를 대상으로 교통사고의 원인이 되는 다양한 요인들이 교통사고에 어느 정도 영향을 미치고 있는지에 대하여 교통안전분야에서 자주 사용되어오던 다중회귀이론, 수량화이론을 적용하여 교통사고예측모델을 구축하였다. 또한 데이터의 불확실성 상태를 합리적으로 처리할 수 있는 퍼지 추론이론 및 인간의 신경계를 수학적으로 모형화하여 학습에 의한 예측에 있어 뛰어난 것으로 알려져 있는 신경망이론을 적용한 교통사고예측모델을 구축하였다 이를 통해, 퍼지추론이론 및 신경망 이론의 유효성을 입증하고 교통사고분석 분야의 적용 타당성을 확인하는데 초점을 맞추고 있다.

• 응용통계연구
• /
• 제20권2호
• /
• pp.219-227
• /
• 2007

시계열 모형은 통신망 트래픽의 예측과 분석에 유용하게 쓰여 왔다. 본 논문에서는 통신망 트래픽의 예측을 위하여 다양한 시계열 모형을 소개하고 성능평가를 하고자 한다. 이를 위하여 실제 통신망 트래픽 자료에 선형 및 비선형 시계열모형을 적합 시키고 비선형 시계열모형이 선형 시계열 모형보다 예측의 정확도가 우수함을 보이고자 한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권7호
• /
• pp.2321-2338
• /
• 2021

Compared with vehicle trajectories, pedestrian trajectories have stronger degrees of freedom and complexity, which poses a higher challenge to trajectory prediction tasks. This paper designs a mode to divide the trajectory of pedestrians at a traffic intersection, which converts the trajectory regression problem into a trajectory classification problem. This paper builds a deep model for pedestrian trajectory prediction at intersections for the task of pedestrian short-term trajectory prediction. The model calculates the spatial correlation and temporal dependence of the trajectory. More importantly, it captures the interactive features among pedestrians through the Attention mechanism. In order to improve the training speed, the model is composed of pure convolutional networks. This design overcomes the single-step calculation mode of the traditional recurrent neural network. The experiment uses Vulnerable Road Users trajectory dataset for related modeling and evaluation work. Compared with the existing models of pedestrian trajectory prediction, the model proposed in this paper has advantages in terms of evaluation indicators, training speed and the number of model parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2964-2985
• /
• 2019

Global data center IP traffic is expected to reach 20.6 zettabytes (ZB) by the end of 2021. Intra-data center networks (Intra-DCN) will account for 71.5% of the data center traffic flow and will be the largest portion of the traffic. The understanding of traffic distribution in IntraDCN is still sketchy. It causes significant amount of bandwidth to go unutilized, and creates avoidable choke points. Conventional transport protocols such as Optical Packet Switching (OPS) and Optical Burst Switching (OBS) allow a one-sided view of the traffic flow in the network. This therefore causes disjointed and uncoordinated decision-making at each node. For effective resource planning, there is the need to consider joining the distributed with centralized management which anticipates the system's needs and regulates the entire network. Methods derived from Kalman filters have proved effective in planning road networks. Considering the network available bandwidth as data transport highways, we propose an intelligent enhanced SDN concept applied to OBS architecture. A management plane (MP) is added to conventional control (CP) and data planes (DP). The MP assembles the traffic spatio-temporal parameters from ingress nodes, uses Kalman filtering prediction-based algorithm to estimate traffic demand. Prior to packets arrival at edges nodes, it regularly forwards updates of resources allocation to CPs. Simulations were done on a hybrid scheme (1+1) and on the centralized OBS. The results demonstrated that the proposition decreases the packet loss ratio. It also improves network latency and throughput-up to 84 and 51%, respectively, versus the traditional scheme.

• 한국정보처리학회논문지
• /
• 제6권10호
• /
• pp.2779-2789
• /
• 1999

In this paper, we propose a new neural Buffered Leaky Bucket algorithm for preventing the degradation of network performance caused by congestion and dealing with the traffic congestion in ATM networks. We networks. We justify the validity of the suggested method through performance comparison in aspects of cell loss rate and mean transfer delay under a variety of traffic conditions requiring the different QoS(Quality of Service). also, the cell scheduling algorithms such as DWRR and DWEDF used for multiplexing the incoming traffics are induced to get the delay time of the traffics fairly. The network congestion information from cell scheduler is used to control the predicted traffic loss rate of Neural Leaky Bucket, and token generation rate is changed by the predicted values. The prediction of traffic loss rate by neural networks can effectively reduce the cell loss rate and the cell transfer delay of next incoming cells and be applied to other traffic control systems. Computer simulation results performed for traffic prediction show that QoSs of the various kinds of traffics are increased.

• 한국정보전자통신기술학회논문지
• /
• 제14권2호
• /
• pp.115-121
• /
• 2021

본 논문은 급증하는 인터넷 트래픽예측을 위해 빅데이터와 인공지능기술을 이용하였다. 기존에 트래픽 예측에 관해 다양한 연구가 있었지만 최근 스마트폰이나 스트리밍 등 거대한 인터넷 트래픽을 유발하는 증가 요소를 반영하지는 못했다. 더불어 대용량 인기 게임 출시나 OTT(Over the Top)사업자의 신규 컨텐츠 제공과 같은 이벤트성 요소는 사전 예측이 더욱 어렵다. 이러한 특성으로 기존 방법으로는 ISP(Internet Service Provider)가 실시간적 서비스 품질관리나 트래픽 예측치를 네트워크 사업환경에 반영하기가 불가능하였다. 따라서 본 연구에서는 이러한 문제점을 해결하고자 기존 NMS와는 별개로 트래픽 데이터를 실시간적으로 탐색, 판별하여 수집하는 인터넷 트래픽 수집시스템을 구축하였다. 이를 통해 수집대상의 데이터를 자동등록할 수 있는 유연성과 탄력성을 확보하였으며 실시간 네트워크 품질모니터링을 가능하게 하였다. 또한 시스템에서 수집된 대량의 트래픽 데이터를 머신러닝(AI)으로 분석하여 OTT 사업자의 미래 트래픽을 예측하였다. 이를 통해 보다 과학적이고 체계적인 예측이 가능해졌으며 더불어 ISP 사업자 간의 연동 최적화와 대형 OTT 서비스의 품질확보가 가능할 수 있게 되었다.

• Journal of Communications and Networks
• /
• 제8권2호
• /
• pp.234-240
• /
• 2006

We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2008년도 춘계학술발표논문집
• /
• pp.157-159
• /
• 2008

AHP를 사용하 교통망 사고 예방 처리 기법은 아직 우리나라에서는 처음 시도되어지는 예방법이라 할수 있다. 인공지능을 사용하여 사고처리하는 방법을 시도를 하였보았으나 그 외의 방법은 문외한이라 할수 있을 정도로 우리나라에서는 보기드문 현상이라 할수 있다. 따라서 계층분석기법을 사용하여 요소분석보다 훨씬 나은 처리방법이므로 좀더 나은 기법이 될 것 같고 다음으로 처리되는 방법의 기본 모티브가 될 영향이 크다라고 한다.

• 한국통신학회논문지
• /
• 제22권2호
• /
• pp.259-267
• /
• 1997

The advent of B-ISDN using ATM(asynchronous transfer mode) made possible a variety of new multimedia services, however it also created a problem of congestion control due to bursty nature of various traffic sources. To tackle this problem, UPC/NPC(user parameter control/network parameter control) have been actively studied and DRLB(dynamic rate leaky bucket) algorithm, in which the token generation rate is changed according to states of data source andbuffer occupancy, is a good example of the UPC/NPC. However, the DRLB algorithm has drawbacks of low efficiency and difficult real-time implementation for bursty traffic sources because the determination of token generation rate in the algorithm is based on the present state of network. In this paper, we propose a more plastic and effective congestion control algorithm by combining the DRLB algorithm and neural network based prediction to remedy the drawbacks of the DRLB algorithm, and verify the efficacy of the proposed method by computer simulations.