CN109412950A - Data distributing method of the star ground based on on-path caching in hybrid network - Google Patents
Data distributing method of the star ground based on on-path caching in hybrid network Download PDFInfo
- Publication number
- CN109412950A CN109412950A CN201811193571.6A CN201811193571A CN109412950A CN 109412950 A CN109412950 A CN 109412950A CN 201811193571 A CN201811193571 A CN 201811193571A CN 109412950 A CN109412950 A CN 109412950A
- Authority
- CN
- China
- Prior art keywords
- node
- cache node
- algorithm
- cache
- data
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/20—Hop count for routing purposes, e.g. TTL
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/25—Routing or path finding in a switch fabric
- H04L49/252—Store and forward routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Radio Relay Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of the present invention provides star the data distributing method based on on-path caching in hybrid network, after setting satellite network scene, it dynamic satellite network is divided into a series of isometric discrete timeslices according to satellite topology control strategy and establishes the annexation figure across time slot, improve data distribution routing algorithm accordingly；The characteristics of according to satellite network, chooses a part of node as cache node, to reduce the propagation delay time of data distribution and the storage overhead of data using the node selection algorithm of proposition.
Description
Technical field
A kind of the present invention relates to satellite network technical field of data transmission more particularly to star the data in hybrid network point
Forwarding method.
Background technique
Data distribution service refers mainly to distribute data, the routing of mainstream from source node to any accessibility destination node
Algorithm mainly has minimum spanning tree routing algorithm and Dijkstra shortest route algorithm.
The main thought of minimum spanning tree is the Connected undigraph of a given cum rights, how to choose a spanning tree, makes
The summation of all Bian Shangquan is minimum on tree.Its construction method is divided into two kinds: kruskal algorithm and prim algorithm.Crewe
This karr algorithm is chosen on side in figure by the ascending order of order of its weight, if not being formed into a loop after selecting side, is reserved for
For a line, removed if forming circuit.Successively select enough sides (n-1) to get minimum spanning tree (n is number of vertex).And it is general in
Nurse algorithm adds it in set since specified vertex, the institute for then being constituted the vertex in set and the vertex outside set
Have chosen in the smallest a line of weight as spanning tree while, and that vertex outside set is added in set, table
Show that the vertex has been connected to.Again with the vertex in set and vertex outside set constitute when looking for the smallest in, and will be corresponding
Vertex is added in set, so goes down until whole vertex are all added in set to get minimum spanning tree.Since minimum generates
Tree building does not consider the of overall importance of node or link, therefore obtained solution is part only according to next-hop up to the weight of link
Optimal solution.But the advantage is that calculating time complexity is small, the time complexity of prim algorithm is O (n2), kruskal
Your time complexity of algorithm is O (eloge).
Node V is divided to and gathers for S and U two by Dijkstra shortest route algorithm, and S indicates that the node having been added to, U indicate
Node is not added, the main thought of algorithm is to guarantee that the shortest path length on each vertex in source point v to S is not more than from source point v to U
In any vertex shortest path length.The routing algorithm is due to that can traverse all nodes, the result is that globally optimal solution,
Calculating time complexity is O (n2)。
In data distribution routing under the conditions of static topological, single source node or multiple source nodes transmit information
To multiple destination nodes, it can use minimum spanning tree or Dijkstra shortest route algorithm obtain a distribution tree and counted
According to transmission.But it is directed to the data distribution routing issue of satellite network, due to its topological periodic transformation, traditional minimum
Spanning tree algorithm or dijkstra's algorithm cannot be directly used in satellite network.
With the diversification of data volume increased rapidly with business demand, more high bandwidth for different stage user and different
Requirement of the structure access capability to next generation network is very strict.In recent years, the development of Low Earth Orbit (LEO) satellite is lower by its
Lower deployment cost and wider coverage area attracted many concerns.Currently, the hybrid network of integrated LEO constellation and terrestrial user
Network is at Internet of Things (IoTs), satellite sensor network, plays important work in a variety of Data distributings such as tactics distributed network
With.In recent years, information centre (ICN) due to its good data routing policy and for content distribution network-caching mechanism and
Candidate solutions as LEO constellation-ground mixing new network framework.Therefore, much about the ground LEO- hybrid network
The research of network caching and forwarding strategy was unfolded in recent years.Research contents mainly utilizes extensive spreadability and the ground of satellite network
Network combines, and is optimized to cache location so that the access delay of user's request for data is accordingly reduced.
Cache policy is mainly in static topological relationship in existing net, i.e., the connection relationship between known node is not at any time
Between and change.Or any net interior nodes are regarded into cache node all to optimize the access delay of user's request for data.However it is right
For the data distribution of satellite network: firstly, since intrinsic spies such as link circuit resource are valuable in satellite network, propagation delay time is big
Point, the expense that data distribution is cached to each satellite node is excessive, influences the transmission of other business；Secondly as defending
The storage resource of StarNet's network is limited, therefore storage overhead can be made excessive as memory node all nodes.
Summary of the invention
In order to solve the problems in the prior art, the present invention provides a kind of star slow based on on-path in hybrid network
The data distributing method deposited, after setting satellite network scene, according to satellite topology control strategy by dynamic satellite network
It is divided into a series of isometric discrete timeslices and establishes the annexation figure across time slot, improve data distribution road accordingly
By algorithm；The characteristics of according to satellite network, chooses a part of node as cache node using the node selection algorithm of proposition, from
And reduce the propagation delay time of data distribution and the storage overhead of data.
The present invention is realized especially by following technical solution:
A kind of star ground data distributing method based on on-path caching in hybrid network, when source node S N generates number of targets
When according to f, SN broadcasts the message each satellite node into network；Some user UT will send request for data order APfTo most
Nearly attachable LEO satellite node to apply for f, this by by the shortest route that precalculates by APfForwarded hop-by-hop is to source node
SN；Once the cache node CN, f that encounter a stored f in repeating process will be immediately sent to UT, and stop APf
Forwarding；Wherein, which comprises node span time slot connection figure S1, is established according to intersatellite topological relation；S2, basis
Above-mentioned across time slot connection figure, selecting cache node storage source node using the cache node selection algorithm based on backtracking subregion will divide
The data of hair, specifically:
S201, initialization cache node set CNSet ← φ；Cache node number i ← 0 having been selected；
If S202, the cache node i < CNNum having been selected, from vertex setMiddle selection one is not belonging to
The vertex of CNSet set allows it to meet new cache node and makes current time delay expense as new cache node c
Reach minimum, is added into cache node set；If the cache node i >=CNNum having been selected, jumps to S204；
S203, new region is re-used as according to current new cache node c and its node covered, readjusts its upper level
Region；If upper level region division does not change, i.e., still be optimal solution, or for current cache node c be source node S N
Then jump to S202；If upper level division needs to be adjusted, that is, generates new cache node c and replace former cache node, then
Jump to S203；S204, cache node set CNSet is obtained.
As a further improvement of the present invention, described that node span time slot connection figure is established according to intersatellite topological relation
Specifically:
S101, scheming GTMiddle building vertex setV=(i-1) N+j | j=1 ..., N；I=1 ..., γ/τ+
1}；Wherein, i indicates that i-th of time slot, j indicate that j-th of satellite node, N are node number, and τ is time interval, when γ is observation
It is long；S102, connection ct (n is taken out in link connection table CRTf, nt, tstart, tend, Tp), wherein nfIndicate sending node, nt
Indicate receiving node, tstartAt the beginning of indicating connection, tendIndicate the end time of connection, TpIndicate propagation delay；If
It is connectionless in CRT to jump to S106；S103, si=t is enabledstart/ τ ..., tend/ τ -1, sj=0 ..., tstart/ τ -1, in figure GT
Si and sj correspond to and establish n on time slotfAnd ntBetween connection relationship, weight is as follows:
G(sj·N+nf, siN+nt)←Tp+τ·(si-sj)
G(sj·N+nt, siN+nf)←Tp+τ·(si-sj)
Connection relationship side right value is 0 between S104, same node；S105, S102 is returned；S106, across time slot space-time is obtained
Figure
As a further improvement of the present invention, the method also includes: using Dijkstra shortest route algorithm find most
Short circuit by.
As a further improvement of the present invention, the method also includes: when nodes scale is smaller, using effective
Shortest route is found using the MST-assisted dijkstra's algorithm of waiting time, once it is utilized without end-to-end path
Original distribution path collection is added in the path MST between two nodes for occurring waiting time delay by MST-assisted dijkstra's algorithm
It closes, keeps the chance for encountering cache node in repeating process bigger.
The beneficial effects of the present invention are: due to inherent defects such as satellite network high latency, high bit-errors, for reducing
The redundant path transmission of data distribution reduces propagation delay time and plays important work to data distribution performance is improved in satellite network
With.The present invention is devised in a kind of satellite network using the thought of ICN net internal segment point cache and is selected based on backtracking point-area's cache node
The data distribution strategy selected, while in order to overcome application limitation of the traditional data distribution routing algorithm in dynamic topology, it proposes
A kind of across time slot connection figure makes Dijkstra shortest path have algorithm and MST algorithm can be in the network that dynamic topology changes
Preferably applied.
Detailed description of the invention
Fig. 1 is data distribution systems block diagram in hybrid network；
Fig. 2 is across time slot connection schematic diagram；
Fig. 3 is backtracking-partition cache node electing process schematic diagram；
Fig. 4 is MST-assisted Dijkstra routing algorithm schematic diagram of the invention；
Fig. 5 is MST and Dijkstra routing algorithm hop count comparison diagram；
Fig. 6 is MST and Dijkstra routing algorithm time delay comparison diagram；
To time delay comparison diagram needed for user's request for data under algorithms of different when Fig. 7 (a) is N=33；
To expense comparison diagram needed for user's request for data under algorithms of different when Fig. 7 (b) is N=33；
To time delay comparison diagram needed for user's request for data under algorithms of different when Fig. 8 (a) is N=17；
To expense comparison diagram needed for user's request for data under algorithms of different when Fig. 8 (b) is N=17.
Specific embodiment
The present invention is further described for explanation and specific embodiment with reference to the accompanying drawing.
The present invention for the characteristic of satellite network propose a kind of selection algorithm based on backtracking-subregion cache node come
Reduce the access delay of user's request for data.Firstly, the ground LEO- hybrid network system is established, according to intersatellite topological relation
Data distribution tree between star is established, selects cache node storage source using the cache node selection algorithm based on backtracking subregion of proposition
The data to be distributed of node achieve the purpose that the time delay that satellite network request for data is accessed to user optimizes.
Fig. 1 describes the detailed process of content distribution in the hybrid network of the ground LEO-.When source node S N generates target data f
When, it broadcasts the message each satellite node into network.In general, some user UT will send APf(request for data order)
To nearest attachable LEO satellite node to apply for f, this by by the shortest route that precalculates by APfForwarded hop-by-hop is to source
Node SN.Once the cache node CN, f that encounter a stored f in repeating process will be immediately sent to UT, and stop
APfForwarding.In general, the bulk redundancy transmission of same target file can seriously reduce the distribution performance on high dynamic ISL.Needle
To these problems, the invention proposes a kind of on-path cache policies that backtracking partitioning algorithm is combined under high dynamic topology.It is main
It works and specifically includes that 1. establish node span time slot connection figure, become to preferably describe the dynamic topology in satellite network
Change；2. the selection algorithm of cache node.
[establishing node span time slot connection figure]
Satellite network is a dynamic network with temporal evolution, node predictable for the characteristics of motion in network
It says, in some timeslice as satellite network can be regarded to a static network, be equivalent to the division for carrying out time slot, obtain a series of
The static topology map of satellite network, but routed according to such topology the problem is that, the static state in each timeslice
Topological model is independent from each other, and simultaneously includes time dimension and Spatial Dimension information with one to improve this situation
Topological diagram --- the dynamic changing process of across time slot connection figure (such as Fig. 2) Lai Fanying satellite network node Temporal Evolution, mould
Type is to be transformed by a series of static topology maps according to certain rule, is a kind of dynamic topology model.
In across time slot connection figureIn, wherein T represents the number of timeslice, and every layer has N number of node, represents satellite
All nodes in net's backbone.WithIt represents
All node sets and line set in connection figure, i.e.,Represent i-th of node of t-th of time slot.Weight on representative edge, calculation formula are as follows:
ω(vi, vj)=waitSlot (i, j)+δ (1)
WaitSlot represents the waiting time delay with next-hop link connection, and δ represents propagation delay, wherein
Specific developing algorithm across time slot connection figure is as follows:
Across the time slot connection figure of algorithm I
[based on backtracking-subregion cache node selection algorithm]
In general, tree structure is presented in the shortest path of data distribution.Therefore, selection cache node is equivalent to entire tree point
At multiple disjoint subregions.If not having available cache node in network, we will be all nodes in distribution tree
It is considered as the region led by single source node, with super-distribution data delay and is covering cost.On the other hand, if selection one
The cache node of fixed number amount, then prime area will be divided into multiple disjoint subregions with different guides.Each
Subregion is by one group of distribution group of paths at one of cache node is as root node.Therefore, feasible cache node quilt is found
Be considered one using minimum vertex-covering cost as the partition zone optimizing problem of target, this backtracking algorithm that can be proposed through the invention
It solves
st.CNset∈V (3)
Wherein,Be cost (i, j) accumulation and, and:
Cost (i, j)=d (i, j)/c+Tf (4)
Here, d () indicates the Euclidean distance between two nodes, TfIndicate the propagation delay time of data, rI, j={ vi,
vi+1..., vj| v ∈ V } it indicates from source node viTo user node vjData distribution path.
In backtracking algorithm proposed by the invention, initial v1The leader being defined as in overstepping one's bounds region, wherein claiming
For region v1.Once having selected a new cache node vi, as shown in figure 3, with viIt is divided into for the corresponding region of root node
Two disjoint subregions, viOverlay area be named as vi.Meanwhile total covering cost is updated.However, such as Fig. 3
Shown in lower right-most portion, obtained subregion will not be best solution.Therefore, once it is determined that new cache node, those
Previous cache node needs are recalled for verifying again, until selected cache node no longer changes or be precisely that source
Node.For example, if current region state as shown in Fig. 3 bottom left section, and selects v4As new cache node, then subregion
State will be evolved into Fig. 3 lower right-most portion.According to backtracking principle, v in Fig. 3 bottom left section4Affiliated region v2It should repair again
Change.Firstly, by region v2Dismiss and then be added its higher level region v1, then according to current partition select new cache node as
New isolated area.
Realization process is as shown in algorithm II:
Algorithm II cache node selection algorithm
[MST-assisted Dijkstra data distribution routing algorithm]
Since node size is larger, typical Dijkstra shortest route algorithm can plus proposed backtracking partitioning strategies
To effectively improve distribution performance.But since nodes scale is smaller, it is difficult to find path end to end, from
And lead to the possible incoming connection waiting time.As a result, unique use of typical Dijkstra routing algorithm will be due to frequent
It waits operation and causes significantly to amplify delay.Therefore, the present invention devises a kind of MST- for efficiently using the waiting time
Assisted dijkstra's algorithm, in the application process of file destination, MST algorithm is due to its excellent local shortest path
Search capability and by collaboration utilize.When using MST in strategy, once MST-assisted is utilized without end-to-end path
Original distribution path set is added in the path MST between two nodes for occurring waiting time delay by dijkstra's algorithm, is made forwarded over
The chance that cache node is encountered in journey is bigger.
If in the shortest path r of target data request APf, there are viAnd vjBetween etc. it is to be delayed, then we count
It calculates from viTo vjThe path MST r 'I, j.By by r 'I, jIt is added in r, data solicitation message APfIt is encountered with bigger probability
Cache node, to achieve the purpose that reduce redundant transmission, Fig. 4 is MST-assisted Dijkstra routing algorithm schematic diagram.
[performance evaluation]
In the present invention, we carry out performance comparison to access delay of the user to distribution data application.LEO constellation orbital
Height is 750km, is provided with two scenes, N=33 and N=17.And the design parameter of satellite constellation is shown in Table 1.
1 satellite constellation parameter list of table
| Satellite parametric reduction | Scene 1 | Scene 2 |
| Classification of track | LEO | LEO |
| Highly (km) | 780 | 780 |
| Inclination angle (deg) | 78.25 | 45 |
| Source node quantity | 1 | 1 |
| Constellation types | LEO | LEO |
| Number of satellite (N) | 4*8 | 4*4 |
| Sampling interval (τ) | 1min | 1min |
| It observes time slot (K) | 10 | 10 |
Firstly, dijkstra's algorithm is compared with typical minimum spanning tree (MST) algorithm, discovery Dijkstra is calculated
Method is better than MST algorithm in terms of transmission hop count and propagation delay time, as shown in Figure 5 and Figure 6.
In addition, we simulate the delay time of the data distribution based on path caching, respectively N=33 and N=17.It will
As a result with random cache strategy and based on backtracking-partition cache node selection algorithm Dijkstra (or MST assist
Dijkstra it) is compared with MST distribution policy, it is found that proposed backtracking partition cache node selection algorithm can obviously subtract
The time delay of few user node data application.
Fig. 7 (a), Fig. 8 (a) respectively carry out pair time delay needed for user's request for data under two kinds of scenes of N=33 and N=17
Than Fig. 7 (b), Fig. 8 (b) respectively compare expense needed for user's request for data under two kinds of scenes of N=33 and N=17, hair
Now can effectively less time delay and expense, raising it be divided based on backtracking-partitioned nodes caching Dijkstra data distribution strategy
Volatility.Note that, due to the traditional dijkstra's algorithm of utilization, will appear a large amount of waiting time delay in path as N=17, because
This routing algorithm should be promoted to MST-assisted dijkstra's algorithm to improve the collision probability with cache node, thus into
The transmission of one step reduction redundant path.
Those skilled in the art of the present technique have been appreciated that in the present invention the various operations crossed by discussion, method, in process
Steps, measures, and schemes can be replaced, changed, combined or be deleted.Further, each with having been crossed by discussion in the present invention
Kind of operation, method, other steps, measures, and schemes in process may also be alternated, changed, rearranged, decomposed, combined or deleted.
Further, in the prior art to have and the step in various operations, method disclosed in the present invention, process, measure, scheme
It may also be alternated, changed, rearranged, decomposed, combined or deleted.
The above description is only a preferred embodiment of the present invention, is not intended to limit the scope of the invention, all utilizations
Equivalent structure or equivalent flow shift made by description of the invention and accompanying drawing content is applied directly or indirectly in other correlations
Technical field, be included within the scope of the present invention.
For those skilled in the art, without departing from the inventive concept of the premise, several letters can also be made
Single deduction or replace, all shall be regarded as belonging to protection scope of the present invention.
Claims (4)
1. data distributing method of a kind of star ground based on on-path caching in hybrid network, when source node S N generates target data f
When, SN broadcasts the message each satellite node into network；Some user UT will send request for data order APfTo recently may be used
The LEO satellite node of connection to apply for f, this by by the shortest route that precalculates by APfForwarded hop-by-hop is to source node S N；One
The cache node CN, f that denier encounters a stored f in repeating process will be immediately sent to UT, and stop APfForwarding；
It is characterized by: the described method includes: S1, establishing node span time slot connection figure according to intersatellite topological relation；S2, basis
Above-mentioned across time slot connection figure, selecting cache node storage source node using the cache node selection algorithm based on backtracking subregion will divide
The data of hair, specifically:
S201, initialization cache node set CNSet ← φ；Cache node number i ← 0 having been selected；If S202,
The cache node i < CNNum of selection, then from vertex setIt is middle select one be not belonging to CNSet set vertex as newly
Cache node c, and so that it is met new cache node and current time delay expense is made to reach minimum, it is added into caching section
Point set；If the cache node i >=CNNum having been selected, jumps to S204；The current new caching section of S203, basis
Point c and its node covered are re-used as new region, readjust the region of its upper level；If upper level region is drawn
Point do not change, i.e., be still optimal solution, or for current cache node c is that source node S N then jumps to S202；If upper level
It divides and needs to be adjusted then, that is, generate new cache node c and replace former cache node, then jump to S203；S204, it is cached
Node set CNSet.
2. according to the method described in claim 1, it is characterized by: described establish node span according to intersatellite topological relation
Time slot connection figure specifically:
S101, scheming GTMiddle building vertex set platformV=(i-1) N+j | j=1 ..., N；I=1 ..., γ/τ+1 }；Its
In, i indicates that i-th of time slot, j indicate that j-th of satellite node, N are node number, and τ is time interval, and γ is observation duration；
S102, connection ct (n is taken out in link connection table CRTf, nt, tstart, tend, Tp), wherein nfIndicate sending node, ntIt indicates
Receiving node, tstartAt the beginning of indicating connection, tendIndicate the end time of connection, TpIndicate propagation delay；If in CRT
It is connectionless to jump to S106；S103, si=t is enabledstart/ τ ..., tend/ τ -1, sj=0 ..., tstart/ τ -1, in figure GTSi and
Sj, which is corresponded to, establishes n on time slotfAnd ntBetween connection relationship, weight is as follows:
G(sj·N+nf, siN+nt)←Tp+τ·(si-sj)
G(sj·N+nt, siN+nf)←Tp+τ·(si-sj)
Connection relationship side right value is 0 between S104, same node；S105, S102 is returned；S106, across time slot space-time diagram is obtained
3. according to the method described in claim 1, it is characterized by: the method also includes being calculated using Dijkstra shortest route
Method finds shortest route.
4. according to the method described in claim 1, it is characterized by: smaller the method also includes working as nodes scale
When, shortest route is found using the MST-assisted dijkstra's algorithm of effective use waiting time, once it is not end-to-end
The path MST between two nodes for occurring waiting time delay is added original point using MST-assisted dijkstra's algorithm by path
Set of paths is sent out, keeps the chance for encountering cache node in repeating process bigger.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811193571.6A CN109412950B (en) | 2018-10-12 | 2018-10-12 | On-path cache-based data distribution method in satellite-ground hybrid network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811193571.6A CN109412950B (en) | 2018-10-12 | 2018-10-12 | On-path cache-based data distribution method in satellite-ground hybrid network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109412950A true CN109412950A (en) | 2019-03-01 |
| CN109412950B CN109412950B (en) | 2021-01-08 |
Family
ID=65467827
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811193571.6A Active CN109412950B (en) | 2018-10-12 | 2018-10-12 | On-path cache-based data distribution method in satellite-ground hybrid network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109412950B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113365309A (en) * | 2021-04-29 | 2021-09-07 | 西安交通大学 | Content caching and distributing method based on regional collaboration in satellite Internet |
| CN113746745A (en) * | 2020-05-30 | 2021-12-03 | 华为技术有限公司 | Multipath communication method, device and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020046405A1 (en) * | 2000-01-28 | 2002-04-18 | Ibeam Broadcasting Corporation | System and method for determining optimal server in a distributed network for serving content streams |
| US7231174B2 (en) * | 2000-02-29 | 2007-06-12 | Kabushiki Kaisha Kenwood | Data distribution system and method, and electric equipment to be used therefor |
| CN104580165A (en) * | 2014-12-19 | 2015-04-29 | 北京交通大学 | Cooperative caching method in intelligence cooperative network |
| CN108390764A (en) * | 2018-01-02 | 2018-08-10 | 东南大学 | A kind of broadcasted content benefit packet method and system towards broadcast and storage network |
| CN108616923A (en) * | 2018-02-27 | 2018-10-02 | 南京邮电大学 | A kind of cooperation caching system based on mobile ad-hoc network |
-
2018
- 2018-10-12 CN CN201811193571.6A patent/CN109412950B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020046405A1 (en) * | 2000-01-28 | 2002-04-18 | Ibeam Broadcasting Corporation | System and method for determining optimal server in a distributed network for serving content streams |
| US7231174B2 (en) * | 2000-02-29 | 2007-06-12 | Kabushiki Kaisha Kenwood | Data distribution system and method, and electric equipment to be used therefor |
| CN104580165A (en) * | 2014-12-19 | 2015-04-29 | 北京交通大学 | Cooperative caching method in intelligence cooperative network |
| CN108390764A (en) * | 2018-01-02 | 2018-08-10 | 东南大学 | A kind of broadcasted content benefit packet method and system towards broadcast and storage network |
| CN108616923A (en) * | 2018-02-27 | 2018-10-02 | 南京邮电大学 | A kind of cooperation caching system based on mobile ad-hoc network |
Non-Patent Citations (2)
| Title |
|---|
| HAO WU;JIAN LI;HANCHENG LU;PEILIN HONG: "A Two-Layer Caching Model for Content Delivery Services in Satellite-Terrestrial Networks", 《2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM)，IEEE》 * |
| 孙彦斌;张宇;张宏莉: "信息中心网络体系结构研究综述", 《电子学报 》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113746745A (en) * | 2020-05-30 | 2021-12-03 | 华为技术有限公司 | Multipath communication method, device and system |
| CN113365309A (en) * | 2021-04-29 | 2021-09-07 | 西安交通大学 | Content caching and distributing method based on regional collaboration in satellite Internet |
| CN113365309B (en) * | 2021-04-29 | 2023-03-28 | 西安交通大学 | Content caching and distributing method based on regional collaboration in satellite Internet |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109412950B (en) | 2021-01-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111211828B (en) | Inter-satellite routing method and device for low earth orbit communication satellite constellation | |
| CN113067625B (en) | Satellite network multi-service QoS routing method based on region division | |
| Liu et al. | Load-balancing routing algorithm based on segment routing for traffic return in LEO satellite networks | |
| JP2897875B2 (en) | Integrated Network Controller for Dynamic Non-Hierarchical Routing Switching Network | |
| US20100061231A1 (en) | Multi-domain network and method for multi-domain network | |
| US20030118027A1 (en) | Multi-constraint routing system and method | |
| CN108964746B (en) | Time-varying satellite network multi-topology searching shortest routing method | |
| CN112333109A (en) | Ant colony optimization-based load balancing routing method in low-orbit satellite network | |
| CN109586785B (en) | Low-orbit satellite network routing strategy based on K shortest path algorithm | |
| CN110391983A (en) | Distributed congestion avoidance routing algorithm for satellite-ground integrated network | |
| CN107302396B (en) | Network route planning method between dynamic star based on mixed strategy | |
| CN111342885A (en) | Gateway station combination-based satellite network routing method | |
| CN109412950A (en) | Data distributing method of the star ground based on on-path caching in hybrid network | |
| US20040213233A1 (en) | Method and apparatus for routing in asynchronous transfer mode communication network | |
| CN104734770B (en) | A kind of distributed group of stars network route method based on context | |
| CN113259993A (en) | Cross-layer routing method and communication system based on MEO/LEO double-layer satellite network | |
| CN113422636A (en) | On-satellite routing optimization method | |
| CN110113783B (en) | Method for realizing satellite network multi-hop routing of joint perception drive | |
| US20060036762A1 (en) | System and method for automatic path generation in a computer network | |
| JPH0983546A (en) | Route selecting method/device and communication network design method/device | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay | |
| CN107241268A (en) | Local multipath method for routing and device based on satellite-based ADS B message satellite networks | |
| CN108011661B (en) | Satellite network routing oscillation suppression method and system | |
| Li et al. | Load-balanced cooperative transmission in MEO-LEO satellite network | |
| CN114499639A (en) | Ant colony optimization routing method with multiple QoS constraints in low-orbit satellite network |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |