Resource-constrained maximum network throughput on space networks  

作　　者：Yanling Xing Ning Ge Youzheng Wang 

机构地区：[1]Department of Electronic Engineering, Tsinghua University [2]Research Institute of Tsinghua University in Shenzhen [3]Department of Aeronautics and Astronautics Engineering, Tsinghua University

出　　处：《Journal of Systems Engineering and Electronics》2015年第2期215-223,共9页系统工程与电子技术（英文版）

基　　金：supported by the National Natural Sciences Foundation of China(61132002;61321061;61231011;61201183);the National Basic Research Program of China(2014CB340206);the Tsinghua University Initiative Scientific Research Program(2011Z05117)

摘　　要：This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.

关 键 词：throughput disruption-tolerant networking(DTN) maximum flow mixed-integer linear programming evolving graph space network 

分 类 号：TN915.0[电子电信—通信与信息系统]