A novel QoS routing protocol for LEO and MEO satellite networks

The rapid advance of communication and satellite technology pushes broadband satellite networks to carry on multimedia traffic. However, the function of onboard routing cannot be provided in existing satellite networks with inter‐satellite links, and quality of service (QoS) of satellite networks cannot be reliably guaranteed because of great difficulties in processing of long distance‐dependent traffic. In this paper, a two‐layered low‐Earth orbit and medium‐Earth orbit satellite network (LMSN) is presented. A novel hierarchical and distributed QoS routing protocol (HDRP) is investigated, and an adaptive bandwidth‐constrained minimum‐delay path algorithm is developed to calculate routing tables efficiently using the QoS metric information composed of delays and bandwidth. The performance of LMSN and HDRP is also evaluated through simulations and theoretical analysis. Copyright © 2007 John Wiley & Sons, Ltd.     

双层卫星网络中的自适应路由算法

The rapid advancement of communication and satellite technology drives broadband satellite networks to carry different traffic loads. However, traffic class routing of satellite cannot be provided by the existing 2 layerd satellite networks. In this paper, a 2 layered satellite network composed of low Earth orbit and medium Earth orbit satellite networks is presented, and a novel Self adapting Routing Protocol (SRP) is developed. This scheme aims to adopt self adapting routing algorithm to support different traffic classes. Meanwhile, the path discovery processing is invoked independently for each individual origin/destination pair. Simulation results are provided to evaluate the performance of the new scheme in terms of end to end delay, normalized data throughput, delay jitter and delivery ratio.     

Research on hierarchical architecture and routing of satellite constellation with IGSO‐GEO‐MEO network

In this paper, a three‐layered medium Earth orbit (MEO), geostationary Earth orbit (GEO), and inclined geosynchronous orbit (IGSO) satellite network (IGMSN) is presented. Based on the idea of time‐slot division, a novel dynamic hierarchical and distributed QoS (quality of service) routing protocol (HDRP) is investigated, and an adaptive bandwidth‐constrained minimum‐delay path for IGSO/GEO/MEO hierarchical architecture constellation (BMDP‐HAC) algorithm is developed to calculate routing tables efficiently using the QoS metric information composed of delays and bandwidth. The performance of the IGMSN and HDRP is evaluated through simulations and theoretical analysis. And then, the paper further analyzes the performance of the IGMSN structure and the BMDP‐HAC algorithm with failure satellites.     

Congestion management techniques for disruption‐tolerant satellite networks

Delay and disruption‐tolerant networks are becoming an appealing solution for extending Internet boundaries toward challenged environments where end‐to‐end connectivity cannot be guaranteed. In particular, satellite networks can take advantage of a priori trajectory estimations of nodes to make efficient routing decisions. Despite this knowledge is already used in routing schemes such as contact graph routing, it might derive in congestion problems because of capacity overbooking of forthcoming connections (contacts). In this work, we initially extend contact graph routing to provide enhanced congestion mitigation capabilities by taking advantage of the local traffic information available at each node. However, since satellite networks data generation is generally managed by a mission operation center, a global view of the traffic can also be exploited to further improve the latter scheme. As a result, we present a novel strategy to avoid congestion in predictable delay‐ and disruption‐tolerant network systems by means of individual contact plans. Finally, we evaluate and compare the performance improvement of these mechanisms in a typical low Earth orbit satellite constellation.     

Performance evaluation on a double‐layered satellite network

How to evaluate the performance of satellite networks is a prerequisite to the construction of satellite networks, and is also one of challenges in the researches on satellite networks. In this paper, generalized stochastic Petri net (GSPN) models are presented to carry out the performance analysis of a double‐layered satellite network. Firstly, the GSPN model of a double‐layered satellite network is simplified by proper analysis. Then, two sets of experiments are conducted to analyse the performance of the satellite networks, and show that the double‐layered satellite network outperforms single‐layered ones on the heavy traffic load. Finally, the feasibility and effectiveness of the proposed approach is verified by simulation experiments. Copyright © 2005 John Wiley & Sons, Ltd.     

