scholarly journals A Multi-Commodity Flow Problem for Fair Resource Allocation in Multi-Path Video Delivery Networks

2020 ◽  
Vol 53 (2) ◽  
pp. 7386-7391
Author(s):  
Luca De Cicco ◽  
Gioacchino Manfredi ◽  
Vittorio Palmisano ◽  
Saverio Mascolo
1992 ◽  
Vol 11 (3) ◽  
pp. 135-139 ◽  
Author(s):  
Frieda Granot ◽  
Michal Penn

Author(s):  
Hang Ma ◽  
Glenn Wagner ◽  
Ariel Felner ◽  
Jiaoyang Li ◽  
T. K. Satish Kumar ◽  
...  

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms. Our empirical results demonstrate that these MAPF-DL solvers scale well and each one dominates the other ones in different scenarios.


2021 ◽  
Vol 13 (11) ◽  
pp. 278
Author(s):  
Jesús Fernando Cevallos Moreno ◽  
Rebecca Sattler ◽  
Raúl P. Caulier Cisterna ◽  
Lorenzo Ricciardi Celsi ◽  
Aminael Sánchez Rodríguez ◽  
...  

Video delivery is exploiting 5G networks to enable higher server consolidation and deployment flexibility. Performance optimization is also a key target in such network systems. We present a multi-objective optimization framework for service function chain deployment in the particular context of Live-Streaming in virtualized content delivery networks using deep reinforcement learning. We use an Enhanced Exploration, Dense-reward mechanism over a Dueling Double Deep Q Network (E2-D4QN). Our model assumes to use network function virtualization at the container level. We carefully model processing times as a function of current resource utilization in data ingestion and streaming processes. We assess the performance of our algorithm under bounded network resource conditions to build a safe exploration strategy that enables the market entry of new bounded-budget vCDN players. Trace-driven simulations with real-world data reveal that our approach is the only one to adapt to the complexity of the particular context of Live-Video delivery concerning the state-of-art algorithms designed for general-case service function chain deployment. In particular, our simulation test revealed a substantial QoS/QoE performance improvement in terms of session acceptance ratio against the compared algorithms while keeping operational costs within proper bounds.


2018 ◽  
Vol 66 ◽  
pp. 332-341 ◽  
Author(s):  
Qilin Fan ◽  
Hao Yin ◽  
Geyong Min ◽  
Po Yang ◽  
Yan Luo ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document