The disclosure relates to satellite communications networking.
A method of operating a satellite communication network having a plurality of satellites interconnected by a plurality of satellite-to-satellite communication links, each of the plurality of satellites being configured to communicate with at least one of a plurality of ground stations using respective ground-satellite communication links, comprises:
transmitting, using the respective ground-satellite communication links, at least one respective routing table to each of the plurality of satellites, each routing table comprising a list of destination satellites of the plurality of satellites and, for each particular destination satellite, definitions of at least two possible routes leading to it, the definition of a route comprising an ordered list of interconnected ones of the plurality of satellites linking a source satellite of the plurality of satellites to the particular destination satellite;
detecting a problem communication link at a particular one of the plurality of satellites, the problem communication link comprising either a problem with the particular one of the plurality of satellites' ability to communicate with one of the plurality of ground stations using one of the plurality of ground-satellite communication links, or a problem with the particular satellite's ability to communicate with others of the plurality of satellites using one of the satellite-to-satellite communication links;
transmitting, from the particular one of the plurality of satellites, an alert message (AM) to at least a subset of the plurality of satellites, the alert message identifying the problem communication link as problematic; and
in response to receiving the alert message, routing, by the subset of the plurality of satellites, subsequent data packets through the communication network using their respective at least one routing table to avoid the problem communication link.
In an alternative embodiment, a component of a satellite configured for incorporation within a satellite communications network having a plurality of satellites interconnected by a plurality of satellite-to-satellite communication links, each of the plurality of satellites being configured to communicate with at least one of a plurality of ground stations using respective ground-satellite communication links, includes logic elements configured to:
store a data structure that identifies different possible destinations in the satellite communications network and defines, for each of multiple of the identified destinations, multiple different routes for routing data from the satellite to the destination;
receive an indication of a problem in the satellite communications network;
determine that the problem in the satellite communications network impacts a first one of the routes defined in the data structure for routing data from the satellite to a particular destination;
update the data structure to reflect that the first route for routing data from the satellite to the destination has been impacted by a problem;
receive data to be routed from the satellite to the particular destination in the satellite communications network;
access the data structure;
determine, based on accessing the data structure, that the first route for routing data from the satellite to the particular destination has been impacted by a problem; and
in response to determining that the first route for routing data from the satellite to the particular destination has been impacted by a problem, select a second route for routing data from the satellite to the particular destination from the different routes for routing data from the satellite to the destination defined in the data structure.
Particular aspects of such a method, such a satellite communications network, and such a satellite component comprise the subject-matter of the dependent claims. Implementations described herein, including the above-described implementations, may include a method or process, a system, or computer-readable program code embodied on computer-readable media.
Additional features will become apparent from the subsequent description, taken in conjunction with the accompanying drawings.
In one example, a satellite communication network includes a constellation of satellites (e.g., a constellation of non-geostationary satellites like a constellation of low earth orbit (LEO) (e.g., 160-2,000 km above the Earth's surface) satellites) interconnected by satellite-to-satellite communication links. One example of such a satellite communications network is the current Iridium® constellation. Another example of such a satellite communications network is the Iridium NEXT constellation currently under development.
Individual satellites communicate with neighboring satellites via satellite-to-satellite communication links (“cross-links”). As illustrated in
As illustrated in
Additional terrestrial terminals (e.g., mobile satellite terminals like satellite telephones and other mobile satellite communications devices) may be used in addition to or in lieu of ground stations, and may establish connections with one or more of the satellites, for example, for the purpose of routing communications from the terrestrial terminals to other terrestrial destinations and/or vice versa via the satellite communications network (and, in some cases, one or more other networks (e.g., the public switched telephone network (PSTN), the Internet, etc.)). In some implementations, such connections between satellites and terrestrial mobile satellite terminals may be implemented in the L frequency band.
As illustrated in
The satellite network 100 may employ various different techniques to handle problems (e.g., failure and/or congestion) with the cross-links between individual satellites. For example, in the event that a satellite detects a problem (e.g., failure or congestion) with a cross-link that it intended to use to transmit data to another satellite, the satellite may use another of its cross-links to transmit the data to a different satellite to enable the data to progress toward its ultimate destination. This technique may be referred to as local rerouting and an example is illustrated in
As illustrated in
The techniques described herein may mitigate the above-mentioned drawbacks of the local rerouting technique, potentially allowing for more efficient management of problematic cross-links (e.g., failed and/or congested cross-links) in a satellite communications network.
For example, cross-link problems (e.g., failure and/or congestion) in a satellite communications system may be addressed using routing tables that contain full descriptions of multiple routes between different source—destination satellite pairs (e.g., multiple routes between each possible source—destination satellite pair in the satellite communications network) and alert messages transmitted by satellites (or other nodes) experiencing problems (e.g., failure and/or congestion) with at least one of their cross-links.
In some implementations, each satellite receives, from a ground station (either directly or indirectly via one or more other satellites), a routing table that includes complete descriptions of a plurality of different routes linking it to all (or some subset of all of) the other satellites of the network. In other implementations, only some subset of the satellites may receive routing tables that include complete descriptions of pluralities of different routes linking them to all (or some subset of all of) the other satellites of the network. A “complete description” of a route may be, for example, an ordered list of nodes (e.g., satellites) forming the route. The routing table(s) distributed to the satellites may original from a terrestrial operations center.
In some implementations, there may be a hierarchical order between the routes linking a “source” satellite to a “destination” satellite. For example, one route may be designated as the “primary” route and be intended to be used as the default route; meanwhile, other routes may be designated as “backup” routes to be used in the event that one of the satellite-to-satellite links of the primary route experiences a problem (e.g., failure or congestion). Such backup routes also may have a hierarchical ordering defining the order in which they are to be used in the event of problems with cross-links in the different backup routes.
An example is illustrated in
As illustrated in Table 1, the routing table for satellite 52 instructs satellite 52 to route a data packet destined for satellite 41 along the primary route PR, extending through satellites 40, 42, 18 and 43, unless there is a problem (e.g., failure and/or congestion) with a cross-link within the primary route PR. Such a problem is illustrated in
In some implementations, the routing table for a satellite may include at least two routes for routing data from the satellite to a destination satellite that do not have any (or that have no more than some predefined number of) intermediary satellites in common.
In the example illustrated in Table 1, each route between satellite 52 and 41 is characterized by a “status”, which is illustrated in this example as taking one of two values: Inactive (I) (e.g., where one or more of the cross-links in the route are known to be experiencing a problem) or Active (A) (e.g., where none of the cross-links in the route are known to be experiencing a problem); this will be explained in greater detail below. In alternative implementations, the “status” may take one of three values: Active, Inactive (i.e. failed) and Congested. Such an approach may allow the satellites to route data differently depending on whether problems with cross-links are due to failures or congestion.
It should be noted that the routes linking satellite 41, when it is the source node, to satellite 52, when it is the destination node, may be the same as the routes linking satellite 52 to satellite 41 (albeit with satellites encountered in the reverse order) or different, depending on the particular implementation.
In one particular example of a satellite communications network, there are 66 satellites and each one uses a distinct routing table to route data through the satellite communications network, where each routing table comprises N>1 routes for each of the 65 possible destination satellites, plus the ground stations. In an example where N=4 (e.g., where there is a primary route and three backup routes for each source—destination satellite pair), a route comprises on average 10 satellites (which may be more than the actual value), each satellite of the route is represented by a byte, and an additional byte is used to code the state of each route and, for the sake of simplicity, routes having a ground station as their destination are ignored, the set of all of the routing tables for a given topology may be represented in 66×65×(10+1) bytes, i.e. slightly more than 46 Kbytes.
In some implementations, the routing tables are transmitted to the satellites by the ground station(s), and the status of all of the routes in any given routing table may be set to “Active” by default. Depending upon the implementation, the routing table used by an individual satellite may be updated at each change of the network topology (which, e.g., may be due to the movement of the satellites along their orbits). Each routing table may be applicable during one or more predetermined active periods (e.g., periods during which the routing table corresponds to the current topology of the satellite communications network). In some implementations, several routing tables are uploaded to individual satellites in advance of their active periods, e.g. several days before. In such implementations, the individual satellites may update their active routing tables themselves, and the synchronization of this updating may be achieved automatically. A ground station may upload routing tables to a satellite when the satellite is connected to the ground station, or routing tables may be routed from the ground station to the satellite across the satellite communications network (e.g., using the routing table(s) of the relevant satellite(s) which are active at the time of the upload) if the satellite is not connected to the ground station.
In order to enable individual satellites to make intelligent choices about which routes listed in their routing tables to use to route data to particular destinations, some or all of the satellites are made aware of known problems (e.g., failures and/or congestion) in the satellite communications network. For example, a satellite experiencing a cross-link failure and/or congestion may initiate an alert (e.g., an alert packet) identifying the problem and/or its location which is transmitted to some or all of the other satellites. In some implementations, conventional flooding algorithms may be used to ensure distribution of the alert to all of the satellites via the satellite-to-satellite links. Such techniques may converge quickly due to the moderate size of a typical satellite communications network.
Various different techniques may be employed to detect a problem in the satellite communications network. For example, an individual satellite may have one or more modems and use the modem(s) to detect problems with its cross-links. In such implementations, the modem on a satellite can detect the failure of one of its cross-links by, for example, monitoring its synchronization state. If the modem detects that the cross-link is synchronized, the modem may determine that the cross-link is functional. In contrast, if the modem detects that the cross-link is not synchronized, the modem may determine that the cross-link has failed. Moreover, a satellite can determine that one of its cross-links is congested, for example, by comparing the known capacity of the cross-link to the current traffic on the cross-link. The described techniques for detecting problems (e.g., cross-link failure and/or congestion) in the satellite communications network are non-exhaustive examples. Other techniques may be employed for detecting problems (e.g., cross-link failure and/or congestion) in the satellite communications network.
Referring again to the example illustrated in
When an individual satellite in the satellite communications network receives the alert message AM, it may change the status of all the routes in its active routing table that include the cross-link between satellites 18 and 14 to “Inactive”, for example, as illustrated in Table 1.
Other implementations are possible. For instance, each satellite could store a list of problematic (e.g., failed and/or congested) links and use the list to determine, on the fly, the highest-priority active route to a destination when the satellite needs to transmit data to the destination. Additionally or alternatively, in some implementations, when a cross-link is experiencing congestion, already-established, active connections may be allowed to continue to use the congested cross-link, but new connections may be discouraged (or prevented) from using the cross-link by using backup routes that utilize different cross-links instead. Such an approach may allow for a progressive de-congestion of the congested cross-link.
In some implementations, if a problem in the satellite communications network (e.g., the failure of the cross-link between satellites 18 and 43 illustrated in
In situations where the problem with a problematic cross-link is congestion, it may be advantageous to implement a mechanism to avoid rapid oscillations between statuses of problematic and non-problematic. For example, a non-congested cross-link may be determined to become congested when the traffic on the cross-link exceeds a first threshold T1 while a congested cross-link may be determined to become non-congested when the traffic on the cross-link decreases below a second threshold T2, where T2<T1.
In some implementations, Quality-of-Service (QoS) levels associated with different types of traffic carried across the satellite communications network may be used in determining how to route different traffic in the satellite communications network, particularly in the case of congestion on one or more cross-links. For example, in one implementation, traffic may be assigned to one of four different QoS levels, QoS1, QoS2, QoS3, and QoS4, where QoS1 traffic is to be given priority over QoS2, QoS3, and QoS4 traffic, QoS2 traffic is to be given priority over QoS3 and QoS4 traffic, and so on. In such implementations, when different QoS level traffic is being considered for routing over a congested cross-link, higher priority QoS level traffic may be routed over the congested cross-link before lower priority QoS level traffic. For example, if the traffic being routed over a cross-link causes the traffic on the cross-link to exceed a threshold level of congestion, the link may be determined to be congested and routed away from the cross-link for the lowest priority QoS level of traffic currently being routed over the cross-link and each successive higher priority QoS level of traffic until the traffic being routed across the cross-link falls below an uncongested traffic level.
As illustrated in
At some point, an indication of a problem in the satellite network (e.g., a failure of and/or congestion in a cross-link) is received (510). For example, as described above, another satellite in the satellite communications network may detect a problem and transmit an alert message identifying the problem to other satellites in the satellite communications network. After the indication of the problem has been received, a determination is made that the problem impacts a first one of the routes defined in the data structure for routing data from the satellite to a particular destination (e.g., a particular satellite or ground station) (515). As a consequence of determining that the problem impacts the first route from the satellite to the particular destination, the data structure is updated to reflect that the first route has been impacted by the problem (520). For example, the data structure may be updated to reflect that a failure has occurred in the first route and/or that the first route is congested.
Thereafter, data to be routed from the satellite to the particular destination is received (525). In response to receiving the data to be routed from the satellite to the particular destination, the data structure is accessed and a determination is made that the first route for routing data from the satellite to the particular destination has been impacted by a problem (530). For example, a determination may be made that a failure has occurred in the first route and/or that the first route is congested. As a consequence of having determined that the first route has been impacted by a problem, a second route for routing data from the satellite to the particular destination is selected from the different routes for routing data from the satellite to the destination that are defined in the data structure (535). The data then may be routed (e.g., transmitted) to another satellite according to the selected route.
Aspects of the present disclosure may be implemented entirely in hardware, entirely in software (including firmware, resident software, micro-code, etc.) or in combinations of software and hardware that may all generally be referred to herein as a “module,” “component,” or “system.” Furthermore, aspects of the present disclosure may take the form of a computer program product embodied in one or more computer-readable media having computer-readable program code embodied thereon.
Any combination of one or more computer-readable media may be utilized. The computer-readable media may be a computer-readable signal medium or a computer-readable storage medium. A computer-readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of such a computer-readable storage medium include the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an appropriate optical fiber with a repeater, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer-readable signal medium may include a propagated data signal with computer-readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer-readable signal medium may be any computer-readable medium that is not a computer-readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer-readable signal medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF signals, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including object oriented programming languages, dynamic programming languages, and/or procedural programming languages.
The figures illustrate examples of possible implementations according to various aspects of the present disclosure. In this regard, each block in a flowchart may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order illustrated in a figure. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of a flowchart, and combinations of blocks in a flowchart, can be implemented by special purpose hardware-based systems that perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The description of the present disclosure has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the disclosure in the form disclosed. Other implementations are possible. For instance, alert messages transmitted from at least some of the satellites can also be transmitted to one or more ground stations. Moreover, the ground stations can also detect problems and/or the resolution of problems in the satellite communications network and transmit alert and/or end-of-alert messages to other ground stations and/or to satellites in response. After all, both the satellites and the ground stations may be considered nodes of the satellite communications network and may be capable of performing some of the same functions, particularly when it comes to making decisions about how to route data in the satellite communications network.
Number | Date | Country | Kind |
---|---|---|---|
14290278 | Sep 2014 | EP | regional |
Number | Name | Date | Kind |
---|---|---|---|
6178163 | Yuan | Jan 2001 | B1 |
9094856 | Tian | Jul 2015 | B1 |
20020150060 | Montpetit | Oct 2002 | A1 |
Number | Date | Country |
---|---|---|
2012-047880 | Apr 2012 | WO |
Entry |
---|
European Patent Office, extended European Search Report for European Patent Application No. 14290278.2, dated Mar. 9, 2015. |
J. Stepanek et al., “Fault-Tolerant Routing for Satellite Command and Control”, 2004 IEEE Aerospace Conference Proceedings, Mar. 6, 2004, pp. 1671-1676, XP010748285. |
T. Taleb et al., “Explicit Load Balancing Technique for NGEO Satellite IP Networks with On-Board Processing Capabilities”, IEEE/ACM Transactions on Networking, vol. 17, No. 1, Feb. 2009, pp. 281-293, XP011246763. |
Number | Date | Country | |
---|---|---|---|
20160080072 A1 | Mar 2016 | US |