Video Data Delivery using Slotted Patching |
| |
| Authors: | Satish Chand Bijendra Kumar Hari Om |
| |
| Affiliation: | 1. Computer Engineering Division, Netaji Subhas Institute of Technology, Sector-3, Dwarka, New Delhi, India;2. Department of Computer Science and Engineering, Indian School of Mines, Dhanbad, India;1. School of Chemistry and Chemical Engineering, University of South China, Hengyang, Hunan 421001, China;2. Hunan key laboratory for the design and application of actinide complexes, University of South China, Hengyang, Hunan 421001, PR China;3. School of Nuclear Science and Technology, University of South China, Hengyang, Hunan 421001, China;1. Department of Pharmacy, Tongren Hospital, Shanghai Jiao Tong University School of Medicine, Shanghai 200336, China;2. State Key Laboratory of High Performance Ceramics and Superfine Microstructure, Shanghai Institute of Ceramics, Chinese Academy of Sciences, Shanghai 200050, China;3. Center of Materials Science and Optoelectronics Engineering, University of Chinese Academy of Sciences, Beijing 100049, China;4. Hongqiao International Institute of Medicine, Shanghai Jiao Tong University School of Medicine, Shanghai 200336, China;5. School of Chemistry and Materials Science, Hangzhou Institute for Advanced Study, University of Chinese Academy of Sciences, 1 Sub-lane Xiangshan, Hangzhou 310024, China;6. Cixi Center of Biomaterials Surface Engineering, Ningbo 315300, China;7. Shenzhen Key Laboratory for Innovative Technology in Orthopaedic Trauma, Guangdong Engineering Technology Research Center for Orthopaedic Trauma Repair, Department of Orthopaedics and Traumatology, The University of Hong Kong Shenzhen Hospital, Shenzhen, China;1. Department of Pharmacy, Tongren Hospital, Shanghai Jiao Tong University School of Medicine, Shanghai, 200336, China;2. State Key Laboratory of High Performance Ceramics and Super?ne Microstructure, Shanghai Institute of Ceramics, Chinese Academy of Sciences, Shanghai, 200050, China;3. Center of Materials Science and Optoelectronics Engineering, University of Chinese Academy of Sciences, Beijing, 100049, China;4. Hongqiao International Institute of Medicine, Shanghai Jiao Tong University School of Medicine, Shanghai, 200336, China;5. School of Chemistry and Materials Science, Hangzhou Institute for Advanced Study, University of Chinese Academy of Sciences, 1 Sub-lane Xiangshan, Hangzhou, 310024, China;6. Cixi Center of Biomaterials Surface Engineering, Shanghai Institute of Ceramics, Chinese Academy of Sciences, Ningbo, 315300, China;1. School of Mathematical Sciences, Soochow University, No.1 Shizi Road, Suzhou, Jiangsu Province, 215006, China;2. School of Mathematical Sciences, University of Science and Technology of China, No.96 Jinzhai Road, Hefei, Anhui Province, 230026, China |
| |
| Abstract: | In the request-based scheme, a patching channel is initiated on arrival of a request in an interarrival time of two adjacent multicast channels. If two requests are received in a short duration in an interarrival time, two patching channels are needed to service them. Both these channels deliver almost the same data, thus, wasting the bandwidth. This problem may be addressed in two ways: using higher level patching technique, or forcing the first request to wait for the second one. Using higher level patching technique makes the system more complex and thus usually not preferred. In the second case, the bandwidth usage certainly reduces, but the length of the waiting time by the first request for the second request is the main issue. In this paper, this issue is addressed by dividing the video duration into uniform time slots such that there is at least one request in a time slot for initiating the patching channel. The proposed scheme is named as Video Data Delivery using Slotted Patching. In this scheme, the patching channels download much less video data than the request-based scheme and thus require less bandwidth. This scheme may not provide immediate services to all users unlike the request-based scheme, but the user's waiting can be made arbitrarily small without using much resources unlike the request-based scheme. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
