A Novel Dynamic Multi-source Multi-sink Flow Algorithm over the Satellite Networks

2019 
The multi-source multi-sink maximum flow problem can be of great significance in guiding network optimization, service scheduling, and capacity analysis. With intermittent connectivity and time-dependence characteristics of satellite networks, the existing flow algorithms for multi-source multi-sink without temporal dimension involvement can no longer maintain high efficiency in satellite networks. To overcome the problem, we propose a novel dynamic multi-source multi-sink flow algorithm. Specially, the storage time-aggregated graph (STAG) is adopted to depict the time-varying properties of satellite networks. Then, a novel dynamic multi-source multi-sink flow (DMMF) algorithm is proposed to enhance the satellite networks’ resource utilization. At last, the simulation is conducted, and the results with obvious network performance gain verifies our proposed DMMF algorithm.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    8
    References
    2
    Citations
    NaN
    KQI
    []