|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | Service-Driven Coded Forward Scheme Based on Streaming Transmission Model for Lunar Space Communication Networks显示文摘With the rapid development of lunar exploration,a large amount of scientific data and media stream service needs to be transmitted through Lunar Space Communication Networks(LSCNs).Due to limited transmitter power and intermittent,long delay and packet loss connections,the reliable and efficient multi-priority services’transmission in LSCNs becomes an urgent problem.Firstly,we propose a Streaming Transmission Model(STM)based on temporal and spatial topology graph to describe the delay and energy consumption for data transmission in LSCNs.Then,we further devise a Coded Forward Scheme based on STM,termed CFS-STM,to achieve multi-priority service in two steps:i).Link Stability Function(LSF)is established by solving an optimization problem to choose the appropriate single-hop path.ii).Raptor code is employed to further save delay and energy with adjustable code-rate according to the different channel conditions.Experiment results show that,CFS-STM can significantly improve the transmission efficiency of multi-service priority streaming delivery in LSCNs. | Shushi Gu Ye Wang Guoqing Chen Shuo Shi | 2020 | China Communications2020，17，7： | 1 |
| 2 | Scalable local reconstruction code design for hot data reads in cloud storage systems显示文摘Since demand for data is significantly heterogeneous in cloud storage systems(CSSs),there is traffic congestion in nodes storing hot data.In erasure-coded CSSs,traffic congestion can be alleviated by degraded reads sacrificing the bandwidth of surviving nodes.Local reconstruction codes(LRCs)reduce the bandwidth consumption of degraded reads,but cannot provide skewed throughput gain for the hot data.In this paper,we propose a scalable local reconstruction code(SLRC)that relies on LRCs but is more flexible in improving the throughput of a specific data block.First,we develop the local maximum throughput(LMT)to measure the maximum throughput of the hot data blocks by analyzing the actual read arrival rate of LRCs.Further,we elaborate on the structure of SLRC and analyze their performance metrics,which include storage overhead,reconstruction cost,and LMT.To select the appropriate code,we present the minimum reconstruction cost,minimum storage overhead,and minimum penalty algorithms.Finally,we implement extensive experiments on several typical SLRCs on the Hadoop distributed file system.Higher LMT and lower bandwidth consumption can be provided by SLRCs for hot data block degraded reads in CSSs compared with RS codes and LRCs. | Zhikai ZHANG Shushi GU Qinyu ZHANG | 2022 | Science China(Information Sciences)2022，65，12： | 1 |
| 3 | A NOVEL APPROACH OF LIMITED-RANDOMNESS FOUNTAIN CODES IN DEEP SPACE COMMUNICATION显示文摘Digital fountain is applied into deep space communication for its rateless and non-feedback forward error correction.However,the long code length and encoding overhead are confined factors to guarantee a considerable recovery probability as power and buffer-limited equipment in deep space environment.At the same time,the typical fountain decoding is sub-optimum decoding algorithm.We propose a new approach,Dependent Sequences Compensation Algorithm(DSCA),to improve the encoding efficiency by restricting the randomness in fountain encoding.While decoding algorithm is also optimized by redundant information in stopping set.The results show that the optimized method can obtain a 10-4 decoding failure rate with overhead under 0.20 for code length 500,which indicates the usefulness of the proposed approach in deep space communication. | Gu Shushi Zhang Qinyu Jiao Jian | 2011 | Journal of Electronics(China)2011，28，2： | 1 |
| 4 | Multi-objective network optimization combining topology and routing algorithms in multi-layered satellite networks显示文摘In satellite communication studies, the multi-layered satellite network (MLSN) can take advan-tage of both wide coverage and low time delay.Furthermore, the issue of stable networking anddynamic reconstructing methods is still worth ex-ploring. However, current studies rarely involvethe combination of the routing algorithm and thenetwork topology. | Zhuoming LI Huiyun XIA Yu ZHANG Junqing QI Shaohua WU Shushi GU | 2018 | Science China(Information Sciences)2018，61，8： | 0 |
| 5 | Layered Coded Cache Placement and Cooperative Delivery with Sharing Links in Satellite-Terrestrial Integrated Networks显示文摘Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances. | Gu Shushi Chen Zihan Wu Yaonan Zhang Qinyu Wang Ye | 2024 | China Communications2024，21，3： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员