本申请为申请号2017100541843、申请日2017年01月24日、发明名称“基于多业务的卫星全光网络波长路由方法”的分案申请。This application is a divisional application with application number 2017100541843, application date January 24, 2017, and invention name "multi-service-based satellite all-optical network wavelength routing method".
技术领域technical field
本发明属于卫星光通信领域，具体说是一种路由方法。The invention belongs to the field of satellite optical communication, specifically a routing method.
背景技术Background technique
随着气象、遥感和军事领域应用需求的不断扩大，对卫星通信技术提出了新的要求。除了传输传统的遥测、遥控数据之外，还需要双向传输视频、音频、科学实验等多种不同类型的数据，传输数据量大，从几bit/s到几百兆bit/s不等。传统的微波式卫星很难满足技术发展的要求，激光链路式卫星具有通信容量大、功耗低、保密性和抗毁性强以及技术更新快、成本低等优势，能够很好的满足卫星通信的发展需求，成为当今研究的热点。With the continuous expansion of application requirements in meteorology, remote sensing and military fields, new requirements are put forward for satellite communication technology. In addition to transmitting traditional telemetry and remote control data, it is also necessary to transmit video, audio, scientific experiments and other types of data in two directions. The amount of transmitted data is large, ranging from a few bits/s to hundreds of megabits/s. Traditional microwave satellites are difficult to meet the requirements of technological development. Laser link satellites have the advantages of large communication capacity, low power consumption, strong confidentiality and invulnerability, fast technology updates, and low cost, which can well meet the needs of satellites. The development needs of communication has become a hot spot in today's research.
在卫星光网络中，研究的难点是波长路由问题，即波长和路由的分配RWA问题，动态的RWA问题已经被证明是NP-hard问题。如何利用双层卫星体系结构的优势以及根据全光网络带宽大、功耗低和抗毁性强等优点，建立双层卫星结构下的卫星全光网络波长路由方法是急需解决的问题。In the satellite optical network, the difficult point of research is the wavelength routing problem, that is, the distribution RWA problem of wavelength and routing, and the dynamic RWA problem has been proved to be an NP-hard problem. How to take advantage of the advantages of the double-layer satellite architecture and according to the advantages of the all-optical network, such as large bandwidth, low power consumption and strong invulnerability, to establish a wavelength routing method for the satellite all-optical network under the double-layer satellite structure is an urgent problem to be solved.
发明内容Contents of the invention
针对现有技术的不足，本发明结合MEO/LEO卫星星座特点，提出一种路由方法。该方法选路时的链路权重综合考虑时延、可用波长数因素，同时引入波长冲突度机制，从而使卫星网络节点负载均衡，减小节点压力，同时减小网络节点的阻塞率，提高了波长利用率，满足不同业务的通信需求。Aiming at the deficiencies of the prior art, the present invention proposes a routing method in combination with the characteristics of MEO/LEO satellite constellations. In this method, the link weight of the route selection comprehensively considers the time delay and the number of available wavelengths, and at the same time introduces the wavelength conflict mechanism, so that the satellite network node load is balanced, the node pressure is reduced, and the blocking rate of the network node is reduced at the same time. Wavelength utilization, to meet the communication needs of different services.
为决解卫星光网络波长路由问题，本发明的技术方案是这样实现的：一种路由方法，具体包括：In order to solve the satellite optical network wavelength routing problem, the technical solution of the present invention is achieved in this way: a routing method specifically includes:
S1：收集LEO/MEO卫星参数:轨道高度h、俯仰角θ、卫星星历参数，通过计算LEO、MEO卫星星下点之间距离的方法，以及“星下点距离最短”原则，建立LEO和MEO之间的网络拓扑结构，确定LEO卫星与唯一的MEO卫星建立链路，将LEO卫星划分区域；S1: Collect LEO/MEO satellite parameters: orbital height h, pitch angle θ, satellite ephemeris parameters, through the method of calculating the distance between LEO and MEO satellite sub-satellite points, and the principle of "shortest sub-satellite point distance", establish LEO and Network topology between MEOs, determine the link between LEO satellites and the only MEO satellite, and divide LEO satellites into regions;
S2：根据业务类型划分等级，确定业务优先级集F＝{f1,f2,…,fm}；S2: Classify according to the business type, and determine the service priority set F={f1 ,f2 ,...,fm };
S3：统计卫星的波长数，以业务优先级F＝{f1,f2,…,fm}将波长分簇，形成波长分簇集合C＝{c1,c2,…,ck}，并使m＝k；使最高优先级业务拥有最大的波长簇，即可用波长数最多；簇与簇之间可用波长有交集，提高波长利用率；S3: Count the number of wavelengths of satellites, divide the wavelengths into clusters according to the service priority F={f1 ,f2 ,…,fm }, and form a wavelength clustering set C={c1 ,c2 ,…,ck } , and make m=k; make the highest priority service have the largest wavelength cluster, that is, the number of available wavelengths is the largest; there is an intersection between the available wavelengths between the clusters, and the wavelength utilization rate is improved;
S4：以可用波长数和时延初始化链路权重C0(u,v)，其中u,v为卫星节点；S4: Initialize the link weight C0 (u, v) with the number of available wavelengths and time delay, where u, v are satellite nodes;
S5：确定K条关键路径，链路权重使用初始权重C0(u,v)；S5: Determine K critical paths, the link weight uses the initial weight C0 (u,v);
S6：基于波长冲突度的K条关键路径链路权重调整，当确定关键路径后，需要重新设置网络中关键链路权重，将关键链路权重分为两部分，初始权重和波长冲突度；S6: Adjust the link weights of K key paths based on the wavelength conflict degree. After the key path is determined, the key link weights in the network need to be reset, and the key link weights are divided into two parts, the initial weight and the wavelength conflict degree;
S7：从调整权重后的K条关键路径中选择链路权重和最小的路径建立路由，并以业务优先级为依据在对应的波长簇中分配波长；S7: Select the link weight and the smallest path from the weight-adjusted K key paths to establish a route, and allocate wavelengths in the corresponding wavelength clusters based on the service priority;
S8：更新网络拓扑结构，重新计算链路权重。S8: Update the network topology structure and recalculate link weights.
进一步地，步骤S1中建立卫星网络拓扑时，以“星下点距离最短”为原则，唯一确定LEO向MEO接入的卫星，保证LEO卫星与唯一的一个MEO卫星相连接，且两者之间的空间距离最短，减小传输时延。Further, when establishing the satellite network topology in step S1, the satellite that LEO accesses to MEO is uniquely determined based on the principle of "the shortest distance between sub-satellite points", ensuring that the LEO satellite is connected to the only MEO satellite, and the distance between the two The space distance is the shortest and the transmission delay is reduced.
进一步地，步骤S2中根据业务类型划分等级具体为：Further, in step S2, the classification according to the business type is specifically as follows:
①根据业务对时延敏感程度划分，对时延要求高的业务有较高优先级，对时延要求较低的业务有较低的优先级；②根据服务质量约定划分，按照用户级别不同，拥有不同的服务质量，划分业务不同的优先级；③根据业务重要程度划分，相对重要的业务具有较高的优先级，而一般业务具有较低的优先级。①Divided according to the sensitivity of the business to delay, the business with high delay requirements has a higher priority, and the business with lower delay requirements has a lower priority; ②Divided according to the service quality agreement, according to different user levels With different service qualities, different business priorities are divided; ③ According to the business importance, relatively important business has a higher priority, while general business has a lower priority.
进一步地，步骤S3中波长分簇时，波长分簇集合中可用波长数以业务优先级为对应依次减少，各波长簇中波长可以有交集，提高波长利用率。Further, when the wavelengths are clustered in step S3, the number of available wavelengths in the wavelength clustering set decreases in order corresponding to the service priority, and the wavelengths in each wavelength cluster can have intersections, thereby improving the wavelength utilization rate.
进一步地，步骤S4中链路初始权重计算公式为：Further, the formula for calculating the initial weight of the link in step S4 is:
其中，λ(u,v)为链路(u,v)的剩余波长数，λmax为当前网络链路中链路剩余波长数的最大值，网络中剩余波长数最大的链路的权重为1，而链路剩余波长数越小，对应权重越大。D(u,v)为链路(u,v)的传输时延，Dmin为所有链路的最小时延，α1和β为链路权重调节因子。Among them, λ(u, v) is the number of remaining wavelengths of the link (u, v), λmax is the maximum number of remaining wavelengths of links in the current network link, and the weight of the link with the largest number of remaining wavelengths in the network is 1, and the smaller the number of remaining wavelengths of the link, the greater the corresponding weight. D(u, v) is the transmission delay of the link (u, v), Dmin is the minimum delay of all links, and α1 and β are link weight adjustment factors.
更进一步地，步骤S5使用Dijkstra最短路径方法，求解K条最短路径，取K＝3-4。Furthermore, step S5 uses Dijkstra's shortest path method to find K shortest paths, where K=3-4.
更进一步地，步骤S6中波长冲突度计算公式为：Furthermore, the formula for calculating the degree of wavelength conflict in step S6 is:
其中in
式中，(s′,d′)为某一(S,D)节点对，(s,d)为当前业务流请求的(S,D)节点对，P是所有(S,D)节点对的集合，p＝|P|是集合P中元素的个数，SETi(s'd')为(s′,d′)的第i条关键路径，εi(s'd')表示路径权重的增量；μ为符号标识，当(s′,d′)与(s,d)申请的波长相同时，μ＝1；当(s′,d′)与(s,d)申请的波长不同时，μ＝-1。In the formula, (s', d') is a certain (S, D) node pair, (s, d) is the (S, D) node pair requested by the current service flow, and P is all (S, D) node pairs , p=|P| is the number of elements in the set P, SETi (s'd') is the ith key path of (s',d'), εi (s'd') represents the path Increment of weight; μ is the symbol mark, when (s',d') and (s,d) apply for the same wavelength, μ=1; when (s',d') and (s,d) apply When the wavelengths are different, μ=-1.
作为更进一步地，更改关键路径链路权重计算公式为：As a further step, change the calculation formula of the critical path link weight to:
，其中α1、β、α2分别为剩余波长数、时延、波长冲突度权重调节因子。, where α1 , β, and α2 are the weight adjustment factors of the number of remaining wavelengths, time delay, and wavelength conflict degree, respectively.
本发明由于采用以上技术方案，能够取得如下的技术效果：相较于现有技术，本发明卫星全光网络波长路由方法结合MEO/LEO双层卫星光网络特点，以MEO为区域管理者，将LEO划分区域，在每个区域内LEO有唯一的MEO卫星与其对应，路由更新在区域内进行，从而减少路由交换，提高路由收敛速度，并将波长分簇，使波长簇与业务优先级集相对应，提高波长利用率。在此基础上，综合考虑链路波长剩余数和传输时延，计算初始链路权重，同时考虑波长冲突度对关键路径链路权重的影响，进行更新建立路由。Due to the adoption of the above technical scheme, the present invention can achieve the following technical effects: Compared with the prior art, the satellite all-optical network wavelength routing method of the present invention combines the characteristics of the MEO/LEO double-layer satellite optical network, with MEO as the regional manager, the LEO is divided into areas. In each area, LEO has a unique MEO satellite corresponding to it. Routing updates are carried out in the area, thereby reducing routing exchanges, improving routing convergence speed, and grouping wavelengths into clusters so that wavelength clusters are consistent with service priority sets. Correspondingly, the wavelength utilization rate is improved. On this basis, considering the remaining number of link wavelengths and transmission delay, the initial link weight is calculated, and the influence of wavelength conflict degree on the key path link weight is considered to update and establish the route.
本发明可以实现网络负载均衡和资源的合理利用，提高了卫星光网络中波长利用率，满足不同业务的通信需求，同时使网络的阻塞率大大降低，为卫星全光网络的研究和发展提供更加有利和高效的波长路由算法。The invention can realize network load balance and rational utilization of resources, improve the utilization rate of wavelengths in the satellite optical network, meet the communication requirements of different services, and at the same time greatly reduce the blocking rate of the network, and provide more advantages for the research and development of the satellite all-optical network. Favorable and efficient wavelength routing algorithm.
附图说明Description of drawings
本发明共有附图1幅：The present invention has 1 accompanying drawing:
图1为卫星全光网络波长路由方法流程图；Fig. 1 is a flow chart of satellite all-optical network wavelength routing method;
具体实施方式Detailed ways
为了使本发明的目的、技术方案和优点更加清楚，下面结合附图和具体实施例对本发明进行详细描述。In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments.
建立MEO/LEO双层卫星网络拓扑结构，根据卫星的轨道参数和运行星历，统计一个星历周期内MEO和LEO卫星的星下点轨迹，以“星下点距离最短”为原则，建立LEO与唯一MEO卫星的对应关系，将LEO卫星划分区域，每个区域有一颗MEO卫星作为该区域的管理者，进行本区域LEO卫星路由信息的汇聚与更新以及相邻区域路由信息的交换。MEO/LEO双层全光网络中存在的星间链路众多、路由汇聚任务繁重等问题。采用分区域管理策略可以减少路由更新信息量，提高路由收敛速度。Establish a MEO/LEO double-layer satellite network topology structure, calculate the sub-satellite trajectory of MEO and LEO satellites within an ephemeris period according to the satellite's orbital parameters and operating ephemeris, and establish LEO based on the principle of "the shortest distance between sub-satellite points" The corresponding relationship with the only MEO satellite divides the LEO satellites into regions, and each region has a MEO satellite as the manager of the region, which aggregates and updates the routing information of the LEO satellites in the region and exchanges routing information in adjacent regions. In the MEO/LEO double-layer all-optical network, there are many inter-satellite links and heavy routing and aggregation tasks. The use of regional management strategies can reduce the amount of routing update information and increase the speed of routing convergence.
多业务波长分配，将业务划分优先级集合，波长分簇。针对不同等级业务采取波长分簇分配方法，以达到降低高优等级业务阻塞率的目的，提高波长利用率。Multi-service wavelength allocation, divide services into priority sets, and group wavelengths into clusters. The wavelength clustering allocation method is adopted for different grades of business to achieve the purpose of reducing the blocking rate of high-quality grades of business and improve the utilization of wavelengths.
为了适应多样化业务需求对QoS的不同要求，并根据光网络当前的资源使用情况提供针对性的服务，可以将用户不同类型的业务依照以下方法之一进行划分：In order to meet the different QoS requirements of diversified business needs and provide targeted services according to the current resource usage of the optical network, different types of services of users can be divided according to one of the following methods:
(1)根据业务重要程度划分：相对重要的业务具有较高的优先级，而一般的业务配置为较低的优先级；(1) Divide according to business importance: relatively important business has higher priority, while general business configuration is lower priority;
(2)根据业务性能指标要求(如时延敏感程度)划分：对时延要求比较高的业务具有较高的优先级，对时延要求较低的业务具有较低的优先级；(2) Divide according to service performance index requirements (such as delay sensitivity): services with higher delay requirements have higher priority, and services with lower delay requirements have lower priority;
(3)根据服务质量约定划分：如按照用户级别的不同，分别提供不同的服务质量。(3) Classification according to service quality agreement: For example, different service qualities are provided according to different user levels.
依照以上业务优先级划分策略，选择一种策略将业务划分优先级，形成业务优先级集合F＝{f1,f2,…,fm}，一般取m＝3或m＝4。According to the business prioritization strategy above, select a strategy to classify the business into priority, forming a service priority set F={f1 , f2 ,...,fm }, generally m=3 or m=4.
波长分簇，以业务优先级F＝{f1,f2,…,fm}为对应将波长分簇C＝{c1,c2,…,ck}，保证每个优先级对应一个波长簇即m＝k，波长簇中可用波长数以优先级为对应依次减少，各波长簇中波长可以有交集。Wavelength clustering, with service priority F={f1 ,f2 ,…,fm } as the corresponding wavelength clustering C={c1 ,c2 ,…,ck }, to ensure that each priority corresponds to a The wavelength clusters are m=k, and the number of available wavelengths in the wavelength clusters decreases in order corresponding to the priority, and the wavelengths in each wavelength cluster may overlap.
初始化链路权重，定义卫星网络链路权重为链路波长数以及链路传输时延的综合函数；Initialize the link weight, and define the satellite network link weight as a comprehensive function of the number of link wavelengths and link transmission delay;
根据链路剩余波长数和传输时延求取各个(S,D)节点对的K条最短路径，也叫关键路径。选取关键路径的原则是，各个(S,D)节点对选取链路权重是由链路波长数和传输时延计算得出的最短(最小权值)路径。链路权重与链路剩余波长数有关，有利于保持网络链路的畅通，实现网络负载均衡。同时也与传输时延有关，有利于保证实时数据的传输时延。Calculate the K shortest paths of each (S, D) node pair according to the number of remaining wavelengths of the link and the transmission delay, which are also called critical paths. The principle of selecting the critical path is that each (S, D) node pair selects the link weight is the shortest (minimum weight) path calculated from the number of link wavelengths and the transmission delay. The link weight is related to the number of remaining wavelengths of the link, which is beneficial to keep the network link smooth and realize network load balancing. At the same time, it is also related to the transmission delay, which is beneficial to ensure the transmission delay of real-time data.
每个(S,D)节点对请求的实际路径需要综合考虑所有(S,D)节点对对链路的需求状况。求取某个S、D节点对的K条关键路径的步骤如下：The actual path requested by each (S, D) node pair needs to comprehensively consider the demand status of all (S, D) node pairs for links. The steps to obtain K critical paths of a certain S, D node pair are as follows:
①根据链路剩余波长和时延设置每条链路的初始权重为：①Set the initial weight of each link according to the remaining wavelength and delay of the link:
式(1)中λ(u,v)为链路(u,v)的剩余波长数，λmax为当前网络链路中链路剩余波长数的最大值，网络中剩余波长数最大的链路的权重为1，而链路剩余波长数越小，对应权重越大。D(u,v)为链路(u,v)的传输时延，Dmin为所有链路的最小时延。α1和β为链路权重调节因子。In formula (1), λ(u, v) is the number of remaining wavelengths of the link (u, v), λmax is the maximum number of remaining wavelengths of links in the current network link, and the link with the largest number of remaining wavelengths in the network The weight of is 1, and the smaller the number of remaining wavelengths of the link, the greater the corresponding weight. D(u,v) is the transmission delay of link (u,v), and Dmin is the minimum delay of all links. α1 and β are link weight adjustment factors.
②应用式(1)得到的链路权重，通过Dijkstra算法，求出(S,D)节点对之间的一条最短路径作为关键路径。在求下一条关键路径之前，从网络中删除当前路径中权重最大的一条链路，从而保证下一条关键路径不会同前一条路径重复。②Use the link weight obtained from formula (1) to obtain a shortest path between (S, D) node pairs as the critical path through Dijkstra's algorithm. Before finding the next critical path, delete the link with the largest weight in the current path from the network, so as to ensure that the next critical path will not be repeated with the previous path.
③重复②的动作，直到当前(S,D)节点对之间不存在可达路径或获得的路径数为K(一般K取3-4)。用K′表示该(S,D)节点对间的实际关键路径数。对所有(S,D)节点对执行①到③过程，会得到所有节点的关键路径集。③ Repeat the action of ② until there is no reachable path between the current (S, D) node pair or the number of paths obtained is K (generally K is 3-4). Use K' to represent the actual number of critical paths between the (S, D) node pair. Execute the process ① to ③ for all (S, D) node pairs, and the key path set of all nodes will be obtained.
更改关键路径的链路权重，当确定关键路径后，需要重新设置网络中关键链路的权重，将关键链路的权重定义为两部分，初始权重和波长冲突度。初始权重即式(1)，波长冲突度则定义为：Change the link weight of the critical path. After the critical path is determined, the weight of the critical link in the network needs to be reset. The weight of the critical link is defined as two parts, the initial weight and the wavelength conflict degree. The initial weight is formula (1), and the wavelength conflict degree is defined as:
其中in
式(2)中(s′,d′)为某一(S,D)节点对，(s,d)为当前业务流请求的(S,D)节点对，P是所有(S,D)节点对的集合，p＝|P|是集合P中元素的个数，SETi(s'd')为(s′,d′)的第i条关键路径，εi(s'd')表示路径权重的增量；μ为符号标识，当(s′,d′)与(s,d)申请的波长相同时，μ＝1；当(s′,d′)与(s,d)申请的波长不同时，μ＝-1。In formula (2), (s', d') is a certain (S, D) node pair, (s, d) is the (S, D) node pair requested by the current service flow, and P is all (S, D) node pairs A set of node pairs, p=|P| is the number of elements in the set P, SETi (s'd') is the ith key path of (s',d'), εi (s'd') Indicates the increment of the path weight; μ is a symbol identification, when (s′,d′) and (s,d) apply for the same wavelength, μ=1; when (s′,d′) and (s,d) When the applied wavelengths are different, μ=-1.
重新设置关键链路的权重为：Reset the weight of key links as:
即链路的初始权重和波长冲突度之和。That is, the sum of the initial weight of the link and the wavelength conflict degree.
通过对关键链路权重的调整，综合考虑了链路的资源状态即剩余波长，以及各节点对在链路上的冲突和竞争。上式反应了冲突避免和竞争机制的结合，在为某(S,D)节点对预留波长链路的同时，应尽量避开其它(S,D)节点对申请相同波长的链路。当某条链路中的波长号与请求节点对外的其它节点对的申请的波长号相同时，该链路的冲突度增加μεi(s'd')(μ＝1)，意味着该链路的权重也要增加，当前请求选择路径应尽量避开该链路；而如果某条链路属于请求(S,D)节点对本身的路径时，该链路的冲突度增加μεi(s'd')(μ＝-1)，意味着该链路的权重也要降低。因此，在为当前请求选择路径时，会在一定程度上优先选择该链路。这样，在冲突避免的基础上引入竞争策略，使得在为当前请求选择路径时，一方面尽量避开申请相同波长号的其它节点对路径上的链路，另一方面，尽量优先选择当前请求节点对的路径上的链路，从而保证算法性能的高效。By adjusting the weight of the key link, the resource state of the link, that is, the remaining wavelength, and the conflict and competition of each node pair on the link are considered comprehensively. The above formula reflects the combination of conflict avoidance and competition mechanism. While reserving a wavelength link for a certain (S, D) node pair, it should try to avoid other (S, D) node pairs applying for the same wavelength link. When the wavelength number in a link is the same as the wavelength number applied by other node pairs from the requesting node, the conflict degree of the link increases μεi (s'd')(μ=1), which means that the link The weight of the path should also be increased, and the path selected by the current request should try to avoid the link; and if a link belongs to the path of the requesting (S, D) node pair itself, the conflict degree of the link increases μεi (s 'd')(μ=-1), which means that the weight of the link should also be reduced. Therefore, this link is somewhat preferred when selecting a path for the current request. In this way, a competition strategy is introduced on the basis of conflict avoidance, so that when selecting a path for the current request, on the one hand, try to avoid the links on the path of other nodes applying for the same wavelength number, and on the other hand, try to choose the current requesting node first. Links on the right path, so as to ensure the high efficiency of the algorithm performance.
本发明可以实现网络负载均衡和资源的合理利用，提高了卫星光网络中波长利用率，满足不同业务的通信需求，同时使网络的阻塞率大大降低，为卫星全光网络的研究和发展提供更加有利和高效的波长路由算法。The invention can realize network load balance and rational utilization of resources, improve the utilization rate of wavelengths in the satellite optical network, meet the communication requirements of different services, and at the same time greatly reduce the blocking rate of the network, and provide more advantages for the research and development of the satellite all-optical network. Favorable and efficient wavelength routing algorithm.
以上所述，仅为本发明较佳的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明披露的技术范围内，根据本发明的技术方案及其发明构思加以等同替换或改变，都应涵盖在本发明的保护范围之内。The above is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Anyone familiar with the technical field within the technical scope disclosed in the present invention, according to the technical solution of the present invention Any equivalent replacement or change of the inventive concepts thereof shall fall within the protection scope of the present invention.
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711362979.7ACN107835046A (en) | 2017-01-24 | 2017-01-24 | A kind of method for routing |
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710054184.3ACN106817304B (en) | 2017-01-24 | 2017-01-24 | Wavelength routing method for satellite all-optical network based on multi-service |
| CN201711362979.7ACN107835046A (en) | 2017-01-24 | 2017-01-24 | A kind of method for routing |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710054184.3ADivisionCN106817304B (en) | 2017-01-24 | 2017-01-24 | Wavelength routing method for satellite all-optical network based on multi-service |
| Publication Number | Publication Date |
|---|---|
| CN107835046Atrue CN107835046A (en) | 2018-03-23 |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711362922.7APendingCN107896189A (en) | 2017-01-24 | 2017-01-24 | Wavelength routing method for satellite all-optical network |
| CN201711362979.7APendingCN107835046A (en) | 2017-01-24 | 2017-01-24 | A kind of method for routing |
| CN201710054184.3AActiveCN106817304B (en) | 2017-01-24 | 2017-01-24 | Wavelength routing method for satellite all-optical network based on multi-service |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711362922.7APendingCN107896189A (en) | 2017-01-24 | 2017-01-24 | Wavelength routing method for satellite all-optical network |
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710054184.3AActiveCN106817304B (en) | 2017-01-24 | 2017-01-24 | Wavelength routing method for satellite all-optical network based on multi-service |
| Country | Link |
|---|---|
| CN (3) | CN107896189A (en) |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108737267A (en)* | 2018-05-23 | 2018-11-02 | 大连大学 | A kind of routing algorithm based on SDN Yu ICN satellite network frameworks |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110662123A (en)* | 2019-08-23 | 2020-01-07 | 北京邮电大学 | Service protection method and controller for optical fiber link in air-ground integrated optical network |
| CN111263417B (en)* | 2019-12-25 | 2021-07-09 | 北京邮电大学 | A user type-based service request processing method and device |
| CN114245421B (en)* | 2021-12-23 | 2022-06-24 | 军事科学院系统工程研究院网络信息研究所 | Satellite communication network flow balancing method based on tilt factor |
| CN115297498A (en)* | 2022-07-28 | 2022-11-04 | 武汉烽火技术服务有限公司 | Method and device for constructing time delay map of transmission network |
| CN115623366B (en)* | 2022-12-15 | 2023-03-10 | 鹏城实验室 | Route wavelength distribution method, device, terminal and medium of satellite all-optical network |
| CN120238176B (en)* | 2025-05-30 | 2025-08-19 | 中国人民解放军陆军工程大学 | Giant constellation network routing method and device based on pinning control |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6449478B1 (en)* | 1999-05-06 | 2002-09-10 | Ericsson Inc. | System and method for modification of satellite hop counter to reflect orbit type |
| EP1353465A2 (en)* | 2002-04-12 | 2003-10-15 | Alcatel | system and method for dynamic wavelength assignment division multiplex ring networks |
| US6684056B1 (en)* | 2000-04-10 | 2004-01-27 | Motorola, Inc. | System for providing optimal satellite communication via a MEO/LEO satellite constellation |
| US20040095907A1 (en)* | 2000-06-13 | 2004-05-20 | Agee Brian G. | Method and apparatus for optimization of wireless multipoint electromagnetic communication networks |
| US7103280B1 (en)* | 1999-06-05 | 2006-09-05 | The Directv Group, Inc. | Architecture for an optical satellite communication network |
| US20090086652A1 (en)* | 2003-10-07 | 2009-04-02 | Microsoft Corporation | Model and method for computing performance bounds in multi-hop wireless networks |
| CN101552933A (en)* | 2009-05-04 | 2009-10-07 | 中国人民解放军空军工程大学 | Optical network self-adapting route system for low/middle orbit double-layer satellite and calculating method of agent route |
| CN103346964A (en)* | 2013-07-02 | 2013-10-09 | 北京京东尚科信息技术有限公司 | Space-ground link changeover method and system based on multilayer satellite network |
| CN103647711A (en)* | 2013-12-20 | 2014-03-19 | 大连大学 | Priority mechanism based satellite network rerouting method |
| CN103825762A (en)* | 2014-02-26 | 2014-05-28 | 重庆邮电大学 | Traffic grooming and distinction importance protection method based on clustering |
| CN105262534A (en)* | 2015-11-20 | 2016-01-20 | 北京邮电大学 | Route method and route device applicable to satellite communication network |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102332950A (en)* | 2011-10-26 | 2012-01-25 | 中国电子科技集团公司第五十四研究所 | Method of speed limit and priority scheduling based on network port in satellite IP network |
| US10203762B2 (en)* | 2014-03-11 | 2019-02-12 | Magic Leap, Inc. | Methods and systems for creating virtual and augmented reality |
| WO2016200451A2 (en)* | 2015-03-11 | 2016-12-15 | The Aerospace Corporation | Satellite laser communications relay node |
| CN104967475B (en)* | 2015-06-11 | 2019-02-12 | 杭州电子科技大学 | Optical and Microwave Hybrid Transmission System for Spatial Information Network |
| CN105791118B (en)* | 2016-03-21 | 2019-04-02 | 南京邮电大学 | Method for routing towards LEO/GEO double layer minipellet |
| CN105978827A (en)* | 2016-05-09 | 2016-09-28 | 中国联合网络通信集团有限公司 | Wavelength distribution method and device |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6449478B1 (en)* | 1999-05-06 | 2002-09-10 | Ericsson Inc. | System and method for modification of satellite hop counter to reflect orbit type |
| US7103280B1 (en)* | 1999-06-05 | 2006-09-05 | The Directv Group, Inc. | Architecture for an optical satellite communication network |
| US6684056B1 (en)* | 2000-04-10 | 2004-01-27 | Motorola, Inc. | System for providing optimal satellite communication via a MEO/LEO satellite constellation |
| US20040095907A1 (en)* | 2000-06-13 | 2004-05-20 | Agee Brian G. | Method and apparatus for optimization of wireless multipoint electromagnetic communication networks |
| EP1353465A2 (en)* | 2002-04-12 | 2003-10-15 | Alcatel | system and method for dynamic wavelength assignment division multiplex ring networks |
| US20090086652A1 (en)* | 2003-10-07 | 2009-04-02 | Microsoft Corporation | Model and method for computing performance bounds in multi-hop wireless networks |
| CN101552933A (en)* | 2009-05-04 | 2009-10-07 | 中国人民解放军空军工程大学 | Optical network self-adapting route system for low/middle orbit double-layer satellite and calculating method of agent route |
| CN103346964A (en)* | 2013-07-02 | 2013-10-09 | 北京京东尚科信息技术有限公司 | Space-ground link changeover method and system based on multilayer satellite network |
| CN103647711A (en)* | 2013-12-20 | 2014-03-19 | 大连大学 | Priority mechanism based satellite network rerouting method |
| CN103825762A (en)* | 2014-02-26 | 2014-05-28 | 重庆邮电大学 | Traffic grooming and distinction importance protection method based on clustering |
| CN105262534A (en)* | 2015-11-20 | 2016-01-20 | 北京邮电大学 | Route method and route device applicable to satellite communication network |
| Title |
|---|
| BO WEN: "Routing,wavelength and time-slot-assignment algorithms for wavelength-routed optical WDM/TDM networks", 《JOURNAL OF LIGHTWAVE TECHNOLOGY》* |
| ZHE YUAN: "Routing in LEO/MEO Double-Layered Satellite Networks", 《2006 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING》* |
| 徐建勇: "支持区分业务的智能光网络路由波长分配（RWA）算法研究", 《中国优秀硕士学位论文全文数据库（信息科技辑）》* |
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108737267A (en)* | 2018-05-23 | 2018-11-02 | 大连大学 | A kind of routing algorithm based on SDN Yu ICN satellite network frameworks |
| CN108737267B (en)* | 2018-05-23 | 2020-11-27 | 大连大学 | A Routing Algorithm Based on SDN and ICN Satellite Network Architecture |
| Publication number | Publication date |
|---|---|
| CN106817304B (en) | 2019-12-13 |
| CN107896189A (en) | 2018-04-10 |
| CN106817304A (en) | 2017-06-09 |
| Publication | Publication Date | Title |
|---|---|---|
| CN106817304B (en) | Wavelength routing method for satellite all-optical network based on multi-service | |
| CN109257091B (en) | Global load balancing satellite-ground cooperative network networking device and method | |
| US10009287B2 (en) | Hierarchical software-defined network traffic engineering controller | |
| CN111130858B (en) | A Dynamic Multi-Object Virtual Network Mapping Method in SD-WAN Scenario | |
| CN108156041B (en) | A Differentiated Virtual Optical Network Mapping Method Based on Security Awareness | |
| CN112769550B (en) | A load balancing quantum key resource distribution system for data center | |
| CN105847146B (en) | A method for improving routing efficiency of hierarchically distributed SDN control plane | |
| CN106789744A (en) | Handled up resource regulating method with the height that time delay is perceived based on UNE virtualization | |
| CN101741733A (en) | Dynamic Deprivation Service Transmission Method for Spatial Information Network | |
| CN105897612A (en) | Multi-service dynamic bandwidth allocation method and system based on SDN (Software Defined Network) | |
| CN109743217B (en) | Self-adaptive resource adjusting method based on SVRA algorithm | |
| CN109067920A (en) | A kind of load balancing and method for routing for server content update | |
| CN111082978A (en) | A utility bandwidth allocation method for SDN network | |
| CN107204935B (en) | Fault probability and load balancing compromise method and system for spectrum flexible optical network | |
| CN117692824A (en) | Bandwidth allocation algorithm based on multiple subsystems | |
| CN117135691A (en) | Load balancing method for edge nodes of mobile edge cache network | |
| Xu et al. | Load‐balancing and QoS based dynamic resource allocation method for smart gird fiber‐wireless networks | |
| CN111740867B (en) | Method for automatically optimizing, scheduling and routing of wide area network service traffic | |
| Ren et al. | A sdn-based dynamic traffic scheduling algorithm | |
| Jin et al. | Utility max–min fair resource allocation for communication networks with multipath routing | |
| CN105337832B (en) | The resource allocation methods of online multicast virtual network | |
| Fajjari et al. | Novel adaptive virtual network embedding algorithm for Cloud’s private backbone network | |
| CN105471762B (en) | A kind of Time Perception service degradation method of power communication net topology | |
| CN108174446B (en) | A joint allocation method for network node link resources to minimize resource occupancy | |
| Shuai et al. | A cost-based distributed algorithm for load balancing in content delivery network |
| 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 | ||
| RJ01 | Rejection of invention patent application after publication | Application publication date:20180323 | |
| RJ01 | Rejection of invention patent application after publication |