Efficient Dissemination of Transaction-Consistent Data in Broadcast Environments

Young, Cheng-Ru; Chiu, Ge-Ming

doi:10.1109/tkde.2007.42

Cited by 5 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the scarcity of radio resources, BSs may rapidly be flooded with increasing and asynchronous requests from a large population of users. One viable way of mitigating this issue and ensuring efficient spectrum utilization is by leveraging the broadcast nature of wireless communications systems [30]. Furthermore, for real-time applications such as video-on-demand services including Netflix or YouTube, a large proportion of traffic is caused by a few popular files that are more likely to be cached at the BS [31].…”

Section: System Setup and Problem Formulationmentioning

confidence: 99%

Packet Completion Time Minimization via Joint D2D and Cellular Communication: A Unified Network Coding Approach

Denis¹,

Seferoğlu²

2020

Preprint

View full text Add to dashboard Cite

This paper tackles the problem of transmitting a common content to a number of cellular users by means of instantly decodable network coding (IDNC) with the help of intermittently connected D2D links. Of particular interest are broadcasting real-time applications such as video-on-demand, where common contents may be partially received by cellular users due to packet erasures over cellular links. Specifically, we investigate the problem of packet completion time, defined as the number of transmission slots necessary to deliver a common content to all users. Drawing on graph theory, we develop an optimal packet completion time strategy by constructing a two-layer IDNC conflict graph.The higher-layer graph permits us to determine all feasible packet combinations that can be transmitted over the cellular link, while the lower-layer graph enables us to find all feasible network coded packets and identify the set of users that can generate and transmit these packets via intermittently connected D2D links. By combining the higher-layer and the lower-layer IDNC conflict graphs, we demonstrate that finding the optimal IDNC packets to minimize the packet completion time problem is equivalent to finding the maximum independent set of the two-layer IDNC conflict graph, which is known to be an Juwendo Denis and Hulya Seferoglu are with the Department of Electrical and Computer Engineering,

show abstract

Section: System Setup and Problem Formulationmentioning

confidence: 99%