On-demand data broadcasting /
address the issue of scheduling broadcasts such that
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1998.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | address the issue of scheduling broadcasts such that and the main server, is also evaluated. Finally, we bandwidth available to a server is insufficient to broadcasting data to all clients is efficient. This broadcasting in an environment where clients make broadcasting, using proxy servers between the clients broadcasting. We look at the problem of data caching decisions. A hierarchical model for data evaluates two new broadcast scheduling algorithms for explicit requests to the server. The server broadcasts minimizing the waiting time at clients. A new caching proposed algorithm tries to trade-of the variance with requested data items to all the clients, including scheme for clients is also proposed. This caching scheme uses information from the server to make serve the clients one at a time. In such environments, such an on-demand model with the objective of the mean access time. the variance of the waiting time is reduced. The thesis deals with issues related to on-demand data This thesis considers environments wherein the crographics. those who have not requested the item. This thesis |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | x, 66 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references: pages 56-59. |