TY - GEN
T1 - Steiner Trees Composition and Scalable Video Coding for Satelite Video Multicast
AU - Binun, Alex
AU - Dinitz, Yefim
AU - Dolev, Shlomi
AU - Hadar, Ofer
AU - Jaber, Adnan
AU - Riabtsev, Shevach
N1 - Publisher Copyright: ©2024 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - The use of Low Earth orbit satellites (LEO) for communication has become a reality (e.g., SpaceX). The usage of Internet communication for communicating videos is very significant. We propose a scheme based on Scalable Video Coding (SVC) that fits multicast to users with heterogeneous resolution demands (e.g., mobile phones, computer screens, and HD televisions). The use of SVC allows a significant reduction in the total communicated information, typically a reduction of dozens of percentages. We build a hierarchy of optimal Steiner trees to communicate the video-encoded layers of the SVC. The first Steiner tree spans across all the terminals and is used to convey the first layer of the SVC, and the second spans the terminals that require more resolution than the basic resolution. The third Steiner tree spans the terminals that require even more resolution, and so forth for the following Steiner trees and SVC layers. We suggest a new algorithm for finding the Steiner trees in the hierarchy, such that they are all optimal and prefer edges not used by the Steiner trees that are used for previous layers. Thus, communication can be distributed without sacrificing optimality.
AB - The use of Low Earth orbit satellites (LEO) for communication has become a reality (e.g., SpaceX). The usage of Internet communication for communicating videos is very significant. We propose a scheme based on Scalable Video Coding (SVC) that fits multicast to users with heterogeneous resolution demands (e.g., mobile phones, computer screens, and HD televisions). The use of SVC allows a significant reduction in the total communicated information, typically a reduction of dozens of percentages. We build a hierarchy of optimal Steiner trees to communicate the video-encoded layers of the SVC. The first Steiner tree spans across all the terminals and is used to convey the first layer of the SVC, and the second spans the terminals that require more resolution than the basic resolution. The third Steiner tree spans the terminals that require even more resolution, and so forth for the following Steiner trees and SVC layers. We suggest a new algorithm for finding the Steiner trees in the hierarchy, such that they are all optimal and prefer edges not used by the Steiner trees that are used for previous layers. Thus, communication can be distributed without sacrificing optimality.
UR - http://www.scopus.com/inward/record.url?scp=105002731660&partnerID=8YFLogxK
U2 - 10.1109/NCA61908.2024.00017
DO - 10.1109/NCA61908.2024.00017
M3 - Conference contribution
T3 - Proceedings - 2024 22nd International Symposium on Network Computing and Applications, NCA 2024
SP - 29
EP - 36
BT - Proceedings - 2024 22nd International Symposium on Network Computing and Applications, NCA 2024
T2 - 22nd International Symposium on Network Computing and Applications, NCA 2024
Y2 - 24 October 2024 through 26 October 2024
ER -