Optimizing Patching‐based multicast for video‐on‐demand in wireless mesh networks

Abstract

SUMMARYIn this work, we study the application of video-on-demand (VoD) in wireless mesh networks (WMN), a next generation edge technology to provide broadband data access in residential, business and even citywise networks. We adopt a Patching-based multicast technique to better utilize the bandwidth resources in the mesh network. We optimize the Patching-based multicast by addressing two critical problems, namely, the Minimum Cost Multicast Tree (MCMT) problem and the Maximum Benefit Multicast Group (MBMG) problem. The MCMT problem is to find a MCMT in the network. We show that finding such a tree in the WMN can be formulated as a graph theory problem, which is to find the tree with minimum number of non-leaf nodes, and which spans all the nodes in the multicast group. We further prove the problem is NP-hard and propose a fast greedy algorithm to accommodate the real-time feature of the VoD application. We solve the MBMG problem by minimizing the communication of a Patching group in the entire network. A Markov model is proposed to capture the growth of the multicast group in the WMN. Simulation study results validate the proposed solutions of the two problems.

A buffer‐aware fleet‐based cooperative H.264/SVC streaming over vehicular networks

“…According to the previous introduction depicted in Section 1, the proposed FCS‐VN involves the following: (1) layered streaming; (2) streaming over wireless networks; (3) bandwidth aggregation; (4) cooperative transmission; and (5) vehicular networks. In these years, many researchers analyzed and discussed the pros and cons of video streaming over wireless networks . Because the long delay and high packet loss rate of wireless networks induce poor quality for video streaming, layered video streaming is adapted over wireless networks .…”

Topology-based Multicast Scheduling for On-Demand Multimedia Service Provisioning

“…To formulate the problem, delivery time (quality requirement) can be considered either as a constraint that cannot be violated, or it can be incorporated in the objective function by considering a penalty for late delivered contents. Since the ISP expects to receive new requests in the future, if the maximum delivery time is not violated, it can be profitable for the ISP to postpone transmitting the content to some receivers (who cannot be clustered into cost efficient multicast groups in the current transmission period) to the next period in hope for receiving more requests and sharing the cost with a larger group [3,9].…”

“…In spite of importance of network topology in reservation costs of VoD transmission, in the existing multicast grouping studies which try to maximize multicast sharing advantage, merely bandwidth consumption is considered. To the best of our knowledge, only Xie et al in [9] took network topology into consideration to calculate multicast group cost. They chose minimization of lower bound of volume of the actual data transmitted for a multicast group as the optimization goal while making grouping decision.…”

A cross‐layer optimization for maximum‐revenue‐based multicast in multichannel multiradio wireless mesh networks

“…For such a scenario, it is usually required to construct a multicast tree to implement the proposed system, because multicast mechanism can deliver a message to a group of destinations in single transmission from the source. Furthermore, for supporting end users to receive high‐resolution TV programs, the multicast tree must have sufficient bandwidth to transmit high‐quality video streams on multiple links simultaneously . Hence, the capability of supporting multiple interference‐free concurrent transmissions is a requirement for our multicast tree.…”