• 디지털산업정보학회논문지
• /
• 제7권2호
• /
• pp.47-58
• /
• 2011

Snoop was suitably designed for wired and wireless network as having snoop agent module in BS(Base Station) which is connecting to both wired and wireless network in order to supplement the problems of TCP. This study examined performance difference by using the web traffic taken wide possession in current internet traffic. The web traffic has greater amount of traffic, shorter life time, and smaller size than other traffics. This study found that snoop producing performance improvement of wireless network in the network mixed with the wired and wireless lead performance loss when transmitting web traffic. This study found that in case of web traffic is transmitted it bring a performance improvement of web traffic as computing BWE((Bandwidth Expansion), and also found that this study prove of performance improvement by decreasing local retranmission.

• IEIE Transactions on Smart Processing and Computing
• /
• 제1권3호
• /
• pp.182-191
• /
• 2012

This paper proposes a high performance QoS (Quality of Service) traffic transmission scheme to provide real-time multimedia services in wireless networks. This scheme is based on both a traffic estimation of the mean rate and a header compression method by dividing this network model into two parts, core RTP/UDP/IP network and wireless access parts, using the IEEE 802.11 WLAN. The improvement achieved by the scheme means that it can be designed to include a means of provisioning the high performance QoS strategy according to the requirements of each particular traffic flow by adapting the header compression for real-time multimedia data. A performance evaluation was carried out to show the effectiveness of the proposed traffic transmission scheme.

• 한국멀티미디어학회논문지
• /
• 제6권7호
• /
• pp.1239-1244
• /
• 2003

본 논문에서는 접속 노드와 무선 채널로 구성되는 무선 ATM(Asynchronous Transfer Mode) 접속 구조에서 랜덤 트래픽의 셀 손실율에 대한 성능을 분석하였다. 랜덤 트래픽 환경에 대하여 접속노드는 셀 레벨(cell levell)의 큐잉 모델을 적용하였다. 그리고 무선 채널을 버스트 에러 환경으로 고려하여 무선 ATM 접속 구조의 셀 손실율을 나타내는 수식을 도출하였다. 무선 ATM접속 구조에서 랜덤 트래픽의 셀 손실율 성능을 개선하기 위해 FEC(Forward Error Correction) 기법을 적용할 수 있는데, 본 논문에서는 여러 FEC 기법을 적용한 경우의 셀 손실율 성능을 정량적으로 비교 분석하여 그 중에서 제안한 concatenated 코드가 가장 우수함을 입증하였다.

• 정보와 통신
• /
• 제32권10호
• /
• pp.31-40
• /
• 2015

This paper investigates several existing techniques to reduce high-availability seamless redundancy (HSR) traffic. HSR is a redundancy protocol for Ethernet networks that provides duplicated frames for separate physical paths with zero recovery time. This feature makes it very useful for real-time and mission-critical applications, such as military applications and substation automation systems. However, the major drawback of HSR is that it generates too much unnecessary redundant traffic in HSR networks. This drawback degrades network performance and may cause congestion and delay. Several HSR traffic reduction techniques have been proposed to reduce the redundant traffic in HSR networks, resulting in the improvement of network performance. In this paper, we provide an overview of these HSR traffic reduction techniques in the literature. The operational principles, advantages, and disadvantages of these techniques are investigated and summarized. We also provide a traffic performance comparison of these HSR traffic reduction techniques.

• Journal of Communications and Networks
• /
• 제14권6호
• /
• pp.653-661
• /
• 2012

High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

• 한국안전학회지
• /
• 제25권2호
• /
• pp.89-94
• /
• 2010

This study deals with the traffic accident according to the improvement projects of frequent accident locations. The objective is to analyze the impact of improvements on the accident reduction. In pursuing the above, the study gives the particular attentions to developing the models based on the data of 70 intersections improved. The main results analyzed are as follows. First, 4 multiple linear regression accident models(total, side right-angle, rear end and side stripe accident) which were statistically significant were developed. Second, total accidents reduction by sight-distance and turning traffic flow improvements, side right-angle by sight-distance, over-speed and lane operation, rear end by turning traffic flow, signal and lane operation, and side stripe by traffic impedance improvements were analyzed. Finally, the above 4 models were evaluated to be statically significant through the correlation analysis and pair-sample t-test.

• 한국통신학회논문지
• /
• 제38B권7호
• /
• pp.519-525
• /
• 2013

응용 레벨 트래픽 분류는 안정적인 네트워크 운영과 자원 관리를 위해서 필수적으로 요구된다. 트래픽분류에 있어서 페이로드 시그니쳐 기반 응용 레벨 트래픽 분류 방법은 고속 링크의 트래픽을 실시간으로 처리하는 과정에서 헤더 정보 및 통계 정보 이용 방법론에 비해 상대적으로 높은 부하를 발생시키며 처리 속도가 느린 단점을 갖는다. 본 논문에서는 페이로드 시그니쳐 기반 트래픽 분류 시스템의 처리 속도를 향상 위하여 응용 트래픽의 지역성을 이용한 서버 IP, Port캐쉬 기반 트래픽 분석 시스템을 제안한다. 제안하는 방법을 학내 망의 실제 트래픽에 적용하여 최대 10배 이상의 처리 속도 향상과 10% 이상의 플로우 분석률을 향상 시킬 수 있었다.

• 한국인터넷방송통신학회논문지
• /
• 제23권6호
• /
• pp.97-102
• /
• 2023

본 연구는 최근 다양화, 대규화 되어가는 IoT시스템을 위한 시험기 개선에 관한 것으로 IoT성능시험기의 패킷 처리 성능개선, 트래픽 프로토콜 생성과 동작에 유연성을 확보하는 방안에 대한 것이다. 본 연구의 목표는 고도화되어 가는 대용량 IoT 네트워크 시스템에서 데이터 트래픽 전송의 안정성을 사전에 검증하고 성능을 측정하는 개방형 소프트웨어인 DPDK기반 고속 IoT 네트워크 성능시험 시스템을 설계하는 것이다. DPDK 기반 트래픽 발생기를 이용하여 고속 IoT 성능시험기의 기본 구성을 설계하였으며 실험을 통해 해당 시스템 적용시 트래픽 모델링하고 패킷생성능력의 기대효과를 제시하였다.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제2권8호
• /
• pp.335-342
• /
• 2013

네트워크의 고속화와 다양한 서비스의 등장으로 오늘날의 네트워크 트래픽은 복잡 다양해지고 있다. 효율적인 네트워크 관리를 위해서 QoS, SLA와 같은 정책을 적용하기 위해서는 트래픽 분석 중에서도 응용 트래픽 분류의 중요성이 크다. 현재까지 트래픽 분류에 관한 연구가 활발히 진행되어 왔는데 최근에는 플로우의 통계 정보를 이용한 트래픽 분류 방법론이 많이 연구되고 있다. 하지만 플로우의 통계 정보를 이용한 트래픽 분류 방법론에는 필히 고려해야 할 여러 문제점이 있다. 본 논문에서는 정답지 트래픽 분석을 통해 통계 정보 기반 트래픽 분석 방법론의 해결해야 하는 문제점들을 분석하고 그 해결방안에 대해 제안한다. 통계 정보 기반 트래픽 분석 방법론에서 필히 해결해야 할 문제점은 총 네 가지로 Feature들의 거리 측정 방법과 대표값 추출 방법, TCP 세션의 이상동작, 그리고 패킷 별 가중치이다. 제안하는 방법은 선정한 통계 시그니쳐 기반 트래픽 분석 시스템을 이용한 학내 망에서의 실험을 통해 그 성능을 검증한다.

• 산업공학
• /
• 제16권3호
• /
• pp.311-321
• /
• 2003

We propose the improved channel assignment and management methods for an efficient use of traffic channel resource for supporting 12.2 Kbps, 64 Kbps, and 384 Kbps traffic with the different quality of service(QoS) in the radio network controller(RNC) in asynchronous IMT-2000 system. We consider two types of traffic channel block assignments for utilizing the traffic channel efficiently; the Completely Shared(CS) channel assignment and the Partially Dedicated and Partially Shared(PDPS) channel assignment. The former is that all traffic channel blocks are completely shared with all traffic types. The latter is that some traffic channel block is independently assigned to each traffic type and the other blocks are completely shared with some traffic type. We also propose the traffic channel management method which consists of the block and task management step, for efficiently assigning, releasing, and managing the channel resource. Finally, we evaluate the performance through various numerical examples when applying our proposed channel block assignment and resource management methods.