A hybrid scheduling scheme for data broadcast over a single channel in mobile environments

Abstract

Various broadcast schemes have been proposed to reduce the data access time of mobile clients. However, they are based either on the mobile users' data access frequencies or on the semantic relations of the data. In this paper, we present a hybrid data broadcast scheme based both on semantic relationships and access probabilities. The broadcast scheme we propose generates a broadcast sequence according to the semantic relationships and replicates popular data items several times according to the data access probabilities. The efficiency of our broadcast scheme is shown via performance evaluations.

On-demand data broadcast with deadlines for avoiding conflicts in wireless networks

“…Dewri et al (2012) scheduled real time requests with deadlines to reduce the miss ratio, and the proposed scheduler attempts to maximize the utility of requests and serves the requests in their deadlines as far as possible. Yi and Shin (2012) proposed a hybrid scheduling scheme based on semantic relationship and access probabilities.…”

An efficient and scalable ubiquitous storage scheme for delay-sensitive IT applications

“…Existing researches on distributed storage have made great progress (Chockler et al 2009;Jepson 2004;MarcelmJimenez et al 2006;Ramakrishnan and Emer 1989;Yi and Shin 2010;Zeng and Veeravalli 2008), however, their solutions to data access cannot still meet the on-line interaction requirements from ubiquitous applications. Peer-to-Peer (P2P) based distributed storage (Yiu et al 2007(Yiu et al , 2009) is an emerging and promising technology for content sharing applications because of its inherent scalability, fault tolerance, and high performance.…”