• Journal of KIISE:Information Networking
• /
• v.36 no.2
• /
• pp.69-79
• /
• 2009

Today's Internet is one of the necessaries of our life. Anomalies of the Internet provoke social problems. For that reason, Internet Measurement which studies characteristics on Internet traffic attracts pubic attention. Recently, Traffic Dispersion Graph (TDG), a novel traffic analysis method, was proposed. The TDG is not a statistical analysis method but a graphical visualization method on interactions among network components. In this paper, we propose a new anomaly detection paradigm and its technique using TDG. The existing studies have focused on detecting anomalous packets of flows. On the other hand, we focus on detecting the sources of anomalous traffic. To realize our paradigm, we designed the TDG Clustering method. Through this method, we could classify anomalous hosts infected by various worm viruses. We obtained normal traffic through dropping traffic of the anomalous hosts. Especially, we expect that the TDG clustering method can be applied to real-time anomaly detection because calculations of the method are fast.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.4
• /
• pp.846-853
• /
• 2004

This paper introduces implementation of a traffic distributed processing system on the Web Sever Networking. The study used two software packages （Packet Capture and Round-Robin Test Package） to check packet quantity from Virtual Network Structure (data generator, virtual server, Serve. 1, 2, 3), and could find out traffic distribution toward Server 1, 2, and 3. The functions of implemented Round-Robin Load Balancing Monitoring System include Round-Robin testing, system monitoring, and graphical indication of data transmission/packet quantity (figures ＆ diagram). As the result of the study shows, Round-Robin Algorithm ensured definite traffic distribution, unless incoming data loads differ much. Although error levels were high in some cases, they were eventually alleviated by repeated tests for a long period of time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.386-393
• /
• 2004

In order to maintain load balancing in distributed systems in a decentralized manner, every node should obtain workload information from all the nodes on the network. It requires $Ο({v^2})$ traffic overheads, where v is the number of nodes. This paper presents a new synchronous dynamic distributed load balancing algorithm for a ( v,k+1,1)-configured network topology, which is a kind of 2k regular graph, based on symmetric balanced incomplete block design, where v equals ${k^2}+k+1$. Our algorithm needs only Ο(v√v) message overheads and each node receives workload information from all the nodes without redundancy. And load balancing in this algorithm is maintained so that every link has same amount of traffic by √v for transferring workload information.

• Annual Conference of KIPS
• /
• 2017.04a
• /
• pp.113-116
• /
• 2017

최근 급격히 증가한 모바일 기기와 Over The Top (OTT) 서비스의 활성화로 인하여 CMM 기반의 LTE/EPC 네트워크에 과다한 데이터/제어 트래픽의 수용이 힘들어지는 문제가 중요 이슈로 부각되고 있다. 이를 해결하기 위하여 IETF는 Distributed Mobility Management (DMM) 기반의 이동성 관리 방안을 제안하였다. 하지만 DMM 기술은 중앙의 트래픽 부하 분산에 초점을 두고 있어 단말의 이동과 관련하여 발생하는 과다한 제어 트래픽 수용에 관한 문제를 해결하기에는 부족하다. 따라서 본 논문에서는 이러한 문제를 해결하기 위하여 SDN 기반으로 CMM과 DMM을 함께 이용하는 HMM (Hybrid Mobility Management) LTE/ECP 네트워크 모델을 제시한다. 또한 HMM 기반의 LTE/EPC 네트워크 모델은 CMM 및 DMM 기법의 선택을 위해 단말의 이동성과 PDN 연결의 개수를 고려한 선택방안을 제시하며, 제안하는 HMM 기반의 LTE/EPC 네트워크 구조에서의 데이터 트래픽 부하량과 단말의 이동성과 PDN 연결 개수에 따라 제어 트래픽의 양을 비교하는 그래프를 제시하며 제안하는 네트워크 모델의 타당성을 입증한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1524-1531
• /
• 2004

This study analyzes a load balancing technique using Round Robin Algorithm. The study uses two software packages (Packet Capture and Round Robin Test Package) to check packet volume from Virtual Network structure (data generator, virtual server, Server1,2,3), and finds out traffic distribution toward Server1,2 and 3. The functions of implemented Round Robin Load Balancing Monitoring System include round robin testing, system monitoring, and graphical indication of data transmission and packet volume. As the result of the study shows, Round Robin Algorithm allows servers to ensure definite traffic distribution, unless incoming data loads differ much. Although error levels are high in some cases, they were eventually alleviated by repeated tests for a long period of time.

• Annual Conference of KIPS
• /
• 2004.05a
• /
• pp.899-902
• /
• 2004

임베디드 시스템은 현재 가전, 단말, 제어, 통신등 다양한 분야에서 응용되고 있으며 컴퓨터 관련 기술의 발전과 더불어 응용분야는 더욱 넓어질 것이다. 이러한 임베디드 시스템의 관리나 테스트를 위해 모니터링 프로그램이 필요하다. 임베디드 시스템은 일반 PC 시스템과 달리 많은 제약을 가지고 있다. 본 논문에서는 자원적 제약을 가진 임베디드에 활용되어지는 NFS를 이용한 임베디드 장비 모니터링에 적합한 MONETA(distributed MONitoring for Embedded TArget system)를 설계, 구현하였다. MONETA에서 제시하는 구조는 모니터링을 위한 서버, 모니터링하는 대상인 클라이언트, 시스템 사용자의 3계층 구조의 분산 모니터링 시스템으로 각 장비별 CPU, Moemory, Disk, 트래픽량을 그래프로 나타도록 구현된다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.