CN106850431B - Multi-attribute optimal routing method applied to low-orbit information network - Google Patents

Multi-attribute optimal routing method applied to low-orbit information network Download PDF

Info

Publication number
CN106850431B
CN106850431B CN201611192384.7A CN201611192384A CN106850431B CN 106850431 B CN106850431 B CN 106850431B CN 201611192384 A CN201611192384 A CN 201611192384A CN 106850431 B CN106850431 B CN 106850431B
Authority
CN
China
Prior art keywords
attribute
network
fuzzy
value
attributes
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.)
Active
Application number
CN201611192384.7A
Other languages
Chinese (zh)
Other versions
CN106850431A (en
Inventor
赵黎晔
贾涛
李延东
马洋
梁巍
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Aerospace Dongfanghong Satellite Co Ltd
Original Assignee
Aerospace Dongfanghong Satellite Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Aerospace Dongfanghong Satellite Co Ltd filed Critical Aerospace Dongfanghong Satellite Co Ltd
Priority to CN201611192384.7A priority Critical patent/CN106850431B/en
Publication of CN106850431A publication Critical patent/CN106850431A/en
Application granted granted Critical
Publication of CN106850431B publication Critical patent/CN106850431B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/123Evaluation of link metrics

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a multi-attribute optimal routing method applied to a low-orbit information network, and belongs to the field of satellite communication. Firstly, selecting N attributes which can represent the network quality; then, calculating an evaluation function of each attribute value of all edges in the whole network topological structure; next, a Choquet fuzzy integral value A of each edge in the topology of the whole network is calculated with respect to the evaluation function of the N attributes representing the network qualitymM is 1 to M, and finally, the fuzzy integral value A is setmAnd M is 1-M, which is used as a measurement weight of the edge in the network, and the optimal route is calculated by utilizing a Dijkstra algorithm. The method takes a fuzzy integral of Chquet based on fuzzy measure as an integrated operator, converts multi-attribute parameters into single comprehensive attribute evaluation parameters, and then utilizes Dijkstra algorithm to select a route. This method has the following advantages: (1) the optimal route under the condition of multi-attribute routing can be obtained; (2) the routing algorithm of the node has low complexity; (3) the parameter adjustment is flexible and the adaptability is strong.

Description

Multi-attribute optimal routing method applied to low-orbit information network
Technical Field
The invention relates to a multi-attribute optimal routing method applied to a low-orbit information network, belonging to the technical field of space networks.
Background
The low-orbit information network communication system is based on low-orbit satellite constellation, and uses the excellent coverage characteristic of the satellite to realize the information access and transmission to the mobile users in a larger area (or the world). The low-orbit information network communication system has the characteristics of wide coverage, flexible and rapid networking, flexible information access and the like, and becomes an important component of the next generation mobile communication (5G) and the national information highway. The satellite nodes in the low-orbit information network have the characteristics of expensive equipment, large information transmission delay, limited bandwidth and the like, so that the optimal routing selection for transmitting data in the low-orbit information network needs to comprehensively consider the combined action of a plurality of attributes. Aiming at the particularity of routing selection of the low-orbit information network, the method for researching the optimal routing under the action of multiple attributes has important practical significance.
The optimal routing problem under the action of multiple attributes can be substantially reduced to a multiple attribute decision analysis problem. The traditional multi-attribute decision analysis problem mostly adopts arithmetic mean, weighted mean and other linear integration operators based on classical additive measurement to fuse the evaluation information of each attribute, and the assumption is that each attribute is independent and independent. But this premise is difficult to satisfy in real-life decision problems. The three attributes of path cost, time delay and bandwidth in the satellite network are correlated, so that the additive property of the property measurement is damaged.
The japanese scholars sugeno first proposed replacing the additivity set function with weaker monotonicity and continuity and became the fuzzy measure. The lambda measurement is a basic fuzzy measurement, and is characterized in that the parameters to be determined are few, and the measurement value of each single-point attribute set is determined only under the condition of satisfying the lambda law. The k-plus-blur measure proposed by Grabisch has strong representation capability, and the larger the k value is, the stronger the representation capability is, but has higher complexity relative to the lambda measure.
The multi-attribute decision method using fuzzy integration based on fuzzy measure as an integration operator not only fully considers the relative weight among the attributes, but also considers the interaction among the attributes. Three fuzzy integrals are commonly used, sugeno fuzzy integral, Zhenyuan fuzzy integral, Choquet fuzzy integral. The calculation complexity of the Sugeno fuzzy integral is the minimum of the three fuzzy integrals, but much information is ignored, and the evaluation effect is poor; the computational complexity of the Zhenyuan fuzzy integral is the maximum, and the integral value of the Zhenyuan fuzzy integral represents the maximum potential among various combinations of the attribute set; the computational complexity of the Choquet fuzzy integral is slightly higher than that of Sugeno integral, so that the properties of monotonicity, idempotency, boundedness and the like are met, and the Choquet fuzzy integral is widely applied to multi-attribute object evaluation and information fusion.
Disclosure of Invention
The technical problem to be solved by the invention is as follows: the method overcomes the defects of the prior art, and provides the multi-attribute optimal routing method which has low algorithm complexity, flexible parameter adjustment and strong adaptability and is applied to the low-orbit information network.
The technical solution of the invention is as follows: a multi-attribute optimal routing method applied to a low-orbit information network is based on a known full-network topological structure and comprises the following steps:
(1) selecting N attributes which can represent the network quality;
(2) calculating an evaluation function f of each attribute value of all edges in the topology structure of the whole networkm,k(x) K is 1 to N, M is 1 to M, and M is the total number of edges of the topology structure of the whole network;
(3) calculating each edge in the topology structure of the whole networkNChoquet fuzzy integral value A of evaluation function of attribute valuem
(4) And (4) calculating the fuzzy integral value A calculated in the step (3)mAnd as the measurement weight of the edge in the network, calculating by utilizing a Dijkstra algorithm to obtain the optimal route.
The evaluation function f of the attribute value in the step (2)m,k(x) The specific calculation formula of (A) is as follows:
Figure BDA0001187456950000021
in which x is the numbermK-th attribute value, p, of an edgek_bestRepresents the maximum value, p, of the kth attribute of all edges in the full-network topologyk_worstIs the minimum value of the kth attribute of all edges in the full-network topology.
Step (3) calculating Choquet fuzzy integral value A of evaluation functions of N attributes of each edge in the whole network topology structure and representing the network qualitymThe method comprises the following specific steps:
(3.1) abbreviation fm,k(x)=fm,kAccording to fm,kWith its density function mu (f) of fuzzy measurem,k) Determining the fuzzy measure density mu (f) of N attributes of the m-th edge representing the network qualitym,k) Specific value of (a), abbreviated as μ (f)m,k) Is mum,k
(3.2) fuzzy measure density mu according to N attributes of all edgesm,kAnd calculating a fuzzy measure parameter lambda according to the following formula:
Figure BDA0001187456950000031
(3.3) the m-th edge determined according to step (3.1) represents the fuzzy measure mu (f) of the N attributes of the network qualitym,k) And (3) calculating the Choquet fuzzy integral value A according to the specific value and the fuzzy measure parameter lambda determined in the step (3.2)m:
Will f ism,kSorting from small to large to obtain fm,i,i=1~N:
Figure BDA0001187456950000032
In the formula, Fm,i={fm,i,fm,i+1,…fm,NIs the m-th side after sortingiSet of attributes to the Nth attribute evaluation function, μ (F)m,i)=μ(fm,i+fm,i+1+...+fm,N-1+fm,N) For any two attribute evaluation functions f with different sequence numbers in the sorted attribute evaluation function setk'And fj' the density value of the fuzzy measure satisfies the following relation:
μ(fm,k'+fm,j')=μ(fm,k')+μ(fm,j')+λmμ(fm,k')μ(fm,j') K '≠ j', where μ (F)N+1)=0。
In step (3.1) fm,kWith its density function mu (f) of fuzzy measurem,k) The correspondence of (a) is obtained as follows: let mu (f)m,k) Is fm,kThird order function of, i.e. mu (f)m,k)=afm,k+bf2 m,k+f3 m,kWherein, for the kth attribute of all edges, the following condition is satisfied:
a+b=1,
Figure BDA0001187456950000033
wherein p isk_meanIs the average value of the k-th attribute of all edges in the full-network topology structure.
Compared with the prior art, the invention has the beneficial effects that:
(1) the routing method can obtain the optimal route under the condition of multi-attribute routing, and overcomes the limitation that the prior art only carries out routing decision according to single attribute;
(2) the relevance among the attributes is fully considered by the selected fuzzy measure, and the cost of each link can be evaluated in an all-around manner;
(3) the method adopts linear mapping to calculate the attribute value evaluation function, has small calculation complexity, is suitable for the calculation of the on-satellite router, and can truly and reasonably reflect the quality degree of the attribute parameters;
(4) the method adopts the third-order function to fit the fuzzy measure of the attributes, has simple and effective model, flexible parameter adjustment and strong adaptability, can select any number of attributes, and has no restriction on the specific selection of the attributes.
Drawings
FIG. 1 is a flow chart of a multi-attribute optimal routing method of the present invention;
fig. 2 is an abstract view of a satellite network according to an embodiment of the invention.
Detailed Description
The invention is described in detail below with reference to the drawings and the detailed description.
As shown in figure 1, the invention provides a multi-attribute optimal routing method applied to a low-orbit information network, which is based on a known full-network topological structure, replaces classical additive measurement with fuzzy measurement, takes Choquet fuzzy integral based on the fuzzy measurement as an integrated operator, converts multi-attribute parameters into single comprehensive attribute evaluation parameters, and then utilizes a shortest path algorithm to perform routing. The method comprises the following specific steps:
(1) selecting N attributes which can represent the network quality; such as bandwidth, cost, latency, etc.
(2) (2) calculating an evaluation function f of each attribute value of all edges in the whole network topology structurem,k(x) K is 1 to N, M is 1 to M, and M is the total number of edges of the topology structure of the whole network; f. ofm,k(x) The specific calculation formula of (A) is as follows:
Figure BDA0001187456950000041
in which x is the numbermK-th attribute value, p, of an edgek_bestRepresents the maximum value, p, of the kth attribute of all edges in the full-network topologyk_worstThe minimum value of the k-th attribute of all edges in the full-network topological structure; p is a radical ofk_bestAnd pk_worstObtained by counting the past data.
Evaluation function f of the above attribute valuesm,k(x) For linear mapping, attribute optimum pk_bestMapping to 1, attribute worst value pk_worstThe mapping is 0. Taking the cost attribute as an example, pk_bestThe value of (1) is the minimum value of the path cost in all loop-free paths from the source point S to other nodes; p is a radical ofk_worstThe maximum value of the path cost in all loop-free paths from the source point S to other nodes is the upper limit and the lower limit that the attribute of the path can reach in the routing process. The linear mapping is adopted because the calculation complexity is small, the linear mapping is suitable for the calculation of the on-satellite router, and the quality degree of the attribute parameters can be reflected really and reasonably.
(3) Calculating the network quality of each edge in the topology structure of the whole networkNChoquet fuzzy integral value A of evaluation function of each attributem
(3.1) abbreviation fm,k(x)=fm,kAccording to fm,kWith its density function mu (f) of fuzzy measurem,k) Determining the fuzzy measure mu (f) of N attributes of the mth edge representing the quality of the networkm,k) Specific value of (a), abbreviated as μ (f)m,k) Is mum,k
The fuzzy measure mu on the set of attributes is used to describe the importance of a certain attribute or several attributes. Can be determined by the following method:
fm,kwith its density function mu (f) of fuzzy measurem,k) The correspondence of (a) is obtained as follows: let mu (f)m,k) Is fm,kThird order function of, i.e. mu (f)m,k)=afm,k+bf2 m,k+f3 m,kWherein, for the kth attribute of all edges, the following condition is satisfied:
a+b=1,
Figure BDA0001187456950000051
wherein p isk_meanIs the average value of the k-th attribute of all edges in the full-network topology structure.
And can also be obtained by table look-up according to experience.
(3.2) fuzzy measure density mu according to N attributes of all edgesm,kAnd calculating a fuzzy measure parameter lambda according to the following formula:
Figure BDA0001187456950000061
(3.3) the m-th edge determined according to step (3.1) represents the fuzzy measure mu (f) of the N attributes of the network qualitym,k) And (3) calculating the Choquet fuzzy integral value A according to the specific value and the fuzzy measure parameter lambda determined in the step (3.2)m:
Will f ism,kSorting from small to large to obtain fm,i,i=1~N:
Figure BDA0001187456950000062
In the formula, Fm,i={fm,i,fm,i+1,…fm,NIs the m-th side after sortingiSet of attributes to the Nth attribute evaluation function, μ (F)m,i)=μ(fm,i+fm,i+1+...+fm,N-1+fm,N) For any two attribute evaluation functions f with different sequence numbers in the sorted attribute evaluation function setk'And fj' the density value of the fuzzy measure satisfies the following relation:
μ(fm,k'+fm,j')=μ(fm,k')+μ(fm,j')+λmμ(fm,k')μ(fm,j') K '≠ j', where μ (F)N+1)=0。
(4) And (4) calculating the fuzzy integral value A calculated in the step (3)mAnd as the measurement weight of the edge in the network, calculating by utilizing a Dijkstra algorithm to obtain the optimal route.
Example (b):
as shown in fig. 2, G is a satellite network abstraction graph (the graph is connected), and there are 5 nodes and 6 edges in the graph.
(1) Selecting two attributes x capable of indicating network quality1,x2Wherein x is1As a tariff, x2Is the bandwidth. The two attribute values are positive numbers;
(2) calculating an evaluation function f of each attribute value of all edges in the topology structure of the whole networkm,k(x) K is 1 to 2, and m is 1 to 6. Maximum value p of tariff in 6 edges1_bestMinimum value of p1_worst(ii) a Maximum value p of band width in 6 edges2_bestMinimum value of p2_worst(ii) a Attribute evaluation function fm,k(x) The specific calculation formula is as follows:
Figure BDA0001187456950000071
from the above formula, it can be seen that: f. ofm,k(x)∈[0,1]For the tariff attribute, a tariff evaluation function f for each edge may be obtained1,1(x1),f2,1(x1),f3,1(x1),f4,1(x1),f5,1(x1),f6,1(x1) (ii) a The bandwidth evaluation function f of each edge can be obtained for the bandwidth property1,2(x2),f2,2(x2),f3,2(x2),f4,2(x2),f5,2(x2),f6,2(x2)。
(3) Computing Choquet fuzzy integral value A of each edge in the whole network topological structure relative to 2 attribute evaluation functions representing network qualitymM is 1-6; the method specifically comprises the following steps:
(3.1) determining f (x)) The corresponding fuzzy measure density function μ (f (x)). The specific method comprises the following steps: mu (f)m,k) Is fm,kThird order function of, i.e. mu (f)m,k)=afm,k+bf2 m,k+f3 m,kAnd determining the values of the coefficients a and b by using a waiting coefficient method. According to μ (f (x) ═ af (x) + bf2(x)+f3(x) Thus, it can be seen that:
μ(0)=0
a+b=1
applying this function to the 1 st attribute (tariff) of all edges of the whole network, then:
order to
Figure BDA0001187456950000072
Wherein p is1_meanExpressed as the average of all edge tariff attributes in the full network topology.
According to the constraint conditions, coefficients a and b can be determined, so that a fuzzy measure density function mu (f) of the 6-edge tariff attribute can be determined1,1(x1)),μ(f2,1(x1)),μ(f3,1(x1)),μ(f4,1(x1)),μ(f5,1(x1)),μ(f6,1(x1)),。
Applying this function to the 2 nd attribute (bandwidth) of all edges of the whole network, then there are:
order to
Figure BDA0001187456950000073
Wherein p is2_meanExpressed as the average of all the sideband wide attributes in the full network topology.
Similarly, a fuzzy measure density function μ (f) of the bandwidth attribute of the full network may be determined1,2(x2)),μ(f2,2(x2)),μ(f3,2(x2)),μ(f4,2(x2)),μ(f5,2(x2)),μ(f6,2(x2))。
The fuzzy measure density function can also be obtained empirically by table lookup.
And (3.2) selecting a lambda fuzzy measure and evaluating the relevance among the 2 attributes. Density mu of fuzzy measure according to N attributes of all edgesm,kM is 1 to M, k is 1 to N, and the following formula calculates a fuzzy measure parameter λ:
Figure BDA0001187456950000081
the density values of the 12 fuzzy measures calculated in (3.1) are formed into a set [ mu (f)1,1(x)),μ(f2,1(x1)),μ(f3,1(x1)),μ(f4,1(x1)),μ(f5,1(x1)),μ(f6,1(x1)),μ(f1,2(x2)),μ(f2,2(x2)),μ(f3,2(x2)),μ(f4,2(x2)),μ(f5,2(x2)),μ(f6,2(x2))}
For a set of 12 elements:
Figure BDA0001187456950000082
in the formula, mui'Is a set
Figure BDA0001187456950000083
The inner elements.
Solving the above equation can obtain a fuzzy measure parameter lambda.
(3.3) computing the Choquet fuzzy integral of each side.
The specific calculation of the Choquet fuzzy integral will be described in detail by taking the calculation of the Choquet fuzzy integral of the first side as an example.
First, will { f1,1(x1),f1,2(x2) Sorting according to size, and noting f1,1(x1) Is f1,f1,2(x2) Is f2Let f be1<f2To obtain a new set { f1,f2}. Choquet fuzzy integral value A1
Figure BDA0001187456950000084
Shorthand F1,iIs Fi,F1,i+1Is Fi+1The above formula can be simplified as:
Figure BDA0001187456950000085
wherein, Fi={fi,fi+1,…fNAnd the evaluation function is a set of the ith attribute evaluation function to the Nth attribute evaluation function which are ordered from small to large. A. the1Can be further developed into:
Figure BDA0001187456950000091
wherein, FN+1=φ μ(φ)=0。
Similarly, the fuzzy integral value A of other edges can be obtainedm,m=2~M
(4) And (4) calculating the fuzzy integral value A calculated in the step (3)mAnd M is 1-M, which is used as a measurement weight of the edge in the network, and the optimal route is calculated by utilizing a Dijkstra algorithm.
Those skilled in the art will appreciate that those matters not described in detail in the present specification are well known in the art.

Claims (4)

1. A multi-attribute optimal routing method applied to a low-orbit information network is based on a known full-network topological structure and is characterized by comprising the following steps:
(1) selecting N attributes which can represent the network quality;
(2) calculating an evaluation function f of each attribute value of all edges in the topology structure of the whole networkm,k(x) K is 1 to N, M is 1 to M, and M is the total number of edges of the topology structure of the whole network;
(3) calculating the Choquet fuzzy integral value A of the evaluation function of N attribute values of each edge in the whole network topological structurem
(4) And (4) calculating the fuzzy integral value A calculated in the step (3)mAnd as the measurement weight of the edge in the network, calculating by utilizing a Dijkstra algorithm to obtain the optimal route.
2. The method according to claim 1, wherein the evaluation function f of the attribute values in step (2) ism,k(x) The specific calculation formula of (A) is as follows:
Figure FDA0002341629540000011
wherein x is the k attribute value of the mth edge, pk_bestRepresents the maximum value, p, of the kth attribute of all edges in the full-network topologyk_worstIs the minimum value of the kth attribute of all edges in the full-network topology.
3. The method according to claim 1, wherein the step (3) calculates Choquet fuzzy integral A of evaluation function of N attributes representing network quality of each edge in the topology of the whole networkmThe method comprises the following specific steps:
(3.1) abbreviation fm,k(x)=fm,kAccording to fm,kWith its density function mu (f) of fuzzy measurem,k) Determining the fuzzy measure density mu (f) of N attributes of the m-th edge representing the network qualitym,k) Specific value of (a), abbreviated as μ (f)m,k) Is mum,k
(3.2) fuzzy measure density mu according to N attributes of all edgesm,kAnd calculating a fuzzy measure parameter lambda according to the following formula:
Figure FDA0002341629540000021
(3.3) the m-th edge determined according to step (3.1) represents the fuzzy measure mu (f) of the N attributes of the network qualitym,k) In particularTaking values and the fuzzy measure parameter lambda determined in the step (3.2), and calculating a Choquet fuzzy integral value Am:
Will f ism,kSorting from small to large to obtain fm,i,i=1~N:
Figure FDA0002341629540000022
In the formula, Fm,i={fm,i,fm,i+1,…fm,NIs the m-th side after sortingiSet of attributes to the Nth attribute evaluation function, U (F)m,i)=U(fm,i+fm,i+1+...+fm,N-1+fm,N) For any two attribute evaluation functions f with different sequence numbers in the sorted attribute evaluation function setk'And fj'The density value of the fuzzy measure meets the following relational expression:
U(fm,k'+fm,j')=μ(fm,k')+μ(fm,j')+λmμ(fm,k')μ(fm,j') K '≠ j', where U (F)N+1)=0。
4. The method of claim 3, wherein f is the step (3.1)m,kWith its density function mu (f) of fuzzy measurem,k) The correspondence of (a) is obtained as follows: let mu (f)m,k) Is fm,kThird order function of, i.e. mu (f)m,k)=afm,k+bf2 m,k+f3 m,kWherein, for the kth attribute of all edges, the following condition is satisfied:
a+b=1,
Figure FDA0002341629540000023
wherein p isk_meanIs the average value of the k-th attribute of all edges in the full-network topology structure.
CN201611192384.7A 2016-12-21 2016-12-21 Multi-attribute optimal routing method applied to low-orbit information network Active CN106850431B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611192384.7A CN106850431B (en) 2016-12-21 2016-12-21 Multi-attribute optimal routing method applied to low-orbit information network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611192384.7A CN106850431B (en) 2016-12-21 2016-12-21 Multi-attribute optimal routing method applied to low-orbit information network

