[go: up one dir, main page]

CN108418756B - A software-defined backhaul network access selection method based on similarity measure - Google Patents

A software-defined backhaul network access selection method based on similarity measure Download PDF

Info

Publication number
CN108418756B
CN108418756B CN201810062366.XA CN201810062366A CN108418756B CN 108418756 B CN108418756 B CN 108418756B CN 201810062366 A CN201810062366 A CN 201810062366A CN 108418756 B CN108418756 B CN 108418756B
Authority
CN
China
Prior art keywords
node
network flow
network
service
candidate
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
CN201810062366.XA
Other languages
Chinese (zh)
Other versions
CN108418756A (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.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
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 Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN201810062366.XA priority Critical patent/CN108418756B/en
Publication of CN108418756A publication Critical patent/CN108418756A/en
Application granted granted Critical
Publication of CN108418756B publication Critical patent/CN108418756B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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
    • H04L45/124—Shortest path evaluation using a combination of metrics
    • 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
    • H04L45/121—Shortest path evaluation by minimising delays
    • 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
    • H04L45/123—Evaluation of link metrics
    • 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
    • H04L45/125—Shortest path evaluation based on throughput or bandwidth
    • 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/302—Route determination based on requested QoS
    • H04L45/306—Route determination based on the nature of the carried application
    • H04L45/3065—Route determination based on the nature of the carried application for real time traffic
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality

Landscapes

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

Abstract

本发明公开了一种基于相似性度量的软件定义回程网络接入选择方法，首先为每个基站生成输出至回程网的网络流；其次，为网络流在回程网中选择满足带宽资源要求的边缘节点作为候选节点；然后计算候选节点处性能参数的二维向量与业务特征参数的二维向量之间的加权欧氏距离；接着，选择平均距离最小的候选节点作为初次接入节点；最后，在回程网络中存在过载的边缘节点时重新为接入该节点的网络流进行接入选择操作，消除过载问题，得到每个网络流的最终接入节点。本发明在考虑基站处业务特征的前提下，为网络流选择最佳回程接入节点，使得业务在进入回程网时就能够更加靠近满足其特征的链路与节点，提升不同业务类型在回程网路由时的满意度。

Figure 201810062366

The invention discloses a software-defined backhaul network access selection method based on similarity measure. First, a network flow output to the backhaul network is generated for each base station; secondly, an edge that meets bandwidth resource requirements is selected in the backhaul network for the network flow. node as a candidate node; then calculate the weighted Euclidean distance between the two-dimensional vector of performance parameters at the candidate node and the two-dimensional vector of service feature parameters; then, select the candidate node with the smallest average distance as the initial access node; When there is an overloaded edge node in the backhaul network, the access selection operation is performed again for the network flow accessing the node, the overload problem is eliminated, and the final access node of each network flow is obtained. The invention selects the best backhaul access node for the network flow under the premise of considering the service characteristics at the base station, so that the service can be closer to the links and nodes satisfying its characteristics when the service enters the backhaul network, and improves the performance of different service types in the backhaul network. Satisfaction when routing.

Figure 201810062366

Description

Software defined backhaul network access selection method based on similarity measurement
Technical Field
The invention relates to the field of Software Defined Networking (SDN), in particular to a software defined backhaul network access selection method based on similarity measurement under the scene of considering the service characteristic requirements of a wireless access network.
Background
With the full development and gradual deepening of 5G research, core concepts of network service fusion and on-demand service provision are followed, and the service types in the wireless access network are no longer limited to the service data between people, but are expanded to the data interaction between people and things, such as: real-time services with different requirements on time delay, or non-real-time services such as Web page browsing and the like responding as required, and best-effort services such as e-mails and the like without specific requirements on time delay; and various Internet of things intelligent terminal services, sensor data, short-distance wireless communication and other service types under the scene of Internet of things equipment interconnection. In addition to the rich and diverse types of services, the throughput that the future network needs to bear will be several times that of the present network. Therefore, the industry focuses on improving the efficiency of the backhaul network between the radio access network and the core network.
In the face of an access scene with abundant service types and huge data volume, the defects of the traditional wired or wireless backhaul technology gradually appear, so that a network control and forwarding mechanism must be reconstructed to meet the requirement of mass data forwarding processing in a future network. With the continuous deep and development of Software Defined Networking (SDN) research, in a scenario in which a radio access Network service is considered, it is possible to select a better access for the service by using a Software Defined backhaul Network.
Disclosure of Invention
The invention aims to solve the technical problem of the prior art and provides a software-defined backhaul network access selection method based on similarity measurement, which measures the similarity between the total service characteristics and the node performance in a network flow by calculating the weighted Euclidean distance between service characteristic parameter vectors and node performance parameter vectors, and selects an optimal backhaul access node for the network flow, so that the service can be closer to links and nodes meeting the characteristic requirements when entering a backhaul network, and the satisfaction degree of different service requirements in backhaul network routing is improved.
The invention adopts the following technical scheme for solving the technical problems:
a software defined backhaul network access selection method based on similarity measurement comprises the following steps:
step 1), after the characteristics of the service at the base station are obtained, generating a network flow meeting the requirement of service bandwidth for the base station;
step 2), after the nodes of the backhaul network and the link state information are collected, for each network flow, selecting the nodes of which the residual available bandwidth resources exceed the bandwidth of the network flow from the edge nodes as candidate nodes of the network flow;
step 3), for each network flow with candidate nodes:
step 3.1), enabling a two-dimensional vector formed by the time delay and the packet loss rate parameters of the time delay sensitive service in the network flow to be a first two-dimensional vector of the network flow, and enabling a two-dimensional vector formed by the time delay and the packet loss rate parameters of the packet loss sensitive service in the network flow to be a second two-dimensional vector of the network flow;
step 3.2), respectively calculating the weighted Euclidean distance between the first two-dimensional vector of the network flow and the two-dimensional vector formed by the network performance parameters at each candidate node, namely the first weighted Euclidean distance of the network flow corresponding to each candidate node;
step 3.3), respectively calculating the weighted Euclidean distance between the second two-dimensional vector of the network flow and the two-dimensional vector formed by the network performance parameters at each candidate node, namely the second weighted Euclidean distance of the network flow corresponding to each candidate node;
step 4), for each network flow with candidate nodes, calculating the average value of the first weighted Euclidean distance and the second weighted Euclidean distance of each candidate node corresponding to the network flow, and selecting the candidate node with the minimum average value as the primary access node of the network flow;
and 5) after each network flow with the candidate nodes is accessed to the backhaul edge node, determining whether an overload node with the total bandwidth requirement of the accessed network flow exceeding the residual available bandwidth resource of the node exists in the network, and if so, adjusting the network flow accessed to the overload node to eliminate the overload problem.
As a further optimization scheme of the software-defined backhaul network access selection method based on the similarity metric, the detailed steps of step 1) are as follows:
in the current access selection process, the characteristics of the service accessed to each base station comprise a bandwidth parameter, a time delay parameter and a packet loss rate parameter, and the sum of the bandwidth requirements of the service accessed to the base station is used as the bandwidth size output to the backhaul network flow at the base station to generate the network flow.
As a further optimization scheme of the software-defined backhaul network access selection method based on the similarity metric, the detailed steps of step 2) are as follows:
after state information of edge nodes and connecting links of the software-defined backhaul network is collected, edge nodes conforming to the principle are selected as candidate nodes for the network flow of each base station according to the principle that the remaining available bandwidth resources at the nodes can meet the network flow of the base station, wherein the remaining available bandwidth resources are calculated by the difference between the sum of the upper capacity limits of the links connected with the nodes and the sum of the used bandwidths of the links.
In the step 3), the time delay and packet loss rate parameters of the network performance of the candidate nodes corresponding to the network flow are expressed in a two-dimensional vector form, and if the candidate nodes are connected with a plurality of links, the time delay and packet loss rate values in the vector respectively select the time delay average value and the packet loss rate average value of the plurality of links; similarly, for the delay and packet loss sensitive services in the network flow, the characteristic requirement parameters of each service on the delay and packet loss rate are expressed in a two-dimensional vector form; and calculating the weighted Euclidean distance between the two-dimensional vectors by adjusting different service characteristic weight coefficients, and respectively measuring the similarity between the delay sensitive service and the network performance of the candidate node and the similarity between the packet loss rate sensitive service and the network performance of the candidate node by using the calculated Euclidean distance, wherein the weight coefficient of the service characteristic is the weight given to the delay or the packet loss rate according to the importance of the delay or the packet loss rate when the Euclidean distance is calculated.
In step 4), because there is only one network flow from each base station, and the network flow contains different service characteristic requirements, in order to better satisfy each service requirement simultaneously, an average value of euclidean distances between delay and packet loss sensitive service characteristic requirement parameter vectors and candidate node performance parameter vectors in the network flow is calculated, and a candidate node with the minimum average distance is selected as a primary access node of the base station.
As a further optimization scheme of the software-defined backhaul network access selection method based on the similarity metric of the present invention, in step 5), when there is an overloaded node in the network where the total bandwidth requirement of the access network flow exceeds the remaining available bandwidth resources of the node, the specific steps of adjusting the network flow accessing the overloaded node and eliminating the overload problem are as follows:
when the network has overload edge nodes, namely after network streams are all accessed to the edge nodes, the residual available bandwidth resources of the nodes cannot meet the bandwidth requirement of the total network streams, firstly, the number of base stations accessed by the overload nodes is judged, and secondly, the base station with the minimum flow is selected from the network streams of the base stations for re-access operation;
the specific process of the re-access operation is as follows: selecting an edge node with a small average Euclidean distance between a service characteristic requirement vector and a candidate node performance parameter vector from candidate nodes of a base station network flow as a next access node of the base station;
continuously repeating the re-access operation process until a node which does not generate overload problem is selected as a final access node for the network flow; meanwhile, if the number of times of the re-access operation of the network flow is greater than the number of the candidate nodes, it indicates that the network flow currently input to the backhaul network by the base station cannot be forwarded temporarily, and the network flow waits for the next access selection process.
Compared with the prior art, the invention adopting the technical scheme has the following technical effects:
1. the invention fully utilizes the software defined network technology to collect the node and link state information and grasps the parameter conditions of the network time delay, the packet loss rate and the like at each return edge node. Because the number and types of the services at each base station are different, the similarity between the services in the network flow and the network performance at the nodes is measured by calculating the average value of the weighted Euclidean distances, and the optimal backhaul access node is selected for the network flow. Different from the situation that the network flow is randomly accessed to the backhaul node, the access node is selected by measuring the similarity, the network flow can be accessed from the node which is more consistent with the service characteristics, when the delay-sensitive service in the network flow is forwarded in the backhaul network, the service which is sensitive to the packet loss rate passes through the link which has better delay performance, and when the packet loss rate is forwarded, the service which is sensitive to the packet loss rate passes through the link which has less packet loss condition, so that different services are closer to the link which meets the requirements when entering the backhaul network for routing, and the satisfaction degree of different service requirements in the network is improved.
2. The invention fully utilizes the idea of similarity measurement, network performance parameters at nodes and service characteristic requirement parameters in network flows to be accessed are expressed by vectors, and the similarity between the service characteristics and the node performance is measured by calculating the weighted Euclidean distance.
Drawings
FIG. 1 is a diagram of an application scenario of the present invention;
FIG. 2 is a schematic diagram of a candidate node based on available bandwidth resources according to the present invention;
fig. 3 is a flowchart of a method for selecting access to a software-defined backhaul network based on a similarity metric according to the present invention.
Detailed Description
The technical scheme of the invention is further explained in detail by combining the attached drawings:
FIG. 1 is a diagram of an application scenario of the present invention: in this scenario, the base station sends the service data to the backhaul network for routing in the form of network flow, and the switch nodes in the backhaul network are divided into two types: the network flow forwarding method comprises a forwarding node and an edge node, wherein the edge node accesses a network flow from a base station, and the two nodes can forward the flow. In addition, the SDN controller can keep track of node and link state information of the entire network, including the time required for one end of a link to transmit to the other end, the packet loss rate of the transmission process, and the link capacity upper limit and the used bandwidth resource condition.
FIG. 2 is a schematic diagram of candidate nodes based on available bandwidth resources:
(1) initializing a base station network flow: after the characteristics of bandwidth, time delay and packet loss rate of all services at a base station are determined, taking the sum of all service bandwidths accessed by the current base station as the size of a network flow;
(2) updating the candidate node set for each network flow: obtaining available bandwidth resources at an edge node according to network state information collected by an SDN controller: the difference between the sum of the upper capacity limits of the connected links and the sum of the used bandwidths of the links; for each network flow, selecting nodes with the residual available bandwidth resources exceeding the bandwidth size of the network flow as candidate nodes, and updating the candidate nodes to a candidate node set Ve,m。
Fig. 3 is a flowchart of a method for selecting access to a software-defined backhaul network based on a similarity metric according to the present invention:
(1) representing the time delay and packet loss rate performance parameters of each node in the candidate node set in a two-dimensional vector form: y (h) ═ th,ph],h∈Ve,m；
(2) The characteristic parameters of time delay and packet loss rate of the time delay sensitive service are converted into [ t ] by a vector epsilon (i)i,pi]I-1, …, u, and similarly, the packet loss sensitive service parameter is expressed as
Figure BDA0001555695900000041
And u and v represent the number of services, and t and p represent time delay and packet loss requirement parameters of the services.
(3) Taking into account the different characteristics of the various services in the network flow, a formula is used
Figure BDA0001555695900000042
Calculating weighted Euclidean distances between a plurality of delay sensitive service vectors epsilon (i) and y (h) in the step (2), and simultaneously utilizing a formula
Figure BDA0001555695900000043
Calculating a plurality of packet loss sensitive traffic vectors in (2)
Figure BDA0001555695900000044
And y (h), wherein: alpha is more than 0.5, beta is less than 0.5, alpha + beta is 1, alpha and beta represent service characteristic weight coefficients, namely when measuring the similarity between the delay sensitive service and the network performance of the candidate node, alpha is more than 0.5 represents whether the delay parameters are more similar and is more important when calculating the Euclidean distance, and beta is less than 0.5 represents whether the packet loss rate parameters are more similar and is more important when calculating the Euclidean distance.
(4) Obtaining the weighted Euclidean distance w between a plurality of time delay and packet loss sensitive service parameter vectors and the node performance parameter vector in the network flow by the calculation in the step (3)i,hAnd wj,hWherein i is 1, …, u, j is 1, …, V, h e Ve,mIn each access selection process, the network flow output to the backhaul network by the base station simultaneously contains a plurality of different types of services, so that the candidate node set V is targeted ate,mCalculating the average Euclidean distance of each node
Figure BDA0001555695900000045
The similarity between the overall service characteristics of the network flow and the node delay and packet loss rate performance is measured by the average Euclidean distance, so that the aim of selecting the node with the maximum similarity from the candidate nodes of the network flow for access is fulfilled, namely: comparing the average Euclidean distance of each node h in the candidate node set
Figure BDA0001555695900000051
And selecting the node with the minimum average Euclidean distance as the initial access node, and considering the node as the node with the maximum similarity with the overall service characteristics of the network flow.
(5) After the initial access node selection of the network flow is completed, the SDN controller collects the network flow state information at the edge node, judges whether an overload node exists when the total bandwidth demand of the network flow of the network exceeds the residual available bandwidth resource of the node, and if the overload node exists, adjusts the selection of the access node according to the following contents:
firstly, judging the number of base stations accessed by the overload node, namely the number of network flows accessed by the overload node; secondly, selecting the base station with the minimum flow from the network flows of the plurality of base stations to perform the re-access operation: in the candidate nodes of the base station network flow, selecting edge nodes with the minimum average Euclidean distance between the service characteristic request vector and the candidate node performance parameter vector, namely: for the
Figure BDA0001555695900000052
When in use
Figure BDA0001555695900000053
When the corresponding node is overloaded, the nodes are selected in sequence
Figure BDA0001555695900000054
Taking the nodes corresponding to the equal average distance as access nodes until the nodes which can meet the bandwidth requirement and cannot generate overload problems are selected for the base station; in addition, if the number of the re-access operations of the network flow is greater than the number of the candidate nodes, it indicates that the network flow currently input to the backhaul network by the base station cannot be forwarded temporarily, so that the network flow waits for the next access selection process. Through the re-access operation, the problem of node overload in the current access selection process is solved.
It will be understood by those skilled in the art that, unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the prior art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
The above-mentioned embodiments, objects, technical solutions and advantages of the present invention are further described in detail, it should be understood that the above-mentioned embodiments are only illustrative of the present invention and are not intended to limit the present invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (4)

1.一种基于相似性度量的软件定义回程网络接入选择方法，其特征在于，包括如下步骤：1. a software-defined backhaul network access selection method based on similarity measurement, is characterized in that, comprises the following steps: 步骤1)，在获得基站处业务的特征后，为基站生成满足业务带宽要求的网络流；Step 1), after obtaining the characteristics of the service at the base station, generate a network flow that meets the service bandwidth requirement for the base station; 步骤2)，在采集回程网节点及链路状态信息后，对于每个网络流，在边缘节点中选择剩余可用带宽资源超过网络流带宽的节点作为该网络流的候选节点，用如下二维向量来表示：Step 2), after collecting the backhaul network node and link state information, for each network flow, select the node whose remaining available bandwidth resources exceed the network flow bandwidth in the edge node as the candidate node of the network flow, and use the following two-dimensional vector To represent: y(h)＝[th,ph],h∈Ve,m y( h )＝[t h ,ph ],h∈V e,m 其中，th为时延参数，ph为丢包率参数，Ve,m为候选节点集合；Among them, t h is the delay parameter, ph is the packet loss rate parameter, and V e,m is the candidate node set; 步骤3)，对于存在候选节点的各个网络流，按照如下步骤计算各个候选节点与网络流的第一加权欧氏距离、第二加权欧氏距离；Step 3), for each network flow with candidate nodes, calculate the first weighted Euclidean distance and the second weighted Euclidean distance between each candidate node and the network flow according to the following steps; 步骤3.1)，令网络流中时延敏感业务的时延和丢包率参数构成的二维向量为该网络流的第一二维向量、网络流中丢包敏感业务的时延和丢包率参数构成的二维向量为该网络流的第二二维向量；Step 3.1), let the two-dimensional vector formed by the delay and packet loss rate parameters of the delay-sensitive service in the network flow be the first two-dimensional vector of the network flow, and the delay and packet loss rate of the packet-loss-sensitive service in the network flow. The two-dimensional vector formed by the parameters is the second two-dimensional vector of the network flow; 第一二维向量按照如下式来表示：The first two-dimensional vector is represented as follows: ε(i)＝[ti,pi],i＝1,…,uε(i)=[t i , p i ], i=1,...,u 其中，u表示网络流中时延敏感的业务个数，t、p分别表示业务的时延、丢包要求参数；Among them, u represents the number of delay-sensitive services in the network flow, and t and p represent the delay and packet loss requirement parameters of the service, respectively; 第二二维向量按照如下式来表示：The second two-dimensional vector is represented as follows:
Figure FDA0002883812220000011
Figure FDA0002883812220000011
 其中，v表示网络流中丢包敏感的业务个数，t、p分别表示业务的时延、丢包要求参数；Among them, v represents the number of services that are sensitive to packet loss in the network flow, and t and p represent the service delay and packet loss requirement parameters, respectively; 步骤3.2)，分别计算该网络流的第一二维向量和各个候选节点处网络性能参数构成的二维向量之间的加权欧氏距离，即该网络流对应其各个候选节点的第一加权欧氏距离；Step 3.2), calculate the weighted Euclidean distance between the first two-dimensional vector of the network flow and the two-dimensional vector formed by the network performance parameters at each candidate node, that is, the first weighted Euclidean distance corresponding to each candidate node of the network flow. distance; 按照如下公式计算各个时延敏感业务向量ε(i)与候选节点的二维向量y(h)之间的加权欧氏距离，即第一加权欧氏距离；Calculate the weighted Euclidean distance between each delay-sensitive service vector ε(i) and the two-dimensional vector y(h) of the candidate node according to the following formula, that is, the first weighted Euclidean distance;