LEO multi-service routing algorithm based on multi-objective decision making

In low earth orbit(LEO) satellite networks,in view of the unbalanced link resource,it's difficult to meet differentiated quality of service(QoS) requirements and easily lead to reduce the efficiency of the whole network.A routing algorithm based on multi-objective decision making was proposed which defined LEO satellite network transmission service as the delay sensitive,sensitive bandwidth and reliability sensitive three categories.It used the eigenvector method to calculate service weights,and used the consistency ratio to determine whether it can be accepted.Based on the multi-objective decision making theory,it combined with the actual state of satellite network nodes and links and the specific requirements of the business,calculating the path that meets the QoS requirements of the service,so as to realize the LEO satellite network multi objective dynamic routing optimization.Established simulation platform based on the iridium network system simulated network delay,the uncertain characteristics like the residual bandwidth and packet error rate,route planning for the randomly generated three classes of business.The simulation results show that,the algorithm not only satisfies the QoS constrain while balancing the traffic load of the satellite link effectively,but also improves the performance on the throughput.     

Performance evaluation of adaptive routing algorithms in packet‐switched intersatellite link networks

This paper addresses the performance evaluation of adaptive routing algorithms in non‐geostationary packet‐switched satellite communication systems. The dynamic topology of satellite networks and variable traffic load in satellite coverage areas, due to the motion of satellites in their orbit planes, pose stringent requirements to routing algorithms. We have limited the scope of our interest to routing in the intersatellite link (ISL) segment. In order to analyse the applicability of different routing algorithms used in terrestrial networks, and to evaluate the performance of new algorithms designed for satellite networks, we have built a simulation model of a satellite communication system with intersatellite links. In the paper, we present simulation results considering a network‐uniform source/destination distribution model and a uniform source–destination traffic flow, thus showing the inherent routing characteristics of a selected Celestri‐like LEO satellite constellation. The updates of the routing tables are centrally calculated according to the Dijkstra shortest path algorithm. Copyright © 2002 John Wiley & Sons, Ltd.     

An end‐to‐end alternative to TCP PEPs: Initial Spreading,a TCP fast start‐up mechanism

While Transmission Control Protocol (TCP) Performance Enhancing Proxy (PEP) solutions have long been undisputed to solve the inherent satellite problems, the improvement of the regular end‐to‐end TCP congestion avoidance algorithms and the recent emphasis on the PEPs drawbacks have opened the question of the PEPs sustainability. Nevertheless, with a vast majority of Internet connections shorter than ten segments, TCP PEPs continue to be required to counter the poor efficiency of the end‐to‐end TCP start‐up mechanisms. To reduce the PEPs dependency, designing a new fast start‐up TCP mechanism is therefore a major concern. But, while enlarging the Initial Window (IW) up to ten segments is, without any doubt, the fastest solution to deal with a short‐lived connection in an uncongested network, numerous researchers are concerned about the impact of the large initial burst on an already congested network. Based on traffic observations and real experiments, Initial Spreading has been designed to remove those concerns whatever the load and type of networks. It offers performance similar to a large IW in uncongested network and outperforms existing end‐to‐end solutions in congested networks. In this paper, we show that Initial Spreading, taking care of the satellite specificities, is an efficient end‐to‐end alternative to the TCP PEPs. Copyright © 2015 John Wiley & Sons, Ltd.     

ATM‐based multimedia communication via NGSO‐satellites

