Abstract
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.
Supported by organization x.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Borradaile, G., Klein, P.N., Mozes, S., Nussbaum, Y., Wulff-Nilsen, C.: Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 170–179, October 2011. https://doi.org/10.1109/FOCS.2011.73
Borradaile, G.: Planar maximum flow: multiple-source multiple-sink maximum flow in directed planar graphs (2015)
Caini, C., Cruickshank, H., Farrell, S., Marchese, M.: Delay- and disruption-tolerant networking (DTN): an alternative solution for future satellite networking applications. Proc. IEEE 99(11), 1980–1997 (2011)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Goldberg, A.V., Tarjan, R.E.: Efficient maximum flow algorithms. Commun. ACM 57(8), 82–89 (2014)
Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: efficient algorithms and complexity. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 397–409. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45061-0_33
Li, H., Zhang, T., Zhang, Y., Wang, K., Li, J.: A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks. Ad Hoc Netw. 59, 63–70 (2017)
Wang, P., Zhang, X., Zhang, S., Li, H., Zhang, T.: Time-expanded graph based resource allocation over the satellite networks. IEEE Wirel. Commun. Lett. 1 (2018). https://doi.org/10.1109/LWC.2018.2872996
Zhang, T., Li, H., Li, J., Zhang, S., Shen, H.: A dynamic combined flow algorithm for the two-commodity max-flow problem over the delay tolerant networks. IEEE Trans. Wirel. Commun. 1 (2018). https://doi.org/10.1109/TWC.2018.2872551
Acknowledgments
This work is supported by the National Natural Science Foundation of China (61871456, 91638202, 61401326, 61571351), the National Key Research and Development Program of China (2016YFB0501004), the National S&T Major Project (2015ZX03002006), the 111 Project (B08038), Natural Science Basic Research Plan in Shaanxi Province of China (2016JQ6054).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Wang, P., Li, H., Zhang, T., Zhang, S., Shi, K. (2019). A Novel Dynamic Multi-source Multi-sink Flow Algorithm over the Satellite Networks. In: Jia, M., Guo, Q., Meng, W. (eds) Wireless and Satellite Systems. WiSATS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 280. Springer, Cham. https://doi.org/10.1007/978-3-030-19153-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-19153-5_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19152-8
Online ISBN: 978-3-030-19153-5
eBook Packages: Computer ScienceComputer Science (R0)