Minimizing bandwidth requirements for on-demand data delivery
| Autor: | John Zahorjan, Mary K. Vernon, Derek L. Eager |
|---|---|
| Rok vydání: | 2001 |
| Předmět: |
Service (systems architecture)
Multicast Dynamic bandwidth allocation Computer science business.industry Distributed computing Principal (computer security) Broadcasting Computer Science Applications Bandwidth allocation Computational Theory and Mathematics Bandwidth (computing) Xcast business Information Systems Computer network |
| Zdroj: | IEEE Transactions on Knowledge and Data Engineering. 13:742-757 |
| ISSN: | 1041-4347 |
| DOI: | 10.1109/69.956098 |
| Popis: | Two recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request, yet achieve considerable client stream sharing which leads to significant server and network bandwidth savings. The paper considers: 1) how well these recently proposed techniques perform relative to each other and 2) whether there are new practical delivery techniques that can achieve better bandwidth savings than the previous techniques over a wide range of client request rates. The principal results are as follows: First, the recent partitioned dynamic skyscraper technique is adapted to provide immediate service to each client request more simply and directly than the original dynamic skyscraper method. Second, at moderate to high client request rates, the dynamic skyscraper method has required server bandwidth that is significantly lower than the recent optimized stream tapping/patching/controlled multicast technique. Third, the minimum required server bandwidth for any delivery technique that provides immediate real-time delivery to clients increases logarithmically (with constant factor equal to one) as a function of the client request arrival rate. Furthermore, it is (theoretically) possible to achieve very close to the minimum required server bandwidth if client receive bandwidth is equal to two times the data streaming rate and client storage capacity is sufficient for buffering data from shared streams. Finally, we propose a new practical delivery technique, called hierarchical multicast stream merging (HMSM), which has a required server bandwidth that is lower than the partitioned dynamic skyscraper and is reasonably close to the minimum achievable required server bandwidth over a wide range of client request rates. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|