• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.5
• /
• pp.555-564
• /
• 2016

This paper proposes a time slot allocation scheme for military patrol environments. This proposal comes from analysis of traffic properties in a military patrol environment. In the near future, robots are expected to explore enemy grounds and measure threat, taking the place of human patrol. In order to control such robots, control messages must be extremely accurate. One mistake from the control center could cause a tragedy. Thus, high reliability must be guaranteed. Another goal is to maintain a continual flow of multimedia data sent from patrol robots. That is, QoS (Quality of Service) must be guaranteed. In order to transmit data while fulfilling both attributes, the per-path based centralized TDMA slot allocation scheme is recommended. The control center allocates slots to robots allowing synchronization among robots. Slot allocation collisions can also be avoided. The proposed scheme was verified through the ns-3 simulator. The scheme showed a higher packet delivery ratio than the algorithm in comparison. It also performed with shorter delay time in the downlink traffic transmission scenario than the algorithm in comparison.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.39-48
• /
• 2008

Recently, many multimedia services have emerged in Internet such as real-time and non- real time services. However, in this Internet environment, we have some limitations to satisfy each service feature. To guarantee the service features in Measurement-Based Admission Control(MBAC) based system on the flow-aware network, there is the method applying Dynamic Priority Scheduling(DPS) algorithm that gives a higher priority to an earlier incoming flow in all of the link bandwidth. This paper classifies all flows under several groups according to flow characteristics on per-flow MBAC algorithm based system. In each flow group, DPS algorithm is applied. This paper proposes two methods that are a DPS based bandwidth borrowing method and a bandwidth dynamic allocation method. The former is that if low priority class has available bandwidths, the flow of high priority class borrows the bandwidth of low priority class when high priority flow has insufficient bandwidth to connect a flow call. The later is that the each group has a minimum bandwidth and is allocated the bandwidth dynamically according to the excess rate for available bandwidth. We compare and analyze the characteristics of the two proposed methods through the simulation experiments. As the results of the experiment, the proposed methods are more effective than existing DPS based method on the packet loss and delay characteristics. Consequently the proposed two methods are very useful in various multimedia network environments.

• Journal of KIISE
• /
• v.43 no.11
• /
• pp.1233-1244
• /
• 2016

In the IoT network environments for LLNs(Low power and Lossy networks), IPv6 Routing Protocol for Low Power and Lossy networks(RPL) has been proposed by IETF(Internet Engineering Task Force). The goal of RPL is to create a directed acyclic graph, without loops. As recommended by the IETF standard, RPL route recovery mechanisms in the event of a failure of a node should avoid loop, loop detection, DIO Poisoning. In this process, route recovery time and control message might be increased in the sub-tree because of the repeated route search. In this paper, we suggested RPL route recovery method to solve the routing overhead problem in the sub-tree during a loss of a link in the RPL routing protocol based on IoT wireless networks. The proposed method improved local repair process by utilizing a route that could not be selected as the preferred existing parents. This reduced the traffic control packet, especially in the disconnected node's sub tree. It also resulted in a quick recovery. Our simulation results showed that the proposed RPL local repair reduced the recovery time and the traffic of control packets of RPL. According to our experiment results, the proposed method improved the recovery performance of RPL.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.975-983
• /
• 1999

