Skip to main content

Routing Optimization of Small Satellite Networks Based on Multi-commodity Flow

  • Conference paper
  • First Online:

Abstract

As the scale of small satellite network is not large and the transmission cost is high, it is necessary to optimize the routing problem. We apply the traditional time-expanded graph to model the data acquisition of small satellite network so that we can formulate the data acquisition into a multi-commodity concurrent flow optimization problem (MCFP) aiming at maximizing the throughput. We use an approximation method to accelerate the solution for MCFP and make global optimization of routing between satellite network nodes. After the quantitative comparison between our MCFP algorithm and general augmented path maximum flow algorithm and exploring the detail of the algorithm, we verify the approximation algorithm’s reasonable selection of routing optimization in small satellite network node communication.

Y. Zhang—Foundation Item: Science and Technology on Communication Networks Laboratory Foundation Project; Aerospace Field Pre-research Foundation Project (060501).

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Jakhu, R.S., Pelton, J.N.: Small Satellites and Their Regulation. Springer, New York (2014). https://doi.org/10.1007/978-1-4614-9423-2

    Book  Google Scholar 

  2. Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)

    MATH  Google Scholar 

  3. Liu, R., Sheng, M., Lui, K.-S., Wang, X., Wang, Y., Zhou, D.: An analytical framework for resource-limited small satellite networks. IEEE Commun. Lett. 20(2), 388–391 (2016)

    Article  Google Scholar 

  4. Even, S., Itai, A., Shamir, A.: On the complexity of time table and multi-commodity flow problems. In: 16th Annual Symposium on Foundations of Computer Science, 1975, pp. 184–193. IEEE (1975)

    Google Scholar 

  5. Iri, M.: On an extension of the maximum-flow minimum-cut theorem to multicommodity flows. J. Oper. Res. Soc. Jpn 13(3), 129–135 (1971)

    MathSciNet  MATH  Google Scholar 

  6. Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM (JACM) 37(2), 318–334 (1990)

    Article  MathSciNet  Google Scholar 

  7. Young, N.E.: Randomized rounding without solving the linear program. In SODA, vol. 95, pp. 170–178 (1995)

    Google Scholar 

  8. Garg, N., Koenemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630–652 (2007)

    Article  MathSciNet  Google Scholar 

  9. Fleischer, L.K.: Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discrete Math. 13(4), 505–520 (2000)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yu Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xu, X., Zhang, Y., Lu, J. (2018). Routing Optimization of Small Satellite Networks Based on Multi-commodity Flow. In: Gu, X., Liu, G., Li, B. (eds) Machine Learning and Intelligent Communications. MLICOM 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 226. Springer, Cham. https://doi.org/10.1007/978-3-319-73564-1_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73564-1_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73563-4

  • Online ISBN: 978-3-319-73564-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics