Application of Time-Varying Graph Theory over the Space Information Networks

被引:41
|
作者
Zhang, Tao [1 ]
Li, Jiandong [2 ]
Li, Hongyan [3 ]
Zhang, Shun [3 ]
Wang, Peng [3 ]
Shen, Haiying [4 ]
机构
[1] Xidian Univ, Inst Informat & Sci, State Key Lab Integrated Serv Networks, Xian, Peoples R China
[2] Xidian Univ, Xian, Peoples R China
[3] Xidian Univ, State Key Lab Integrated Serv Networks, Xian, Peoples R China
[4] Univ Virginia, Dept Comp Sci, Charlottesville, VA 22903 USA
来源
IEEE NETWORK | 2020年 / 34卷 / 02期
基金
中国国家自然科学基金;
关键词
Routing; Dynamic scheduling; Satellites; Network slicing; Quality of service; Orbits; VIRTUALIZATION;
D O I
10.1109/MNET.001.1900245
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
SIN is constructed to support real-time data acquisition, massive data transmission and processing, and systematized information services. Different from static networks, both the network topologies and the available network resources are dynamic in SIN. However, the existing networking technologies treat SIN as segmented static networks, and ignore the relationship among different segmented subnetworks, which results in low resource utilization and poor transmission QoS. This article exploits the time-varying graph theory to characterize and allocate the dynamic resources of SIN. We first introduce the overall SIN architecture, and discuss its key technologies in terms of network slicing and dynamic routing. Then, we construct a novel STAG to precisely depict the multi-dimensional time-varying resources and reveal their connection relationships in SIN. With STAG, we propose the dynamic network slicing strategy to build the dedicated network slices for different services, and design the intra-slice routing scheme to guarantee the service transmission QoS. Simulation results demonstrate our methods can complete more space missions with higher resource utilization. Finally, we discuss the promising future of the time-varying graph theory.
引用
收藏
页码:179 / 185
页数:7
相关论文
共 50 条
  • [41] Survivability in Time-Varying Networks
    Liang, Qingkai
    Modiano, Eytan
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2017, 16 (09) : 2668 - 2681
  • [42] Locations on time-varying networks
    Hakimi, SL
    Labbé, M
    Schmeichel, EF
    NETWORKS, 1999, 34 (04) : 250 - 257
  • [43] Survivability in Time-varying Networks
    Liang, Qingkai
    Modiano, Eytan
    IEEE INFOCOM 2016 - THE 35TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, 2016,
  • [44] ESTIMATING TIME-VARYING NETWORKS
    Kolar, Mladen
    Song, Le
    Ahmed, Amr
    Xing, Eric P.
    ANNALS OF APPLIED STATISTICS, 2010, 4 (01): : 94 - 123
  • [45] TIME-VARYING NEURAL NETWORKS
    WALDRON, MB
    PROCEEDINGS OF THE ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY, PTS 1-4, 1988, : 1933 - 1933
  • [46] On the application of competitive neural networks to time-varying clustering problems
    Gonzalez, AI
    Grana, M
    DAnjou, A
    Cottrell, M
    SPATIOTEMPORAL MODELS IN BIOLOGICAL AND ARTIFICIAL SYSTEMS, 1997, 37 : 49 - 56
  • [47] Flows over time in time-varying networks: Optimality conditions and strong duality
    Koch, Ronald
    Nasrabadi, Ebrahim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 237 (02) : 580 - 589
  • [48] Synchronization on Time-Varying Networks
    Li, Meng
    Jiang, Xin
    Ma, Li-li
    Ma, Yi-fang
    Shen, Xin
    Guo, Quan-tong
    Zheng, Zhi-ming
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND SOFTWARE ENGINEERING (AISE 2014), 2014, : 566 - 571
  • [49] On the exploration of time-varying networks
    Flocchini, Paola
    Mans, Bernard
    Santoro, Nicola
    THEORETICAL COMPUTER SCIENCE, 2013, 469 : 53 - 68
  • [50] A theory of time-varying constants
    Belinchón, JA
    Alfonso-Faus, A
    INTERNATIONAL JOURNAL OF MODERN PHYSICS D, 2001, 10 (03): : 299 - 309