• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.283-286
• /
• 2011

무선 멀티홉 네트워크에서 멀티미디어 트래픽의 QoS(Quality of Service) 지원을 위하여 EDCA(Enhanced Distributed Channel Access) 기반의 동적 우선순위 할당 기법이 다수 제안되었다. 해당 기법들은 각 홉에서의 최소한의 전송 지연 보장을 위하여 클래스별 예상 지연 시간을 계산한다. 하지만 각 클래스별 예상 지연 시간의 계산은 무선 채널에서의 간섭, 충돌 및 링크 품질에 영향을 받기 때문에 정확한 예측이 어렵다. 본 논문에서는 EDCA 기반의 동적 우선순위 할당을 위한 정교한 클래스별 지연 시간 예측 기법을 제안한다. 제안하는 기법은 무선 채널의 링크 품질과 전송 패킷의 크기를 고려하여 좀더 실제와 유사한 지연 시간을 예측할 수 있다. 실험을 통해 제안하는 기법이 기존의 기법보다 정확성이 높으며 이를 통해 동적 우선순위 할당 기법의 성능을 향상시킬 수 있음을 확인하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.1-10
• /
• 2014

The characteristics of internet traffic was dramatically changed recently. Especially, the ratio of video traffic in internet network is highly increased. Because the video traffic changes the traditional interactive traffic transport into one way contents delivery, internet network pricing structure is not efficient to reflect this changes. The fundamental reason for these is the discontinuity between the cost and revenue of the internet traffic. Although the internet traffic is forecasted to grow highly, the revenue of network provider is not expected to increase as such. The present paper investigates various alternatives to improve the present business model and to accommodate traffic growth. Then, the desirable options is proposed to invoke the innovation and to reflect the price signal according to some criteria.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.191-197
• /
• 2012

In this paper we propose the FQSM(Fairness and QoS Supporting MAC) protocol that supports fairness and Quality of Service(QoS). The received or measured data traffics will be assigned a priority level according to its transmission urgency in the FQSM. And the load prediction algorithm is used to support the fairness between different priority traffics. For this, the buffer length values of the nodes are continuously monitored for a some period. Based on the buffer length variations for this period, the order of transmission is determined. FQSM also adapts cross-layer concept to rearrange the data transmission order in each sensor node's buffer, saves energy consumption by allowing few nodes in data transmission, and prolongs the network lifetime.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.65-75
• /
• 2005

Measurement of network traffic have shown that the self-similarity is a ubiquitous phenomenon spanning across diverse network environments. In previous work, we have explored the feasibility of exploiting the long-range correlation structure in a self-similar traffic for the congestion control. We have advanced the framework of the multiple time scale congestion control and showed its effectiveness at enhancing performance for the rate-based feedback control. Our contribution is threefold. First, we define a modular extension of the TCP-a function called with a simple interface-that applies to various flavours of the TCP-e.g., Tahoe, Reno, Vegas and show that it significantly improves performance. Second, we show that a multiple time scale TCP endows the underlying feedback control with proactivity by bridging the uncertainty gap associated with reactive controls which is exacerbated by the high delay-bandwidth product in broadband wide area networks. Third, we investigate the influence of the three traffic control dimensions-tracking ability, connection duration, and fairness-on performance.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.220-222
• /
• 2003

최근 각 가정에 초고속 인터넷의 급속한 보급에 따라 정보가전간의 제어와 통신을 위한 홈 네트워크가 등장하게 되었다. 이와 같은 홈 네트워크에서는 비디오나 오디오와 같은 멀티미디어 서비스가 주요 트래픽이 될 것으로 예측되고 있다. 그러나 홈 네트워크에서의 각 정보가전은 이질적이고 분산적인 특징을 가지고 있기 때문에 컴퓨팅 능력과 지원 가능한 멀티미디어 타입이 정보가전마다 다르다. 따라서 본 논문에서는 정보가전의 특징에따라 멀티미디어 서비스를 지원할 수 있는 Home Manager(HomeMngr)를 설계하였다. 제안 기법은 이동 에이전트를 이용하여 자원의 동적 재구성과 분산 프로세싱를 수행하여 멀티미디어 서비스를 지원하게 된다.

