• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.9
• /
• pp.4572-4586
• /
• 2019

Mobile Edge Computing (MEC) and Information-Centric Networking (ICN) are essential network architectures for the future Internet. The advantages of MEC and ICN such as computation and storage capabilities at the edge of the network, in-network caching and named-data communication paradigm can greatly improve the quality of video streaming applications. However, the packet loss in wireless network environments still affects the video streaming performance and the existing loss recovery approaches in ICN does not exploit the capabilities of MEC. This paper proposes a Deep Learning based Loss Recovery Mechanism (DL-LRM) for video streaming over MEC based ICN. Different with existing approaches, the Forward Error Correction (FEC) packets are generated at the edge of the network, which dramatically reduces the workload of core network and backhaul. By monitoring network states, our proposed DL-LRM controls the FEC request rate by deep reinforcement learning algorithm. Considering the characteristics of video streaming and MEC, in this paper we develop content caching detection and fast retransmission algorithm to effectively utilize resources of MEC. Experimental results demonstrate that the DL-LRM is able to adaptively adjust and control the FEC request rate and achieve better video quality than the existing approaches.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.209-220
• /
• 2013

Handover is the technology to minimize data lose of mobile devices and make continuous communication possible even if the device could be moved from one digital cell site to another one. That is, it is a function that enables the mobile user to avoid the disconnection of phone conversations when moving from a specific mobile communication area to another. Today, there are a lot of ongoing researches for fast and efficient hand-over, in order to address phone call's delay and disconnection which are believed to be the mobile network's biggest problems, and these should essentially be resolved in all mobile networks. Thanks to recent technology development in mobile network, the LTE network has been commercialized today and it has finally opened a new era that makes it possible for mobile phones to process data at high speed. In LTE network environment, however, a new authentication key must be generated for the hand-over. In this case, there can be a problem that the authentication process conducted by the hand-over incurs its authentication cost and delay time. This essay suggests an efficient key caching hand-over method which simplifies the authentication process: when UE makes hand-over from oMME to nMME, the oMME keeps the authentication key for a period of time, and if it returns to the previous MME within the key's lifetime, the saved key can be re-used.

• Journal of Convergence for Information Technology
• /
• v.10 no.1
• /
• pp.22-27
• /
• 2020

With the deployment of 5G infrastructure, content delivery network (CDN) will be a key role to provide explosive growing services for the independent media and YouTube which contain high-speed mobile contents. Without a local cache, the mobile backhaul and fronthaul should endure huge burden of bandwidth request for users as the increase number of direct accesses from contents providers. To deal with this issue, this paper fist presents both fronthaul solutions for CDN that use dark fibers and a passive optical network (PON). On top of that, we propose the aggregated content request specialized for PON caching and evaluate and compare its performance to legacy schemes through the simulation. The proposed PON caching scheme can reduce average access time of up to 0.5 seconds, 1/n received request packets, and save 60% of backhaul bandwidth compared to the no caching scheme. This work can be a useful reference for service providers and will be extended to further improve the hit ratio of cache in the future.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2137-2142
• /
• 2003

One of the important performance metrics of the World Wide Web is how fast and precise a request from users will be serviced successfully. Shared Web Caching (SWC) is one of the techniques to improve the performance of the network system. In Shared Web Caching Systems, the key issue is on deciding when and where an item is cached, and also how to transfer the correct and reliable information to the users quickly. Such SWC distributes the items to the proxies which have sufficient capacity such as the processing time and the cache sizes. In this study, the Hot Spot Prediction Algorithm (HSPA) has been suggested to improve the consistent hashing algorithm in the point of the load balancing, hit rate with a shorter response time. This method predicts the popular hot spots using a prediction model. The hot spots have been patched to the proper proxies according to the load-balancing algorithm. Also a simulator is developed to utilize the suggested algorithm using PERL language. The computer simulation result proves the performance of the suggested algorithm. The suggested algorithm is tested using the consistent hashing in the point of the load balancing and the hit rate.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.91-98
• /
• 2013

