An on-demanded data broadcasting scheduling considering the data item size

Hu, Wenbin; Xia, Chang; Du, Bo; Wu, Min

doi:10.1007/s11276-014-0768-0

Cited by 8 publications

(2 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The constantly changing characteristics of data item size in on-demand data broadcast are studied in [20]. The authors proposed two scheduling models under different split strategies, one is the equal split scheduling model ES-× × which proposes the equal splitting strategy (ES) and a deadline adjust strategy.…”

Section: Data Scheduling In On-demand Data Disseminationmentioning

confidence: 99%

“…Although various scheduling algorithms for on-demand broadcast have been proposed in the literature [18][19][20][21][22], these algorithms do not fully utilize the strength of data broadcast 2 Mobile Information Systems and only clients requesting the same data item can be satisfied in one broadcast slot. With network coding technique [23], it is possible that clients requesting different data items can be satisfied simultaneously by utilizing previously received data items stored at clients.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Coding-Based Scheduling for Multi-Item Requests in Real-Time On-Demand Data Dissemination

Wang¹,

Yan²,

Yu³

2016

Mobile Information Systems

View full text Add to dashboard Cite

On-demand broadcast is an effective data dissemination technique to enhance the system ability to handle dynamic client access patterns. With the development of real-time wireless applications, it is practical for clients to request multiple related data items with time constraint in one request. For real-time data broadcast, items are only useful if they can be received by clients before expiration; otherwise, the related requests become invalid. Hence, minimizing the number of requests that miss their deadlines becomes an important task in on-demand broadcast, especially for multi-item scenario, where more requests are inclined to miss their deadlines due to the heavier workload and greater complexity, compared with single-item scenario. In this paper, we propose a network coding-based scheduling algorithm for real-time multi-item data dissemination. The proposed algorithm exploits the coding opportunities between cached and requested data items and integrates network coding with data scheduling to minimize the deadline miss ratio. Extensive simulation results demonstrate that the proposed algorithm achieves the lowest deadline miss ratio under various circumstances. In addition, the high efficiency of the proposed algorithm in utilizing the transmission bandwidth is proved for that fewer instances of ineffective service are provided for satisfying clients' requests within time constraints.

show abstract

Section: Data Scheduling In On-demand Data Disseminationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%