Publications (2)

Publication Number Publication Date
CN106850431A CN106850431A (en) 2017-06-13
CN106850431B true CN106850431B (en) 2020-05-12

Family

ID=59135979

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611192384.7A Active CN106850431B (en) 2016-12-21 2016-12-21 Multi-attribute optimal routing method applied to low-orbit information network

Country Status (1)

Country Link
CN (1) CN106850431B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107979409B (en) * 2017-12-21 2020-11-20 北京九天微星科技发展有限公司 Inter-orbit satellite communication routing method and device
CN113055079B (en) * 2021-03-12 2022-11-25 重庆邮电大学 Fuzzy logic-based routing method in low-earth-orbit satellite network

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103647664A (en) * 2013-12-13 2014-03-19 哈尔滨工业大学深圳研究生院 Distributed simulation system for deep space multi-relay satellite communication
CN103780475A (en) * 2014-02-24 2014-05-07 中国人民解放军理工大学 Spatial information network isomerism dynamic networking method based on layered autonomous area
CN104143042A (en) * 2014-06-28 2014-11-12 中国人民解放军国防科学技术大学 Method for deciding agile satellite earth observation task pretreatment scheme
CN105282242A (en) * 2015-09-29 2016-01-27 杭州天宽科技有限公司 Multiattribute information-based inter-data center data transmission scheduling method
CN105897329A (en) * 2016-06-08 2016-08-24 大连大学 Multi-service routing optimization method of LEO satellite network based on multi-objective decisions

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8566035B2 (en) * 2010-02-25 2013-10-22 International Business Machines Corporation Route optimization

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103647664A (en) * 2013-12-13 2014-03-19 哈尔滨工业大学深圳研究生院 Distributed simulation system for deep space multi-relay satellite communication
CN103780475A (en) * 2014-02-24 2014-05-07 中国人民解放军理工大学 Spatial information network isomerism dynamic networking method based on layered autonomous area
CN104143042A (en) * 2014-06-28 2014-11-12 中国人民解放军国防科学技术大学 Method for deciding agile satellite earth observation task pretreatment scheme
CN105282242A (en) * 2015-09-29 2016-01-27 杭州天宽科技有限公司 Multiattribute information-based inter-data center data transmission scheduling method
CN105897329A (en) * 2016-06-08 2016-08-24 大连大学 Multi-service routing optimization method of LEO satellite network based on multi-objective decisions

