Please use this identifier to cite or link to this item:
|Title:||On the design of strategies for resolving bandwidth constraints for large-scale multimedia video-on-reservation systems|
|Authors:||Zeng, Z. |
|Citation:||Zeng, Z., Veeravalli, B., Royston, T.T.M., Jia, G. (2007). On the design of strategies for resolving bandwidth constraints for large-scale multimedia video-on-reservation systems. ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications : 592-597. ScholarBank@NUS Repository. https://doi.org/10.1109/ICIEA.2007.4318476|
|Abstract:||In this paper, we propose three novel algorithms to resolve the bandwidth overflow problems presented in the real world multimedia retrieval situations: (1) Alternate Path (AP), (2) Sending Earlier (SE), and (3) Sending at Lower Bandwidth (SLB). AP method relieves the bandwidth overflows by excluding file transmissions from the overflowed link and then choosing a different path for them. In this case, file with the smallest size is selected as the victim. SE method resolves the conflictions by sending the fils over the same link at an earlier time. The file transmissions which end earliest are selected as the victims. SLB method uses whatever leftover bandwidths to send the files using a lower bandwidth. In this method, the file transmissions will start earlier and last longer. Here, file with the smallest size is selected as the victim. A number of simulations have been conducted in order to analyze the performance of the proposed methods under different charge standards. From these simulations, we observe that higher network charges favor the use of the SE method, while higher storage charges favor the AP algorithm. © 2007 IEEE.|
|Source Title:||ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 18, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.