CN109905281A - The group of stars network Telemetry Service transmission method of multipath maximum throughput - Google Patents
The group of stars network Telemetry Service transmission method of multipath maximum throughput Download PDFInfo
- Publication number
- CN109905281A CN109905281A CN201910224883.7A CN201910224883A CN109905281A CN 109905281 A CN109905281 A CN 109905281A CN 201910224883 A CN201910224883 A CN 201910224883A CN 109905281 A CN109905281 A CN 109905281A
- Authority
- CN
- China
- Prior art keywords
- link
- node
- max
- network
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Radio Relay Systems (AREA)
Abstract
The invention discloses a kind of group of stars network Telemetry Service transmission methods of multipath maximum throughput, mainly solve the problems, such as that existing Telemetry Service multiplexed transport amount is low.Its scheme is: 1) according to end-to-end Telemetry Service transmission demand is received, determining its volume of transmitted data and time-constrain；2) according to remote sensing satellite network topological information and time-constrain, link capacity sequence is obtained；3) initialization storage translation sequence, in conjunction with 2) building time expander graphs；4) augmenting path that moment connection at first is found in time expander graphs calculates max-flow and obtains remaining network；5) max-flow of cumulative calculated augmenting path L every time, return step 4), circulation looks for road, exports Network Maximal-flow when a no available augmenting path from source node to destination node.The present invention improves network maximum throughput, can plan the route transmission of group of stars Network Maximal-flow, can be used in the group of stars network environment that link is discontinuously connected to.
Description
Technical field
The invention belongs to fields of communication technology, and in particular to a kind of group of stars network Telemetry Service transmission method can be used for chain
In the remote sensing network environment that road is discontinuously connected to, the maximum throughput of mission planning is promoted.
Background technique
After transmitting first Landsat from the U.S. in 1972, the beginning of space remote sensing is indicated.Remote sensing network obtains
Data speed is fast, and the period is short, obtaining means multiplicity, contain much information, range is wide, can for the mankind exploringly object feature provide it is strong
Means, the fields such as extensive use and military affairs, geological and mineral exploration, survey of natural resources, city management, are other technologies means institutes
Incomparable, therefore it is increasingly becoming the hot spot of satellite communication field research.
However there is the features such as discontinuously connection, bit error rate height, Shi Yanchang in remote sensing satellite network, if directly by existing ground
ICP/IP protocol is applied with satellite network, and the high-speed mobility of node leads to the interrupted connection of its topology, data transmission efficiency
It will be very low.How reasonable distribution network data flow, maximize end to end network handling capacity, the problem of being urgent need to resolve,
A kind of transmission method of maximum throughput suitable for remote sensing satellite network need to be designed.
In order to preferably solve the problems, such as remote sensing satellite Network Maximal-flow, need to construct suitable model to describe remote sensing satellite
Network.Therefore many scholars solve spatial network data transmission problems using traditional static map, and satellite network is temporally divided
It is segmented into a series of snapshot plotting, finds most shortest time delay path or most inside static map according to traditional static map Network Theory
Big stream has been isolated the topology connection between different periods due to traditional static map, has led to maximum required by different routing sequences
Stream is different.As shown in Fig. 2, if first selecting S-A-D, then S-A-B-D is selected, acquiring max-flow is 5；If first selecting S-A-D, reselection
S-B-D, acquiring max-flow is 7.It is influenced just because of routing sequence bring, it is maximum not to find solution on snapshot plotting so far
The effective ways of stream constrain the maximum Stream Data Transmission of remote sensing satellite network.
Summary of the invention
Present invention aims in view of the above-mentioned problems, proposing a kind of group of stars network Telemetry Service of multipath maximum throughput
Transmission method, low to solve existing remote sensing satellite data distribution field big data transmission quantity, downloading rate is slow, data acquisition
The problem of period length, provides theoretical direction for the maximum transmitted and route planning of Telemetry Service data, improves network maximum
Handling capacity.
To achieve the above object, technical solution of the present invention includes the following:
(1) the time-constrain T of data volume MFlow and multiplexed transport that remote sensing task needs to transmit are obtained；
(2) according to remote sensing satellite network topological information, link capacity sequence is obtained:
Network topological information of the remote sensing satellite within confinement time is obtained, T will be constrained task time and be divided into m not
Interval time section is determined, so that topology of the remote sensing network in a regular time section t is fixed and invariable, according to what is divided
M period calculates time capacity sequence C (T)=(c of each of the links1,c2,...,ct,...,cm), wherein T is given
Time-constrain range, ctRefer to link in the total capacity of given time period t；
(3) initialization storage translation sequence, constructs time expander graphs:
A storage translation sequence: S (T)=(s is constituted with the link between node different periods each in time expander graphs1,
s2...,st,...,sm-1), wherein stRefer in the data volume in the t-1 period to t period memory transfer, and initializes stFor nothing
It is poor big；Construct time expander graphs according to link capacity sequence C (T) and storage translation sequence S (T), i.e., it is different in the same period
Link capacity side c is added between nodet, the addition storage side s between the same node point of different periodst；
(4) augmenting path is found in time expander graphs:
The current max-flow of satellite network described in (4a) setting time expander graphs: ToTfmax(T)=0；
(4b) currently looks for road starting point for what source node s was set as augmenting path L, and by departure time tbeginIt is set as first
A time period tbegin=1；
(4c) finds effective adjacent link according to current node adjacency relationship:
If there are an adjacent links to meet t >=t for nodebegin, and link capacity ct>=0, then the adjoining link is effective, and
All effective adjacent links are recorded, are executed (4d)；Conversely, available adjacent link is not present in present node, execute (4e)；
(4d) selection from all effective adjacent links has connection period t earliestnewA chain of=min (t)
Road using the terminal node of this link as the next-hop node of augmenting path, and sets new for the terminal node of this link
Circuit node is looked for, set present node looks for the road departure time as tbegin=tnew, execute step (4f)；
(4e) judges whether present node is source node s:
If present node is source node s, augmenting path, end loop, output satellite Network Maximal-flow is not present
ToTfmax(T), (8) are executed, otherwise, the adjacent link of the upper hop of present node is set as in vain, deleting in augmenting path L should
Node, at the same the upper hop node of present node be set as adding lustre to path L it is new look for circuit node, return step (4c)；
(4f) judges whether present node is terminal d:
If present node is terminal d, execute step (5), it is no to then follow the steps (4c)；
(5) terminate currently to look for road, obtain an augmenting path L of network, set the interim max-flow of augmenting path L as
fmax(T), and it is initialized as 0.
(6) it calculates interim max-flow and obtains remaining network
(6a) calculates the permitted maximum feasible stream f (T) of current ink according to the augmenting path found；
The interim max-flow f of (6b) update augmenting path Lmax(T)=f (T), it is remaining according to feasible stream calculation current ink
Capacity and reverse chain-circuit capacity update remaining network.
(7) by the interim max-flow f of calculated augmenting path Lmax(T) and ToTfmax(T) it adds up, accumulated result is made
For the current max-flow ToTf of networkmax(T), return step (4b).
(8) judge ToTfmax(T) whether it is greater than Telemetry Service demand MFlow, if so, output max-flow scheme rule
It draws, terminates.It is on the contrary, then it is assumed that network transmission maximum throughput is ToTfmax(T), it cannot be completed within the given period distant
Feel mission planning.
Compared with the prior art, the invention has the following advantages:
First, different time sections network topology isolates a large amount of discardings that will lead to data packet, this hair in traditional snapshot plotting
It is bright that remote sensing network is modeled using time expander graphs, accurate Characterization can be carried out to remote sensing network transmission demand, and pass through
Metastasis sequence is cached, topology in different time periods is contacted, takes full advantage of the cache resources of satellite node, effectively improve number
According to the delivery ratio of packet.
Second, the present invention solves network in time expander graphs, by the increasing for repeatedly finding moment connection at first
Wide Lu Jing constantly updates remaining network, until that can not find an effective augmenting path warp, obtains end-to-end in time expander graphs
Network Maximal-flow, and then obtain the Telemetry Service transmission method of multipath maximum throughput, can effectively instruct Telemetry Service
Max-flow route planning.
Detailed description of the invention
Fig. 1 is implementation flow chart of the invention；
Fig. 2 is the time expander graphs model schematic that the present invention uses；
Fig. 3 is the schematic diagram that the present invention solves Network Maximal-flow embodiment.
Specific embodiment
With reference to the accompanying drawings, the embodiment of the present invention is described in detail:
Referring to Fig.1, steps are as follows for the realization of this example:
Step 1, remote sensing mission requirements are obtained
In the present embodiment, it is assumed that the amount that the remote sensing task got needs to transmit is MFlow=14, time-constrain T=10.
Step 2, link capacity sequence is obtained
(2a) obtains network topological information of the remote sensing satellite within confinement time, will constrain T task time and be divided into m
The period of a variable interval, so that topology of the remote sensing network in a regular time section t is fixed and invariable；
(2b) calculates the time capacity sequence of each of the links: C (T)=(c according to the m period divided1,c2,...,
ct,...,cm), wherein T is given time-constrain range, ctRefer to link in the capacity of given time period t；
As shown in attached drawing 2 (a), there are 4 nodes (S, A, B, D) and 5 directed links in the time expander graphs of the present embodiment
Gather { (S, A), (S, B), (A, B), (A, D), (B, D) }, it is assumed that network topology within the period of 1s is fixed and invariable, just
T=5s can be divided into m=5 period using 1s as time interval, the link capacity of each period is equal to ct=Bt× t, Bt
It is the link bandwidth of given time period t, t is the period divided.
Below to illustrate the calculation method of time capacity sequence C (T) for link (S, A):
Bandwidth sequence B (T)=(4,0,6,0,0) of given link (S, A), t=1, then
C (T)=(4 × 1,0 × 1,6 × 1,0 × 1,0 × 1)=(4,0,6,0,0),
In the manner described above, the capacity sequence of all links is calculated.
Step 3, time expander graphs are constructed
(3a) constitutes a storage translation sequence with the link between each node different periods in time expander graphs:
S (T)=(s1,s2...,st,...,sm-1),
Wherein, stRefer in the data volume in the t-1 period to t period memory transfer, and initializes stFor infinity, wherein 1
≤t≤m-1；
(3b) constructs time expander graphs according to link capacity sequence C (T) and storage translation sequence S (T), i.e., in the same period
Link capacity side c is added between different nodest, the addition storage side s between the same node point of different periodst；
As shown in attached drawing 2 (b), by all link capacity sequence C (T)=(c1,c2,...,ct,...,cm) it is labeled in correspondence
Bian Shang, to illustrate its adding method for (S, A):
By step 2 it is found that the capacity sequence of link (S, A) is (4,0,6,0,0), by (S, A) link capacity mark of 1 period
Note is 4, and (S, A) link capacity of 3 periods is labeled as 6；
Its adding method is illustrated by taking S node as an example between addition storage link the different periods of all nodes:
By the link capacity sequence of (S, A) it is found that S node only has the adjoining link of 1 period, 2 periods and 3 periods, so
Oriented storage side is added between 1 period and 2 periods, and oriented storage side is added between 2 periods and 3 periods, for convenience, if
The size for storing side is infinity, without mark.
(3c) arrives the process of (3b) according to above-mentioned (3a), add the capacity of all links while and all nodes storage while,
After addition is completed, the building of deadline expander graphs.
Step 4, augmenting path is found in time expander graphs.
The current max-flow of satellite network described in (4a) setting time expander graphs are as follows: ToTfmax(T)=0；
(4b) currently looks for road starting point for what source node s was set as augmenting path L, and by departure time tbeginIt is set as first
A time period tbegin=1；
(4c) finds effective adjacent link according to current node adjacency relationship:
If there are an adjacent links to meet t >=t for nodebegin, and link capacity ct>=0, then the adjoining link is effective, and
All effective adjacent links are recorded, are executed (4d)；Conversely, available adjacent link is not present in present node, execute (4e)；
(4d) selection from all effective adjacent links has connection period t earliestnewA chain of=min (t)
Road using the terminal node of this link as the next-hop node of augmenting path, and sets new for the terminal node of this link
Circuit node is looked for, set present node looks for the road departure time as tbegin=tnew, execute step (4f)；；
In the present embodiment, as shown in attached drawing 3 (a1), the valid adjacency link of source point S has (S, A) and (S, B), corresponding to have
The effect connection period is respectively t(S,A)=1, t(S,A)=3 and t(S,B)=2, wherein t(S,A)Indicate the connection period of link (S, A),
t(S,B)It indicates the connection period of link (S, B), selects the t with the connection period earliestnewThe adjacent chain of=min (1,3,2)=1
Road (S, A), the next-hop node by the terminal node A of link (S, A) as the path L that adds lustre to, and set new for node A and work as
Before look for circuit node, and set current A node looks for the road departure time as tbegin=tnew=1；
(4e) judges whether present node is source node s:
If present node is source node s, augmenting path, end loop, output satellite Network Maximal-flow is not present
ToTfmax(T), step 6 is executed, otherwise, the adjacent link of the upper hop of present node is set as in vain, deleting in augmenting path L
The node, at the same the upper hop node of present node be set as adding lustre to path L it is new look for circuit node, return step (4c)；
(4f) judges whether present node is terminal d:
If present node is terminal d, end currently looks for road, obtains an augmenting path L of network, sets augmenting path L
Interim max-flow be f (T), and be initialized as infinity；Otherwise, return step (4c)；
The present embodiment, finds next-hop by circulation to acquire augmenting path, the adjoining link of A node have (A, B) and (A,
D), corresponding effective connection period t(A,B)=1, t(A,D)=4, t(A,D)=5, wherein t(A,B)When indicating the connection of link (A, B)
Section, t(A,D)It indicates the connection period of link (A, D), selects the t with the connection period earliestnewThe adjoining of=min (1,4,5)=1
Link (A, B), obtains the next-hop node B of node A, and sets new for node B and currently look for circuit node, and set current B
The road departure time of looking for of node is tbegin=tnew=1, it similarly, can be in the hope of the next-hop node D of node B, since node D is
Terminal, so obtained augmenting path L are as follows: S → A → B → D, as shown in attached drawing 3 (a1).
Step 5, interim max-flow is calculated, remaining network is obtained
(5a) calculates the permitted maximum feasible stream f (T) of current ink according to the augmenting path found；
The present embodiment after choosing augmenting path S → A → B → D, calculates the maximum feasible stream that current ink allows, calculates
Mode are as follows:
Wherein, (a, b), (p, q), (u, v) respectively represent link different in network, t1, t2, t3It respectively represents different
Period,Different links are respectively indicated in the capacity of different periods.
It is available according to Fig. 3 (a1), the capacity of link (S, A):The capacity of link (A, B):Link
The capacity of (B, D):So S → A → B → D maximum feasible stream is f (T)=min (4,6,4)=4；
(5b) updates remaining network according to feasible stream calculation current ink reverse chain-circuit capacity and residual capacity；
The reverse chain-circuit capacity of link is calculated as follows in (5b1):
Cfv,u(T)=f (T), (v, u) ∈ E
Wherein Cfv,uIt (T) is link reversal capacity, fu,vIt (T) is link maximum feasible flow,
Reverse chain-circuit capacity is calculated equal to maximum feasible stream according to maximum feasible stream 4 obtained in (5a) in this example
4；
Link residual flow is calculated as follows in (5b2):
Cfu,v(T)=Cu,v(T)-f (T), (u, v) ∈ E
Wherein Cfu,vIt (T) is link residual capacity, Cu,vIt (T) is current link capacities, E is link in time expander graphs
Set；In this example, the current capacities of (S, A) link are 4, and the current capacities of (A, B) link are 6, the current appearance of (B, D) link
Amount is 4, the residual flow of (S, A) link is calculated are as follows: 4-4=0, the residual flow of (A, B) link are as follows: 6-4=2, link
The link residual flow of (B, D) are as follows: 4-4=0；
The reverse chain-circuit capacity of link and link residual flow are labeled in corresponding sides by (5b3), obtain its remaining network,
As shown in Fig. 3 (a2).
Step 6, circulation, which is looked for, passes by journey, cumulative to obtain Network Maximal-flow.
By the interim max-flow f of calculated augmenting path Lmax(T) and ToTfmax(T) it is added, the result of addition is as net
The current max-flow ToTf of networkmax(T), return step (4b), continues cycling through to look for and passes by journey, until source node without one effectively
Augmenting path until.
As shown in Fig. 3, the left side of this example is augmenting path, and the right is remaining network.According to step 4, first in attached drawing 3
(a1) an augmenting path S → A → B → D is found in, and augmenting path S → A → B → D max-flow is calculated by step 5
It is 4, and obtains the residual paths and remnants network of augmenting path, such as Fig. 3 (a2)；
S → B → A → D augmenting path is continually looked in Fig. 3 (b1) again, be obtained by calculation augmenting path S →
B → A → D max-flow is 4, and obtains the residual paths and remnants network of augmenting path, as shown in Fig. 3 (b2)；
Then, S → A → D augmenting path is continually looked in 3 (c1), and augmenting path S → A → D is obtained by calculation
Max-flow is 2, and obtains the residual paths and remnants network of augmenting path, as shown in Fig. 3 (c2)；
Then, S → A → D augmenting path is continually looked in 3 (d1), and augmenting path S → A → D is obtained by calculation
Max-flow is 4, and obtains the residual paths and remnants network of augmenting path, as shown in Fig. 3 (d2)；
Continue to find road warp in 3 (d2), until without an effective adjacent link, then terminating since source node S
It finds, finally obtaining Network Maximal-flow is ToTfmax(T)=4+4+2+4=14.
Step 7, judge whether that Telemetry Service planning can be completed.
Judge ToTfmax(T) whether it is more than or equal to Telemetry Service demand MFlow, if so, output max-flow scheme rule
It draws, terminates transmission plan planning process, it is on the contrary, then it is assumed that transmission demand is up to ToTfmax(T), finishing service is unable to advise on demand
It draws.
In the present embodiment, MFlow=14 is equal to max-flow 14, can complete mission planning in time-constrain T=5s.
Above description is only example of the present invention, it is clear that for those skilled in the art, is being understood
After the content of present invention and principle, all it may be carried out in form and details without departing substantially from the principle of the invention, structure
Various modifications and change, but these modifications and variations based on inventive concept are still in claim of the invention and protection model
Within enclosing.
Claims (5)
1. a kind of group of stars network Telemetry Service transmission method of multipath maximum throughput, which is characterized in that include the following:
(1) the time-constrain T of data volume MFlow and multiplexed transport that remote sensing task needs to transmit are obtained；
(2) according to remote sensing satellite network topological information, link capacity sequence is obtained:
(2a) obtains network topological information of the remote sensing satellite within confinement time, will constrain T task time and be divided into m not
Interval time section is determined, so that topology of the remote sensing network in a regular time section t is fixed and invariable；
(2b) calculates the time capacity sequence of each of the links: C (T)=(c according to the m period divided1,c2,...,
ct,...,cm), wherein T is given time-constrain range, ctRefer to link in the total capacity of given time period t；
(3) initialization storage translation sequence, constructs time expander graphs:
(3a) constitutes a storage translation sequence with the link between each node different periods in time expander graphs:
S (T)=(s1,s2...,st,...,sm-1),
Wherein, stRefer in the data volume in the t-1 period to t period memory transfer, and initializes stFor infinity；
(3b) constructs time expander graphs according to link capacity sequence C (T) and storage translation sequence S (T), i.e., different in the same period
Node between add link capacity side ct, the addition storage side s between the same node point of different periodst；
(4) augmenting path is found in time expander graphs:
The current max-flow of satellite network described in (4a) setting time expander graphs: ToTfmax(T)=0；
(4b) currently looks for road starting point for what source node s was set as augmenting path L, and by departure time tbeginWhen being set as first
Between section tbegin=1；
(4c) finds effective adjacent link according to current node adjacency relationship:
If there are an adjacent links to meet t >=t for nodebegin, and link capacity ct>=0, then the adjoining link is effective, and records
All effective adjacent links execute (4d)；Conversely, available adjacent link is not present in present node, execute (4e)；
(4d) selection from all effective adjacent links has connection period t earliestnewA link of=min (t), will
Next-hop node of the terminal node of this link as augmenting path, and the road Xin Zhao section is set by the terminal node of this link
Point, set present node looks for the road departure time as tbegin=tnew, execute step (4f)；
(4e) judges whether present node is source node s:
If present node is source node s, augmenting path, end loop, output satellite Network Maximal-flow ToTf is not presentmax
(T), (8) are executed, otherwise, are set as the adjacent link of the upper hop of present node in vain, the node is deleted in augmenting path L,
Simultaneously the upper hop node of present node be set as adding lustre to path L it is new look for circuit node, return step (4c)；
(4f) judges whether present node is terminal d:
If present node is terminal d, execute step (5), otherwise, executes step (4c)；
(5) terminate currently to look for road, obtain an augmenting path of network: L={ (a, b) ..., (p, q) ..., (u, v) },
In (a, b), (p, q), (u, v) respectively represents link different in network, sets the interim max-flow of augmenting path L as fmax
(T), and it is initialized as 0；
(6) it calculates interim max-flow and obtains remaining network:
(6a) calculates the permitted maximum feasible stream f (T) of current ink according to the augmenting path found, and maximum feasible stream refers to currently
Augmenting path L allow by maximum stream flow；
The interim max-flow f of (6b) update augmenting path Lmax(T)=f (T), according to feasible stream calculation current ink residual capacity
And reverse chain-circuit capacity, update remaining network；
(7) by the interim max-flow f of calculated augmenting path Lmax(T) and ToTfmax(T) it adds up, accumulated result is as net
The current max-flow ToTf of networkmax(T), return step (4b).
(8) judge ToTfmax(T) whether it is greater than Telemetry Service demand MFlow, if so, output max-flow programme planning, knot
Beam, it is on the contrary, then it is assumed that network transmission maximum throughput is ToTfmax(T), interior at a given time period remote sensing task cannot be completed
Planning.
2. the method as described in claim 1, which is characterized in that total appearance c of the link in given time period t in step (2)t, pass through
Following formula calculates:
ct=Bt×t,t∈m
Wherein, t is the duration of present period, BtIt is bandwidth of the respective links in time period t, if the link period does not connect
It is logical,
Then corresponding connected sequence ct=0, conversely, if ct> 0 then illustrates that link is continual communication in time period t.
3. the method as described in claim 1, which is characterized in that calculate current chain according to the augmenting path L that (5) are found in (6a)
The permitted maximum feasible stream f (T) in road, is from current link capacities setIn the amount of trying to please minimum value,
Formula is as follows:
Wherein, (a, b), (p, q), (u, v) respectively represent link different in network, t1, t2, tnRespectively represent the different time
Section,Indicate link (a, b) in t1The capacity of period,Indicate link (p, q) in t2The capacity of period,Indicate link
(u, v) is in tnThe capacity of period.
4. the method as described in claim 1, which is characterized in that calculate current ink residual capacity in (6b), pass through following formula meter
It calculates:
Cfu,v(T)=Cu,v(T)-f (T), (u, v) ∈ E
Wherein (u, v) is current ink, Cu,vIt (T) is current (u, v) link capacity, Cfu,vIt (T) is link (u, v) residual capacity,
F (T) is the maximum feasible flow of current (u, v) link, and E is the set of link in time expander graphs.
5. the method as described in claim 1, which is characterized in that calculate reverse chain-circuit capacity in (6b), be calculate by the following formula:
Cfv,u(T)=f (T), (v, u) ∈ E
Wherein (u, v) is current ink, and (v, u) is the reverse link of (u, v) link, Cfv,u(T) be reverse link (v, u) appearance
Amount, f (T) is link (u, v) maximum feasible flow, and E is the set of link in time expander graphs.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910224883.7A CN109905281A (en) | 2019-03-24 | 2019-03-24 | The group of stars network Telemetry Service transmission method of multipath maximum throughput |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910224883.7A CN109905281A (en) | 2019-03-24 | 2019-03-24 | The group of stars network Telemetry Service transmission method of multipath maximum throughput |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109905281A true CN109905281A (en) | 2019-06-18 |
Family
ID=66952464
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910224883.7A Pending CN109905281A (en) | 2019-03-24 | 2019-03-24 | The group of stars network Telemetry Service transmission method of multipath maximum throughput |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109905281A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111541582A (en) * | 2020-04-09 | 2020-08-14 | 清华大学 | Satellite network capacity calculation method and device and electronic equipment |
| CN111835634A (en) * | 2020-07-14 | 2020-10-27 | 中国电子科技集团公司第二十研究所 | Dynamic multipath routing method based on service distribution |
| CN111970202A (en) * | 2020-08-28 | 2020-11-20 | 电子科技大学 | Network topology discovery method based on three-way sub-topology measurement |
| CN112257950A (en) * | 2020-11-02 | 2021-01-22 | 上海电力大学 | Trade path configuration method applied to power market and computer-readable storage medium |
| CN114641029A (en) * | 2022-05-17 | 2022-06-17 | 亚太卫星宽带通信（深圳）有限公司 | Transmitting method and system based on satellite communication signal device |
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103312608A (en) * | 2013-04-25 | 2013-09-18 | 大连大学 | Satellite network routing algorithm based on traffic engineering |
| CN105897329A (en) * | 2016-06-08 | 2016-08-24 | 大连大学 | Multi-service routing optimization method of LEO satellite network based on multi-objective decisions |
| CN106452559A (en) * | 2016-09-14 | 2017-02-22 | 西北工业大学 | High-throughput satellite formation data transmission method based on network coding |
| CN106789340A (en) * | 2017-01-19 | 2017-05-31 | 西安电子科技大学 | Satellite network adaptive topology based on prediction finds and maintaining method |
| EP3329612A1 (en) * | 2015-07-31 | 2018-06-06 | ViaSat, Inc. | Flexible capacity satellite constellation |
| CN105407049B (en) * | 2015-10-26 | 2018-07-03 | 西安电子科技大学 | Delay-tolerant network max-flow method for routing based on time aggregation figure |
| CN108566242A (en) * | 2018-06-13 | 2018-09-21 | 昆宇蓝程（北京）科技有限责任公司 | A kind of Information Network resource scheduling system for remote sensing data transmission business |
| CN108832993A (en) * | 2018-06-22 | 2018-11-16 | 西安电子科技大学 | Online relay satellite system communication resource allocation method towards hybrid task |
-
2019
- 2019-03-24 CN CN201910224883.7A patent/CN109905281A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103312608A (en) * | 2013-04-25 | 2013-09-18 | 大连大学 | Satellite network routing algorithm based on traffic engineering |
| EP3329612A1 (en) * | 2015-07-31 | 2018-06-06 | ViaSat, Inc. | Flexible capacity satellite constellation |
| CN105407049B (en) * | 2015-10-26 | 2018-07-03 | 西安电子科技大学 | Delay-tolerant network max-flow method for routing based on time aggregation figure |
| CN105897329A (en) * | 2016-06-08 | 2016-08-24 | 大连大学 | Multi-service routing optimization method of LEO satellite network based on multi-objective decisions |
| CN106452559A (en) * | 2016-09-14 | 2017-02-22 | 西北工业大学 | High-throughput satellite formation data transmission method based on network coding |
| CN106789340A (en) * | 2017-01-19 | 2017-05-31 | 西安电子科技大学 | Satellite network adaptive topology based on prediction finds and maintaining method |
| CN108566242A (en) * | 2018-06-13 | 2018-09-21 | 昆宇蓝程（北京）科技有限责任公司 | A kind of Information Network resource scheduling system for remote sensing data transmission business |
| CN108832993A (en) * | 2018-06-22 | 2018-11-16 | 西安电子科技大学 | Online relay satellite system communication resource allocation method towards hybrid task |
Non-Patent Citations (3)
| Title |
|---|
| TAO ZHANG; HONGYAN LI; SHUN ZHANG; JIANDONG LI: "A Storage-Time-Aggregated Graph-Based QoS Support Routing Strategy for Satellite Networks", 《GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE》 * |
| 李红艳，杨光祥，王文龙: "一种最大吞吐量的深空通信网络路由算法", 《西安电子科技大学学报》 * |
| 王鹏，李红艳，张焘，李朋云: "基于时间聚合图的DTN网络最短时延路由算法", 《通信学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111541582A (en) * | 2020-04-09 | 2020-08-14 | 清华大学 | Satellite network capacity calculation method and device and electronic equipment |
| CN111835634A (en) * | 2020-07-14 | 2020-10-27 | 中国电子科技集团公司第二十研究所 | Dynamic multipath routing method based on service distribution |
| CN111970202A (en) * | 2020-08-28 | 2020-11-20 | 电子科技大学 | Network topology discovery method based on three-way sub-topology measurement |
| CN112257950A (en) * | 2020-11-02 | 2021-01-22 | 上海电力大学 | Trade path configuration method applied to power market and computer-readable storage medium |
| CN114641029A (en) * | 2022-05-17 | 2022-06-17 | 亚太卫星宽带通信（深圳）有限公司 | Transmitting method and system based on satellite communication signal device |
| CN115801093A (en) * | 2022-10-14 | 2023-03-14 | 西安空间无线电技术研究所 | Path planning method for guaranteeing end-to-end deterministic time delay of satellite network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109905281A (en) | The group of stars network Telemetry Service transmission method of multipath maximum throughput | |
| CN108521375B (en) | SDN-based network multi-service flow QoS transmission and scheduling method | |
| CN105245451B (en) | The time diffusivity of satellite DTN network routes method for searching | |
| US5535195A (en) | Method for efficient aggregation of link metrics | |
| Ahmad et al. | AEERP: AUV aided energy efficient routing protocol for underwater acoustic sensor network | |
| JP2021526763A (en) | Methods and devices for managing networks | |
| JP7076584B2 (en) | Methods and equipment for managing networks | |
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| CN111970044A (en) | Satellite network time slot allocation and routing planning method based on Lagrange relaxation | |
| CN108632940B (en) | Reliable multipath routing algorithm suitable for photoelectric sensor wireless MESH network | |
| CN109951335A (en) | Satellite network time delay and rate joint protection method for routing based on time aggregation figure | |
| CN109246624A (en) | A kind of multicast forward method and relevant device | |
| CN105407049B (en) | Delay-tolerant network max-flow method for routing based on time aggregation figure | |
| CN114844812A (en) | Low-delay low-overhead path deployment method for active network remote sensing | |
| Wu et al. | DSFL: Decentralized satellite federated learning for energy-aware LEO constellation computing | |
| Wang et al. | Geographic routing in random duty-cycled wireless multimedia sensor networks | |
| CN110930675A (en) | Electricity consumption information acquisition system | |
| Jia et al. | TTDeep: Time-triggered scheduling for real-time ethernet via deep reinforcement learning | |
| CN109889447A (en) | Network transmission method and system based on hybrid ring networking and fountain codes | |
| CN109121178A (en) | One kind carrying out energy heterogeneous star networking route designing method based on Artificial Potential Field | |
| CN104202247A (en) | Non-linear annealing based multi-constrained routing method for SDN (Software Defined Network) | |
| CN103312603B (en) | network congestion information transmission method and device | |
| CN115225550B (en) | On-demand whole network telemetry device based on clustering path planning algorithm | |
| CN106100995A (en) | A kind of method for routing being applicable to power line carrier communication network network | |
| CN104244423A (en) | Wireless sensor network based multi-path transmission time slot scheduling algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20190618 |
|
| WD01 | Invention patent application deemed withdrawn after publication |