• 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 Korea Institute of Information Security & Cryptology
• /
• v.31 no.5
• /
• pp.919-939
• /
• 2021

As a next-generation communication technology, 5G networks are capable of handling large amounts of traffic based on higher speeds, shorter communication delays, and higher connectivity compared to 4G networks. In this 5G network environment, base stations are installed all over the city at high density due to their characteristics, and are connected to user terminals to provide services. Therefore, if the base station is damaged by a malicious attacker, it is expected to cause great damage to users and society as a whole. So the need for secure communication equipment such as 5G base stations has emerged. Therefore, in this paper, we propose the security functional requirements derived using threat modeling, a systematic methodology for 5G base stations, and the security assurance requirements at the level that can cope with the backdoor issues. The security requirements proposed in this paper can be used for base station design and development to construct a secure network environment as a security evaluation standard for 5G base stations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.436-438
• /
• 2015

In this paper, a P2P Standard Group Formation (P2P-SGF) method in Wi-Fi Direct is presented to provide direct communication services between Internet-of-Things (IoT) gateways. Generally, network traffic congestion and speed reduction problems are caused when transmitting mass data as well as measured data from many sensors between IoT gateways via an Access Point (AP). For solving these problems, it is required to implement Wi-Fi Direct efficiently transmitting mass data between IoT gateways without passing through the AP. The implemented P2P-SGF method basically performs Discovery, GO (Group Owner) Negotiation, WPS (Wi-Fi Protected Setup) Provisioning, and Address Configuration. Especially, it supports the DLNA (Digital Living Network Alliance) service function for sharing mass data between IoT gateways. Some experimental results verify that it can successfully share large video files.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.30-41
• /
• 2002

We focus on the mobile agents which are considered as new paradigm to solve information retrieval of large volumes of data in the distributed and heterogeneous environment. The mobile agent moves the computation to data instead of large volumes of data to computations. In this paper, we propose an information retrieval model, which can effectively search data in the distributed and heterogeneous environment, using mobile agents. Our model is applied to the design and implementation of an Q&A(Question and Answer) retrieval system. Our Q&A retrieval system, called QASSMA(Q&A Search System using Mobile Agents), uses mobile agents to retrieve articles from Q&A boards and newsgroups that exist in the heterogeneous and distributed environment. QASSMA has the following features and advantages. First, the mobile retrieval agent moves to the destination server to retrieve articles to reduce the retrieval time by eliminating data traffics from the server to the client host. Also it can reduce the traffic that was occurred in the centralized network system, and reduce the usage of resources by sending its agent and running in the destination host. Finally, the mobile retrieval agent of QASSMA can add and update dynamically the class file according to its retrieval environment, and support other retrieval manner. In this paper, we have shown that our Q&A retrieval system using mobile agents is more efficient than the retrieval system using static agents by our experiments.

• Journal of Internet Computing and Services
• /
• v.24 no.5
• /
• pp.1-7
• /
• 2023

This paper proposes a small cell resource partitioning allocation method to solve interference to machine type communication devices (MTCD) and improve performance in 5G heterogeneous networks (HetNet) where macro base station (MBS) and many small cell base stations (SBS) are overlaid. In the 5G HetNet, since various types of MTCDs generate data traffic, the load on the MBS increases. Therefore, in order to reduce the MBS load, a cell range expansion (CRE) method is applied in which a bias value is added to the received signal strength from the SBS and MTCDs satisfying the condition is connected to the SBS. More MTCDs connecting to the SBS through the CRE will reduce the load on the MBS, but performance of MTCDs will degrade due to interference, so a method to solve this problem is needed. The proposed small cell resource partitioning allocation method allocates resources with less interference from the MBS to mitigate interference of MTCDs newly added in the SBS with CRE, and improve the overall MTCD performace using separating resources according to the performance of existing MTCDs in the SBS. Through simulation results, the proposed small cell resource partitioning allocation method shows performance improvement of 21% and 126% in MTCDs capacity connected to MBS and SBS respectively, compared to the existing resource allocation methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.23-34
• /
• 2004

This paper presents architecture and control method of packet scheduler to guarantee QoS of high quality streaming services in high-speed packet-switched networks. Since streaming services need far more stringent QoS requirements than the typical sort of burst data applications, they should be guaranteed minimum bandwidth and end-to-end delay bound to each flow, regardless of the behavior of other flows. To meet these requirements, a packet scheduler isolate a flow from the undesirable effects of other flows and provides end-to-end delay guarantees for individual flow and divides stringently the available link bandwidth among flows sharing the link. Until now, many vendors are developing traffic management chips running at 10Gbps, but most of chips have drawbacks to support high quality streaming services. In this paper, we investigate the drawbacks of commercial TM chips and traffic characteristic of streaming services and present implementation frameworks of the proposed packet scheduler. Finally, we analyze the simulation results of the proposed scheduler.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.5
• /
• pp.38-48
• /
• 2007

In ubiquitous environment, sensor networks that sense and transmit surrounding data without human intervention will become more important. If sensors are installed for detecting vehicles and measuring their speed in the road and that real-time information is given to drivers, it will be very effective for enhancing safety and controlling traffic in the road. In this paper, we proposed a new reliable and real-time sensor MAC protocol between AP and sensor nodes in order to provide real-time traffic flow information based on ubiquitous sensor networks. The proposed MAC allocates one TDMA slot for each sensor node on the IEEE 802.15.4 based channel structure, introduces relayed communication for distant sensors, and adopts a frame structure that supports retransmission for the case of errors. In addition, the proposed MAC synchronizes with AP by using beacon and adopts a hybrid tracking mode that supports economic power consumption according to various traffic situations, We implemented a simulator for the proposed MAC by using sim++ and evaluated various performances. The simulation results show that the proposed MAC reduces the power consumption and reveals excellent performance in real-time application systems.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.339-345
• /
• 2014

This study has a purpose that improves efficiency of energy management and adaptation followed by movement of node better than the various early studied routing techniques. The purpose of this paper is the technique that uses RSSI value and location of sensor that is received by each sensor node to routing. This sduty does not save node information of 1-hop distance. And it solves energy-inefficient traffic problem that happens during data exchange process for middle node selection in close range multi hop transmission technique. The routing protocol technique that is proposed in this study selects a node relevant to the range of transmission which is set for RSSI value that is received by each node and selects the closest node as a middle node followed by location data. Therefore, it is for not exhaustion of node's energy by managing energy efficiently and cutting data transmission consuming until the destination node.

• Journal of Digital Convergence
• /
• v.10 no.1
• /
• pp.49-57
• /
• 2012

The Internet succeeded because of the end-to-end principle which allowed anyone to add functionality to the network. However, as the internet is increasingly becoming the platform for smart IT applications such as VoIP, IPTV, Cloud Computing and Smart Phone, networks are now under increasing strain of traffic congestion and the absence of quality of service insurances. To date, the debate over internet rules has focused on network neutrality rather than network efficiency. This article emphasizes the well-functioning role of market mechanism for the efficient use and further development of the network. To maximize the value of the network, this article proposes a differential treatment to packets based on customer types, and a two-part tariff pricing rule to secure funding to expand and upgrade networks.

• The KIPS Transactions:PartC
• /
• v.14C no.3 s.113
• /
• pp.285-292
• /
• 2007

In the adaptable bandwidth allocation technique, a transmission plan for variable rate video data is made by the CBA algorithm and the data is transmitted by considering network traffic. But the CBA algorithm produces a transmission plan where the size of the increasing interval of transmission rate is generally larger than the size of the decreasing interval. And the transmission rate in CBA algorithm is changed in overflow curve during the increasing interval of transmission rate. This ぉy cause many frames to be discarded when available transmission rate is small. In this paper, a smoothing algorithm is proposed, where transmission rate is changed in the middle of underflow curve and overflow curve, but the transmission rate increases at the minimum. In order to show the performance, the proposed algorithm and a CBA algorithm were applied to a transmission plan in the adaptable bandwidth allocation technique, and the minimum frame rates, the average frame rates, the variation of frame rates, and the numbers of discarded frames were compared in both algorithms.