Figure FDA0002883812220000012
Figure FDA0002883812220000012
 其中，α表示业务特征权重系数，且α＞0.5；Among them, α represents the service feature weight coefficient, and α>0.5; 步骤3.3)，分别计算该网络流的第二二维向量和各个候选节点处网络性能参数构成的二维向量之间的加权欧氏距离，即该网络流对应其各个候选节点的第二加权欧氏距离；Step 3.3), respectively calculate the weighted Euclidean distance between the second two-dimensional vector of the network flow and the two-dimensional vector formed by the network performance parameters at each candidate node, that is, the second weighted Euclidean distance corresponding to each candidate node of the network flow. distance; 按照如下公式计算各个丢包敏感业务向量
Figure FDA0002883812220000014
与候选节点的二维向量y(h)之间的加权欧氏距离，即第二加权欧式距离；Calculate each packet loss sensitive service vector according to the following formula
Figure FDA0002883812220000014
The weighted Euclidean distance from the two-dimensional vector y(h) of the candidate node, that is, the second weighted Euclidean distance;
Figure FDA0002883812220000013
Figure FDA0002883812220000013
 其中，β＜0.5且α+β＝1，β表示业务特征权重系数；Wherein , β＜0.5 and α+β=1, β represents the service feature weight coefficient; 步骤4)，对于存在候选节点的各个网络流，计算该网络流对应其各个候选节点的第一加权欧氏距离、第二加权欧氏距离的平均值，选择平均值最小的候选节点作为该网络流的初次接入节点；Step 4), for each network flow with candidate nodes, calculate the average value of the first weighted Euclidean distance and the second weighted Euclidean distance corresponding to each candidate node of the network flow, and select the candidate node with the smallest average value as the network. The initial access node of the flow; 步骤5)，在存在候选节点的各个网络流都接入至回程边缘节点后，确定网络中是否存在接入网络流总带宽需求超过该节点剩余可用带宽资源的过载节点，若存在，则调整接入该过载节点的网络流，消除过载问题。Step 5), after each network flow of the candidate node is connected to the backhaul edge node, determine whether there is an overloaded node in the network whose total bandwidth requirement of the access network flow exceeds the remaining available bandwidth resources of the node, and if so, adjust the connection. network flow into the overloaded node to eliminate the overload problem. 2.根据权利要求1所述的基于相似性度量的软件定义回程网络接入选择方法，其特征在于，所述步骤1)的详细步骤如下：2. The software-defined backhaul network access selection method based on similarity metric according to claim 1, wherein the detailed steps of the step 1) are as follows: 在当前接入选择过程中，接入至各个基站的业务的特征包括带宽参数、时延参数和丢包率参数，并将接入基站的业务的带宽需求之和作为该基站处输出至回程网网络流的带宽大小，生成网络流。In the current access selection process, the characteristics of the services accessed to each base station include bandwidth parameters, delay parameters and packet loss rate parameters, and the sum of the bandwidth requirements of the services accessing the base station is output to the backhaul network as the base station The bandwidth size of the network flow, which generates the network flow. 3.根据权利要求1所述的基于相似性度量的软件定义回程网络接入选择方法，其特征在于，所述步骤2)的详细步骤如下：3. The software-defined backhaul network access selection method based on similarity metric according to claim 1, wherein the detailed steps of the step 2) are as follows: 在采集软件定义回程网络的边缘节点及其连接链路的状态信息后，根据节点处剩余可用带宽资源能够满足基站网络流的原则，为每个基站的网络流选择符合原则的边缘节点作为候选节点，其中剩余可用带宽资源由该节点所连链路的容量上限之和与链路已用带宽之和的差值计算得到。After collecting the status information of edge nodes and their connecting links in the software-defined backhaul network, according to the principle that the remaining available bandwidth resources at the node can satisfy the network flow of the base station, select the edge node that meets the principle as the candidate node for the network flow of each base station. , where the remaining available bandwidth resource is calculated by the difference between the sum of the upper limit of the capacity of the link connected to the node and the sum of the used bandwidth of the link. 4.根据权利要求1所述的基于相似性度量的软件定义回程网络接入选择方法，其特征在于，所述步骤5)中，网络中存在接入网络流总带宽需求超过该节点剩余可用带宽资源的过载节点时，调整接入该过载节点的网络流、消除过载问题的具体步骤如下：4. The software-defined backhaul network access selection method based on similarity metric according to claim 1, wherein in the step 5), there is an access network flow total bandwidth requirement in the network that exceeds the remaining available bandwidth of the node When the resource is overloaded at a node, the specific steps to adjust the network flow accessing the overloaded node and eliminate the overload problem are as follows: 当网络存在过载边缘节点时，即在网络流均接入至边缘节点后，该节点剩余可用带宽资源无法满足总网络流带宽要求，首先判断过载节点接入的基站个数，其次从多个基站的网络流中选择流量最小的基站进行重新接入操作；When there is an overloaded edge node in the network, that is, after all network flows are connected to the edge node, the remaining available bandwidth resources of the node cannot meet the total network flow bandwidth requirements. Select the base station with the least traffic in the network flow for re-access operation; 所述重新接入操作的具体过程是：在基站网络流的候选节点中，选择业务特征要求向量与候选节点性能参数向量之间平均欧氏距离次小的边缘节点，作为该基站的下一次接入节点；The specific process of the re-access operation is: in the candidate nodes of the base station network flow, select the edge node with the second smallest average Euclidean distance between the service feature requirement vector and the candidate node performance parameter vector, as the next access of the base station. incoming node; 不断重复所述重新接入操作过程，直至为网络流选择出不会产生过载问题的节点作为其最终接入节点；与此同时，若网络流的重新接入操作的次数大于候选节点个数，则说明该基站当前输入至回程网络的网络流暂时无法被转发，让该网络流等待下一次的接入选择过程。Repeating the re-access operation process continuously until a node that will not cause an overload problem is selected for the network flow as its final access node; at the same time, if the number of re-access operations of the network flow is greater than the number of candidate nodes, It means that the network flow currently input by the base station to the backhaul network cannot be forwarded temporarily, so that the network flow waits for the next access selection process.
CN201810062366.XA 2018-01-23 2018-01-23 A software-defined backhaul network access selection method based on similarity measure Active CN108418756B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810062366.XA CN108418756B (en) 2018-01-23 2018-01-23 A software-defined backhaul network access selection method based on similarity measure

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810062366.XA CN108418756B (en) 2018-01-23 2018-01-23 A software-defined backhaul network access selection method based on similarity measure

Publications (2)

Publication Number Publication Date
CN108418756A CN108418756A (en) 2018-08-17
CN108418756B true CN108418756B (en) 2021-03-02

Family

ID=63126102

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810062366.XA Active CN108418756B (en) 2018-01-23 2018-01-23 A software-defined backhaul network access selection method based on similarity measure

Country Status (1)

Country Link
CN (1) CN108418756B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109831386B (en) * 2019-03-08 2020-07-28 西安交通大学 Optimal path selection algorithm based on machine learning under SDN
CN115828638B (en) * 2023-01-09 2023-05-23 西安深信科创信息技术有限公司 Automatic driving test scene script generation method and device and electronic equipment

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8467369B2 (en) * 2007-06-04 2013-06-18 Qualcomm Atheros, Inc. Distributed scheduling
CN105721302A (en) * 2016-03-31 2016-06-29 重庆邮电大学 A software-defined network routing method
CN106851738A (en) * 2017-01-25 2017-06-13 南京邮电大学 Towards the software definition wireless network architecture and method of the small base station super-intensive networkings of LTE
CN107193638A (en) * 2017-05-30 2017-09-22 南京邮电大学 A kind of quick self-adapted moving method of network function perceived based on multi-dimensional environment

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8467369B2 (en) * 2007-06-04 2013-06-18 Qualcomm Atheros, Inc. Distributed scheduling
CN105721302A (en) * 2016-03-31 2016-06-29 重庆邮电大学 A software-defined network routing method
CN106851738A (en) * 2017-01-25 2017-06-13 南京邮电大学 Towards the software definition wireless network architecture and method of the small base station super-intensive networkings of LTE
CN107193638A (en) * 2017-05-30 2017-09-22 南京邮电大学 A kind of quick self-adapted moving method of network function perceived based on multi-dimensional environment

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
Applying backpressure to balance resource usage in software-defined wireless backhauls;Jorge Baranda，et al;《 2015 IEEE International Conference on Communication Workshop (ICCW)》;20150914;全文 *
无线Mesh回程网的跨层优化快速算法;罗茂松,叶梧,冯穗力,张伟青;《华南理工大学学报（自然科学版）》;20120630;全文 *

