• 한국정보통신학회논문지
• /
• 제5권5호
• /
• pp.923-930
• /
• 2001

본 논문은 최근 급속히 증가되고 있는 무선 인터넷에서 발생되는 Short Traffic 서비스의 성능을 향상시키기 위하여, TCP 프로토콜의 폭주제어 알고리즘을 보완하는 응답패킷 분할 기법(SPACK)을 제안하였다. 유선통신 환경과는 달리 무선통신 환경에서는 높은 비트 오류율로 인하여 TCP 프로토콜의 폭주제어 알고리즘이 오동작을 일으키게 된다. 이로 인하여 TCP 프로토콜의 성능은 급격히 저하되어 전체적인 인터넷 서비스의 성능이 떨어지게 된다. 본 논문에서는 이러한 TCP 프로토콜을 성능을 개선시키기 위해 기지국에서 응답패킷을 분할하여 전달하는 SPACK 기법을 제안하였다. 제안된 기법은 컴퓨터 시뮬레이션을 통하여 성능을 분석하였으며, 그 결과 기존의 TCP 프로토콜에 비하여 SPACK을 이용하는 경우 더 높은 성능이 발휘됨을 확인하였다.

• 반도체디스플레이기술학회지
• /
• 제10권3호
• /
• pp.83-87
• /
• 2011

TCP works well in wired networks where packet losses mainly occur due to congestion in data traffic. In wireless networks TCP does not differentiate packet losses from transmission errors or from congestion, which could lead to degrade the network performance. Several methods have been proposed to improve TCP performance over wireless links. Among them the Snoop module working at the base station is the popular method. In this paper, it is shown that the performance of Snoop largely depends upon the transmission link errors and the amount of data traffic. Also, our research shows that the local retransmission timeout value of Snoop can affect throughput. From the simulation results we suggest how to effectively use the Snoop algorithm considering data traffic and transmission link errors. It is expected that the proposed adaptive method will contribute to improving the network performance reducing the burden of the processes for data traffic.

• 한국인터넷방송통신학회논문지
• /
• 제9권4호
• /
• pp.87-97
• /
• 2009

A Mobile Ad hoc Network (MANET) is characterized by multi-hop wireless connectivity, frequently changing network topology with mobile nodes and the efficiency of the dynamic routing protocol plays an important role in the performance of the network. In this paper, the performance of five routing protocols for MANET is compared by using OPNET modeler: AODV, DSR, GRP, OLSR and TORA. The various performance metrics are examined, such as packet delivery ratio, end-to-end delay and routing overhead with varying data traffic, number of nodes and mobility. In our simulation results, OLSR shows the best performance in terms of data delivery ratio in static networks, while AODV has the best performance in mobile networks with moderate data traffic. When comparing proactive protocols (OLSR, GRP) and reactive protocols (AODV, DSR) with varying data traffic in the static networks, proactive protocols consistently presents almost constant overhead while the reactive protocols show a sharp increase to some extent. When comparing each of proactive protocols in static and mobile networks, OLSR is better than GRP in the delivery ratio while overhead is more. As for reactive protocols, DSR outperforms AODV under the moderate data traffic in static networks because it exploits caching aggressively and maintains multiple routes per destination. However, this advantage turns into disadvantage in high mobility networks since the chance of the cached routes becoming stale increases.

• 스마트미디어저널
• /
• 제13권6호
• /
• pp.24-34
• /
• 2024

시계열인 네트워크 트래픽 데이터로부터 미래를 예측할 수 있다면 효율적인 자원 배분, 악성 공격에 대한 예방, 에너지 절감 등의 효과를 거둘 수 있다. 통계 기법과 딥러닝 기법에 기반한 많은 모델이 제안되었는데, 이들 연구 대부분은 모델 구조와 학습 알고리즘을 개선하는 일에 치중하였다. 모델의 예측 성능을 높이는 또 다른 접근방법은 우수한 데이터를 확보하는 것이다. 이 논문은 우수한 데이터를 확보할 목적으로, 시계열 데이터를 증강하는 밀집 샘플링 기법을 네트워크 트래픽 예측 응용에 적용하고 성능 향상을 분석한다. 데이터셋으로는 네트워크 트래픽 분석에 널리 사용되는 UNSW-NB15를 사용한다. RMSE와 MAE, MAPE를 사용하여 성능을 분석한다. 성능 측정의 객관성을 높이기 위해 10번 실험을 수행하고 기존 희소 샘플링과 밀집 샘플링의 성능을 박스플롯으로 비교한다. 윈도우 크기와 수평선 계수를 변화시키며 성능을 비교한 결과 밀집 샘플링이 일관적으로 우수한 성능을 보였다.

