• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.484-486
• /
• 2000

인터넷 비디오 방송 같은 멀티미디어 응용 프로그램들은 네트워크를 통한 비디오 전송을 필요로 한다. 그런데 네트워크 자원에 제약이 많은 경우에는 전송되는 비디오 스트림의 손실이 불가피하며 이러한 손실이 클라이언트나 네트워크에서 일어난다면 네트워크 자원의 낭비가 생기게 된다. 이에 본 논문에서는 제약이 많은 네트워크를 통해 계층적 인코딩이 적용된 비디오 스트림을 전송할 때 서버가 프레임 전체를 버리지 않고 가능하면 덜 중요한 계층만을 최적으로 버리는 선택적 계층 삭제 알고리즘을 제안하였다. 어떤 계층을 버리는데 드는 비용을 클라이언트 측에서 얻을 수 있는 QoS와 연관지어 볼 때, 제안하는 선택적 계층 삭제 알고리즘은 네트워크 자원 제약이 커질수록 기존의 선택적 프레임 삭제 알고리즘보다 높은 QoS를 보여주었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.39-46
• /
• 2005

As the multimedia application traffic takes more portion in the internet traffic, it is necessary to control the network congestion through the congestion control protocol. In addition, the QoS-enabled networks such as DiffServ become an indispensable technology when running the multimedia applications. However, the previously proposed end-to-end congestion control algorithms take the round trip time to react the network congestion. Thus, as the RTT becomes larger, the reaction against the congestion gets delayed further, while the network congestion gets worse. In addition the performance of end-to-end congestion control algorithm is degraded if the QoS-enabled network runs the congestion control mechanism in the network level without any coordination between them. In this paper, we propose the early rate adaptation protocol for the DiffServ network which effectively linke the congestion control algorithm at the host and the congestion mechanism in the network together. By taking advantage of early congestion notification from the network it is possible to react the network congestion more quickly and effectively.

• The Korean Journal of Applied Statistics
• /
• v.28 no.1
• /
• pp.1-8
• /
• 2015

Security has become an issue due to the rapid increases in internet traffic data network. Especially P2P traffic data poses a great challenge to network systems administrators. Preemptive measures are necessary for network quality of service(QoS) and efficient resource management like blocking suspicious traffic data. Deep packet inspection(DPI) is the most exact way to detect an intrusion but it may pose a private security problem that requires time. We used several machine learning methods to compare the performance in classifying network traffic data accurately over time. The Random Forest method shows an excellent performance in both accuracy and time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10B
• /
• pp.831-840
• /
• 2004

Providing quality of service (QoS) guarantees over wireless link requires thorough understanding and quantification of the interactions among the traffic source, the wireless channel, and the underlying error control mechanisms. In this paper, we account for such interactions in a network-layer model that we use to investigate the delay performance of a wireless channel. We consider a single ON/OFF traffic stream transported over a wireless link. The capacity of this link fluctuates according to a fluid version of Gilbert-Elliot's model. We derive the packet delay distribution via two different approaches: uniformization and Laplace transform. Numerical aspects of both approaches are compared. The delay distribution is further used to quantify the wireless effective bandwidth under a given delay guarantee. Numerical results and simulations are used to verify the adequacy of our analysis and to study the impact of error control and bandwidth allocation on the packet delay performance. Wireless networks, QoS, delay distribution, fluid analysis.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.5
• /
• pp.37-45
• /
• 2004

As Internet technologies are mature, many new applications that are different characteristics are emerging. Recently we see wide use of P2P(Peer to Peer) applications of which traffic shows different statistical characteristics compared with traditional application such as web(HTTP) and FTP(File Transfer Protocol). In this paper, we measured subscriber network of KT(Korea Telecom) to analyze P2P traffic characteristics. We show flow characteristics of measured traffic. We also estimate Hurst parameter of P2P traffic and compare self-similarity with web traffic. Analysis results indicate that P2P traffic is much bustier than web traffic and makes both upstream traffic and downstream traffic be symmetric. To predict parameters related QoS such as packet loss and delays we model P2P traffic using two self-similar traffic models and predict both loss probability and mm delay then compare their accuracies. With simulation we show that the self-similar traffic models we derive predict the performance of P2P traffic accurately and thus when we design a network or evaluate its performance, we can use the P2P traffic model as reference input traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.329-337
• /
• 2009