Future broadband satellite networks for multimedia will be seamlessly integrated into terrestrial broadband networks which often use asynchronous transfer mode (ATM) and recently also the less complex multi protocol label switching (MPLS) technique as transmission and switching protocol. In light of this, future broadband satellite networks may adopt the ATM transmission scheme and implement ATM or ATM‐like switches on board the satellites. However, as compared to communication in fixed networks, satellite communication is characterized by special constraints (e.g. signal delay, channel quality, dynamic network topology) that require novel ATM‐based communication technology for satellite systems. This paper presents results from the ATM‐Sat project that aims to complete this technically challenging and important R&D task in the cooperation between DLR, Fraunhofer Gesellschaft and Tesat‐Spacecom. In brief the following aspects have been addressed in the ATM‐Sat project:

• development of the concept and communication technology for a multimedia satellite system with,
  • non‐geostationary orbit (NGSO) satellites;
  • inter satellite links (ISLs);
  • on‐board ATM switching;
  • fixed and mobile terminals;
• verification of the developed communication technology with a demonstrator.

In particular the ATM‐Sat R&D tasks cover the system and protocol architecture, on‐board processing, ISL routing, up/downlink and on board ATM resource management (including medium access control), error control, IP over satellite‐ATM, and active intelligent antennas. Copyright © 2005 John Wiley & Sons, Ltd.     

Adaptive frequency‐hopping schemes for CR‐based multi‐link satellite networks

In this paper, we study two dynamic frequency hopping (DFH)–based interference mitigation approaches for satellite communications. These techniques exploit the sensing capabilities of a cognitive radio to predict future interference on the upcoming frequency hops. We consider a topology where multiple low Earth orbit satellites transmit packets to a common geostationary equatorial orbit satellite. The FH sequence of each low Earth orbit–geostationary equatorial orbit link is adjusted according to the outcome of out‐of‐band proactive sensing scheme, performed by a cognitive radio module in the geostationary equatorial orbit satellite. On the basis of sensing results, new frequency assignments are made for the upcoming slots, taking into account the transmit powers, achievable rates, and overhead of modifying the FH sequences. In addition, we ensure that all satellite links are assigned channels such that their minimum signal‐to‐interference‐plus‐noise ratio requirements are met, if such an assignment is possible. We formulate two multi‐objective optimization problems: DFH‐Power and DFH‐Rate. Discrete‐time Markov chain analysis is used to predict future channel conditions, where the number of states are inferred using k‐means clustering, and the state transition probabilities are computed using maximum likelihood estimation. Finally, simulation results are presented to evaluate the effects of different system parameters on the performance of the proposed designs.     

A delay‐centric parallel multi‐path routing protocol for cognitive radio ad hoc networks

In this paper, we develop a delay‐centric parallel multi‐path routing protocol for multi‐hop cognitive radio ad hoc networks. First, we analyze the end‐to‐end delay of multi‐path routing based on queueing theory and present a new dynamic traffic assignment scheme for multi‐path routing with the objective of minimizing end‐to‐end delay, considering both spectrum availability and link data rate. The problem is formulated as a convex problem and solved by a gradient‐based search method to obtain optimal traffic assignments. Furthermore, a heuristic decentralized traffic assignment scheme for multi‐path routing is presented. Then, based on the delay analysis and the 3D conflict graph that captures spectrum opportunity and interference among paths, we present a route discovery and selection scheme. Via extensive NS2‐based simulation, we show that the proposed protocol outperforms the benchmark protocols significantly and achieves the shortest end‐to‐end delay. Copyright © 2015 John Wiley & Sons, Ltd.     

VoIP traffic in wireless mesh networks: a MOS‐based routing scheme

Support of Voice over Internet Protocol (VoIP) services in wireless mesh networks requires implementation of efficient policies to support low‐delay data delivery. Multipath routing is typically supported in wireless mesh networks at the network level to provide high fault tolerance and load balancing because links in the proximity of the wireless mesh gateways can be very stressed and overloaded, thus causing scarce performance. As a consequence of using multipath solutions, lower delay and higher throughput can be supported also when a given path is broken because of mobility or bad channel conditions, and alternative routes are available. This can be a relevant improvement especially when assuming that real‐time traffic, such as VoIP, travels into the network. In this paper, we address the problem of Quality of Service (QoS) support in wireless mesh networks and propose a multipath routing strategy that exploits the Mean Opinion Score (MOS) metric to select the most suitable paths for supporting VoIP applications and performing adaptive load balancing among the available paths to equalize network traffic. Performance results assess the effectiveness of the proposed approach when compared with other existing methodologies. Copyright © 2015 John Wiley & Sons, Ltd.     