Node which plays the role of cache server does not exist in the wireless ad-hoc network consisting of only mobile nodes. Even if it exists, it is difficult to provide cache services due to the movement of nodes. Therefore, the cooperative cache technique is necessary in order to improve the efficiency of information access by reducing data access time and use of bandwidth in the wireless ad-hoc network. In this paper, the whole network is divided into zones which don't overlap and master node of each zone is elected. General node of each zone has ZICT and manages cache data to cooperative cache and gateway node use NZCT to manage cache information of neighbor zone. We proposed security structure which can accomplish send and receive in the only node issued id key in the elected master node in order to prepare for cache consistent attack which is vulnerability of distributed caching techniques. The performance of the proposed method in this paper could confirm the excellent performance through comparative experiments of GCC and GC techniques.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.303-308
• /
• 2005

Generally, the overloaded server problem and the rapidly increased network traffic problem are happened in a center concentrated multimedia digital content service. Recently, a study about the CDN which is a digital content transmission technology to solve these problems are performed actively. In this study, we proposed the SDCDS which improved a process latency time and a security performance on a digital content delivery and management. The goal of the SDCDS is the digital content security and the improvement of the processing time. For that, we have to design the security and the caching method considering the architecture characteristics of the CDN. In the SDCDS, the public key encryption method is designed by considering the architecture characteristics of CDN. And we improved the processing latency time by improved the caching method which uses the grouped caching method on the encrypted DC and the general DC. And in the experiment, we veryfy the performance of the proposed system.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.3
• /
• pp.111-116
• /
• 2023

The WiscKey database, which optimizes overhead by compaction of the LSM tree-based Key-Value database, stores the value in a separate file, and stores only the key and value addresses in the database. Each time an fsync system call function is used to ensure data integrity in the process of storing values. In previously conducted studies, workload performance was reduced by up to 5.8 times as a result of performing the workload without calling the fsync system call function. However, it is difficult to ensure the data integrity of the database without using the fsync system call function. In this paper, to reduce the overhead of the fsync system call function while performing workloads on the WiscKey database, we use NVDIMM caching techniques to ensure data integrity while improving the performance of the WiscKey database.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.7
• /
• pp.3329-3350
• /
• 2017

Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be $O(H^2{\gamma})$, where H is the height of the tree and ${\gamma}$ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.785-788
• /
• 2016

최근 IoT 프로토콜 가운데 가장 활발히 논의되는 프로토콜로 CoAP(Constrained Application Protocol)이 있다. CoAP은 4가지 보안모드로 운영된다. 그 중 3가지 모드인 PresharedKey, RawPublicKey, Certificate 모드의 경우 DTLS(Datagram Transport Layer Security)가 적용된 방식이다. 반면 NoSec 모드는 DTLS가 적용되지 않은 기본방식이다. 본 논문에서는 DTLS의 복잡한 Handshake 방식으로 인한 전력소모 및 Performance의 저하를 고려한 새로운 방식을 제안한다. NoSec 환경의 CoAP 프로토콜에 S-Broker(Secure-Broker)를 적용한 security 및 performance 향상 방안이다. 제안한 방식으로 경량화 통신을 구현하여 무결성과 보안 강도를 높였다. 추가적으로 Proxy의 forwarding 기능과 caching 기능을 구현하여 성능의 향상을 도모한다.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.175-180
• /
• 2004

Generally, as for the multimedia high quality contents, an illegality facsimile is possible without a damage of a quality. Also a distribution of contents duplicated illegality in an Internet is giving a great economic loss to digital contents provider. Therefore, a study for security and efficient distribution of digital contents is required. The most important issues in a design of digital contents distribution system are a user convenience, an execution speed and a security. In this study, we designed digital contents distribution system that used a web caching technology and an encryption/decryption technique on hierarchical structure. The proposed system was the digital contents distribution system that improved a security and execution speed, a convenience of a user. Also it verified performance superiority of a proposed system by an examination.