• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.67-76
• /
• 2012

Traffic classification plays an important role in traffic management. To traditional methods, P2P and encryption traffic may become a problem. Support Vector Machine (SVM) is a useful classification tool which is able to overcome the traditional bottleneck. The main disadvantage of SVM algorithms is that it's time-consuming to train large data set because of the quadratic programming (QP) problem. However, the useful support vectors are only a small part of the whole data. If we can discard the useless vectors before training, we are able to save time and keep accuracy. In this article, we discussed the feasibility to remove the useless vectors through a sequential method to accelerate training speed when dealing with large scale data.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.59-62
• /
• 2001

This paper discusses a data mining technique for time series analysis of traffic data, which provides useful knowledge for network configuration management. Commonly, a network designer must employ a combination of heuristic algorithms and analysis in an interactive manner until satisfactory solutions are obtained. The problem of heuristic algorithms is that it is difficult to deal with large networks and simplification or assumptions have to be made to make them solvable. Various data mining techniques are studied to gain valuable knowledge in large and complex telecommunication networks. In this paper, we propose a traffic pattern association technique among network nodes, which produces association rules of traffic fluctuation patterns among network nodes. Discovered rules can be utilized for improving network topologies and dynamic routing performance.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.225-228
• /
• 2000

In this paper, a design of the reliable video-conference system using CTI(Computer Telephony Integration) technology is proposed. When video-conference is run on the current existing Internet, the transmission delay problem for voice data traffic can be frequently occurred. In order to transmit the real-time voice data through the Internet efficiently, some complicated algorithms such as CODEC(Code/Decode) should be applied. It can cause further excessive processing delay which can affect the overall performance. The voice traffic is usually transmitted through the reliable PSTN(Public Switched Telephone Network) in the CTI system. In this paper a new architecture, in which PSTN for voice traffic and Internet for video traffic are used at the same time instead of using Internet by itself, is proposed to relieve the problems on a video conference.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.30-35
• /
• 2002

The deployment of multicast communication services in the Internet is expected to lead a stable packet transfer even in heavy traffic as in On-Line Game environment. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. So, measuring the bottleneck link bandwidth along a path is important for understanding the performance of multicast. We propose not only a definition of CBT's core link state that Steady-State(SS), Normal-State(NS) and Bottleneck State(BS) according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construct shard multicast trees.

• IE interfaces
• /
• v.18 no.4
• /
• pp.494-503
• /
• 2005

This paper considers the problem of performance analysis for the multiplexer, when homogeneous periodic on-off sources are statistically multiplexed. Periodic on-off source model is defined that on-period and off-period are repeated by once in a deterministic periodic time and in on-period, cell arrives with deterministic time interval. In order to reflect periodicity of source model, we consider two multiplexing situation, such as random multiplexing and synchronized multiplexing. In both case, we obtain the overload-period distribution in the multiplexer, and an approximate method using the overload period distribution is suggested for obtaining the CLP(Cell Loss Probability) in the buffer of the multiplexer. A numerical example using MPEG-I real traffic samples and the results are also presented.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.325-329
• /
• 2007

The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2936-2938
• /
• 2005

The deployment of multicast communication services in the internet is expected to lead a stable packet transfer even in heavy traffic as in network system environment. The core based tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. so, measuring the bottleneck link bandwidth along a path is important for understanding th performance of multicast. We propose not only a definition of CBT's core link state that Steady-State, Normal-State and Bottleneck State according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construst shard multicast trees.

• Proceedings of the KSR Conference
• /
• 2004.06a
• /
• pp.528-533
• /
• 2004

The purpose of this thesis is to construct the autonomous decentralized train traffic management structure using techniques of Autonomous Decentralized System. Currently, a method of train traffic control is making use of CTC(Centralized Traffic Control). Its operation method is divided into the remote mode and the local mode. The classified basis is according to the control authority of install signals in track side. In most cases, a large scale station is operated by the local mode. Because of dispatchers in center can not control the shunting works influence on the main route. In order to solve these problem s, we analyzed a current operation condition and system requirements. Moreover, this thesis is constructing autonomous decentralized train traffic management structure. Finally, this research proposed that interface with CTC and step-by-step construction.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.86-89
• /
• 1998

Multiple types of information in a multimedia service are delivered though multiple virtual connections on ATM network, while each virtual connection may be controlled independently. A multimedia service requires an associative relationship among multiple information streams to provide required harmonization. There may be required additional traffic descriptors to guarantee the required harmonization among multiple information streams in a multimedia service. For buffering of large bandwidth information stream(e.g., video), extremely large buffer size is necessary, but this approach should not be efficient way to compensate a severely delayed cells/blocks experienced at network. The best way to solve this problem will be minimization of relative-delayed-transfer of cells/blocks to application processes through ATM network control. To minimize a delayed transfer the mapping between relative delay parameter(i.e., associative Group QoS parameters) and per-VC traffic descriptor will be necessary. This paper is present additional functions and parameters to interpret the mapping between relative delay parameters(i.e., associative Group QoS parameters) and per-VC traffic descriptors in ATM API for multimedia application services.

• Journal of KSNVE
• /
• v.8 no.5
• /
• pp.799-806
• /
• 1998

Noise and vibration due to railway traffic are major causes of environmental pollution in the city. In course of judging, assessing and coping with the problem, it becomes imperative to predict the vibration level induced by railway traffic passing through downtown in the city. The vibration due to railway traffic is transferred to the neighbouring buildings through the ground. In this study, as a method predicting vibration level of the buildings near railway, a vibration transfer formula is suggested. This formula is used to calculate vibration level occuring at the bottom of the neighbouring buildings, which are located at a certain distance from railway.