• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.382-385
• /
• 2003

Introduction of digital broadcasting service does not only mean the change of information transmission method but also the change of total broadcasting system. In past day, Television was only received one-sided information from broadcasting station, but digital broadcasting means that digital television becomes the most important means of information transmission by the introduction of new programming, lots of channels, data service, multi communication. In the age of the digital broadcasting, the recording and replay medium's interest is getting higher. The medium is able to record more than 24 hours' digital broadcasting programs without additional tapes. In this paper the recording and replay device using HDD was implemented and device driver based on linux was programmed. It has Intel PXA250 processor and hard disk is used as storage equipment. And transport Stream is saved on hard disk through PXA250's data bus. FIFO is added to solve the different saving speed and FPGA is also added to display the saved data.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2421-2433
• /
• 1997

In this paper, based on the relative logical storage cost of each movie by the difference of service request probability, we propose and implement the SDU(Separate Data Use) method and the EDU(Existing Data Use) method to provide FF(Fast Forward) and FR(Fast Reverse) function in efficiently through analysing MPEG bit stream and frame characteristics. By selecting and applying the FF/FR function providing method based on the service request probability of movie, the proposed method can reduce the cost of FF/FR functions for total serviced movies.

• Journal of Internet Computing and Services
• /
• v.17 no.1
• /
• pp.55-64
• /
• 2016

Existing Android applications for streaming video in real time are dependent on the codec, which composes the encoding function, and the version of Android operating system. Also, for streaming video in real time, most applications should be connected with a separate desktop PC. To overcome these disadvantages, we propose a new application, which records and streams video in real time. Specifically, the proposed application uses the flash video file format, which is the common media file format supported by various versions of Android operating system. Through experiments, we show that it is possible for the proposed application to record the video screens more than 20 frames per second and to stream it in real time while using the existing video encoding methods.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.7
• /
• pp.387-396
• /
• 2004

In this paper, we propose an algorithm that distributes processor time to the tasks decoding encoded frames with a goal maximizing total QoS (quality of services) of video conference system. An encoded frame has such a characteristic that the QoS of recovered frame image also increases as the processor time given for decoding the frame gets to increase. Thus, the quality of decoded image for each frame can be represented as a QoS function of the amount of service time given to decode. In addition, every stream of video conference has close time-dependency between continuous frames belonging to the same stream. Based on the time-dependency and QoS functions, we propose an on-line frame scheduling algorithm which does not schedule all frames in the system but just a few frames while maximizing total QoS of video streams in the conference. The simulation results show that, as the system load gets to increase, the proposed algorithm compared to the existing EDF algorithm can reduce the quality of decoded frame images more smoothly and show the movements of conference attendees more naturally without short cutting.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.379-384
• /
• 2010

The service quality is one of the most important issue for successful deployment of IPTV services. Currently, a number of parameters have been reported that they have an effect on the quality of IPTV services. However, it is almost impossible to monitor and manage all the parameters in real time. Key parameters, therefore, should be chosen as a service metric for efficient quality management of IPTV services. For this purpose, we implement an environment for monitoring and measuring the quality of IPTV services and try to figure out the effect of each parameter on the quality of IPTV services. In particular, we focus on a parameter called continuous count error (CCE) measured at the level of MPEG transport stream (TS) and show that it has a greater effect on the quality of IPTV services than other parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.2050-2055
• /
• 2012

Since the wireless sensor networks become pervasive, various application-specific requirement have been emerged and suggested. Among them, reliability and real-time service are ones of big research challenges since sensed information is useless if a packet is lost and delivered later than deadline. Even though many research works have been proposed, they was designed to meet one of both requirements. To solve above problem, in this paper, we propose how to extend current protocol to meet two requirements together. More detailed, Mint Route protocol is revised to meet specific real-time requirement, (m,k)-firm stream in wireless sensor networks. Since the main operations in MintRoute are very similar to definition of (m,k)-firm stream, extension is achieved by modifying some parts of procedure. Finally, the simulation results are given and analyzed to validate the its suitability for reliable and real-time requirement.

• Journal of Agricultural Extension & Community Development
• /
• v.22 no.1
• /
• pp.79-92
• /
• 2015

Agricultural Technology Center is an education center to provide agriculturalists with information and technology related with agriculture. As domestic and international environment of agriculture and rural area is changing, functions and roles of Agricultural Technology Center are evolving according to stream of times. In 1995, a new urban and rural complex city was created for symbiotic relationship between city and rural area, As a result, user group of Agricultural Technology Center expanded to nonagriculturalists. Though the change of agricultural extension service is necessary to perform extended functions of rural area and to satisfy needs of new group of users, it is difficult to find enough studies on new functions and roles of Agricultural Technology Center to manage the service change. Therefore, this study is aimed to suggest new functions and roles of Agricultural Technology Center according to stream of times. This study were surveyed through questionnaire targeting users of Namyangju Agricultural Technology Center to compare user group awareness of Agricultural Technology Center in urban and rural complex city. According to this study result, while main purpose of agriculturalists' visiting at Agricultural Technology Center was participating in education programs related with agriculture. In contrast, nonagriculturalists usually visited the center for agricultural understanding, leisure activities, and children education, participating in field work programs. From the survey result of required functions of the center, it was revealed that nonagriculturalists expected urban agriculture, research for living improvement in rural area, adjustment education for returning farmer, and function of farming promotion, comparing agriculturalists. It is verified that this difference of user group awareness reflects the necessity that Agricultural Technology Center should change services and accept increasing use of nonagriculturalists with new functions and roles.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.491-508
• /
• 2010

In peer-to-peer (P2P) on-demand streaming networks, the alleviation of server load depends on reciprocal stream sharing among peers. In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. Therefore, the key challenge is how to keep the initial part of a video in a peer's buffer for as long as possible, and thus maximize the availability of a video for stream relay. In addition, to address the issues of delivering data on lossy network and providing scalable quality of services for clients, the adoption of multiple description coding (MDC) has been proven as a feasible resolution by much research work. In this paper, we propose a novel caching scheme for P2P on-demand streaming, called Dynamic Buffering. The proposed Dynamic Buffering relies on the feature of MDC to gradually reduce the number of cached descriptions held in a client's buffers, once the buffer is full. Preserving as many initial parts of descriptions in the buffer as possible, instead of losing them all at one time, effectively extends peers’ service time. In addition, this study proposes a description distribution balancing scheme to further improve the use of resources. Simulation experiments show that Dynamic Buffering can make efficient use of cache space, reduce server bandwidth consumption, and increase the number of peers being served.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.