In wireless networks, maximizing throughput and minimizing energy consumption are two conflicting objectives. For elastic traffic, it is important to enhance the throughput since it directly affects the quality-of-service(QoS) of users. At the same time, the energy consumption should be minimized in order to prolong the battery lifetime of the mobile station. In this paper, we propose an energy efficient sleep scheme that considers throughput and energy saving simultaneously. The proposed scheme is designed for an efficient tradeoff between throughput and energy saving when receiving elastic traffic. Through extensive simulations, we compare the proposed scheme with the conventional scheme. Our proposed scheme outperforms the conventional one in terms of utility, i.e., user satisfaction, which is defined as inversely proportional to the weighted multiplication of service completion time and energy consumption.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.5
• /
• pp.807-816
• /
• 2021

With the technology of the 4th industrial revolution, network traffic is increasing due to an increase in supply, an increase in demand, and an increase in the complexity of traffic patterns. SDN, a concept in which H/W and S/W are separated in order to efficiently manage such massive traffic, is attracting attention as a next-generation network. A lot of research is being conducted on the merits of applying flexible policies by avoiding the problem of rigid vendor dependency by using the SDN controller implemented with S/W Opensource. Therefore, in this paper, we propose an efficient load balancing technique by grouping through the packet structure of the network layer using the control layer and infrastructure layer of SDN and analyzing the packet delay and reception rate.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.725-732
• /
• 2002

Presented is a Genetic Algorithm (GA) for dynamic partitioning an ATM LANE(LAN Emulation) network. LANE proves to be one of the best solutions to provide guaranteed Quality of Service (QoS) for mid-size campus or enterprise networks with minor modification of legacy LAN facilities. However, there are few researches on the efficient LANE network operations to deal with scalability issues arising from broadcast traffic delivery. To cope with this scalability issue, proposed is a decision model named LANE Partitioning Problem (LPP) which aims at partitioning the entire LANE network into multiple Emulated LANs (ELANS), each of which works as an independent virtual LAN.

• Proceedings of the KAIS Fall Conference
• /
• 2006.05a
• /
• pp.529-533
• /
• 2006

인터넷의 이용이 보편화 되면서 사용자들은 유 ${\bullet}$ 무선에 관계없는 다양한 인터넷서비스를 요구하고 있다. 그러나 이러한 서비스 제공을 위해서는 서로 다른 트래픽 특성 및 전송속도 등에 대한 충분한 고려가 있어야 하며, 그 이전에 유 ${\bullet}$ 무선 네트워크의 통합이 전제되어야 한다. 현재 이러한 문제점을 해결하기 위해 다양한 연구가 진행되고 있으며, 이 중 가장 유력한 대안으로 떠오르고 있는 것이 ALL-IP 네트워크이다. ALL-IP 네트워크는 인프라 구성과 다양한 RAN 지원 등의 장점을 가지고 있지만, 근본적으로 IP 전송 기술을 기반으로 하고 있기 때문에 서비스 품질 보장 측면에서는 많은 취약점이 있다. 따라서 서비스 품질 보장에 대한 문제는 다가오는 ALL-IP 기반의 유 ${\bullet}$ 무선 통합 네트워크 환경에서 시급히 해결해야 할 문제로 인식되고 있다. 이를 위해 본 논문에서는 유 ${\bullet}$ 무선 통합망의 서비스 품질을 보장에 관하여 최적의 방법을 연구하였다

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.781-792
• /
• 2005

This study proposes an Architecture for user level End-to-end Quality of Service(QoS) using overlay In Next Generation Network(NGN). Inexisting NGNs, the IMS of a control plane provides user QoS through direct traffic control and resource-reservation over the IP packet transport network of a user plane. Further, a set of torrent studies are ongoing not only to maximize the QoS for users, but also to minimize the quality deterioration for supporting the user End-to-end QoS. Along with that, an extended QoS in user level must be considered, for Instance, differentiating service quality to support users' expectation, providing optimized contents by users' equipments, and so forth. Accordingly, the Overlay Service Network Architecture proposed by this study provides protocol adaptation for maximum throughput on transport layer by using the most efficient transport layer protocol to various network circumstances. Also, the Overlay Service Network Architecture on application layer distributes processing delay from the data transformation process of the user equipment to the network, and it is capable of intermediate processing depending on user service level. application service feature, and equipment circumstance as well. Thus, this study mainly proposes the Overlay Service Network Architecture for user level end-to-end QoS in NGN with the quality control features both on the transport layer and the application layer, an internal component feature, and a service scenario providing the QoS linking with 3GPP.