MLSR: a novel routing algorithm for multilayered satellite IPnetworks

Several IP-based routing algorithms have been developed for low-Earth orbit (LEO) satellite networks in recent years. The performance of the satellite IP networks can be improved drastically if multiple satellite constellations are used in the architecture. A multilayered satellite IP network is introduced that consists of LEO, medium-Earth orbit (MEO) and geostationary Earth orbit (GEO) satellites. A new multilayered satellite routing (MLSR) algorithm is developed that calculates routing tables efficiently using the collected delay measurements. The performance of the multilayered satellite network and MLSR is evaluated through simulations and analysis     

Simulation analyses of weighted fair bandwidth‐on‐demand (WFBoD) process for broadband multimedia geostationary satellite systems

Advanced resource management schemes are required for broadband multimedia satellite networks to provide efficient and fair resource allocation while delivering guaranteed quality of service (QoS) to a potentially very large number of users. Such resource management schemes must provide well‐defined service segregation to the different traffic flows of the satellite network, and they must be integrated with some connection admission control (CAC) process at least for the flows requiring QoS guarantees. Weighted fair bandwidth‐on‐demand (WFBoD) is a resource management process for broadband multimedia geostationary (GEO) satellite systems that provides fair and efficient resource allocation coupled with a well‐defined MAC‐level QoS framework (compatible with ATM and IP QoS frameworks) and a multi‐level service segregation to a large number of users with diverse characteristics. WFBoD is also integrated with the CAC process. In this paper, we analyse via extensive simulations the WFBoD process in a bent‐pipe satellite network. Our results show that WFBoD can be used to provide guaranteed QoS for both non‐real‐time and real‐time variable bit rate (VBR) flows. Our results also show how to choose the main parameters of the WFBoD process depending on the system parameters and on the traffic characteristics of the flows. Copyright © 2005 John Wiley & Sons, Ltd.     

Next‐generation global satellite system with mega‐constellations

Mega satellite constellations in low earth orbit (LEO) will provide complete global coverage; rapidly enhance overall capacity, even for unserved areas; and improve the quality of service (QoS) possible with lower signal propagation delays. Complemented by medium earth orbit (MEO) and geostationary earth orbit (GEO) satellites and terrestrial network components under a hybrid communications architecture, these constellations will enable universal 5G service across the world while supporting diverse 5G use cases. With an unobstructed line‐of‐sight visibility of approximately 3 min, a typical LEO satellite requires efficient user terminal (UT), satellite, gateway, and intersatellite link handovers. A comprehensive mobility design for mega‐constellations involves cost‐effective space and ground phased‐array antennas for responsive and seamless tracking. An end‐to‐end multilayer protocol architecture spanning space and terrestrial technologies can be used to analyze and ensure QoS and mobility. A scalable routing and traffic engineering design based on software‐defined networking adequately handles continuous variability in network topology, differentiated user demands, and traffic transport in both temporal and spatial dimensions. The space‐based networks involving mega‐constellations will be better integrated with their terrestrial counterparts by fully leveraging the multilayer 5G framework, which is the foundational feature of our hybrid architecture.     

Multi‐hour design of survivable classical IP networks