Also Published As

Publication number Publication date
CN108418756A (en) 2018-08-17

Similar Documents

Publication Publication Date Title
CN104661260B (en) A kind of Wireless Mesh intelligent grid method for routing of QoS perception and load balancing
CN102355670B (en) A multi-channel wireless mesh network channel allocation method
CN113055229B (en) Wireless network self-selection protocol method based on DDQN
CN111835564B (en) A method and system for adaptive recovery of power Internet of things communication link failure
CN113784373A (en) Combined optimization method and system for time delay and frequency spectrum occupation in cloud edge cooperative network
CN113207156B (en) A wireless sensor network cluster routing method and system
CN109286959A (en) An AHP-based Vertical Handoff Method for Heterogeneous Wireless Networks
Zhu et al. Adaptive multi-access algorithm for multi-service edge users in 5G ultra-dense heterogeneous networks
CN105208624A (en) Service-based multi-access network selection system and method in heterogeneous wireless network
TWI531186B (en) Multiple-interface network device and selection method for transmitting network packets
CN113329413B (en) Multipath transmission data pre-scheduling method and system for high-speed rail scene
CN106060876B (en) A kind of method of heterogeneous wireless network equally loaded
CN114025331B (en) Heterogeneous network-based traffic system and network selection method in heterogeneous network environment
CN109617819B (en) Software-defined backhaul network routing method based on traffic classification
CN106060851A (en) Secure resource optimization method under congestion control in heterogeneous cloud wireless access network
CN108418756B (en) A software-defined backhaul network access selection method based on similarity measure
CN108901058A (en) A method for optimal selection of Internet of Things node access channel
CN106658572A (en) Dense network load balancing method based on load aware
CN115499869B (en) A vehicle-assisted edge digital twin aggregation method based on information age matching
CN114928611B (en) IEEE802.11p protocol-based energy-saving calculation unloading optimization method for Internet of vehicles
CN107911857A (en) A multi-access method based on uplink and downlink decoupling in ultra-dense heterogeneous networks
Ahdan et al. Adaptive forwarding strategy in named data networking: A survey
CN108923817B (en) Method for reducing interference between terminals in LoRa network
Capela et al. Multihoming and network coding: A new approach to optimize the network performance
CN114390489A (en) Service deployment method for end-to-end network slice

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