• 한국정보통신학회논문지
• /
• 제26권11호
• /
• pp.1630-1636
• /
• 2022

현재 교통 표지판 인식 기법들은 다양한 날씨, 빛의 변화 등과 같은 외부환경 뿐만 아니라 교통 표지판이 일부 훼손된 경우에는 인식 성능이 저하되는 경우가 발생한다. 따라서 본 논문에서는 이러한 문제점을 개선하기 위하여 홉필드 네트워크와 퍼지 Max-Min 신경망을 이용하여 손상된 교통 표지판의 인식 성능을 개선하는 방법을 제안한다. 제안된 방법은 손상된 교통 표지판에서 특징들을 분석한 후, 그 특징들을 학습 패턴으로 구성하여 퍼지 Max-Min 신경망에 적용하여 1차적으로 교통 표지판의 특징을 분류한다. 1차적 분류된 특징이 있는 학습 영상들을 홉필드 네트워크에 적용하여 손상된 특징을 복원한다. 홉필드 네트워크를 적용하여 복원된 교통 표지판의 특징들을 다시 퍼지 Max-Min 신경망에 적용하여 최종적으로 손상된 교통 표지판을 분류하고 인식한다. 제안된 방법의 성능을 평가하기 위하여 손상된 정도가 다른 다양한 교통 표지판 8개를 적용하여 실험한 결과, 제안된 방법이 퍼지 Max-Min 신경망에 비해 평균적으로 38.76%의 분류 성능이 개선되었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• 한국통신학회논문지
• /
• 제23권8호
• /
• pp.1926-1940
• /
• 1998

본 논문은 완전 결합형 ATM 스위치의 성능 분석에 관한 연구결과를 제시하고자 한 내용의 II부로서, 버스티 트래픽 및 비균일 분포에 대한 성능 분석 결과를 포함하고 있다. 사용한 스위치 모델은 ETRI에서 제안한 완전 결합형 ATM 스위치로써 비교적 소규모용으로 설계되었으며 트래픽의 버스트 특성을 효과적으로 홉수하기 위해 2단 버퍼링 구조를 사용하며, 주소 기법은 비트 어드레싱 방식을 사용하여 별도의 기능 블럭 추가없이 멀티캐스팅 기능 구현을 용이하게 하였다. 모의실험을 위해 입력 트래픽 모델은 트래픽의 군집적(bursty) 성질을 포착할 수 있는 IBP 모델과 기존의 트래픽 모델로 사용되어 온 랜덤 트래픽 모델을 고려하였다. 또한 다양한 시나리오 구성을 위해 출력 포트 분포는 균일과 비균일 둘 다를 고려하고 멀티캐스팅 기능도 구현하였다. 본 논문에서는 다양한 환경 하에서 수행한 모의실험 결과를 제시하고 성능 분석을 수행하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1993년도 Fifth International Fuzzy Systems Association World Congress 93
• /
• pp.907-910
• /
• 1993

This paper describes the use of fuzzy control and decision making to simulate the control of traffic flow at an intersection. To show the value of fuzzy logic as an alternative method for control of traffic environments. A traffic environment includes the lanes to and from an intersection, the intersection, vehicle traffic, and signal lights in the intersection. To test the fuzzy logic controller, a computer simulation was constructed to model a traffic environment. A typical cross intersection was chosen for the traffic environment, and the performance of the fuzzy logic controller was compared with the performance of two different types of conventional control. In the hardware verifications, fuzzy logic was used to control acceleration of a model train on a circular path. For the software experiment, the fuzzy logic controller proved better than conventional control methods, especially in the case of highly uneven traffic flow between different directions. On the hardware si e of the research, the fuzzy acceleration control system showed a marked improvement in smoothness of ride over crisp control.

• 디지털산업정보학회논문지
• /
• 제18권2호
• /
• pp.9-16
• /
• 2022

The nodes constituting the vehicle ad hoc network (VANET) are vehicles moving along the road and road side units (RSUs) installed around the road. The vehicle ad hoc network is used to collect the status, speed, and location information of vehicles driving on the road, and to communicate with vehicles, vehicles, and RSUs. Today, as the number of vehicles continues to increase, urban roads are suffering from traffic jams, which cause various problems such as time, fuel, and the environment. In this paper, we propose a method to solve traffic congestion problems on urban roads and demonstrate that the method can be applied to solve traffic congestion problems through performance evaluation using two typical protocols of vehicle ad hoc networks, AODV and GPSR. The performance evaluation used ns-2 simulator, and the average number of traffic jams and the waiting time due to the average traffic congestion were measured. Through this, we demonstrate that the vehicle ad hoc-based traffic congestion management technique proposed in this paper can be applied to urban roads in smart cities.