Most of Internet intra‐domain routing protocols (OSPF, RIP, and IS–IS) are based on shortest path routing. The path length is defined as the sum of metrics associated with the path links. These metrics are often managed by the network administrator. In this context, the design of an Internet backbone network consists in dimensioning the network (routers and transmission links) and establishing the metric. Many requirements have to be satisfied. First, Internet traffic is not static as significant variations can be observed during the day. Second, many failures can occur (cable cuts, hardware failures, software failures, etc.). In this paper, we present algorithms (meta‐heuristics and greedy heuristic) to design Internet backbone networks, taking into account the multi‐hour behaviour of traffic and some survivability requirements. Many multi‐hour and protection strategies are studied and numerically compared in this paper. Our algorithms can be extended to integrate other quality of service constraints. Copyright © 2002 John Wiley & Sons, Ltd.     

Network Mobility in satellite networks: architecture and the protocol

Mobility management is required to ensure the session continuity for multiple Internet Protocol‐enabled devices onboard a satellite that hands off between ground stations. Network Mobility (NEMO) can efficiently manage the mobility of multiple Internet Protocol‐enabled devices that are connected as a mobile network. However, existing mobility management solutions for satellite networks are unable to route through intermediate satellites links when a direct connection with a ground station is lost. We proposed an architecture of NEMO in satellite networks with routing through multiple satellite links using nesting, where a mobile network connects to another mobile network. However, NEMO Basic Support Protocol can be inefficient in satellite networks because of poor nesting formation leading to the routing loop, inefficient routes, and overloaded links. We extended NEMO Basic Support Protocol for the efficient use in satellite networks by augmenting it with a decision criteria for the nesting. Results verify that the extended protocol ensures loop‐free and continuous connection despite the loss of direct connection to the ground and provides an insight on how to form the nested NEMO to avoid overloading. The architecture and the extended NEMO protocol can be used for the efficient and continuous transfer of data from satellite networks to the ground. Copyright © 2011 John Wiley & Sons, Ltd.     

A bio‐inspired OSPF path selection scheme based on an adaptive attractor selection model

Current Internet Protocol routers only support equal cost multi‐path routing, which performs the random path selection or the traffic uniform distribution among equal‐cost paths. In biology, an adaptive attractor selection model is presented to simulate the concentration changes of two kinds of Escherichia coli 's mRNA in changing nutrition environments with bistability equations. Inspired by the metabolism behaviors of E. coli , we propose an adaptive path selection scheme Open Shortest Path First‐path selection by attractor selection to dynamically select the transmission path by the real‐time path quality. Here, the mRNA concentration is analogous to the path quality. Then, to reflect the multipath quality, multi‐stability equations are adopted and redesigned. Our scheme consists of two main features. The first one is a redefined path‐activity to indicate multipath transmission goodness, which is inversely proportional to the offset between current path quality and best path quality. And the second one is a new attractor expression of the multi‐stability equations to concretely specify the effect of a stochastic item noise in the equations on the path selection. Compared with the greedy selection and the uniform random selection in file transfer protocol (FTP) service, our scheme gains better performance on reducing file transmission time, traffic throughput, and traffic dropped. Copyright © 2015 John Wiley & Sons, Ltd.     

Dynamic cache allocation routing strategy of Internet of things satellite node based on traffic prediction

Aiming at the routing problem of low earth orbit (LEO) Internet of things (IoT) satellite systems,a dynamic cache allocation routing strategy based on traffic prediction for IoT satellite nodes was proposed.Firstly,the space-time characteristics of traffic distribution in the LEO coverage area were analyzed,and an end-to-end traffic prediction model was proposed.Then,according to the traffic prediction result,a dynamic cache allocation routing strategy was proposed.The satellite node periodically monitored the traffic load of the inter-satellite link,dynamically allocated the cache resources of each inter-satellite link between the neighboring nodes.The cache allocation process was divided into two phases,initialization and system operation.At the same time,the traffic offload and packet forwarding strategy when the node was congested was proposed.By comparing the queuing delay and the forwarding delay,it was determined whether the data packet needs to be rerouted.The simulation results show that the proposed routing strategy effectively reduces the packet loss rate and average end-to-end delay,and improves the traffic distribution in the whole network.