• Journal of Korea Multimedia Society
• /
• v.19 no.9
• /
• pp.1698-1709
• /
• 2016

These days, anyone can easily product and share their own content through a web service such as blogs and SNS. However, contents are being operated separately because of the space limitation in individual SNS. Therefore, it is hard to search contents efficiently in individual SNS. To solve this problem, this paper propose a "Private Contents Management and Sharing Service with Voluntary Sharing Economy System." The system is in part [Input], [Save] and it provides a way to collect the content that are scattered on the Internet based on the creation of personal index. It also proposes a more systematic content management and sharing by creating and updating the website standard index by introducing an index Coordinator concept. Furthermore in [Use] section, by providing a portion of the index as the primary search results, it avoid unclassified content list which was simply collected by users. In conclusion, unlike previous studies, this system will contribute to the acquisition and management of interspersed content and ultimately contribute to the shared activation by preventing secondary processing and unauthorized processing to the original article.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.784-799
• /
• 2013

This paper presents an adaptive rate control scheme for streaming-based content sharing service. This scheme delivers multimedia contents from a user device to another device or seamlessly redirects streaming service across heterogeneous user devices. In the proposed scheme, a streaming server adjusts video quality level according to the network and client status. Our scheme is different from other rate control schemes, because the video quality at the server is decided not only based on the available bandwidth, but also based on the device characteristics and bandwidth requirement at the access network. We also propose a bandwidth estimation method to achieve more equitable bandwidth allocations among streaming flows competing for the same narrow link with different Round Trip Times (RTTs). Through the simulation, we prove that our scheme improves the network stability and the quality of streaming service by appropriately adjusting the quality of the video stream. The simulation results also demonstrate the ability of the proposed scheme in ensuring RTT-fairness while remaining throughput efficient.

• Journal of Information Technology Applications and Management
• /
• v.22 no.2
• /
• pp.43-70
• /
• 2015

Concerns have been growing about whether domestic internet protocol television (IPTV) can establish a solid foothold in the pay TV market, largely because of the lack of IPTV-only content and service differentiation. It has been difficult for IPTV providers to attract valuable PPs (program providers) to strengthen their positions, and IPTV providers have invested much money into procuring content. To survive this difficult situation, IPTV providers need to reappraise their profit sharing methods and content distribution structure to facilitate the expansion of their subscriber base. This can be done by attracting valuable PPs to IPTV providers and securing extra revenue by distributing more content for their PP partners. The IPTV industry has a different structure and value chain from the digital cable industry. Moreover, profit sharing schemes among participants in the IPTV industry are complicated. Thus it is essential to analyze the criteria for profit sharing, the selection of attributes in profit sharing, and their cause-effect relationship in developing fair pricing for broadcast content in the IPTV industry. This study introduces the attributes that need to be considered for the pricing of content and profit sharing among IPTV providers and PPs. In addition, this study uses system dynamics to analyze the relationship among those attributes along with additional associated factors for the pricing of content.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• Journal of Broadcast Engineering
• /
• v.23 no.1
• /
• pp.26-35
• /
• 2018

The recent development of overlay network technology enables distributed sharing of various types of contents. Although overlay network has great advantages as a huge content repository, it is practically difficult to directly provide such Internet service as streaming of contents. On the other hand, the media server, which is specialized in content services, has excellent service capabilities, but it suffers from the huge contents that are constantly created and requires large expansion of severs and storages, and thus requires much effort for efficient management of the huge repository. Hence, the association of an overlay network of huge storage with a media server of high performance content service will show a great synergy effect. In this paper, a location-aware scheme of constructing overlay networks and associating it with media server is proposed, and then cache-based contents management and service policy are proposed for efficient content service. The performance is analysed for one of the content services, streaming service.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.8
• /
• pp.85-92
• /
• 2015

Due to the advancements in the capabilities of smart devices and home networks, we are able to easily access multimedia contents stored in a home server. In this paper, we present a wireless media content sharing mechanism for home networks that utilizes UPnP-based DLNA technology. We also present a novel Peer-to-Peer content sharing system that is able to operate on the client as well as server. Our system supports multiple push/pull services simultaneously via a multi-thread technique, and our intuitive user interface facilitates ease of use. Future studies would explore the feasibility of implementing our system in a multi-hop environment or providing a community-wide service.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1065-1085
• /
• 2020

With rapid growth of content demands, device-to-device (D2D) content sharing is exploited to effectively improve the service quality of users. Considering the limited storage space and various content demands of users, caching schemes are significant. However, most of them ignore the influence of the asynchronous content reuse and the selfishness of users. In this work, the user preferences are defined by exploiting the user-oriented content popularity and the current caching situation, and further, we propose the social-aware rate, which comprehensively reflects the achievable contents download rate affected by the social ties, the caching indicators, and the user preferences. Guided by this, we model the collaborative caching problem by making a trade-off between the redundancy of caching contents and the cache hit ratio, with the goal of maximizing the sum of social-aware rate over the constraint of limited storage space. Due to its intractability, it is computationally reduced to the maximization of a monotone submodular function, subject to a matroid constraint. Subsequently, two social-aware collaborative caching algorithms are designed by leveraging the standard and continuous greedy algorithms respectively, which are proved to achieve different approximation ratios in unequal polynomial-time. We present the simulation results to illustrate the performance of our schemes.

• ETRI Journal
• /
• v.36 no.2
• /
• pp.197-205
• /
• 2014

This paper proposes a novel framework for virtual content delivery networks (CDNs) based on cloud computing. The proposed framework aims to provide multimedia content delivery services customized for content providers by sharing virtual machines (VMs) in the Infrastructure-as-a-Service cloud, while fulfilling the service level agreement. Furthermore, it supports elastic virtual CDN services, which enables the capabilities of VMs to be scaled to encompass the dynamically changing resource demand of the aggregated virtual CDN services. For this, we provide the system architecture and relevant operations for the virtual CDNs and evaluate the performance based on a simulation.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.53-56
• /
• 2003

Aiming at importance of geodetic data standards in process of digitized geodetic production, application and service, this paper discusses the content framework of geodetic technical base standard, information system standard and data service standard. Hierarchy relation and category relation of geodetic data standard system are established in this paper.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.97-99
• /
• 2013

Various display devices become widespread now. Endeavoring to provide high-quality user experience, sharing contents becomes a hot issue in recent years. In this paper, a Contents Sharing System based on Users Context is proposed, which can provide pervasive contents sharing services on multiple devices with disregard for the device differences. This system supporting automatical contents sharing according to users' context, and intelligent content-fault recovery to provide an intelligent platform for users sharing service seamlessly without additional manual operations. Also we points out the problems and considerations about this proposed system which will be improved in the later research.