Satellite Network Architecture Research Articles

Democratizing LEO Satellite Network Measurement

Low Earth Orbit (LEO) satellite networks are quickly gaining traction with promises of impressively low latency, high bandwidth, and global reach. However, the research community knows relatively little about their operation and performance in practice. The obscurity is largely due to the high barrier of entry for measuring LEO networks, which requires deploying specialized hardware or recruiting large numbers of satellite Internet customers. In this paper, we introduce HitchHiking, a methodology that democratizes global visibility into LEO satellite networks. HitchHiking builds on the observation that Internet-exposed services that use LEO Internet can reveal satellite network architecture and performance, bypassing the need for specialized hardware. We evaluate HitchHiking against ground truth measurements and prior methods, showing that it provides more coverage and accuracy. With HitchHiking, we complete the largest study to date of Starlink network latency, measuring over 2,400~users across 27~countries. We uncover unexpected patterns in latency that surface how LEO routing is more complex than previously understood. Finally, we conclude with recommendations for future research on LEO networks.

Game theory-based switch migration strategy for satellite networks

Software-Defined Networking (SDN) separates the control plane and data plane of the network, abstracting the underlying infrastructure of applications and network services and handing it over to the SDN controller for unified management. The introduction of SDN technology into satellite networks effectively addresses control challenges posed by dynamic topologies and intermittent inter-satellite links. Due to factors such as geography and usage patterns, the distribution of remote sensing data traffic is uneven in both space and time. Some remote sensing satellites may acquire large volumes of data within a short period and transmit them back to the ground through intermediate nodes, leading to a sudden surge in load on certain controllers. This situation adversely impacts the performance of remote sensing data transmission. To mitigate this, switch migration operations are required to alleviate the load on overloaded controllers and to achieve the load balance among all controllers. In this paper, a switch migration scheme based on game theory is proposed under a three-layer satellite network architecture, which is designed based on the management costs and ensures timely triggering of the migration operations. Moreover, a game theory-based matching optimization model is formulated in the scheme to address the matching problem between target controllers and migration candidate switches. We further propose a distributed algorithm to seek the Nash equilibrium within the game. Experimental results demonstrate that, compared to other relevant algorithms, this approach can find the near-optimal matching strategy for each target controller and reduce the average latency of these controllers.

Democratizing LEO Satellite Network Measurement

Low Earth Orbit (LEO) satellite networks are quickly gaining traction with promises of impressively low latency, high bandwidth, and global reach. However, the research community knows relatively little about their operation and performance in practice. The obscurity is largely due to the high barrier of entry for measuring LEO networks, which requires deploying specialized hardware or recruiting large numbers of satellite Internet customers. In this paper, we introduce HitchHiking, a methodology that democratizes global visibility into LEO satellite networks. HitchHiking builds on the observation that Internet-exposed services that use LEO Internet can reveal satellite network architecture and performance, bypassing the need for specialized hardware. We evaluate HitchHiking against ground truth measurements and prior methods, showing that it provides more coverage and accuracy. With HitchHiking, we complete the largest study to date of Starlink network latency, measuring over 2,400 users across 27 countries. We uncover unexpected patterns in latency that surface how LEO routing is more complex than previously understood. Finally, we conclude with recommendations for future research on LEO networks.

Research on Multi-DAG Satellite Network Task Scheduling Algorithm Based on Cache-Composite Priority

The problem of multiple DAGs sharing satellite constellation resources has gradually attracted widespread attention. Due to the limited computing resources and energy consumption of satellite networks, it is necessary to formulate a reasonable multi-DAG task scheduling scheme to ensure the fairness of each workflow under the premise of considering latency and energy consumption. Therefore, in this paper, we propose a multi-DAG satellite network task scheduling algorithm based on cache-composite priority under the Software-Defined Networking satellite network architecture. The basic idea of this algorithm lies in the DAG selection phase, where not only are task priorities computed but also the concept of fair scheduling is introduced, so as to prevent the excessively delayed scheduling of low-priority DAG tasks. In addition, the concept of public subtasks is introduced to reduce the system overhead caused by repetitive tasks. The experimental results show that the hybrid scheduling strategy proposed in this paper can meet the demand of DAG scheduling and improve the degree of task completion while effectively reducing the task latency and energy consumption.

