• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.161-169
• /
• 2009

A traffic analysis on the Internet has an advantage for obtaining the characteristics of transferred packets. There were many studies to understand the characteristics of the Internet traffic with mathematical statistical approach. The approach of this study is different from previous studies. We first introduced a virtual network concept to present the Internet as a simplified mathematical model. It also represents each traffic flowing on the Internet as a parallel Gaussian channel on the virtual network. We suggest the optimal capacity of each parallel Gaussian channel using some related studies on the Gaussian channel model.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.4-4
• /
• 2004

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.48-49
• /
• 2013

복잡한 네트워크 환경에서 광 대역 범위의 보안 정책을 적용하기 위하여 리눅스 커널기반의 Bridge 방화벽을 적용하고 운영시 실시간 트래픽 측정과 모니터링을 위하여 NTOP을 이용하여 실시간 모니터링 시스템을 구현하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1160-1168
• /
• 2000

This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block which makes it possible to monitor bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. Additionally, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to protect the network from being congested and to find out a cost-effective buffer design method.

• Journal of Korea Game Society
• /
• v.4 no.4
• /
• pp.3-9
• /
• 2004

Expansion of internet and construction of high speed network which require multimedia services like MMORPG are exceeding the infra-structure. In this work, CBT is analyzed by focusing on the multicast routing protoco and the algorithm which is transformable to Anycast scheme from CBT scheme is suggested to adapt game traffic. Anycast routing scheme is suitable to distribute high density traffic. Simulation model was set per a number of group and group member, which enabled to reflect real environments. Performance evaluation of routing based on the characteristics of end-to-end delay of CBT and Anycast was mainly focused, The result showed that Anycast method was improved up 8.7%, 25.5%, 34.0%, 38.6% and 51.8%, 56.6% comparing with PIM-DM and CBT routing when packet site was 128, 512 and 1K byte respectively. From the simulation, CBT/Anycast routing scheme can be presented as a flexible and solid solution for the MMORPG traffic to improve the delay characteristics of game packets.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.388-398
• /
• 2004

This paper focuses on the reduction method of message traffic occurred when multiple participants collaborate in the distributed virtual environment. It is referred to as filtering method of update message to minimize data traffic exchanged in the virtual environment, and it is the essential process to improve the scalability of the virtual environment. Spatial partitioning method, a popular filtering technique, divides the whole environment into smaller sub-parts in order to make it small the regions to be maintained consistently. However, it is less flexible and adaptable because the information of area of interest must be configured before simulation. In this paper, the concept of dynamic area of interest is proposed, which is highly adaptable by applying dynamic environmental elements to AOI management. It uses multiple layering and multiple consistency algorithms for dynamic management, and makes it possible to consume system resource efficiently. For performance evaluation, experiments are performed with virtual avatars, measuring message traffic. Finally, the proposed model could be applied to the AOI management systems which accommodate massive users like MMORPG, or virtual communities.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.641-649
• /
• 2005

Metro networks use the existing circuit-switching technology like SONET/SDH. Such circuit-switching based networks are inefficient in tarrying Internet traffic with bursty nature. Therefore, metro networks can become a bottleneck In order to resolve this problem, the IEEE 802.17 working group has proposed the RPR (Resilient Packet Ring) technology. In addition to this, the RPR fairness mechanism has been defined to provide fairness among the stations in the RPR network. However, the current RPR fairness mechanism has the problem of inefficient use of the available bandwidth after when the congestion at a node is resolved. In this paper, we propose an improved bandwidth allocation mechanism in which, after the congestion resolution at a node, the node estimates the number of nodes transmitting data and measures the remaining bandwidth and fairly allocates the available bandwidth to active nodes. To show the performance of our proposed mechanism, we have performed simulation and showed that the proposed mechanism offers higher bandwidth utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9B
• /
• pp.591-595
• /
• 2005

In this paper, we propose the fairness improvement leaky bucket (PILB) algorithm as a traffic policing mechanism. In the proposed algorithm, there is a cell buffer for every ATM connection in order to store date cells. Network decides whether an ATM connection obeys the contracted traffic parameter, and stores data cells in the cell buffer if the connection obeys but is considered as violated the contract due to temporary lack of network resource. By using the proposed algorithm, we can obtain the statistical multiplexing gain that is the superiority of packet switching network. Moreover, when a connection tries to transmit more data cells by violating the contracted traffic parameters, the connection is prevented from using excess network resource, which incurs all connections sharing network resource fairly. The performance of the proposed FILB algorithm is investigated by using the simulation. The result shows that the proposed algorithm provides superior performance and all connections within a group share network resource fairly. The proposed algorithm can be applied not only the ATM network but also IP network.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.1-15
• /
• 2010

The damage of safety accidents at home can be minimized by preventing accidents in advance as well as by coping with the accidents promptly through the help of safety management system. In this paper, we identify several services to prevent and cope with the accidents that may occur at home by leveraging sensors and wireless network technology available at home network environments. In order to provide these services, we propose a context-aware system for safety management at home. The proposed system awares the dangerous situations through the information collected by the sensors in home network environment. The proposed system tries to not only prevent the accidents but also to cope with the situations using the information of rescue targets and the location where the accident occurs. We evaluate the appropriateness of sensors by implementing the proposed environments. Through OPNET simulation experiments, we also measure the amount of network traffic in order to confirm that the bandwidth of IEEE 802.15.4 is enough for the proposed system. Finally, we determine more appropriate wireless data transmission mechanism with respect to the end-to-end delay and battery consumption for the proposed system.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.189-196
• /
• 2006

This paper proposes a priority based AOI management model as a method to effectively process message traffic for collaboration in virtual environments. Where message traffic reaches the maximum capacity of the message replay server in DVE, some of the events might be delayed to be updated at the remote clients. Because existing AOI models depend only on the occurrence time of events, they have a problem that more important events in the context might be processed later than less serious ones. Close Interactions with other participants are relatively more important than simple events which happen at a distance from the participant. This study classifies the priorities of events according to the degree of interest, and proposes a method to reduce processing delay time of events highly interested by a user. The proposed model offers a way to effectively utilize limited capacity of a server using a priority queue mechanism, which is able to handle different kinds of events. To prevent from starvation of simple events and to give fairness to the proposed algorithm, event occurrence time is also considered as well as degree of interest when processing events.