[273] | Farzad Tashtarian, Abdelhak Bentaleb, Reza Farahani, Minh Nguyen, Christian Timmerer, Hermann Hellwagner, Roger Zimmermann, A Distributed Delivery Architecture for User Generated Content Live Streaming over HTTP, In 2021 IEEE 46th Conference on Local Computer Networks (LCN), IEEE, pp. 162-169, 2021.
[bib][url] [doi] [abstract]
Abstract: Live User Generated Content (UGC) has become very popular in today’s video streaming applications, in particular with gaming and e-sport. However, streaming UGC presents unique challenges for video delivery. When dealing with the technical complexity of managing hundreds or thousands of concurrent streams that are geographically distributed, UGC systems are forces to made difficult trade-offs with video quality and latency. To bridge this gap, this paper presents a fully distributed architecture for UGC delivery over the Internet, termed QuaLA (joint Quality-Latency Architecture). The proposed architecture aims to jointly optimize video quality and latency for a better user experience and fairness. By using the proximal Jacobi alternating direction method of multipliers (ProxJ-ADMM) technique, QuaLA proposes a fully distributed mechanism to achieve an appropriate solution. We demonstrate the effectiveness of the proposed architecture through real-world experiments using the CloudLAB testbed. Experimental results show the outperformance of QuaLA in achieving high quality with more than 57% improvement while preserving a good level of fairness and respecting a given target latency among all clients compared to conventional client-driven solutions.
|
[272] | Babak Taraghi, Abdelhak Bentaleb, Christian Timmerer, Roger Zimmermann, Hermann Hellwagner, Understanding quality of experience of heuristic-based HTTP adaptive bitrate algorithms, In Proceedings of the 31st ACM Workshop on Network and Operating Systems Support for Digital Audio and Video, ACM, pp. 82-89, 2021.
[bib][url] [doi] [abstract]
Abstract: Adaptive bitrate (ABR) algorithms play a crucial role in delivering the highest possible viewer's Quality of Experience (QoE) in HTTP Adaptive Streaming (HAS). Online video streaming service providers use HAS - the dominant video streaming technique on the Internet - to deliver the best QoE for their users. A viewer's delight relies heavily on how the ABR of a media player can adapt the stream's quality to the current network conditions. QoE for video streaming sessions has been assessed in many research projects to give better insight into the significant quality metrics such as startup delay and stall events. The ITU Telecommunication Standardization Sector (ITU-T) P.1203 quality evaluation model allows to algorithmically predict a subjective Mean Opinion Score (MOS) by considering various quality metrics. Subjective evaluation is the best assessment method for examining the end-user opinion over a video streaming session's experienced quality. We have conducted subjective evaluations with crowdsourced participants and evaluated the MOS of the sessions using the ITU-T P.1203 quality model. This paper's main contribution is to investigate the correspondence of subjective and objective evaluations for well-known heuristic-based ABRs.
|
[271] | Bernhard Rinner, Christian Bettstetter, Hermann Hellwagner, Stephan Weiss, Multidrone Systems: More Than the Sum of the Parts, In Computer, Institute of Electrical and Electronics Engineers (IEEE), vol. 54, no. 5, pp. 34-43, 2021.
[bib][url] [doi] [abstract]
Abstract: Now that drones have evolved from bulky platforms to agile devices, a challenge is to combine multiple drones into an integrated autonomous system, offering functionality that individual drones cannot achieve. Such multidrone systems require connectivity, communication, and coordination. We discuss these building blocks along with case studies and lessons learned.
|
[270] | Philipp Moll, Selina Isak, Hermann Hellwagner, Jeff Burke, A Quadtree-based synchronization protocol for inter-server game state synchronization, In Computer Networks, Elsevier BV, vol. 185, pp. 107723, 2021.
[bib][url] [doi] [abstract]
Abstract: Online games are a fundamental part of the entertainment industry but the current IP infrastructure does not satisfactorily fulfill the needs of these services. The novel networking architecture Named Data Networking (NDN) inherently supports network-level multicast and packet-level security and thereby introduces promising features for online games. In this paper, we propose an NDN-based approach to synchronize game state in a server cluster, a task necessary to allow multiple players in large numbers to play in the same game world. The proposed Quadtree Synchronization Protocol applies NDN’s data-centric nature to decouple the game world from the game servers hosting it. This means that requesting changes of a specific game world region becomes possible without knowing which game server is responsible for the requested region. We use a hierarchic game world structure when requesting data that allows the network to forward requests to the responsible game server without directly addressing it. This region-based naming scheme decouples world regions from servers which eases the management of the game server cluster and allows easier recovery after server failures. In addition, this decoupling allows exchanging information about a geographical region, such as a game world, without knowledge of the other participants changing the world. Such a region-based synchronization mode is not possible to implement with existing protocols. However, it allows building distributed systems that do not require a central server to work. Besides architectural benefits, network emulations show that our protocol increases the efficiency of data transport by utilizing network-level multicast. Our proposed approach can keep up with current protocols which can be used for inter-server game state synchronization.
|
[269] | Daniele Lorenzi, Minh Nguyen, Farzad Tashtarian, Simone Milani, Hermann Hellwagner, Christian Timmerer, Days of future past, In Proceedings of the 2021 Workshop on Evolution, Performance and Interoperability of QUIC, ACM, pp. 8-14, 2021.
[bib][url] [doi] [abstract]
Abstract: HTTP Adaptive Streaming (HAS) has become a predominant technique for delivering videos in the Internet. Due to its adaptive behavior according to changing network conditions, it may result in video quality variations that negatively impact the Quality of Experience (QoE) of the user. In this paper, we propose Days of Future Past, an optimization-based Adaptive Bitrate (ABR) algorithm over HTTP/3. Days of Future Past takes advantage of an optimization model and HTTP/3 features, including (i) stream multiplexing and (ii) request cancellation. We design a Mixed Integer Linear Programming (MILP) model that determines the optimal video qualities of both the next segment to be requested and the segments currently located in the buffer. If better qualities for buffered segments are found, the client will send corresponding HTTP GET requests to retrieve them. Multiple segments (i.e., retransmitted segments) might be downloaded simultaneously to upgrade some buffered but not yet played segments to avoid quality decreases using the stream multiplexing feature of QUIC. HTTP/3's request cancellation will be used in case retransmitted segments will arrive at the client after their playout time. The experimental results shows that our proposed method is able to improve the QoE by up to 33.9%.
|
[268] | Dragi Kimovski, Roland Matha, Josef Hammer, Narges Mehran, Hermann Hellwagner, Radu Prodan, Cloud, Fog, or Edge: Where to Compute?, In IEEE Internet Computing, Institute of Electrical and Electronics Engineers (IEEE), vol. 25, no. 4, pp. 30-36, 2021.
[bib][url] [doi] [abstract]
Abstract: The computing continuum extends the high-performance cloud data centers with energy-efficient and low-latency devices close to the data sources located at the edge of the network. However, the heterogeneity of the computing continuum raises multiple challenges related to application management. These include where to offload an application – from the cloud to the edge – to meet its computation and communication requirements. To support these decisions, we provide in this article a detailed performance and carbon footprint analysis of a selection of use case applications with complementary resource requirements across the computing continuum over a real-life evaluation testbed.
|
[267] | Antonia Stornig, Aymen Fakhreddine, Hermann Hellwagner, Petar Popovski, Christian Bettstetter, Video Quality and Latency for UAV Teleoperation over LTE: A Study with ns3, In 2021 IEEE 93rd Vehicular Technology Conference (VTC2021-Spring), IEEE, pp. 1-7, 2021.
[bib][url] [doi] [abstract]
Abstract: Teleoperation of an unmanned aerial vehicle (UAV) is a challenging mobile application with real-time control from a first-person view. It poses stringent latency requirements for both video and control traffic. This paper studies the video quality and latencies for UAV teleoperation over LTE using ns3 simulations. A key ingredient is the latency budget model. We observe that the latency of the video is higher and more sensitive to mobility than that of the control traffic. The latency is influenced by the traffic variation caused by the variable bit rate of the streaming application. High mobility tends to increase latency and lead to more outliers, being problematic in real-time control.
|
[266] | Samira Hayat, Roland Jung, Hermann Hellwagner, Christian Bettstetter, Driton Emini, Dominik Schnieders, Edge Computing in 5G for Drone Navigation: What to Offload?, In IEEE Robotics and Automation Letters, Institute of Electrical and Electronics Engineers (IEEE), vol. 6, no. 2, pp. 2571-2578, 2021.
[bib][url] [doi] [abstract]
Abstract: Small drones that navigate using cameras may be limited in their speed and agility by low onboard computing power. We evaluate the role of edge computing in 5G for such autonomous navigation. The offloading of image processing tasks to an edge server is studied with a vision-based navigation algorithm. Three computation modes are compared: onboard, fully offloaded to the edge, and partially offloaded. Partial offloading is expected to pose lower demands on the communication network in terms of transfer rate than full offloading but requires some onboard processing. Our results on the computation time help select the most suitable mode for image processing, i.e., whether and what to offload, based on the network conditions.
|
[265] | Reza Farahani, Farzad Tashtarian, Hadi Amirpour, Christian Timmerer, Mohammad Ghanbari, Hermann Hellwagner, CSDN: CDN-Aware QoE Optimization in SDN-Assisted HTTP Adaptive Video Streaming, In 2021 IEEE 46th Conference on Local Computer Networks (LCN), IEEE, pp. 525-532, 2021.
[bib][url] [doi] [abstract]
Abstract: Recent studies have revealed that network-assisted techniques, by providing a comprehensive view of the network, improve HTTP Adaptive Streaming (HAS) system performance significantly. This paper leverages the capability of Software-Defined Networking, Network Function Virtualization, and edge computing to introduce a CDN-Aware QoE Optimization in SDN-Assisted Adaptive Video Streaming (CSDN) framework. We employ virtualized edge entities to collect various information items and run an optimization model with a new server/segment selection approach in a time-slotted fashion to serve the clients’ requests by selecting optimal cache servers. In case of a cache miss, a client’s request is served by an optimal replacement quality from a cache server, by a quality transcoded from an optimal replacement quality at the edge, or by the originally requested quality from the origin server. Comprehensive experiments conducted on a large-scale testbed demonstrate that CSDN outperforms other approaches in terms of the users’ QoE and network utilization.
|
[264] | Reza Farahani, Farzad Tashtarian, Alireza Erfanian, Christian Timmerer, Mohammad Ghanbari, Hermann Hellwagner, ES-HAS: an edge- and SDN-assisted framework for HTTP adaptive video streaming, In Proceedings of the 31st ACM Workshop on Network and Operating Systems Support for Digital Audio and Video, ACM, pp. 50-57, 2021.
[bib][url] [doi] [abstract]
Abstract: Recently, HTTP Adaptive Streaming (HAS) has become the dominant video delivery technology over the Internet. In HAS, clients have full control over the media streaming and adaptation processes. Lack of coordination among the clients and lack of awareness of the network conditions may lead to sub-optimal user experience and resource utilization in a pure client-based HAS adaptation scheme. Software Defined Networking (SDN) has recently been considered to enhance the video streaming process. In this paper, we leverage the capability of SDN and Network Function Virtualization (NFV) to introduce an edge- and SDN-assisted video streaming framework called ES-HAS. We employ virtualized edge components to collect HAS clients' requests and retrieve networking information in a time-slotted manner. These components then perform an optimization model in a time-slotted manner to efficiently serve clients' requests by selecting an optimal cache server (with the shortest fetch time). In case of a cache miss, a client's request is served (i) by an optimal replacement quality (only better quality levels with minimum deviation) from a cache server, or (ii) by the original requested quality level from the origin server. This approach is validated through experiments on a large-scale testbed, and the performance of our framework is compared to pure client-based strategies and the SABR system [12]. Although SABR and ES-HAS show (almost) identical performance in the number of quality switches, ES-HAS outperforms SABR in terms of playback bitrate and the number of stalls by at least 70% and 40%, respectively.
|
[263] | Alireza Erfanian, Hadi Amirpour, Farzad Tashtarian, Christian Timmerer, Hermann Hellwagner, LwTE-Live: Light-weight Transcoding at the Edge for Live Streaming, In Proceedings of the Workshop on Design, Deployment, and Evaluation of Network-assisted Video Streaming, ACM, pp. 22-28, 2021.
[bib][url] [doi] [abstract]
Abstract: Live video streaming is widely embraced in video services, and its applications have attracted much attention in recent years. The increased number of users demanding high quality (e.g., 4K resolution) live videos increases the bandwidth utilization in the backhaul network. To decrease bandwidth utilization in HTTP Adaptive Streaming (HAS), in on-the-fly transcoding approaches, only the highest bitrate representation is delivered to the edge, and other representations are generated by transcoding at the edge. However, this approach is inefficient due to the high transcoding cost. In this paper, we propose a light-weight transcoding at the edge method for live applications, LwTE-Live, to decrease the bandwidth utilization and the overall live streaming cost. During the encoding processes at the origin server, the optimal encoding decisions are saved as metadata and the metadata replaces the corresponding representation in the bitrate ladder. The significantly reduced size of the metadata compared to its corresponding representation decreases the bandwidth utilization. The extracted metadata is then utilized at the edge to decrease the transcoding time. We formulate the problem as a Mixed-Binary Linear Programming (MBLP) model to optimize the live streaming cost, including the bandwidth and computation costs. We compare the proposed model with state-of-the-art approaches, and the experimental results show that our proposed method saves the cost and backhaul bandwidth utilization up to 34% and 45%, respectively.
|
[262] | Alireza Erfanian, Hadi Amirpour, Farzad Tashtarian, Christian Timmerer, Hermann Hellwagner, LwTE: Light-Weight Transcoding at the Edge, In IEEE Access, Institute of Electrical and Electronics Engineers (IEEE), vol. 9, pp. 112276-112289, 2021.
[bib][url] [doi] [abstract]
Abstract: Due to the growing demand for video streaming services, providers have to deal with increasing resource requirements for increasingly heterogeneous environments. To mitigate this problem, many works have been proposed which aim to ( i ) improve cloud/edge caching efficiency, (ii) use computation power available in the cloud/edge for on-the-fly transcoding, and (iii) optimize the trade-off among various cost parameters, e.g., storage, computation, and bandwidth. In this paper, we propose LwTE, a novel L ight- w eight T ranscoding approach at the E dge, in the context of HTTP Adaptive Streaming (HAS). During the encoding process of a video segment at the origin side, computationally intense search processes are going on. The main idea of LwTE is to store the optimal results of these search processes as metadata for each video bitrate and reuse them at the edge servers to reduce the required time and computational resources for on-the-fly transcoding. LwTE enables us to store only the highest bitrate plus corresponding metadata (of very small size) for unpopular video segments/bitrates. In this way, in addition to the significant reduction in bandwidth and storage consumption, the required time for on-the-fly transcoding of a requested segment is remarkably decreased by utilizing its corresponding metadata; unnecessary search processes are avoided. Popular video segments/bitrates are being stored. We investigate our approach for Video-on-Demand (VoD) streaming services by optimizing storage and computation (transcoding) costs at the edge servers and then compare it to conventional methods (store all bitrates, partial transcoding). The results indicate that our approach reduces the transcoding time by at least 80% and decreases the aforementioned costs by 12% to 70% compared to the state-of-the-art approaches.
|
[261] | Alireza Erfanian, Farzad Tashtarian, Anatoliy Zabrovskiy, Christian Timmerer, Hermann Hellwagner, OSCAR: On Optimizing Resource Utilization in Live Video Streaming, In IEEE Transactions on Network and Service Management, Institute of Electrical and Electronics Engineers (IEEE), vol. 18, no. 1, pp. 552-569, 2021.
[bib][url] [doi] [abstract]
Abstract: Live video streaming traffic and related applications have experienced significant growth in recent years. However, this has been accompanied by some challenging issues, especially in terms of resource utilization. Although IP multicasting can be recognized as an efficient mechanism to cope with these challenges, it suffers from many problems. Applying software-defined networking (SDN) and network function virtualization (NFV) technologies enable researchers to cope with IP multicasting issues in novel ways. In this article, by leveraging the SDN concept, we introduce OSCAR (Optimizing reSourCe utilizAtion in live video stReaming) as a new cost-aware video streaming approach to provide advanced video coding (AVC)-based live streaming services in the network. In this article, we use two types of virtualized network functions (VNFs): virtual reverse proxy (VRP) and virtual transcoder function (VTF). At the edge of the network, VRPs are responsible for collecting clients’ requests and sending them to an SDN controller. Then, by executing a mixed-integer linear program (MILP), the SDN controller determines a group of optimal multicast trees for streaming the requested videos from an appropriate origin server to the VRPs. Moreover, to elevate the efficiency of resource allocation and meet the given end-to-end latency threshold, OSCAR delivers only the highest requested quality from the origin server to an optimal group of VTFs over a multicast tree. The selected VTFs then transcode the received video segments and transmit them to the requesting VRPs in a multicast fashion. To mitigate the time complexity of the proposed MILP model, we present a simple and efficient heuristic algorithm that determines a near-optimal solution in polynomial time. Using the MiniNet emulator, we evaluate the performance of OSCAR in various scenarios. The results show that OSCAR surpasses other SVC- and AVC-based multicast and unicast approaches in terms of cost and resource utilization.
|
[260] | Michal Barcis, Hermann Hellwagner, Information Distribution in Multi-Robot Systems: Adapting to Varying Communication Conditions, In 2021 Wireless Days (WD), IEEE, pp. 1-8, 2021.
[bib][url] [doi] [abstract]
Abstract: This work addresses the problem of application-layer congestion control in multi-robot systems (MRS). It is motivated by the fact that many MRS constrain the amount of transmitted data in order to avoid congestion in the network and ensure that critical messages get delivered. However, such constraints often need to be manually tuned and assume constant network capabilities. We introduce the adaptive goodput constraint, which smoothly adapts to varying communication conditions. It is suitable for long-term communication planning, where rapid changes are undesirable. We analyze the introduced method in a simulation-based study and show its practical applicability using mobile robots.
|
[259] | Michal Barcis, Agata Barcis, Nikolaos Tsiogkas, Hermann Hellwagner, Information Distribution in Multi-Robot Systems: Generic, Utility-Aware Optimization Middleware, In Frontiers in Robotics and AI, Frontiers Media (SA), vol. 8, pp. 1-11, 2021.
[bib][url] [doi] [abstract]
Abstract: This work addresses the problem of what information is worth sending in a multi-robot system under generic constraints, e.g., limited throughput or energy. Our decision method is based on Monte Carlo Tree Search. It is designed as a transparent middleware that can be integrated into existing systems to optimize communication among robots. Furthermore, we introduce techniques to reduce the decision space of this problem to further improve the performance. We evaluate our approach using a simulation study and demonstrate its feasibility in a real-world environment by realizing a proof of concept in ROS 2 on mobile robots.
|
[258] | Jesus Aguilar-Armijo, Christian Timmerer, Hermann Hellwagner, EADAS: Edge Assisted Adaptation Scheme for HTTP Adaptive Streaming, In 2021 IEEE 46th Conference on Local Computer Networks (LCN), IEEE, pp. 487-494, 2021.
[bib][url] [doi] [abstract]
Abstract: Mobile networks equipped with edge computing nodes enable access to information that can be leveraged to assist client-based adaptive bitrate (ABR) algorithms in making better adaptation decisions to improve both Quality of Experience (QoE) and fairness. For this purpose, we propose a novel on-the-fly edge mechanism, named EADAS (Edge Assisted Adaptation Scheme for HTTP Adaptive Streaming), located at the edge node that assists and improves the ABR decisions on-the-fly. EADAS proposes (i) an edge ABR algorithm to improve QoE and fairness for clients and (ii) a segment prefetching scheme. The results show a QoE increase of 4.6%, 23.5%, and 24.4% and a fairness increase of 11%, 3.4%, and 5.8% when using a buffer-based, a throughput-based, and a hybrid ABR algorithm, respectively, at the client compared with client-based algorithms without EADAS. Moreover, QoE and fairness among clients can be prioritized using parameters of the EADAS algorithm according to service providers’ requirements.
|
[257] | Venkata Phani Kumar Malladi, Christian Timmerer, Hermann Hellwagner, Mipso: Multi-Period Per-Scene Optimization For HTTP Adaptive Streaming, In 2020 IEEE International Conference on Multimedia and Expo (ICME), IEEE, pp. 1-6, 2020.
[bib][url] [doi] [abstract]
Abstract: Video delivery over the Internet has become more and more established in recent years due to the widespread use of Dynamic Adaptive Streaming over HTTP (DASH). The current DASH specification defines a hierarchical data model for Media Presentation Descriptions (MPDs) in terms of periods, adaptation sets, representations and segments. Although multi-period MPDs are widely used in live streaming scenarios, they are not fully utilized in Video-on-Demand (VoD) HTTP adaptive streaming (HAS) scenarios. In this paper, we introduce MiPSO, a framework for Multi–Period per-Scene Optimization, to examine multiple periods in VoD HAS scenarios. MiPSO provides different encoded representations of a video at either (i) maximum possible quality or (ii) minimum possible bitrate, beneficial to both service providers and subscribers. In each period, the proposed framework adjusts the video representations (resolution-bitrate pairs) by taking into account the complexities of the video content, with the aim of achieving streams at either higher qualities or lower bitrates. The experimental evaluation with a test video data set shows that the MiPSO reduces the average bitrate of streams with the same visual quality by approximately 10% or increases the visual quality of streams by at least 1 dB in terms of Peak Signal-to-Noise (PSNR) at the same bitrate compared to conventional approaches to video content delivery.
|
[256] | Christian Timmerer, Hermann Hellwagner, HTTP Adaptive Streaming: Where Is It Heading?, In Proceedings of the Brazilian Symposium on Multimedia and the Web, ACM, pp. 349-350, 2020.
[bib][url] [doi] [abstract]
Abstract: In this contribution, we present selected novel approaches and results of our research work in the ATHENA Christian Doppler Laboratory (Adaptive Streaming over HTTP and Emerging Networked Multimedia Services), a major research project at our department jointly funded by public sources and industry. By putting this work also into the context of related ongoing research activities, we aim at working out where HTTP Adaptive Streaming is currently heading.
|
[255] | Babak Taraghi, Anatoliy Zabrovskiy, Christian Timmerer, Hermann Hellwagner, Cloud-based Adaptive Video Streaming Evaluation Framework for the Automated Testing of Media Players CAdViSE, In Proceedings of the 11th ACM Multimedia Systems Conference, ACM, pp. 349-352, 2020.
[bib][url] [doi] [abstract]
Abstract: Attempting to cope with fluctuations of network conditions in terms of available bandwidth, latency and packet loss, and to deliver the highest quality of video (and audio) content to users, research on adaptive video streaming has attracted intense efforts from the research community and huge investments from technology giants. How successful these efforts and investments are, is a question that needs precise measurements of the results of those technological advancements. HTTP-based Adaptive Streaming (HAS) algorithms, which seek to improve video streaming over the Internet, introduce video bitrate adaptivity in a way that is scalable and efficient. However, how each HAS implementation takes into account the wide spectrum of variables and configuration options, brings a high complexity to the task of measuring the results and visualizing the statistics of the performance and quality of experience. In this paper, we introduce CAdViSE, our Cloud-based Adaptive Video Streaming Evaluation framework for the automated testing of adaptive media players. The paper aims to demonstrate a test environment which can be instantiated in a cloud infrastructure, examines multiple media players with different network attributes at defined points of the experiment time, and finally concludes the evaluation with visualized statistics and insights into the results.
|
[254] | Minh Nguyen, Christian Timmerer, Hermann Hellwagner, H2BR: An HTTP/2-based Retransmission Technique to Improve the QoE of Adaptive Video Streaming, In Proceedings of the 25th ACM Workshop on Packet Video, ACM, pp. 1-7, 2020.
[bib][url] [doi] [abstract]
Abstract: HTTP-based Adaptive Streaming (HAS) plays a key role in over-the-top video streaming. It contributes towards reducing the rebuffering duration of video playout by adapting the video quality to the current network conditions. However, it incurs variations of video quality in a streaming session because of the throughput fluctuation, which impacts the user’s Quality of Experience (QoE). Besides, many adaptive bitrate (ABR) algorithms choose the lowest-quality segments at the beginning of the streaming session to ramp up the playout buffer as soon as possible. Although this strategy decreases the startup time, the users can be annoyed as they have to watch a low-quality video initially. In this paper, we propose an efficient retransmission technique, namely H2BR, to replace low-quality segments being stored in the playout buffer with higher-quality versions by using features of HTTP/2 including (i) stream priority, (ii) server push, and (iii) stream termination. The experimental results show that H2BR helps users avoid watching low video quality during video playback and improves the user’s QoE. H2BR can decrease by up to more than 70% the time when the users suffer the lowest-quality video as well as benefits the QoE by up to 13%.
|
[253] | Minh Nguyen, Hadi Amirpour, Christian Timmerer, Hermann Hellwagner, Scalable High Efficiency Video Coding based HTTP Adaptive Streaming over QUIC, In Proceedings of the Workshop on the Evolution, Performance, and Interoperability of QUIC, ACM, pp. 28-34, 2020.
[bib][url] [doi] [abstract]
Abstract: HTTP/2 has been explored widely for adaptive video streaming, but still suffers from Head-of-Line blocking, and three-way handshake delay due to TCP. Meanwhile, QUIC running on top of UDP can tackle these issues. In addition, although many adaptive bitrate (ABR) algorithms have been proposed for scalable and non-scalable video streaming, the literature lacks an algorithm designed for both types of video streaming approaches. In this paper, we investigate the impact of QUIC and HTTP/2 on the performance of ABR algorithms. Moreover, we propose an efficient approach for utilizing scalable video coding formats for adaptive video streaming that combines a traditional video streaming approach (based on non-scalable video coding formats) and a retransmission technique. The experimental results show that QUIC benefits significantly from our proposed method in the context of packet loss and retransmission. Compared to HTTP/2, it improves the average video quality and provides a smoother adaptation behavior. Finally, we demonstrate that our proposed method originally designed for non-scalable video codecs also works efficiently for scalable videos such as Scalable High Efficiency Video Coding (SHVC).
|
[252] | Mohamed Ayoub Messous, Hermann Hellwagner, Sidi-Mohammed Senouci, Driton Emini, Dominik Schnieders, Edge Computing for Visual Navigation and Mapping in a UAV Network, In ICC 2020 - 2020 IEEE International Conference on Communications (ICC), IEEE, pp. 1-6, 2020.
[bib][url] [doi] [abstract]
Abstract: This research work presents conceptual considerations and quantitative evaluations into how integrating computation offloading to edge computing servers would offer a paradigm shift for an effective deployment of autonomous drones. The specific mission that has been considered is collaborative autonomous navigation and mapping in a 3D environment of a small drone network. Specifically, in order to achieve this mission, each drone is required to compute a low latency, highly compute intensive task in a timely manner. The proposed model decides for each task, while considering the impact on performance and mission requirements, whether to (i) compute locally, (ii) offload to the edge server, or (iii) to the ground station. Extensive simulation work was performed to assess the effectiveness of the proposed scheme compared to other models.
|
[251] | Petra Mazdin, Michal Barcis, Hermann Hellwagner, Bernhard Rinner, Distributed Task Assignment in Multi-Robot Systems based on Information Utility, In 2020 IEEE 16th International Conference on Automation Science and Engineering (CASE), IEEE, pp. 734-740, 2020.
[bib][url] [doi] [abstract]
Abstract: Most multi-robot systems (MRS) require to coordinate the assignment of tasks to individual robots for efficient missions. Due to the dynamics, incomplete knowledge and changing requirements, the robots need to distribute their local state information within the MRS continuously during the mission. Since communication resources are limited and message transfers may be erroneous, the global state estimated by each robot may become inconsistent. This inconsistency may lead to degraded task assignment and mission performance. In this paper, we explore the effect and cost of communication and exploit information utility for online distributed task assignment. In particular, we model the usefulness of the transferred state information by its information utility and use it for controlling the distribution of local state information and for updating the global state. We compare our distributed, utility-based online task assignment with well-known centralized and auction-based methods and show how substantial reduction of communication effort still leads to successful mission completion. We demonstrate our approach in a wireless communication testbed using ROS2.
|
[250] | Alireza Erfanian, Farzad Tashtarian, Reza Farahani, Christian Timmerer, Hermann Hellwagner, On Optimizing Resource Utilization in AVC-based Real-time Video Streaming, In 2020 6th IEEE Conference on Network Softwarization (NetSoft), IEEE, pp. 301-309, 2020.
[bib][url] [doi] [abstract]
Abstract: Real-time video streaming traffic and related applications have witnessed significant growth in recent years. However, this has been accompanied by some challenging issues, predominantly resource utilization. IP multicasting, as a solution to this problem, suffers from many problems. Using scalable video coding could not gain wide adoption in the industry, due to reduced compression efficiency and additional computational complexity. The emerging software-defined networking (SDN)and network function virtualization (NFV) paradigms enable re-searchers to cope with IP multicasting issues in novel ways. In this paper, by leveraging the SDN and NFV concepts, we introduce a cost-aware approach to provide advanced video coding (AVC)-based real-time video streaming services in the network. In this study, we use two types of virtualized network functions (VNFs): virtual reverse proxy (VRP) and virtual transcoder (VTF)functions. At the edge of the network, VRPs are responsible for collecting clients’ requests and sending them to an SDN controller. Then, executing a mixed-integer linear program (MILP) determines an optimal multicast tree from an appropriate set of video source servers to the optimal group of transcoders. The desired video is sent over the multicast tree. The VTFs transcode the received video segments and stream to the requested VRPs over unicast paths. To mitigate the time complexity of the proposed MILPmodel, we propose a heuristic algorithm that determines a near-optimal solution in a reasonable amount of time. Using theMiniNet emulator, we evaluate the proposed approach and show it achieves better performance in terms of cost and resource utilization in comparison with traditional multicast and unicast approaches.
|
[249] | Michal Barcis, Agata Barcis, Hermann Hellwagner, Information Distribution in Multi-Robot Systems: Utility-Based Evaluation Model, In Sensors, MDPI AG, vol. 20, no. 3, 2020.
[bib][url] [doi] [abstract]
Abstract: This work addresses the problem of information distribution in multi-robot systems, with an emphasis on multi-UAV (unmanned aerial vehicle) applications. We present an analytical model that helps evaluate and compare different information distribution schemes in a robotic mission. It serves as a unified framework to represent the usefulness (utility) of each message exchanged by the robots. It can be used either on its own in order to assess the information distribution efficacy or as a building block of solutions aimed at optimizing information distribution. Moreover, we present multiple examples of instantiating the model for specific missions. They illustrate various approaches to defining the utility of different information types. Finally, we introduce a proof of concept showing the applicability of the model in a robotic system by implementing it in Robot Operating System 2 (ROS 2) and performing a simple simulated mission using a network emulator. We believe the introduced model can serve as a basis for further research on generic solutions for assessing or optimizing information distribution.
|