Optical satellite network architecture [Invited Tutorial

This paper addresses the architecture of optical satellite networks from the physical to the transport and application layers. New frontiers exist for much more research before an efficient architecture can be constructed. Optical wireless networks have the potential to serve space–space, space–terrestrial/aircraft, and aircraft–aircraft data centers and metropolitan area networks. Though the technology in these applications is similar in nature, the architecture constructs and protocol tuning can be very different. Free-space optical networks have two attributes that are not encountered in fiber networks and those are their ability to connect without predeployment of infrastructures and the ability to reconfigure their connection topology by beam steering in time scales of milliseconds to seconds to adapt to traffic loads (as high as Tbps per connection), satellite and mobile platform movements, switching node states, and atmospheric conditions. This paper emphasizes a multi-layer approach to optical wireless networks and how the network architecture can be tuned to specific applications.

A remote sensing data transmission strategy based on the combination of satellite-ground link and GEO relay under dynamic topology

The low earth orbit (LEO) remote sensing satellite has a short communication time with the earth station (ES), and a large amount of remote sensing data cannot be transmitted back to the ES in time using the LEO-ES link during the communication period. Using relay satellites can indirectly increase the amount of data transmitted back from LEO. In this paper, we combine LEO- ES link and relay satellite offloading to study the problem of maximizing the amount of data transmitted back from LEO remote sensing satellites. Most of the existing methods do not consider the effect of topology change on policy. In this paper, we consider a three-layer satellite network architecture of geostationary earth orbit (GEO), LEO remote sensing satellite, and ES. We studied the problem of maximizing the amount of LEO transmitted back data under dynamic topology between layers, and proposed a transmission strategy based on a combination of LEO-ES link and GEO offload under dynamic topology. First, in order to reduce the number of link interruptions in each time slot, a Non-Uniform Time Slot Division Method (NUTSDM) based on visible relationships between layers is proposed based on discrete-time points, which helps to accurately determine the number and identity of LEOs competing under each time slot. Second, the relationship among GEOs, LEOs, and network administrators is modeled as a Stackelberg game model, and a Two-way Bargaining Game Scheme under Dynamic Topology (TWBGS-DT) is proposed to maximize the amount of data transmitted back from space. Compared with the existing methods, the experimental results confirm the effectiveness of the proposed scheme in terms of algorithm convergence speed, terms of pricing, GEO cache space allocation, and increase the data volume of LEO transmissions back by 11.5% and 8.2 times relative to the ISL-Aided strategy and GAA-FARR strategy, respectively.

Multi-Layer Network Security Architecture

This month is the last of four installments on multi-layer network architectures. We talked about the need for satellite, fiber and wireless network architectures to include all layers in its designs. When they are integrated together to form one Internet, issues on internetworking appear at all layers including the Application Layer. All the more critical are network architectures with coherent multi-layer designs. This last piece addresses network security and resiliency and the need for a multi-layer approach to an effective design.

Multi-QoS adaptive routing algorithm based on SDN for satellite network

With the development of communication services, satellite network services have developed from the traditional single type of services to multiple types of services. Different types of services need to meet different Quality of Service (QoS) requirements. The traditional satellite network algorithm does not distinguish the services, so the high QoS service in the network cannot get timely service. However, the architecture of Software Defined Satellite Networking (SDSN) can solve this problem well. The controller in the SDSN has a global view and can obtain the node and link information of LEO satellites. Therefore, the SDSN can more effectively meet the demand of data service for QoS. In this paper, a satellite network architecture based on Software Defined Networking (SDN) is firstly established. Then an adaptive routing algorithm that can meet various QoS requirements is proposed. The final simulation results show that compared with SDRA algorithm and Dijkstra algorithm, this optimization algorithm has better performance in QoS satisfaction rate and bandwidth utilization.

Routing algorithm design of satellite network architecture based on SDN and ICN

SummaryIn view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space‐terrestrial network, in the paper, we propose a satellite network architecture called software‐defined information centric satellite networking (SDICSN) based on software‐defined networking (SDN) and information‐centric networking (ICN), and we design a virtual node matrix routing algorithm (VNMR) under the SDICSN architecture. The SDICSN architecture realizes the flexibility of network management and business deployment through the features of the separation of forwarding and controlling by the SDN architecture and improves the response speed of requests in the network by the centric of “content” as the ICN idea. According to the periodicity and predictability of the satellite network, the VNMR algorithm obtains the routing matrix through the relative orientation of the source and destination nodes, thus reducing the spatial complexity of the input matrix of the Dijkstra algorithm and then reducing the time complexity of the routing algorithm. For forwarding information base (FIB), the mechanism of combination of event driven and polling can be quickly updated in real time. Finally, the advantages of the SDICSN architecture in routing efficiency, request delay, and request aggregation are verified by simulation.

A Satellite Handover Strategy Based on the Potential Game in LEO Satellite Networks

In a low earth orbit (LEO) satellite network, handover management across satellite spot beams needs to be addressed to decrease handover times while using network resources efficiently since the speed of LEO satellites is much higher than that of mobile nodes. In this paper, we propose a novel satellite handover strategy based on the potential game for mobile terminals in a LEO satellite communication network. To continue communication with the counterpart, the user has to switch among the covered LEO satellites. In a software-defined satellite network (SDSN) architecture, the satellite handover can be viewed as a bipartite graph. To balance the satellite network workload, we propose a terminal random-access algorithm based on the target of userspace maximization. The simulated handover conducted on a typical LEO satellite network, Iridium, corroborates the effectiveness of the proposed handover strategy.

The impact of delay in software-defined integrated terrestrial-satellite networks

Satellite communication networks have been evolving from standalone networks with ad-hoc infrastructures to possibly interconnected portions of a wider Future Internet architecture. Experts belonging to the fifth-generation (5G) standardization committees are considering satellites as a technology to integrate in the 5G environment. Software Defined Networking (SDN) is one of the paradigms of the next generation of mobile and fixed communications. It can be employed to perform different control functionalities, such as routing, because it allows traffic flow identification based on different parameters and traffic flow management in a centralized way. A centralized set of controllers makes the decisions and sends the corresponding forwarding rules for each traffic flow to the involved intermediate nodes that practically forward data up to the destination. The time to perform this process in integrated terrestrial-satellite networks could be not negligible due to satellite link delays. The aim of this paper is to introduce an SDN-based terrestrial satellite network architecture and to estimate the mean time to deliver the data of a new traffic flow from the source to the destination including the time required to transfer SDN control actions. The practical effect is to identify the maximum performance than can be expected.

Network coding‐based multi‐path routing algorithm in two‐layered satellite networks

Satellite networks are capable of contenting a variety of data transmission needs of users in geographically diverse locations throughout the world. Multi-layered satellite networks (MLSNs) can construct efficient communications networks due to their extensive coverage and high network capacity. However, throughput degradation and severe end-to-end delay could occur in MLSNs because of the traffic congestion. To resolve these problems, the authors first propose a novel MEO/LEO satellite network architecture that construct effective inter-satellite links. Then the authors present a network coding-based multi-path routing algorithm to deliver traffic through the hybrid satellite network. The analysis of characteristics of the proposed scheme are addressed by performance evaluations in simulation.

Fast Recovery Routing Algorithm for Software Defined Network based Operationally Responsive Space Satellite Networks

An emerging satellite technology, Operationally Responsive Space (ORS) is expected to provide a fast and flexible solution for emergency response, such as target tracking, dense earth observation, communicate relaying and so on. To realize large distance transmission, we propose the use of available relay satellites as relay nodes. Accordingly, we apply software defined network (SDN) technology to ORS networks. We additionally propose a satellite network architecture refered to as the SDN-based ORS-Satellite (Sat) networking scheme (SDOS). To overcome the issures of node failures and dynamic topology changes of satellite networks, we combine centralized and distributed routing mechanisms and propose a fast recovery routing algorithm (FRA) for SDOS. In this routing method, we use centralized routing as the base mode.The distributed opportunistic routing starts when node failures or congestion occur. The performance of the proposed routing method was validated through extensive computer simulations.The results demonstrate that the method is effective in terms of resoving low end-to-end delay, jitter and packet drops.

Cooperative and cognitive satellite systems

Cooperative and Cognitive Satellite Systems provides a solid overview of the current research in the field of cooperative and cognitive satellite systems, helping users understand how to incorporate state-of-the-art communication techniques in innovative satellite network architectures to enable the next generation of satellite systems. The book is edited and written by top researchers and practitioners in the field, providing a comprehensive explanation of current research that allows users to discover future technologies and their applications, integrate satellite and terrestrial systems and services to create innovative network architectures, understand the requirements and possibilities for future satellite communications standards and protocols, and evaluate the feasibility and practical constraints involved in the deployment process. Provides a solid overview of the current research in the field of co-operative and cognitive satellite systemsPresents concepts in multibeam and multicarrier joint processing and high performance random access schemes Explains hybrid and dual satellite systems, cognitive broadband satellite systems, spectrum exploitation, and resource allocation

MSS 대역 WCDMA ATC 서비스 주파수 할당을 위한 인접 채널 간섭 분석

최근 기존의 MSS(Mobile Satellite Service) 대역에 지상망과 위성망의 하이브리드 형태인 ATC(Ancillary Terrestrial Component) 서비스 도입이 추진되고 있다. 새로운 MSS/ATC 서비스 주파수 할당을 위해서는 기존의 지상망에 의한 인접 채널 간섭뿐만 아니라 시스템 자체 내의 인접 채널 간섭 분석이 중요하다. 이에 본 논문에서는 인접 채널 간섭에 의한 ACIR(Adjacent Channel Interference Ratio), 지상 이동국 및 위성 이동 지구국의 수를 파라미터로 하여 업링크에서는 지상 기지국 최소 허용 전력 및 시스템 용량(capacity) 손실, 다운링크에서는 1 빔(beam) 당 1 셀(cell)을 가정하여 MSS/ATC 시스템 용량 손실에 대한 시스템 성능을 평가하였다. MSS/ATC 서비스 주파수 배치에 따른 주파수 공유를 위해 두 가지 시나리오 즉, 5 MHz 및 10 MHz 주파수 간격에 대한 ACIR 기준값을 평가하였으며, 향후 이 기준값에 따른 ATC 서비스 커버리지 및 수신 필터 설계 등이 요구된다. A candidate hybrid satellite and terrestrial network architecture, MSS/ATC(Mobile Satellite Service/Ancillary Terrestrial Component), is proposed for utilizing efficiently the exist MSS bands. Studies on the adjacent channel interference from the existing terrestrial mobile services and MSS/ATC itself are important to allocate a new ATC service frequency in MSS band. In this paper, we have analyzed the minimum permission power of terrestrial base station and the capacity loss with parameters of ACIR, number of MS(mobile Station) and MES(Mobile Earth Station) in uplink, and also, the capacity performance based on 1 beam and 1 cell assumption for MSS/ATC in downlink. The ACIR requirements are estimated in two MSS/ATC frequency allocation scenarios for 5 MHz and 10 MHz guard band to share spectrum with adjacent systems, and according to these ACIR requirements the service coverage and the receiver filter for ATC system should be designed in near future.

On-Demand QoS Multicast Routing for Triple-Layered LEO/HEO/GEO Satellite IP Networks

In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite network architecture including the Geostationary Earth Orbit (GEO), the Highly Elliptical Orbit (HEO), and the Low Earth Orbit (LEO) satellite layers, which provides the near-global coverage with 24 hour uninterrupted over the areas varying from 75° S to 90° N. On the basis of this satellite network architecture, we propose an on-demand QoS multicast routing protocol (ODQMRP) for satellite IP networks using the concept of logical locations to isolate the mobility of LEO and HEO satellites. In ODQMRP, we present two strategies, i.e., the parallel shortest path tree (PSPT) strategy and the least cost tree (LCT) strategy, to create the multicast trees under the condition that the QoS requirements, containing the delay constraint, and the available bandwidth constraint, are guaranteed. The PSPT and LCT strategy minimize the path delay and the path cost of the multicast trees, respectively. Simulation results demonstrate that the performance benefits of the proposed ODQMRP in terms of the end-to-end tree delay, the tree cost, and the failure ratio of multicasting connections by comparison with the conventional non-QoS shortest path tree (SPT) strategy.

QoS-Guaranteed Secure Multicast Routing Protocol for Satellite IP Networks Using Hierarchical Architecture

Most recent satellite network research has focused on providing routing services without considering security. In this paper, for the sake of better global coverage, we introduce a novel triple-layered satellite network architecture including Geostationary Earth Orbit (GEO), Highly Elliptical Orbit (HEO), and Low Earth Orbit (LEO) satellite layers, which provides the near-global coverage with 24 hour uninterrupted over the areas varying from 75° S to 90° N. On the basis of the hierarchical architecture, we propose a QoS-guaranteed secure multicast routing protocol (QGSMRP) for satellite IP networks using the logical location concept to isolate the mobility of LEO and HEO satellites. In QGSMRP, we employ the asymmetric cryptography to secure the control messages via the pairwise key pre-distribution, and present a least cost tree (LCT) strategy to construct the multicast tree under the condition that the QoS constraints are guaranteed, aiming to minimize the tree cost. Simulation results show that the performance benefits of the proposed QGSMRP in terms of the end-to-end tree delay, the tree cost, and the failure ratio of multicasting connections by comparison with the conventional shortest path tree (SPT) strategy.

Cross‐layer protocols for satellite communication networks: part I

Cross‐layer protocols for satellite communication networks: part I

Capacity Dimensioning and Routing for Hybrid Satellite and Terrestrial Systems

Satellite network architecture plays an important role in the success of a satellite business. For future commercial broadband data satellite networks integrated with the terrestrial network, satellite network topology, link capacity, and routing have major impacts on the cost of the network and the amount of revenue the network can generate. To find the most cost-effective satellite network topology, we propose a unified mathematical framework using a two-stage stochastic programming formulation. The solution to the stochastic programming formulation gives optimal link capacities and an optimal routing strategy for different network topologies, taking into account uncertainties in long-term aggregate traffic statistic estimation. Using a simple satellite network example, we show the feasible topology regions for three different satellite topologies and show that, for some parameter values, the hybrid topology is more cost effective than nonhybrid topologies. In the limit of high traffic rejection cost, stochastic dimensioning reduces to static dimensioning. We study worst case static dimensioning for a general geosynchronous earth orbit satellite network and show the feasible topology regions, as well as effective cost comparisons for different topologies. We conclude with a discussion on network cost and architectural flexibility relating to satellite network design.

A gateway architecture for IP satellite networks with dynamic resource management and DiffServ QoS provision

AbstractIP satellite networks are gaining a considerable interest mainly due to their ability to deliver high bandwidth services to nation‐wide areas. However some difficulties still exist to implement IP‐based transport mechanisms on geostationary satellite networks (i.e. TCP‐based protocols are affected by the large delay‐bandwidth product). The satellite network architecture presented in this paper is designed to provide a complete QoS support for IP traffic based on the DS paradigm, while minimizing the waste of the valuable satellite resource. The proposed technique operates on two time scales: a short‐term reaction compensates fast traffic variations by an appropriate scheduling while a medium term resource allocation mechanism reduces the wasted bandwidth. Copyright © 2003 John Wiley & Sons, Ltd.