• 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.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.41
• /
• pp.95-102
• /
• 1997

This paper deals with an order picking system in an automated storage and retrieval system(AS/RS). For the order picking system, two fundamental policies, the batching and the picking policies, must be selected. The batching policy determines the manner in which orders are combined for picking in each trip of picking machine. The picking policy determines the sequence of all items in each group of orders. Most of studies for the batching policy doesn't consider dynamic arrivals and due dates of orders. Therefore, we present an batching policy which considers dynamic arrivals and due dates of orders. The presented batching policy is efficient for the automated storage and retrieval system which is connected with a manufacturing system.

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.487-494
• /
• 2009

VOD(Video On Demand) that provides streaming service according to the user's requirement in real time, consists of the video streaming server and the client system. Since it is very hard to apply the traditional server-client model that a server communicates with many clients through 1:1 connection to VOD system because it requires very high network bandwidth, many researches have been done to address this problem. Batching technique is one of VOD system based on Multicast that requires very small network bandwidth. However, the batching based VOD system has a limitation that it is very hard to provide VCR(Video Cassette Recorder) ability. In this paper, we propose a technique that reduces the required network bandwidth to provide VCR function by using the characteristic of MPEG, one of international video compression standard. In the proposed technique, a new video stream for VCR function is constructed with I pictures that is able to be decoded independently. The new video stream for VCR function is transmitted with the video stream for normal play together in Batching manner. The performance evaluation result shows that the proposed technique not only reduces the required network bandwidth and memory usage but also decreases the CPU usages.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.12
• /
• pp.2852-2859
• /
• 1997

Video-On-Demand system provides electronic video rental services from remote video servers on a broadband communication networks. Most of proposed VOD systems are typically designed for one-to-one conncetion between a user and video server. Therefore, video server stream services to customers individually by allocating a dedicated transmission channel and a set of video server resources for each customer. However, it is inefficiency and wxpensive way when server support multiple users who access the same video stream with a dedicated video channel. Therefore, to achieve cost-effectiveness, batching have studied method that uses multicast communication to simultaneously service all users requesting the same video with a single video with a single video stream. However, the application of the multicast communication by batching detract from the VCR-like function and on-demand nature of the system. In this paepr, we propose a scheme that can support an interactive VCR for all user requesting the same video stream with batching. To reduce a server I/O and network bandwidth requirement, dynamic buffer is allocated to access node which has variable playout poit. Consequently, it makes possible interactive VCR operation as if customer uses true VOD system. Also, this scheme can just deliver a multicast stream without delay after an initial request or VCR action occurred. The policy can guarantee acceptable services to number of users at minimum cost.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.13-15
• /
• 2011

현재 무선 통신을 이용한 IPTV서비스에 대한 요구가 지속적으로 증가 되고 있다. 따라서 제한된 자원을 다수의 사용자들에게 효율적으로 전송하기 위한 기술이 개발되어야 한다. 본 논문에서 우리는 무선 IPTV의 VOD 시스템 성능 향상을 위해 효율적인 Batching 기법과 채널을 효과적으로 사용하기 위하여 Network coding을 활용한 기법을 제안한다. 제안된 기법은 채널을 효과적으로 사용하기 위하여 Network coding을 활용하였다. 현재의 Batching 기법은 다수의 채널을 사용하는 반면에 제안된 기법은 한 개의 채널에서 2개 이상의 세그먼트를 전송함으로써 얻어지는 채널사용의 효율성을 보여준다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.716-720
• /
• 2003

Order-picking process is one of the major operations in warehouses and distribution centers. In low-level picker-to-part system, picker usually combines orders (order batching) as much as possible so that the can pick a set of the combined orders at the same time. For midpoint routing policy, this paper develops an efficient order-batching algorithm based on cluster analysis. The algorithm is compared with a well known existing algorithm in terms of the total travel time and number of batches grouped. The test results show that the proposed heuristic performs better than the other.

• Industrial Engineering and Management Systems
• /
• v.14 no.3
• /
• pp.289-298
• /
• 2015

This paper analyses the best batch formations for order picking throughput in narrow-aisle order picking systems. Our analytical comparison finds that a high pick density variation leads to a heavy picker blocking. Simulation experiments show that a distance-based batching algorithm reduces picker blocking by decreasing the number of aisles visited and stabilizing the variation in number of picks per aisle by packing orders tightly, and that the solution quality and mechanism for determining the batch size dictated by the sorting strategy causes varying amounts of blocking. We conclude that combining a distance-based batching method with an appropriate batch sizing strategy will reduce picker blocking and shorten travel in narrow-aisle picking systems.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.253-255
• /
• 2010

IPTV 서비스는 무선 통신 지역의 요구가 증가되고 있다. 또한 사용자들이 제한된 자원을 지원하기 위해 효율적인 전송 기술은 개발되어야 한다. 본문에서 우리는 전반적인 무선 IPTV의 VoD 시스템 성능 향상을 위해 효율적인 batching 기법을 제안한다. 이 제안은 채널 사용을 극대화하기 위해 SIT(Segment Interval Time)을 활용하였다. 현재의 Batching 기법은 많은 수의 채널을 사용하는 반면에 우리가 제안한 기법은 적은 수의 채널을 사용하여 VoD의 빠른 서비스를 보여준다. 또한 재생 지연 시간도 줄어든다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.623-628
• /
• 2000

Video-on-demand system in which users can request any video through the network at any time is made possible by rapid increase in network bandwidth and capacity of the media server. However true video-on-demand system cannot support all requests since bandwidth requirement is still too demanding. Therefore efficient bandwidth reduction algorithm is necessary. both the piggybacking method and the batching method are novel solutions that can provide more logical number of streams than the physical system can support. Of course each of them has its pros and cons. hence piggybacking with batching-by-size can take advantage of both the schemes. Some parameters such as the size of batch and the size of the catch-up window should be adjusted and order to maximize the bandwidth reduction for piggybacking with batching-by-size method. One of the most important parameters is decided optimally in this paper. Simulation shows that the optimized parameter can achieve considerable reductionand consequently remarkable enhancement in performance.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.989-998
• /
• 2002

The waiting delays of users are inevitable in this policy since the services are not taken immediately upon requests but upon every scheduling points. An inefficient management of such delays makes m unfair service to users and increases the possibility of higher reneging rates. This paper proposes an leagued batching scheduling scheme which improves the average waiting time of users requests and reduces the starvation problem of users requesting less popular movies. The proposed scheme given intervals based on the league which reflect the disk partitions service patterns and user requests. Experimental results of simulations show that the proposed scheme improves about 18 percentage of average waiting time comparing with those of conventional methods such as FCFS and MQL.