Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Balancing push and pull for data broadcast
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A study on channel allocation for data dissemination in mobile computing environments
Mobile Networks and Applications - Special issue: resource management in mobile wireless communication networks
Proceedings of the tenth international conference on Information and knowledge management
The M/G/c queue in light traffic
Queueing Systems: Theory and Applications
Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment
IEEE Transactions on Knowledge and Data Engineering
Agent-based Mobile Data Caching Strategies Using Data Significance
Journal of Integrated Design & Process Science
Hi-index | 0.00 |
Hybrid data dissemination, which combines the push-based (i.e., broadcast) and pull-based (i.e., on-demand) data delivery, is the most common technique to deliver information in a mobile computing system. Most of the prior works in hibrid dissemination are based on the assumption that each delivered data item is of the same size. However, in the modern communication environment in which various information is delivered, the conventional dissemination schemes suffer from the efficiency issues. In this paper, we consider a general model of hybrid data dissemination, in which each data item is allowed to have an arbitrary size. The analytical model MGBC (Model of General Broadcast Channels) and MGOD (Model of General On-demand Channels) are first proposed to describe the broadcast and on-demand channels, respectively. In addition, the scheme GDS (General Dissemination Scheme) is adopted to perform the channel allocation and the data classification. Experimental results show that the proposed approach gives a near-optimal solution in achieving the minimun access time in the general dissemination environment.