amsys 17(15): e2

Research Article

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

Download893 downloads
Cite
BibTeX Plain Text
  • @ARTICLE{10.4108/eai.8-12-2017.153459,
    author={Xiaolin Xu and Yu Zhang and Jihua Lu},
    title={Routing Optimization of Small Satellite Networks based on Multi-commodity Flow},
    journal={EAI Endorsed Transactions on Ambient Systems},
    volume={4},
    number={15},
    publisher={EAI},
    journal_a={AMSYS},
    year={2017},
    month={12},
    keywords={satellite network, multi-commodity flow, routing optimization, approximation algorithm, concurrent flow.},
    doi={10.4108/eai.8-12-2017.153459}
}
  • Xiaolin Xu
    Yu Zhang
    Jihua Lu
    Year: 2017
    Routing Optimization of Small Satellite Networks based on Multi-commodity Flow
    AMSYS
    EAI
    DOI: 10.4108/eai.8-12-2017.153459
Xiaolin Xu1, Yu Zhang2,3,4,*, Jihua Lu1
  • 1: Beijing Institute of Technology, No.5 YardZhong Guan Cun South Street, Haidian District, Beijing
  • 2: Beijing Institute of Technology; The Science and Technology on Information Transmission and Dissemination in
  • 3: Communication Networks Laboratory, the 54th Research Institute of China Electronics Technology Group Corporation,
  • 4: No.5 YardZhong Guan Cun South Street, Haidian District, Beijing
*Contact email: yuzhang@bit.edu.cn

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.

Keywords
satellite network, multi-commodity flow, routing optimization, approximation algorithm, concurrent flow.
Received
2017-08-19
Accepted
2017-10-23
Published
2017-12-08
Publisher
EAI
http://dx.doi.org/10.4108/eai.8-12-2017.153459

Copyright © 2017 Xiaolin Xu et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.