• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2002.11a
• /
• pp.400-406
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked fine. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2144-2159
• /
• 2015

CISCO VNI predicted an average annual growth rate of 66% for mobile video traffic between 2014 and 2019 and accordingly much academic research related to video streaming has been initiated. In video streaming, Adaptive Bitrate (ABR) is a streaming technique in which a source video is stored on a server at variable encoding rates and each streaming user requests the most appropriate video encoding rate considering their channel capacity. However, these days, ABR related studies are only focusing on real-time rate adaptation omitting energy efficiency though it is one of the most important requirement for mobile devices, which may cause dissatisfaction for streaming users. In this paper, we propose an energy efficient prefetching based dynamic adaptive streaming technique by considering the limited characteristics of the batteries used in mobile devices, in order to reduce the energy waste and provide a similar level of service in terms of the average video rate compared to the latest ABR streaming technique which does not consider the energy consumption. The simulation results is showing that our proposed scheme saves 65~68% of energy at the average global mobile download speed compared to the latest high performance ABR algorithm while providing similar rate adaptation performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.4
• /
• pp.694-699
• /
• 2017

In accordance with the development of information and communications technology, a network user has to be able to use quality of service (QoS)-based multimedia services easily. Thus, information and communications operators began to focus on a technique for providing multimedia services. The IP Multimedia Subsystem (IMS) is a platform based on Internet Protocol (IP) as a technology for providing multimedia services and application services. The emerging 5G networks are described as having massive capacity and connectivity, adaptability, seamless heterogeneity, and great flexibility. The explosive growth in network services and devices for 5G will cause excessive traffic loads. In this paper, software-defined networking (SDN) is applied as a kind of virtualization technology for the network in order to minimize the traffic load, and Simple Network Management Protocol (SNMP) is used to provide more efficient network management. To accomplish these purposes, we suggest the design of a dynamic routing algorithm to be utilized in the IMS network using SDN and an SNMP private management information base (MIB). The proposal in this paper gives information and communications operators the ability to supply more efficient network resources.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.6
• /
• pp.208-218
• /
• 2017

This study aims to develop the Vehicle Local Dynamic Map (V-LDM) and demonstrate its performance for providing dynamic map data efficiently to the vehicle control module. Firstly, the concept of the in-vehicle LDM has been established and then the system has been carefully designed according to the international standards. The high-precision digital map embedded in LDM has been designed to incorporate the lane-level information of road network, and the Dynamic Map protocol (DM protocol) which is a message protocol including the road data with dynamic traffic event data has been defined. The performance test of the proposed system has been conducted in the uninterrupted road section of Kyungbu expressway, showing that both of the data size and the elapsed time to finish the process are almost linearly proportional to the length of target road. Finally, it is recommended that the length of target road for DM protocol be less than 250m.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1144-1156
• /
• 2014

In Internet, IP multicast has been used successfully to provide an efficient, best-effort delivery service for group communication applications. However, applications such as multiparty private conference, distribution of stock market information, pay per view and other subscriber services may require secure multicast to protect integrity and confidentiality of the group traffic, and validate message authenticity. Providing secure multicast for group communication is problematic without a robust group key management. In this paper, we propose a group key management scheme based on the secret sharing technology to require each member by itself to generate the group key when receiving a rekeying message multicast by the group key distributor. The proposed scheme enforces mutual authentication between a member and the group key distributor while executing the rekeying process, and provides forward secrecy and backward secrecy properties, and resists replay attack, impersonating attack, group key disclosing attack and malicious insider attack.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2002.11a
• /
• pp.400-406
• /
• 2002

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked One. But the needs of users have changed. The want to use the new real-time multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-or-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1914-1924
• /
• 2016

In this paper, considering virtualized Evolved Packet Core(vEPC) network for 5G mobile network, we propose architecture for supporting Service Function Chaining(SFC) in 5G mobile network. Using SFC in 5G network, dynamic path configuration and providing network services based on subscriber and traffic information. SFC technology provides logical ordered set of network functions and delivers packet through providing logical path over the physical network. Based on the perspective of 5G core network in distributed manner, we design hierarchical SFC architecture to manage SFC for global path including vEPC and SGi-LAN network, and internal path between virtualized network functions in each cloud. In this paper, we define architecture and call flow for establishing data path using SFC. Finally, we design testbed architecture for real implementation based on open source software.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.231-236
• /
• 2012

For real-time wireless sensor network applications, it is essential to provide different levels of quality of service (QoS) such as reliability, low latency, and fault-tolerant traffic control. To meet these requirements, an (m,k)-firm based real-time routing protocol has been proposed in our prior work, including a novel local transmission status indicator called local DBP (L_DBP). In this paper, a fault recovery scheme for (m,k)-firm real-time streams is proposed to improve the performance of our prior work, by contributing a delay-aware forwarding candidates selection algorithm for providing restricted redundancy of packets on multipath with bounded delay in case of transmission failure. Each node can utilize the evaluated stream DBP (G_DBP) and L_DBP values as well as the deadline information of packets to dynamically define the forwarding candidate set. Simulation results show that for real-time service, it is possible to achieve both reliability and timeliness in the fault recovery process, which consequently avoids dynamic failure and guarantees meeting the end-to-end QoS requirement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.697-710
• /
• 2004

Differentiated services (DiffServ) model has been prevailed as a scalable approach to provide quality of service in the Internet. However, there are difficulties in providing the guaranteed service in terms of end-to-end systems since differentiated services network considers quality of service of aggregated traffic due to the scalability and many researches have been mainly focused on per hop behavior or a single domain behavior. Furthermore quality of service may be time varying according to the network conditions. In this paper, we study dynamic class mapping mechanism to guarantee the end-to-end quality of service for multimedia traffics with the minimum network cost over differentiated services network. The proposed algorithm consists of an effective implementation of relative differentiated service model, quality of service advertising mechanism and dynamic class mapping mechanism. Finally, the experimental results are provided to show the performance of the proposed algorithm.

• International Journal of Highway Engineering
• /
• v.11 no.3
• /
• pp.129-139
• /
• 2009

The transportation network is a critical infrastructure in the event of natural and human caused disasters such as rainfall, snowfall, and terror and so on. Particularly, the transportation network in an urban area where a large number of population live is subject to be negatively affected from such events. Therefore, efficient traffic operation plans are required to assist rapid evacuation and effective detour of vehicles on the network as soon as possible. Recently, ubiquitous communication and sensor network technology is very useful to improve data collection and connection related emergency information. In this study, we develop a specific algorithm to provide evacuation route and detour information only for vehicles under emergency situations. Our algorithm is based on shortest path search technique and dynamic traffic assignment. We perform the case study to evaluate model performance applying hypothetical scenarios involved terror. Results show that the model successfully describe effective path for each vehicle under emergency situation.