• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1099-1104
• /
• 2020

In order to provide various types of application services based on the Internet, it is ideal to guarantee the quality of service(QoS) for each flow. However, realizing these ideas is not an easy task.. It is effective to classify multiple flows having the same or similar service quality requirements into same group, and to provide service quality for each group. The queue management mechanism in the router plays a very important role in order to efficiently transmit data and to support differentiated quality of service for each service. In order to efficiently support various multimedia services, an intelligent and adaptive queue management mechanism is required. This paper proposes an intelligent queue management mechanism based on deep reinforcement learning that decides whether to deliver packets for each group based on the traffic information of each flow group flowing in for a certain period of time and the current network state information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1339-1346
• /
• 2015

The traffic identification is a preliminary and essential step for stable network service provision and efficient network resource management. While a number of identification methods have been introduced in literature, the payload signature-based identification method shows the highest performance in terms of accuracy, completeness, and practicality. However, the payload signature-based method's processing speed is much slower than other identification method such as header-based and statistical methods. In this paper, we first classifies signatures by matching type based on range, order, and direction of packet in a flow which was automatically extracted. By using this classification, we suggest a novel method to improve processing speed of payload signature-based identification by reducing searching space.

• Journal of Internet Computing and Services
• /
• v.2 no.2
• /
• pp.23-36
• /
• 2001

To support real-time multicast, the existing DS network may use the EF PHB for transmission, However, because of the dynamic characteristics of the multicast flow and the features of the EF PHB. it is very difficult to make a provision of resources or to manage the network when EF multicast flows increase, Also, the existing LBE PHB can not guarantee the transmission delay bounds required for the real-time multicast traffic, In this paper. a new concept of PHB. namely, low-delay multicast PHB, that may guarantee approximately the per-hop delay is proposed, For the low-delay multicast PHB, router architectures are devised, The queue management algorithm on a low-delay multicast queue and a scheduling method are also devised. This new architecture of the LDM AF class is simple to be implemented.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.1
• /
• pp.23-34
• /
• 2022

With the development of network technology, the application area has also been diversified, and protocols for various purposes have been developed and the amount of traffic has exploded. Therefore, it is difficult for the network administrator to meet the stability and security standards of the network with the existing traditional switching and routing methods. Software Defined Networking (SDN) is a new networking paradigm proposed to solve this problem. SDN enables efficient network management by programming network operations. This has the advantage that network administrators can flexibly respond to various types of attacks. In this paper, we design a threat level management module, an attack detection module, a packet statistics module, and a flow rule generator that collects attack information through the controller and switch, which are components of SDN, and detects attacks based on these attributes of SDN. It proposes a method to block denial of service attacks (DoS) of advanced attackers by programming and applying honeypot. In the proposed system, the attack packet can be quickly delivered to the honeypot according to the modifiable flow rule, and the honeypot that received the attack packets analyzed the intelligent attack pattern based on this. According to the analysis results, the attack detection module and the threat level management module are adjusted to respond to intelligent attacks. The performance and feasibility of the proposed system was shown by actually implementing the proposed system, performing intelligent attacks with various attack patterns and attack levels, and checking the attack detection rate compared to the existing system.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.2
• /
• pp.139-147
• /
• 2004

To provide Internet QoS, the IETF Proposed two models of Integrated Services (IntServ) and Differentiated Services (DiffServ) Unlike IntServ where resource reservation and admission control is Per-flow based using RSVP. DiffServ supports aggregated traffic classes to provide various QoS to different classes of traffics. However a dynamic QoS management system is required to dynamically provide differentiated QoS for customers who require dynamic QoS change. This paper designed and implemented therefore a policy-based QoS management system to manage effectively and configure dynamically QoS of DiffServ networks. The validity of the system has been verified by the experimentation on the Linux-based DiffServ network.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.194-204
• /
• 2008

The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic. We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.1-7
• /
• 2019

Recently, multimedia streaming service has been activated, and the demand for high-quality multimedia convergence contents services is predicted to increase significantly in the future. The issues of the increasing network load due to the rise of multimedia streaming traffic must be addressed in order to provide QoS guaranteed services. To do this, an efficient network resource management and mobility support technologies are needed through seamless mobility support for heterogeneous networks. Therefore, in this paper, an MIH technology was used to recognize the network situation information in advance and reduce packet loss due to handover delays, and an ACLMIH-FHPMIPv6 is designed that can provide an intelligent interface through introducing a hierarchical mobility management technique in FPMIPv6 integrated network.

• Journal of Korean Society of Transportation
• /
• v.18 no.5
• /
• pp.83-97
• /
• 2000

The traffic management schemes through traffic signal control and information provision could be effective when the link-level data and trip-level data were used simultaneously in analysis Procedures. But, because the trip-level data. such as origin, destination and departure time, can not be obtained through the existing surveillance systems directly. It is needed to estimate it using the link-level data which can be obtained easily. Therefore the objective of this study is to develop the model to estimate O-D demand using only the link flows in highway network as a real time. The methodological approaches in this study are kalman filer, least-square method and normalized least-square method. The kalman filter is developed in the basis of the bayesian update. The normalized least-square method is developed in the basis of the least-square method and the natural constraint equation. These three models were experimented using two kinds of simulated data. The one has two abrupt changing Patterns in traffic flow rates The other is a 24 hours data that has three Peak times in a day Among these models, kalman filer has Produced more accurate and adaptive results than others. Therefore it is seemed that this model could be used in traffic demand management. control, travel time forecasting and dynamic assignment, and so forth.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.345-352
• /
• 2017

Traffic management is a highly beneficial mechanism for satisfying quality-of-service requirements and overcoming the resource scarcity problems in networks. This paper introduces an optimal connection admission control mechanism to decrease the packet loss ratio and end-to-end delay in cognitive radio sensor networks (CRSNs). This mechanism admits data flows based on the value of information sent by the sensor nodes, the network state, and the estimated required resources of the data flows. The number of required channels of each data flow is estimated using a proposed formula that is inspired by a graph coloring approach. The proposed admission control mechanism is formulated as a semi-Markov decision process and a linear programming problem is derived to obtain the optimal admission control policy for obtaining the maximum reward. Simulation results demonstrate that the proposed mechanism outperforms a recently proposed admission control mechanism in CRSNs.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.519-523
• /
• 2003

This paper describes the communication system of sequencing sorter. Generally sequencing sorter is a machine that sorts mails by delivery order. And designed sequencing sorter is composed of 5 physical modules. So, it is necessary to communicate with each module and to control this communication. A computer called Machine Management Computer, controls this. This paper is about the communication system with MMC and module controllers. This is PC-based, asynchronous full-duplex 4-wire serial systems. 3 protocol layers are presented and stop-and-wait flow control is adopted. Because designed sequencing sorter has to be operated high speed about 27,000 letters per hour, we analyzed the network traffic in the worst case. So, we could find that the communication system has to use above 115,200bps speed.