• Journal of Korea Multimedia Society
• /
• v.11 no.10
• /
• pp.1392-1402
• /
• 2008

Home gateway is always full-powered for ubiquitous home services, and consumes much energy yearly. Power-saving algorithm to conserve this energy must reduce the energy consumption and preserve always-on services. Our algorithm predicts current idle period using the history of the past idle period when the idle period starts, and then determines whether the power mode is changed to the saving mode or not. On the power saving mode, it processes the simple protocol data for network control using proxying with no wakeup. And it changes the power mode to active mode when user's traffic exists. As the results of the simulation using real traffic, our algorithm saves the energy consumption from 14% to 49% as compared with existing method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1496-1499
• /
• 2008

DoS/DDoS로 대표되는 트래픽 폭주 공격은 대상 시스템뿐만 아니라 네트워크 대역폭 및 시스템 자원 등을 고갈시킴으로써 네트워크에 심각한 장애를 유발하기 때문에, 신속한 공격 탐지와 공격유형별 분류는 안정적인 서비스 제공 및 시스템 운영에 필수요건이다. 본 논문에서는 1) 데이터마이닝의 대표적인 분류 모델인 C4.5 알고리즘을 기반으로 SNMP MIB 정보를 사용하여 트래픽 폭주공격을 탐지하고 각 공격유형별 분류를 수행하는 시스템을 설계 및 구현하였다; 2) C4.5에서 추가적으로 제공하는 동작원리에 관한 규칙들을 상세히 분석함으로써 공격탐지 및 공격유형별 분류에 관한 시스템의 의미론적 해석을 시도하였다; 3) C4.5는 주어진 SNMP MIB의 속성들의 정보이익 값을 이용하여 예측모형을 구축하는 알고리즘으로, 특징선택 및 축소의 효과를 추가적으로 얻었다. 따라서 시스템의 운용 시, 제안된 모델은 전체 13개의 MIB 정보 중 5개의 MIB 정보만을 사용하여 보다 신속하고, 정확하며, 또한 가벼운 공격탐지 및 공격유형별 분류를 수행함으로써 네트워크 시스템의 자원관리와 효율적인 시스템 운영에 기여하였다.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.2
• /
• pp.81-89
• /
• 2008

Improved EKF suggests variable path prediction to reduce the event traffic caused by the information sharing among multi-users in networked virtual environment. The three dimensional virtual space is maintained consistently by endless status information exchange among dispersed users, and periodic status transmission brings traffic overhead in network. By using the error between the measured movement trace of dynamic information and the EKF predicted, we propose the method applied to predict the mobile packet of dynamic data which is simultaneously changing. And, the simulation results of DIS dead reckoning algorithms and EKF path prediction is compared here. It followed the specific path and while moving, the proposed method which it proposes predicting with DIS dead reckoning algorithm and to compare to the mobile path of the actual object and it got near it predicts the possibility of knowing it was.

• Smart Media Journal
• /
• v.13 no.4
• /
• pp.33-48
• /
• 2024

With the advent of 5G, characterized by Enhanced Mobile Broadband (eMBB), Ultra-Reliable Low Latency Communications (URLLC), and Massive Machine Type Communications (mMTC), efficient network management and service provision are becoming increasingly critical. This paper proposes a novel approach to address key challenges of 5G networks, namely ultra-high speed, ultra-low latency, and ultra-reliability, while dynamically optimizing network slicing and resource allocation using machine learning (ML) and deep learning (DL) techniques. The proposed methodology utilizes prediction models for network traffic and resource allocation, and employs Federated Learning (FL) techniques to simultaneously optimize network bandwidth, latency, and enhance privacy and security. Specifically, this paper extensively covers the implementation methods of various algorithms and models such as Random Forest and LSTM, thereby presenting methodologies for the automation and intelligence of 5G network operations. Finally, the performance enhancement effects achievable by applying ML and DL to 5G networks are validated through performance evaluation and analysis, and solutions for network slicing and resource management optimization are proposed for various industrial applications.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.146-151
• /
• 1999

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.