Also Published As

Publication number Publication date
CN106850431A (en) 2017-06-13

Similar Documents

Publication Publication Date Title
CN108521375B (en) SDN-based network multi-service flow QoS transmission and scheduling method
CN105897329B (en) LEO satellite network multi-service routing optimization method based on multiobjective decision-making
Duffield et al. Multicast inference of packet delay variance at interior network links
Yarkan et al. Exploiting location awareness toward improved wireless system design in cognitive radio
CN102158417A (en) Method and device for optimizing multi-constraint quality of service (QoS) routing selection
Hooghiemstra et al. Delay distributions on fixed internet paths
EP1655893A1 (en) Simulated annealing for traffic matrix estimation
CN106850431B (en) Multi-attribute optimal routing method applied to low-orbit information network
CN106685745B (en) A kind of constructing network topology method and device
CN1992674B (en) Method of multi-dimensional packet classification based on muti-bit segmentation
EP1798894A1 (en) A fast simulated annealing for traffic matrix estimation
CN101815002A (en) Method for evaluating overall performance of network based on multi-measure deviation maximization
CN109327401A (en) A kind of traffic scheduling method and system of SDN network
CN113190939A (en) Large sparse complex network topology analysis and simplification method based on polygon coefficient
CN105357132B (en) A kind of multiple domain ASON damages based on hypergraph model perceive multicast route method
CN113098713A (en) End-to-end reliability assessment method for spatial information network
CN115879806A (en) Power system and traffic network vulnerability assessment method based on complex network
CN103595652B (en) The stage division of QoS efficiency in a kind of powerline network
CN113630171A (en) Satellite network k-terminal reliability analysis method based on QoS
CN107635235A (en) A kind of multiband matches somebody with somebody the more radio frequencies of electricity consumption mobile Ad hoc network and method for channel allocation
Celik et al. Effect of application mapping on network-on-chip performance
Olama et al. Stochastic differential equations for modeling, estimation and identification of mobile-to-mobile communication channels
KR102006292B1 (en) Apparatus and method for transporting multimedia using FEC, and DNN model selecting apparatus for determining FEC parameter
CN103152751A (en) Energy-saving transmission adaptive LMS (Least-Mean Squares) distributed detection method for wireless sensor network
CN113747536B (en) QoS-aware multi-path routing method of WSNs in mobile environment

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