최근 네트워크의 속도가 빨라지고 멀티미디어 데이터를 다루기 위한 기술들이 개발됨에 따라 많은 멀티미디어 응용 프로그램들이 인터넷에 등장하고 있다. 그러나 이들 응용프로그램들은 수신자에게 전송되는 영상.음성의 품질이 낮기 때문에 기대만큼 빠르게 확산되지 못하고 있다. 영상.음성의 품질이 낮은 이유는 현재 인터넷이 실시간 응용프로그램이 요구하는 만큼 빠르고 신뢰성 있게 데이터를 전송할 수 없기 때문이다. 현재 인터넷의 내부구조를 바꾸지 않고 품질을 높이기 위해 많은 연구들이 진행되고 있는데 그 중 하나는 동적으로 변화하는 인터넷의 상태에 맞게 멀티캐스트 트래픽의 전송율을 조절하는 종단간의 흐름제어이다. 본 논문은 기존의 흐름제어 기법인 IVS와 RLM의 성능을 개선시키기 위한 두 가지 흐름제어 기법을 소개한다. IVS는 송신자가 주기적으로 측정된 네트워크 상태에 따라 전송율을 일정하게 조절한다. 송신자가 하나의 데이타 스트림을 생성하는 IVS와는 달리 RLM에서는 송신자가 계층적 코딩에 의하여 생성된 여러개의 데이타 스트림을 전송하고 각 수신자는 자신의 네트워크 상태에 맞게 데이타 스트림을 선택하는 기법이다. 그러나 IVS는 송신자가 전송율을 일정하게 증가시키고, RLM은 각자의 네트워크 상태를 고려하지 않고 임의의 시간에 하나 이상의 데이타 스트림을 받기 때문에 성능을 저하시킬 수 있다. 본 논문에서는 TCP-like IVS와 Adaptive RLM이라는 두 가지 새로운 기법을 소개한다. TCP-like IVS는 송신자가 전송율을 동적으로 결정하고, Adaptive RLM은 하나 이상의 데이타 스트림을 받기 위해 적당한 시간을 선택할 수 있다. 본 논문에서는 시뮬레이션을 통해 여러 가지 네트워크 구조에서 두 가지 방식이 기존의 방식에 비하여 더욱 높은 대역폭 이용율과 10~20% 정도 적은 패킷손실율을 이룬다는 것을 보여준다.Abstract Nowadays, many multimedia applications for the Internet are introduced as the network gets faster and many techniques manipulating multimedia data are developed. These multimedia applications, however, do not spread widely and are not fast as expected at their introduction time due to the poor quality of image and voice delivered at receivers. The poor quality is mainly attributed to that the current Internet can not carry data as fast and reliably as the real-time applications require. To improve the quality without modifying the internal structure of the current Internet, many researches are conducted. One of them is an end-to-end flow control of multicast traffic adapting the sending rate to the dynamically varying Internet state. This paper proposes two flow-control techniques which can improve the performance of the two conventional techniques; IVS and RLM. IVS statically adjusts the sending rate based on the network state periodically estimated. Differently from IVS in which a sender produces one single data stream, in RLM a sender transmits several data streams generated by the layered coding scheme and each receiver selects some data streams based on its own network state. The more data streams a receiver receives, the better quality of image or voice the receiver can produce. The two techniques, however, can degrade the performance since IVS increases its sending rate statically and RLM accepts one more data stream at arbitrary time regardless of the network state respectively. We introduce two new techniques called TCP-like IVS and Adaptive RLM; TCP-like IVS can determine the sending rate dynamically and Adaptive RLM can select the right time to add one more data stream. Our simulation experiments show that two techniques can achieve better utilization and less packet loss by 10-20% over various network topologies.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.3
• /
• pp.63-71
• /
• 2014

We analyze the execution time of Reed-Solomon coding, which is the MAC-layer forward error correction scheme used in CDMA2000 1xEV-DO broadcast services, under different air channel conditions. The results show that the time constraints of MPEG-4 cannot be guaranteed by Reed-Solomon decoding when the packet loss rate (PLR) is high, due to its long computation time on current hardware. To alleviate this problem, we propose three error control schemes. Our static scheme bypasses Reed-Solomon decoding at the mobile node to satisfy the MPEG-4 time constraint when the PLR exceeds a given boundary. Second, dynamic scheme corrects errors in a best-effort manner within the time constraint, instead of giving up altogether when the PLR is high; this achieves a further quality improvement. The third, video-aware dynamic scheme fixes errors in a similar way to the dynamic scheme, but in a priority-driven manner which makes the video appear smoother. Extensive simulation results show the effectiveness of our schemes compared to the original FEC scheme.

• 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.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.16-27
• /
• 2017

IEEE 802.15.6 standard, a Wireless Body Area Network, aims to transfer not only medical data but also non-medical data, such as physical activity, streaming, multimedia game, living information, and entertainment. Services which transfer those data have very various data rates, intervals and frequencies of continuous access to a medium. Therefore, an efficient anti-collision operations and medium assigning operation have to be carried out when multiple nodes with different data rates are accessing shared medium. IEEE 802.15.6 standard for CSMA/CA medium access control method distributes access to the shared medium, transmits a control packet to avoid collision and checks status of the channel. This method is energy inefficient and causes overhead. These disadvantages conflict with the low power, low cost calculation requirement of wireless body area network, shall minimize such overhead for efficient wireless body area network operations. Therefore, in this paper, we propose a medium access scheduling scheme, which adjusts the time interval for accessing to the shared transmission medium according to the amount of data for generating respective sensor node, and a priority control algorithm, which temporarily adjusts the priority of the sensor node that causes transmission concession due to the data priority until next successful transmission to ensure fairness.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.7
• /
• pp.31-40
• /
• 2004

In this paper, we analyze mathematically the performance of the gated service scheduling in the Interleaved Polling with Adaptive Cycle Time(IPACT) was proposed to control upstream traffic for Gigabit Ethernet-PONs. In the analysis, we model EPON MAC protocol as a polling system and use mean value analysis. We divide arrival rate λ into three regions and analyze each region accordingly In the first region in which λ value is very small, there are very few ONUs' data to be transmitted. In the second region in which λ has reasonably large value, ONUs have enough data for continuous transmission. In the third region, ONUs' buffers are always saturated with data since λ value is very large. We obtain average packet delay, average Queue size, average cycle time of the gated service. We compare analysis results with simulation to verify the accuracy of the mathematical analysis. Simulation requires much time and effort to evaluate the performance of EPONs. On the other hand, mathematical analysis can be widely used in the design of EPON systems because system designers can obtain various performance results rapidly. We can design appropriate EPON systems for varioustraffic property by adjusting control parameters.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.129-140
• /
• 2003

Recently viruses and various hacking tools that threat hosts on a network becomes more intelligent and cleverer, and so the various security mechanisms against them have ken developed during last decades. To detect these network attacks, many NIPSs(Network-based Intrusion Prevention Systems) that are more functional than traditional NIDSs are developed by several companies and organizations. But, many previous NIPSS are hewn to have some weakness in protecting important hosts from network attacks because of its incorrectness and post-management aspects. The aspect of incorrectness means that many NIPSs incorrectly discriminate between normal and attack network traffic in real time. The aspect of post-management means that they generally respond to attacks after the intrusions are already performed to a large extent. Therefore, to detect network attacks in realtime and to increase the capability of analyzing packets, faster and more active responding capabilities are required for NIPS frameworks. In this paper, we propose a framework for real-time intrusion prevention. This framework consists of packet filtering component that works on netfilter in Linux kernel and traffic control component that have a capability of step-by-step control over abnormal network traffic with the CBQ mechanism.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.6
• /
• pp.7-20
• /
• 2017

The advancement of cloud and big data and the considerable growth of traffic have increased the complexity and problems in the management inefficiency of existing networks. The software-defined networking (SDN) environment has been developed to solve this problem. SDN enables us to control network equipment through programming by separating the transmission and control functions of the equipment. Accordingly, several studies have been conducted to improve the performance of SDN controllers, such as the method of connecting existing legacy equipment with SDN, the packet management method for efficient data communication, and the method of distributing controller load in a centralized architecture. However, there is insufficient research on the control of SDN in terms of the quality of network-using applications. To support the establishment and change of the routing paths that meet the required network service quality, we require a mechanism to identify network requirements based on a contract for application network service quality and to collect information about the current network status and identify the violations of network service quality. This study proposes a method of identifying the quality violations of network paths through ontology to ensure the network service quality of applications and provide efficient services in an SDN environment.