• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.696-708
• /
• 1992

In this study, we have several objectives. First, In spite of a fixed bandwidth waste of reservation channel, we maximize the efficiency of transmission channel by the multiple access algorithm that performs channel reservation and data transmission independently, eliminating the frame structure of transmission channel and reserving it by the slot unit . Second, In order to improve the entire system performance, we accommodate the variation of traffic at each earth station more effectively, and accomplish the stable delay characteristics and the equlity of service #or users. For this purpose, we design the satellite channel that consists of reservation channel and transmission channel which are logically separate and operate Independently. We also design a demand assignment multiple access algorithm based on the satellite channel structure.

• 전자공학회논문지 IE
• /
• v.43 no.1
• /
• pp.39-45
• /
• 2006

The increment of user at mobile communication system requires the need of increased system capacity. To increase the system capacity can be realized by decreasing the size of cell. But, this method causes various problems. Therefore, it be used the hierarchical cellular system with macrocell and microcell for a efficient working. The users feel more inconvenience about the drop of connected call than the block of new call. Therefore, it is to be desired that the dropping rate of handoff call is lowered. At this paper, we use non reversible hierarchical scheme and fixed channel assignment scheme at the hierarchical cellular system with macrocell and microcell for the call process strategy. We analyze the system performance in accordance with the number of guard channel for handoff.