• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    A Multi-Constraint Path Optimization Scheme Based on Information Fusion in Software Defined Network

    2024-05-25 14:42:38JinlinXuWansuPanLongleChengHaiboTanMunanYuanandXiaofengLi
    Computers Materials&Continua 2024年4期

    Jinlin Xu ,Wansu Pan ,Longle Cheng ,Haibo Tan ,Munan Yuan and Xiaofeng Li

    1Hefei Institutes of Physical Science,Chinese Academy of Sciences,Hefei,230031,China

    2University of Science and Technology of China,Hefei,230026,China

    ABSTRACT The existing multipath routing in Software Defined Network(SDN)is relatively blind and inefficient,and there is a lack of cooperation between the terminal and network sides,making it difficult to achieve dynamic adaptation of service requirements and network resources.To address these issues,we propose a multi-constraint path optimization scheme based on information fusion in SDN.The proposed scheme collects network topology and network state information on the network side and computes disjoint paths between end hosts.It uses the Fuzzy Analytic Hierarchy Process (FAHP) to calculate the weight coefficients of multiple constrained parameters and constructs a composite quality evaluation function for the paths to determine the priority of the disjoint paths.The SDN controller extracts the service attributes by analyzing the packet header and selects the optimal path for flow rule forwarding.Furthermore,the service attributes are fed back to the path composite quality evaluation function,and the path priority is dynamically adjusted to achieve dynamic adaptation between service requirements and network status.By continuously monitoring and analyzing the service attributes,the scheme can ensure optimal routing decisions in response to varying network conditions and evolving service demands.The experimental results demonstrated that the proposed scheme can effectively improve average throughput and link utilization while meeting the Quality of Service(QoS)requirements of various applications.

    KEYWORDS SDN;multi-constraint path;information fusion;FAHP

    Abbreviation

    1 Introduction

    In recent years,with the rapid development of Internet technology,various new network applications and services have shown explosive growth.To improve the open innovation of traditional network architecture and promote the optimization and selection of routing strategies,Software Defined Network (SDN) technology is a new network paradigm that collects the network state periodically and obtains the service demand from a global perspective[1,2].It can also calculate the optimal path and then issue flow rules to the forwarding plane to route data flows,further improving the flexibility of network resource allocation[3,4].With the diversity of network services,it is increasingly important to achieve the rational utilization of network resources,effectively avoid network congestion,and better improve the overall quality of network services.This puts higher requirements on SDN routing strategies.Therefore,the multipath routing strategy under SDN architecture has become one of the current research hotspots.

    Currently,most multipath high-availability transmission solutions under SDN architecture tend to be designed and optimized on the terminal,mainly in multi-path management [5,6] and path selection [7,8].These approaches face problems such as the high complexity of multi-constraint routing algorithms and lack of network global awareness when solving the problem of multi-path high availability transmission.As a result,they lead to decision lag,reduce network resource utilization,and greatly affect the implementation efficiency and Quality of Service(QoS)of upper-layer services in the network.

    In this work,we focus on multi-constraint path optimization in SDN to address the issues mentioned above.A multipath routing optimization scheme based on information fusion is proposed to meet the QoS requirements of emerging applications.The proposed scheme constructs a composite quality evaluation function based on the global network state based on the global visibility of the SDN controller to the switches and other devices,and uses the Fuzzy Analytic Hierarchy Process(FAHP)[9]to determine the weight coefficients of each parameter and compute the path priority.Based on the service attributes and QoS requirements,iterative optimization of routing strategies is carried out to meet the load balancing needs within the network.The contributions of this paper are summarized as follows:

    ? Design an SDN transmission architecture that combines network side and terminal side optimization,including three modules:Path collection,path composite quality evaluation,and routing decision.

    ? Perceive the link state of the data plane layer,evaluate the composite quality of paths,and sort the paths based on FAHP.Select the route with the highest priority as the optimal route,and adjust based on the service attributes to update the iteration path priority until the route ends.

    ? Use Mininet to construct different network topologies for experiments.The simulation experiment results show that compared with the synchronous method,the proposed method can improve network throughput and link utilization,and can meet the QoS requirements of different services.

    The rest of the paper is structured as follows.Section 2 summarizes the related work.In Section 3,we establish a multi-constraint path optimization scheme based on information fusion,using FAHP to evaluate path priority and iterating routing based on service attributes.The experimental results are presented in Section 4.We conclude the paper in Section 5.

    2 Related Work

    The research on multipath transmission in SDN faces challenges such as complex multi-constraint routing algorithms and the inability to fully utilize the advantages of SDN’s global network parameter acquisition [10,11].Consequently,further investigation and improvement in these areas within the domain of SDN-based multipath transmission.

    Abe et al.[12] proposed a modeling algorithm to find k Maximal link Disjoint Paths with Cost (kMDPC) to provide disjoint paths for SDN data planes and help in switch load-balancing.Lee et al.[13] designed an efficient routing algorithm with Segment Routing (SR) for SDN (ESRSDN)to meet the bandwidth requirements of routing requests.The algorithm considers traffic load balancing and reduces the extra cost of packet header size.Diego et al.[14]proposed a solution that enables the end-to-end QoS based on the queue support in OpenFlow,allowing operators with an SDN-enabled network to efficiently allocate the network resources according to the users’demands.Forests et al.[15]introduced a classification method for different application types and corresponding network resource allocations,which is implemented by computing programmable labels in the control plane to provide differentiated QoS guarantees for various application types.Henni et al.[16]constructed a coherent network framework in SDN that improves network video transmission performance by ensuring QoS for prioritized flows.Parsaei et al.[17] used a hybrid model of type-2 fuzzy systems and a Rhododendron optimization algorithm to find the optimal and reliable path while satisfying high-quality multi-constraint QoS.Kamath et al.[18] added a component Multiple Constraint Optimal Paths (MCOP) for packet forwarding,which selects multiple optimal paths to forward packets while considering the QoS requirements of the traffic.Ibrahim et al.[19]proposed and implemented an Energy-Aware Routing Multi-Level and mapping Problem(EARMLP)algorithm to minimize the overall power consumption in SDN-based core networks.BinSahaq et al.[20]presented a new QoS-aware routing algorithm based on SDN,which uses the state information obtained from previous optimization iterations to obtain network subgraphs of small size to avoid additional useless Dijkstra calls.Kamboj et al.[21]proposed a dynamic multipath routing scheme with perceivable QoS for improving the QoS of high bandwidth applications in SDN networks.Guo et al.[22] proposed a Multi-Constraint QoS Dual-Path routing optimization algorithm based on SDN(SDN-MCQDP),using reverse links to remove redundant dual-path links that meet multi-constraint QoS and ensure data transmission after link failure.

    With the development of artificial intelligence technology,routing strategies for SDN multipaths are gradually being applied[23–25].Hu et al.[26]proposed an intelligent driving network architecture based on SDN,which optimizes network latency and throughput at the data plane.Compared with traditional routing algorithms Open Shortest Path First(OSPF)and Equal-Cost Multi-Path routing(ECMP),it effectively improves the network load balancing ability.Huang et al.[27]proposed a nearoptimal flow control method for QoS optimization in SDN,which uses the Deep Reinforcement Learning (DRL) algorithm to solve the multipath routing problem in SDN.Under the architecture of the Internet of Things,Sun et al.[28]combined multiple machine-learning algorithms to identify and classify flows and selected the optimal transmission path for different types of applications based on multi-constrained QoS.These artificial intelligence-based routing optimization methods require a large amount of label data for training during the training process,which requires high computational complexity and still has problems in terms of routing accuracy,generalization,and fault adaptability.

    The above SDN routing solutions have improved network performance such as transmission delay,QoS,and packet loss rate,but there is still room for improvement in terms of routing calculation difficulty,link utilization,and QoS satisfaction with different services.Therefore,we propose a multi-constraint path optimization scheme based on information fusion,utilizing FAHP for routing evaluation and selection,and adjusting weight coefficients to update the iterative path priority based on the service attributes.Ultimately,achieving adaptive matching between requirements and network resources reduces network load pressure.

    3 Scheme Architecture

    Utilizing the advantages of SDN technology,design path optimization with multi-constraints,so that routing strategies can be adaptively adjusted based on service requirements and the supplydemand relationship between network resources.The overall architecture of the optimization scheme is shown in Fig.1,which mainly includes path collection,path composite quality evaluation,and routing decisions.

    Figure 1: The framework of a multi-constraint path optimization scheme based on information fusion

    The SDN control plane and data plane communicate through the OpenFlow protocol.The control plane obtains global state information by sending messages to the switches in the data plane and storing basic topology relationships.In path collection,select the optimal path that satisfies the link state,delete the current optimal path based on the jointness constraint,and iteratively update the topology relationship to obtain a disjoint path list.The path composite quality evaluation module perceives the global state and selects multiple path quality evaluation parameters based on the actual link state.Calculate the weight of each parameter through FAHP and arrange the paths in descending priority order.Based on the above,the routing decision module extracts the packet header for analysis and matching,and then selects the route with the highest priority as the optimal route.This module provides feedback on service attributes to the path composite quality evaluation module and adjusts the weight coefficients to update the iterative path priority until the routing process is completed.Moreover,extending the SDN control function to terminals can support information exchange between the control plane and terminal devices.After parsing the IP information of terminals,the control plane can send instructions to terminal devices to adjust services,achieving dynamic adaptation of service requirements and network resources.

    3.1 Path Collection

    In the initial stage,SDN controller discovery topology and link state.The controller sends flow entries in the form of flooding to all nodes connected to it in the network,requesting port information.Switches send Packet_Out packet containing Link Layer Discovery Protocol(LLDP)to the underlying nodes.When a node receives an LLDP packet sent by a neighboring node,it will send a Packet_In packet to the SDN controller containing its own and neighboring node link information.Fig.2 shows the process of topology discovery through the LLDP protocol.The SDN controller completes topology discovery and topology management based on the feedback information.Using network tools to store topology maps G(V,E),where V is the set of network nodes,and E is the set of links between these nodes.

    Figure 2: Topology discovery process

    Firstly,the disjoint path list is selected in the basic topology relationship.Assuming that the network is composed of a set of switching devicesS={s1,s2,...,sN-1},with flowsF={f1,f2,...,fn}passing through the SDN controller for path calculation and forwarding,the objective function expression of the disjoint paths is as follows:

    whereISrepresents the set of disjoint switches with different paths,Sfrepresents the available paths of flow.The constraint conditions for multi-objective functions are joint constraint and link state constraint,respectively,expressed as follows:

    whereRrepresents the path,andrlrepresents the available state of linkl.

    To meet the real-time requirements of multi-constraint QoS for applications,it is also necessary to monitor the network status.By using timestamp counters to send data flow detection between nodes,regularly polling and storing the number of bytes sent by the port,network status information such as bandwidth,latency,and jitter is calculated.The SDN controller calculates the remaining bandwidthBrbased on switch port statistics.Firstly,obtain the capacityCof each port of each switch,and then calculate the port transfer rateTrbased on traffic statistics.The remaining bandwidthBris represented as:

    For each path,the available bandwidth is the minimum remaining bandwidth value of all switch ports.Therefore,the available bandwidthBrkfor each path is:

    wherekrepresents thek-th path between two terminals.

    The delay of each link mainly includes two parts.Taking the SDN controller,switch A,and switch B as examples,the first part is the delay ofTAB(controller A-B controller) andTBA(controller B-A controller)calculated by the difference in timestamps between two data packets.Another delay isTA(controller A controller)andTB(controller B controller)between the controller and switch,which use the timestamp of the echo message defined in the OpenFlow protocol to measure.The delay between A and B is:

    Then,the delay of each link is:

    The SDN controller utilizes the Dijkstra algorithm to calculate the optimal path between the source node S and the destination node D,considering bandwidth as the weight.To obtain disjoint paths,the current calculated optimal path is deleted from the original graph,and a new topology is obtained.It is iterated sequentially until there are no available paths,and all disjoint paths are saved in the path list.Algorithm 1 describes the procedure for collecting a disjoint path list based on bandwidth.

    If the total available bandwidth of all paths is less than the bandwidth required by the service,the network will make every effort to provide the service.However,in general,the bandwidth provided by the network is greater than the service demand bandwidth.Therefore,under the premise of meeting the bandwidth demand,it is necessary to evaluate the composite quality of available paths and prioritize selecting paths with better quality.

    3.2 Path Composite Quality Evaluation

    When the bandwidth of all transmission paths exceeds the bandwidth required by the service,network resources are not fully utilized;When the bandwidth of all transmission paths is less than the bandwidth required by the service,the network will experience congestion,which affects the QoS.Dijkstra is a classic algorithm for finding the shortest path,but it is only applicable to paths that have already met the constraint conditions,so it has significant limitations.How to find the optimal transmission path that meets the constraints of flows in a shorter time has become a challenge.

    Considering the influence of various factors on the transmission path,there exists a competitive relationship among the optimization objectives and a lack of unified calculation standards.To address this issue,we introduce the FAHP to analyze the quality of paths.FAHP is a multi-criteria decision analysis method that combines fuzzy mathematics and the analytic hierarchy process,enabling the handling of decision-making problems characterized by uncertain information and strong fuzziness.In FAHP,the decision problem is decomposed into multiple sub-objectives or criteria to construct a hierarchical network model.Then,using expert judgment to fuzzily the judgment matrices at each level,a fuzzy hierarchical structure model is obtained,and the weight vectors of each level are calculated.Finally,the ranking and priority of each decision scheme in the entire hierarchical structure network are solved.

    By employing the FAHP method,we can effectively address the mutual influence and dependency relationships between decision factors,leading to more objective,scientific,and reliable decision outcomes.The usage of FAHP enhances the robustness and accuracy of the path optimization process,enabling a composite analysis of the path quality in SDN environments.

    Based on FAHP,determine decision objectives and associated factors.the evaluation criteria for path quality are established by considering the essential parameters associated with various service attributes.In this study,four evaluation parameters,namely bandwidth,delay,hop count,and packet loss rate,are selected and represented as a setU,whereU=(U1,U2,U3,U4).Fig.3 illustrates the implemented hierarchical model.

    Figure 3: A hierarchical model for path optimization

    Assume that the normalization value of thej-th(j=1,2,3,4)evaluation parameter for thei-th(i=1,2,3...n) path is denoted asxij,representing a paired selection matrix.This matrix signifies the relative importance assigned to each evaluation parameter for paths,as shown in Eq.(8):

    The fuzzy matrixX=is constructed by comparing the relative importance of evaluation parameters pairwise,where 0 ≤xij≤1 andxij+xji=1.The scale and definition are shown in Table 1.

    Table 1: The value and its definition and explanation

    If the fuzzy matrixX=satisfies the condition:

    Then,the resulting fuzzy matrixXis referred to as a fuzzy consistent matrix,wherexij=0.5,represents that parameteriand parameterjare considered equally important.If 0 ≤xij≤0.5,represents that parameterjis more important than parameteri,the smaller the value ofxij,the greater the importance of parameterjrelative to parameteri.Conversely,if 0.5 ≤xij≤1,indicates that parameteriis more important than parameterj,the larger the value ofxij,the greater the importance of parameterirelative to parameterj.

    If the fuzzy matrix does not meet Eq.(9),it needs to be transformed into a fuzzy consistent matrix.The matrixX=needs to be summed by rows:

    The elements in the fuzzy matrix are mathematically transformed to obtain the fuzzy consistent matrix:

    Based on the judgment matrix,calculate the priority weight of the importance of the parameters in this level for a certain parameter in the previous layer.The weight coefficientwof parameteriis:

    whereα=(n-1)/2,the weight coefficientwshould satisfy the constraint conditions shown in Eq.(13):

    The composite evaluation function of the path is obtained by summing up the weights of the evaluation parameters and the normalized values of the parameters.

    This function integrates the importance weights assigned to each evaluation parameter with their normalized values,thereby providing a comprehensive assessment of the path’s quality.By adjusting the weight coefficients,it is possible to modify the relative importance of different evaluation parameters in the composite quality evaluation function of the path.This allows for meeting the specific link requirements of different services.

    Based on the above,calculate the initialization weights of various evaluation parameters.Establish an initial weight table for path service quality evaluation based on Table 1,as shown in Table 2.

    Table 2: The analysis of path composite quality weight

    The matrix corresponding to the path composite quality evaluation can be obtained from Table 2:

    According to Eqs.(10)and(11),calculate the conversion to a fuzzy consistent matrix:

    Further,calculate the initialization priority weights for each parameter according to Eq.(12)as follows:w1=0.288,w2=0.261,w3=0.239,w4=0.212.From this,the importance of different indicators for evaluating the quality of path composition can be determined.

    3.3 Routing Decision

    The routing decision module adjusts the path evaluation parameters and corresponding parameter weights based on the service attributes and adjusts the paths for different flows through global optimization iterations.Algorithm 2 demonstrates the process of SDN controllers assigning deterministic paths.When the client sends the first packet to the switch,the switch uses the Packet_In in the OpenFlow protocol message to send the message to the SDN controller.The SDN Controller extracts packet header options,if it is MP_CAPABLE,select the path with the highest ranking from the path list,and send the flow table of that path to the corresponding switch.If the header option for extracting data packets is MP_JOIN,the determination of whether it is a new sub-flow can be based on the token.If the sub-flow belongs to the same connection as the previous sub-flow,the paths in the path list can be distributed sequentially.Otherwise,update the path list and allocate paths in order.For paths that require re-routing,trace back to the path composite quality evaluation module based on the original forwarding path and reevaluate the path.

    Based on the aforementioned algorithm,the overall flowchart of the proposed scheme is depicted in Fig.4.The scheme iteratively updates the routing table based on various service attributes until the routing process is completed.In the case of paths requiring re-routing,pertinent path information is extracted from the path monitoring list.Considering the current forwarding conditions within the network,the weight coefficients of the evaluation parameters are recalculated.Subsequently,the available path list is updated and transmitted to the routing decision module.This ensures that the routing process incorporates the most recent information,allowing for efficient and effective path selection based on the evaluation criteria.

    At the end of each routing iteration,the QoS parameters for each route are updated based on the utilization of the initial parameters.This ensures that the impact of the previous round is considered and applied to the subsequent rounds.Through iterative routing updates,the path availability is enhanced,while simultaneously achieving adaptive alignment between service requirements and network resources.This scheme facilitates the continuous improvement of the routing process,as the QoS parameters are dynamically adjusted based on the evolving network conditions and the changing demands of the service.

    4 Simulation Experiments and Result Analysis

    4.1 Simulation Setup

    To evaluate the performance of the proposed scheme,we conduct experiments on Mininet.The network controller uses Ryu v4.3,and the OpenFlow protocol version is 1.4.The OpenFlow switches are used to set up multiple paths,and bandwidth is controlled with the help of their meter function.We used the Iperf and Distributed Internet Traffic Generator(D-ITG)to model the flow requests in the network and generate the experimental packets using the uniform distribution method.Each host resource sends data packets to the destination,sets the controller to update the network status every 25 s,and issues a new flow table to the nodes.The capacity of each available communication link is set to 1 Gpbs,and the static buffer of the switch port is set to 300 KB.Each experiment lasts for 100 s and is repeated 10–20 times.Simulate the topology diagram using four real network topology cases from the Internet Topology Zoo dataset [29],where the Global Center topology consists of 9 nodes and 36 links;The ATT North America topology has a total of 25 nodes and 57 links;TaTa topology has a total of 145 nodes and 194 links;The Cogent topology consists of 197 nodes and 245 links.

    Figure 4: The overall process of the path optimization scheme

    The performance of the proposed scheme is validated through a comprehensive analysis of throughput,link utilization,latency,and QoS satisfaction.Simulation-based comparative experiments are conducted,comparing the proposed scheme with routing optimization schemes ESR-SDN [13],MCOP[18],and SDN-MCQDP[22],all based on the SDN architecture.

    4.2 Throughput and Link Utilization

    The throughput of schemes under different loads was compared,with experimental settings ranging from 100 to 500 requests.As depicted in Fig.5,the proposed scheme demonstrates the superiority of its path planning in achieving globally optimal transmission performance across different numbers of requests.When the number of requests is 100,there is minimal disparity in average throughput among the four schemes.However,as the number of requests increases,the average throughput increases significantly.Notably,the proposed scheme exhibits a slightly higher average throughput compared to the benchmark schemes.This can be attributed to the relatively low dependency between different paths in the proposed scheme,allowing for routing selection based on individual requests.Such a characteristic enables the proposed scheme to optimize path planning and enhance overall transmission performance as the number of requests escalates.

    Figure 5: Average throughput for different network scales

    The amount of link utilization is equal to the total amount of consumed bandwidth by each link to the total available capacity in the network.The link utilization under different topologies is shown in Figs.6a and 6b,corresponding to 100 and 500 requests,respectively.As evident from Fig.6,the proposed scheme exhibits a higher average link utilization compared to the other three schemes,highlighting its advantage in achieving global path resource utilization.ESR-SDN,due to its limitations in returning the optimal path and errors in calculating the optimal path,exhibits lower link utilization.SDN-MCQDP partially mitigates link congestion and enhances link utilization to some extent through dual-path routing.When the number of requests is 500,as shown in Fig.6b,the average link utilization of MCOP surpasses that of SDN-MCQDP due to the capability of selecting multiple optimal paths simultaneously for data forwarding.The proposed scheme prioritizes the links through multi-parameter analysis,ensuring maximum transmission efficiency and reducing resource waste of available bandwidth.Thus,while satisfying the bandwidth requirements of network applications,the proposed scheme effectively improves link utilization.These results highlight the performance advantage of the proposed scheme in terms of throughput,providing evidence of its ability to enhance overall network transmission performance through optimized allocation of network resources.

    Figure 6: Comparison of average link utilization

    4.3 Path Costs

    The average routing cost in a network is estimated by the utilization of all paths for the corresponding traffic requests.Fig.7 shows the routing costs of these schemes for requests,with Figs.7a–7d representing different network scales.When the number of requests is less than 50,all four schemes choose the path with the shortest distance between the controller and the switch.Therefore,the routing costs for different network scales are almost equal.In the same network scale,the routing cost increases as the number of requests increases.Similarly,as the network scale increases,the traffic demand also increases and the routing costs also increase.In Figs.7c and 7d,the routing cost of the MCOP scheme exceeds that of SDN-MCQDP and is marginally lower than that of our proposed scheme.The proposed scheme incurs a higher total routing cost as it necessitates the controller to generate path priorities based on the network topology to enhance link utilization.However,the differences in routing costs are 8.3%,3.7%,and 4.6% in comparison to the ESR-SDN,MCOP,and SDN-MCQDP,respectively.If the requirement is to promptly select the optimal path for data forwarding under multi-constraint QoS conditions,and a slight increase in routing cost is acceptable,the proposed scheme remains the optimal choice.

    Figure 7: All path costs for different network scales

    4.4 Latency

    To test the trade-off between delay and routing cost,we further observe the delay of the path.Compare the performance of the proposed scheme in terms of latency at different network scales based on the relative difference percentage of latency in the link.The relative difference percentage of delayηtis calculated as follows:

    wheredrepresents delay constraint.The smaller the value ofηt,the better the latency performance.

    From Fig.8,it can be seen that the proposed scheme has advantages in terms of delay compared to the other three schemes.Fig.8a depicts the proposed scheme demonstrating a notable advantage in terms of latency,exhibiting relative percentage improvements of 2.9%,1.2%,and 1.4%compared to ESR-SDN,MCOP,and SDN-MCQDP schemes,respectively.In Fig.8b,a marginal difference between MCOP and SDN-MCQDP,with their performance reversing as the number of nodes increases.the proposed scheme maintains its dominance,showcasing a relative percentage improvement of 3.7% over ESR-SDN.The ESR-SDN algorithm has the lowest relative percentage of delay because it does not directly return the optimal path,requiring additional calculations to determine the path that satisfies multiple constraints.The SDN-MCQDP reduces the repeated node calls to some extent by generating directed acyclic graphs based on the destination node.In contrast,the proposed scheme calculates all feasible paths from intermediate nodes to destination nodes during the path composite quality evaluation process and prioritizes them,effectively reducing link latency.

    Figure 8: The percentage of relative delay difference

    4.5 QoS Satisfaction

    We conducted QoS satisfaction testing on a range of network applications,aiming to assess their performance under different QoS requirements.Table 3 provides an overview of the QoS requirements for five commonly encountered real network applications that were included in our study.

    Table 3: The QoS requirements for different applications

    The experimental results are presented in Fig.9,illustrating the percentage of QoS satisfaction achieved by the four schemes for various network sizes.The proposed scheme consistently achieves the highest QoS satisfaction rate,surpassing 91%for diverse application requirements.We observed that the QoS satisfaction of different applications exhibits a slight decrease with an increase in network nodes.However,there are also minor variations in some applications due to their varying sensitivity towards different parameters.

    Figure 9: The QoS satisfaction of different applications

    In Fig.9a,the MCOP scheme outperforms the ESR-SDN and SDN-MCQDP schemes,providing better QoS satisfaction.However,its QoS satisfaction slightly diminishes as the number of links increases,as shown in Figs.9b–9d.This can be attributed to the calculation of weights along the path in the MCOP scheme,which aims to select the path with the maximum available bandwidth,thereby improving the quality of service.The SDN-MCQDP scheme exhibits different trends for different applications in various network topologies.This is due to the utilization of a reverse link pruning algorithm in the SDN-MCQDP scheme,which enables the acquisition of two disjoint optimal paths,providing backup options to meet the requirements of different applications.However,the quality of service for applications can be influenced by the routing computation time,leading to fluctuations.The proposed scheme calculates and analyzes network state information,taking into account various QoS constraints such as delay,hop count,bandwidth,and packet loss rate.By comparing service requirements with the available network capacity within the SDN controller,the optimal path is computed,thus meeting the satisfaction of a majority of network applications.Through comparisons,the proposed solution demonstrates its effectiveness in satisfying QoS demands and meeting the diverse requirements of network services,while also providing insights into the performance characteristics of different schemes in different network scenarios.

    5 Conclusions and Future Work

    We have developed and implemented a multi-constraint path optimization scheme that utilizes information fusion to address the high complexity issues related to multi-constraint QoS routing algorithms in SDN architecture.By linking state awareness at the data plane,the FAHP is used to integrate multi-constraint path quality evaluation parameters,generate a path composite quality evaluation model,and prioritize the optimal path list.Additionally,we dynamically adjust the weight of path quality evaluation parameters based on the service attributes.Through global optimization,we iteratively fine-tune paths for different flows,striving to achieve adaptive alignment between business requirements and network resources.The simulation results demonstrate that the proposed optimization scheme effectively enhances the average throughput of data streams,improves link utilization,and exhibits adaptability to various network topology types.These findings highlight the capability of the proposed scheme to meet the QoS requirements of a majority of network applications.

    In future work,one of the main directions for improvement is to consider additional QoS indicators as path quality evaluation parameters to further optimize the proposed scheme.Moreover,it is essential to conduct testing in more complex simulation scenarios and network platforms to expand node scale and make network topology more complex,to study its scalability in real situations.

    Acknowledgement:Not applicable.

    Funding Statement:This present research work was supported by the National Key R&D Program of China(No.2021YFB2700800)and the GHfund B(No.202302024490).

    Author Contributions:The authors confirm contribution to the paper as follows:study conception and design:Jinlin Xu,Wansu Pan;data collection:Jinlin Xu;analysis and interpretation of results:Longle Cheng,Wansu Pan;draft manuscript preparation: Jinlin Xu,Munan Yuan;project administration:Haibo Tan,Xiaofeng Li.All authors reviewed the results and approved the final version of the manuscript.

    Availability of Data and Materials:The data used to support the findings of this study are included within the article.

    Conflicts of Interest:The authors declare that they have no conflicts of interest to report regarding the present study.

    亚洲精品456在线播放app| 欧美 日韩 精品 国产| 成人二区视频| 亚洲,欧美,日韩| 国产永久视频网站| 精品一区二区三区四区五区乱码 | 青春草国产在线视频| 国产xxxxx性猛交| 人妻一区二区av| 日韩人妻精品一区2区三区| 日韩中文字幕视频在线看片| 免费日韩欧美在线观看| 亚洲精品456在线播放app| 亚洲精华国产精华液的使用体验| 亚洲av中文av极速乱| 久久久国产一区二区| 春色校园在线视频观看| 国产一区有黄有色的免费视频| 久久久国产精品麻豆| 亚洲熟女精品中文字幕| 中国国产av一级| 精品一区二区三区视频在线| 巨乳人妻的诱惑在线观看| 巨乳人妻的诱惑在线观看| 美女中出高潮动态图| h视频一区二区三区| 久热这里只有精品99| 久久久久久久亚洲中文字幕| 男人添女人高潮全过程视频| 久久久久久久亚洲中文字幕| 精品一品国产午夜福利视频| 男人舔女人的私密视频| 成人无遮挡网站| 久久国产精品男人的天堂亚洲 | 午夜91福利影院| 欧美少妇被猛烈插入视频| 插逼视频在线观看| 一本一本久久a久久精品综合妖精 国产伦在线观看视频一区 | 深夜精品福利| 久久精品aⅴ一区二区三区四区 | 日韩不卡一区二区三区视频在线| 99热国产这里只有精品6| 亚洲av福利一区| 视频中文字幕在线观看| 一级毛片电影观看| 最近手机中文字幕大全| 中文字幕制服av| 国产亚洲av片在线观看秒播厂| 午夜福利在线观看免费完整高清在| 欧美精品人与动牲交sv欧美| 国产精品无大码| 国产成人91sexporn| 黑人猛操日本美女一级片| 一区二区三区四区激情视频| 高清欧美精品videossex| 51国产日韩欧美| 亚洲国产欧美日韩在线播放| 免费黄网站久久成人精品| 在线观看免费视频网站a站| 欧美老熟妇乱子伦牲交| 国产成人精品福利久久| 香蕉丝袜av| 亚洲国产精品一区二区三区在线| a级毛片在线看网站| 亚洲激情五月婷婷啪啪| 日本vs欧美在线观看视频| 美女主播在线视频| 99热6这里只有精品| 女的被弄到高潮叫床怎么办| 国产免费一区二区三区四区乱码| 国产无遮挡羞羞视频在线观看| 亚洲精品av麻豆狂野| 一边亲一边摸免费视频| 99香蕉大伊视频| 大话2 男鬼变身卡| 亚洲av电影在线进入| 高清在线视频一区二区三区| 少妇熟女欧美另类| 一区二区三区四区激情视频| 精品第一国产精品| 亚洲精品色激情综合| 亚洲精品久久久久久婷婷小说| 成人免费观看视频高清| 97超碰精品成人国产| 赤兔流量卡办理| 久久国产精品大桥未久av| 亚洲精品久久久久久婷婷小说| 少妇人妻久久综合中文| 成人18禁高潮啪啪吃奶动态图| 美国免费a级毛片| 妹子高潮喷水视频| 国产精品麻豆人妻色哟哟久久| 亚洲,欧美精品.| 最近中文字幕2019免费版| 国产黄频视频在线观看| 少妇的丰满在线观看| xxxhd国产人妻xxx| 老司机影院成人| 狠狠精品人妻久久久久久综合| 国产av一区二区精品久久| 免费av不卡在线播放| 国产精品成人在线| 精品99又大又爽又粗少妇毛片| 狂野欧美激情性bbbbbb| 日日啪夜夜爽| 久久精品国产亚洲av涩爱| 91午夜精品亚洲一区二区三区| 亚洲综合色惰| 91精品伊人久久大香线蕉| 激情视频va一区二区三区| 999精品在线视频| 日韩不卡一区二区三区视频在线| 亚洲精品乱久久久久久| 久久久久人妻精品一区果冻| 日本爱情动作片www.在线观看| 2021少妇久久久久久久久久久| 激情视频va一区二区三区| 久久国产精品男人的天堂亚洲 | 少妇的丰满在线观看| 最近中文字幕高清免费大全6| 国产片特级美女逼逼视频| 国产爽快片一区二区三区| 国产av一区二区精品久久| 精品国产露脸久久av麻豆| 国产精品成人在线| 大片电影免费在线观看免费| av卡一久久| 激情视频va一区二区三区| 国产又爽黄色视频| 亚洲成色77777| 在线观看免费日韩欧美大片| 亚洲国产欧美日韩在线播放| 韩国av在线不卡| 自线自在国产av| 伦理电影大哥的女人| 日本wwww免费看| 欧美国产精品一级二级三级| 校园人妻丝袜中文字幕| 一二三四在线观看免费中文在 | 国产日韩欧美亚洲二区| 中文字幕另类日韩欧美亚洲嫩草| av在线观看视频网站免费| 视频区图区小说| 国产欧美日韩综合在线一区二区| 亚洲丝袜综合中文字幕| 黑丝袜美女国产一区| freevideosex欧美| 在线观看三级黄色| 精品少妇内射三级| 亚洲精品中文字幕在线视频| 午夜免费观看性视频| 欧美最新免费一区二区三区| 国产精品一国产av| 精品一区在线观看国产| 老司机影院成人| 极品少妇高潮喷水抽搐| www.av在线官网国产| 这个男人来自地球电影免费观看 | 成年动漫av网址| 成人亚洲欧美一区二区av| 日本色播在线视频| 国产高清国产精品国产三级| 熟女人妻精品中文字幕| 国产xxxxx性猛交| 国产熟女欧美一区二区| 国产欧美日韩综合在线一区二区| 久久影院123| 日本爱情动作片www.在线观看| 国产精品99久久99久久久不卡 | 大片免费播放器 马上看| 丝袜在线中文字幕| 一本一本久久a久久精品综合妖精 国产伦在线观看视频一区 | 少妇高潮的动态图| 街头女战士在线观看网站| 制服人妻中文乱码| 黄色视频在线播放观看不卡| 亚洲国产欧美在线一区| 成人免费观看视频高清| av播播在线观看一区| 亚洲精品国产色婷婷电影| 国产 精品1| 亚洲精品久久成人aⅴ小说| 国产欧美亚洲国产| 免费高清在线观看视频在线观看| 欧美少妇被猛烈插入视频| 亚洲国产色片| 亚洲国产看品久久| 制服丝袜香蕉在线| 国产精品人妻久久久影院| 婷婷色综合www| 丁香六月天网| 精品国产一区二区三区久久久樱花| av福利片在线| 国精品久久久久久国模美| 亚洲国产欧美日韩在线播放| 99re6热这里在线精品视频| 欧美精品一区二区免费开放| 丰满迷人的少妇在线观看| 少妇熟女欧美另类| 蜜桃在线观看..| 国产永久视频网站| 国国产精品蜜臀av免费| 9热在线视频观看99| 成年女人在线观看亚洲视频| 国产免费一级a男人的天堂| 自拍欧美九色日韩亚洲蝌蚪91| 国产亚洲精品久久久com| 一个人免费看片子| 日本免费在线观看一区| 七月丁香在线播放| 最近手机中文字幕大全| 国产高清三级在线| 国产av精品麻豆| av免费在线看不卡| 夜夜骑夜夜射夜夜干| 91成人精品电影| 国产免费福利视频在线观看| 自拍欧美九色日韩亚洲蝌蚪91| 日日摸夜夜添夜夜爱| 熟女人妻精品中文字幕| 热99久久久久精品小说推荐| 成人毛片a级毛片在线播放| 视频区图区小说| 精品少妇内射三级| 极品少妇高潮喷水抽搐| 国产精品久久久久久久电影| 国产熟女午夜一区二区三区| 91精品国产国语对白视频| 久久精品国产亚洲av天美| 熟女人妻精品中文字幕| 99久国产av精品国产电影| 国产精品国产三级国产专区5o| 精品视频人人做人人爽| 日本-黄色视频高清免费观看| 久久精品国产自在天天线| 午夜老司机福利剧场| 新久久久久国产一级毛片| 99精国产麻豆久久婷婷| 一级毛片 在线播放| 春色校园在线视频观看| av在线老鸭窝| 久久精品人人爽人人爽视色| 亚洲伊人久久精品综合| 亚洲高清免费不卡视频| videos熟女内射| 午夜福利网站1000一区二区三区| 美女中出高潮动态图| 精品少妇黑人巨大在线播放| 美女脱内裤让男人舔精品视频| 亚洲精品乱久久久久久| 一区二区三区四区激情视频| 国产成人aa在线观看| 18+在线观看网站| 日本与韩国留学比较| 亚洲精品久久午夜乱码| 久久久久久久国产电影| 最近中文字幕2019免费版| 久久久久久伊人网av| 嫩草影院入口| 老女人水多毛片| 成人毛片a级毛片在线播放| 久久影院123| 在线亚洲精品国产二区图片欧美| 国产男女超爽视频在线观看| 国产激情久久老熟女| 黑人猛操日本美女一级片| 一本大道久久a久久精品| 精品人妻在线不人妻| 免费av不卡在线播放| 午夜激情久久久久久久| 中文乱码字字幕精品一区二区三区| 成年人免费黄色播放视频| freevideosex欧美| 美女内射精品一级片tv| 亚洲精品久久成人aⅴ小说| 欧美人与性动交α欧美精品济南到 | 国产成人aa在线观看| 十八禁网站网址无遮挡| 18禁裸乳无遮挡动漫免费视频| 国产精品国产三级国产专区5o| 亚洲人成77777在线视频| 黑人猛操日本美女一级片| 欧美成人午夜精品| 91精品三级在线观看| 日韩制服骚丝袜av| 毛片一级片免费看久久久久| 飞空精品影院首页| 亚洲经典国产精华液单| 亚洲一级一片aⅴ在线观看| 在线 av 中文字幕| 宅男免费午夜| 国产极品粉嫩免费观看在线| 亚洲av免费高清在线观看| 久久久欧美国产精品| 国产国语露脸激情在线看| a级毛色黄片| 亚洲av欧美aⅴ国产| 一本大道久久a久久精品| 久久久久久久久久久免费av| 卡戴珊不雅视频在线播放| 欧美人与善性xxx| 国产视频首页在线观看| 国产成人午夜福利电影在线观看| 丰满乱子伦码专区| 另类亚洲欧美激情| 亚洲精品国产色婷婷电影| 国产色婷婷99| 啦啦啦在线观看免费高清www| 精品人妻一区二区三区麻豆| 色婷婷av一区二区三区视频| 97在线人人人人妻| 女人精品久久久久毛片| 极品少妇高潮喷水抽搐| 精品一区二区三区四区五区乱码 | 亚洲经典国产精华液单| 国产精品久久久久久av不卡| 成人亚洲精品一区在线观看| 中文字幕av电影在线播放| 欧美人与善性xxx| 欧美精品av麻豆av| 欧美老熟妇乱子伦牲交| 精品第一国产精品| 欧美激情国产日韩精品一区| 成人漫画全彩无遮挡| 成人午夜精彩视频在线观看| √禁漫天堂资源中文www| tube8黄色片| 亚洲av成人精品一二三区| 香蕉精品网在线| 91国产中文字幕| 亚洲欧美日韩另类电影网站| 久久免费观看电影| 中文乱码字字幕精品一区二区三区| 国产av码专区亚洲av| 嫩草影院入口| 久久国产精品大桥未久av| 免费观看无遮挡的男女| 人人妻人人爽人人添夜夜欢视频| 黄片播放在线免费| 久久精品国产亚洲av涩爱| 丰满迷人的少妇在线观看| 另类亚洲欧美激情| 国产日韩一区二区三区精品不卡| 成人午夜精彩视频在线观看| 久久久精品94久久精品| 国产不卡av网站在线观看| 欧美国产精品一级二级三级| 热99久久久久精品小说推荐| 亚洲国产av新网站| 亚洲欧美日韩另类电影网站| 欧美日韩一区二区视频在线观看视频在线| av一本久久久久| a级毛片黄视频| 欧美激情国产日韩精品一区| 一本色道久久久久久精品综合| 国产日韩欧美视频二区| 女性生殖器流出的白浆| 免费不卡的大黄色大毛片视频在线观看| 一级黄片播放器| 女人久久www免费人成看片| 啦啦啦在线观看免费高清www| 国产精品久久久久久精品古装| 国产熟女欧美一区二区| 丰满迷人的少妇在线观看| 99久久人妻综合| 国产极品天堂在线| 久久午夜福利片| 另类亚洲欧美激情| 亚洲成国产人片在线观看| 下体分泌物呈黄色| 成人毛片a级毛片在线播放| 美女国产高潮福利片在线看| 久久久久久久久久久久大奶| 水蜜桃什么品种好| 国产精品国产三级专区第一集| 亚洲欧美日韩另类电影网站| 在线观看免费日韩欧美大片| 国产精品蜜桃在线观看| 26uuu在线亚洲综合色| 亚洲国产成人一精品久久久| 亚洲美女视频黄频| 在线观看人妻少妇| 啦啦啦在线观看免费高清www| 久久国产精品男人的天堂亚洲 | 蜜桃在线观看..| 中国三级夫妇交换| 中文字幕亚洲精品专区| 99热国产这里只有精品6| 亚洲国产欧美日韩在线播放| 男的添女的下面高潮视频| 王馨瑶露胸无遮挡在线观看| 美女脱内裤让男人舔精品视频| 午夜老司机福利剧场| 99视频精品全部免费 在线| 人妻人人澡人人爽人人| 欧美激情国产日韩精品一区| 国产亚洲欧美精品永久| 黑人巨大精品欧美一区二区蜜桃 | 热re99久久精品国产66热6| 极品少妇高潮喷水抽搐| freevideosex欧美| 91在线精品国自产拍蜜月| 国产高清三级在线| 久久精品国产自在天天线| 熟女人妻精品中文字幕| 性高湖久久久久久久久免费观看| 国国产精品蜜臀av免费| 久久精品国产a三级三级三级| 91国产中文字幕| 黄色视频在线播放观看不卡| 国产精品久久久久久久电影| 国产日韩一区二区三区精品不卡| 飞空精品影院首页| 晚上一个人看的免费电影| 久久久久国产网址| 国产精品一区二区在线不卡| 国产一区有黄有色的免费视频| 免费观看a级毛片全部| 国产精品一二三区在线看| 中文天堂在线官网| 热re99久久国产66热| 熟女av电影| 五月玫瑰六月丁香| 中文字幕免费在线视频6| 只有这里有精品99| 国产老妇伦熟女老妇高清| 亚洲av电影在线进入| 在线观看美女被高潮喷水网站| 精品视频人人做人人爽| 亚洲国产av影院在线观看| 蜜桃国产av成人99| 精品国产一区二区三区久久久樱花| 卡戴珊不雅视频在线播放| 夫妻性生交免费视频一级片| 成年人午夜在线观看视频| 亚洲精品乱码久久久久久按摩| 亚洲av欧美aⅴ国产| 美女国产高潮福利片在线看| 蜜臀久久99精品久久宅男| 婷婷成人精品国产| 日韩制服骚丝袜av| 夜夜爽夜夜爽视频| 男女高潮啪啪啪动态图| 亚洲久久久国产精品| 黄色毛片三级朝国网站| 99国产综合亚洲精品| 国产精品嫩草影院av在线观看| 日韩人妻精品一区2区三区| 一边摸一边做爽爽视频免费| 99热国产这里只有精品6| 极品少妇高潮喷水抽搐| 高清av免费在线| 亚洲欧美成人精品一区二区| 一二三四中文在线观看免费高清| 中文字幕人妻丝袜制服| 最近2019中文字幕mv第一页| 国产熟女午夜一区二区三区| 亚洲少妇的诱惑av| 色哟哟·www| 亚洲性久久影院| 狂野欧美激情性xxxx在线观看| 久热这里只有精品99| 久久久久久久久久久久大奶| 女人精品久久久久毛片| 飞空精品影院首页| 街头女战士在线观看网站| 国产精品嫩草影院av在线观看| 国产熟女欧美一区二区| 18禁在线无遮挡免费观看视频| 亚洲中文av在线| 亚洲欧美日韩卡通动漫| 国产在线免费精品| 久久 成人 亚洲| 亚洲精品一二三| 午夜久久久在线观看| tube8黄色片| 亚洲国产av影院在线观看| 美女视频免费永久观看网站| 亚洲精品久久久久久婷婷小说| 人妻少妇偷人精品九色| 香蕉丝袜av| 午夜91福利影院| 女人久久www免费人成看片| 纯流量卡能插随身wifi吗| 欧美日韩综合久久久久久| 久久久精品94久久精品| 精品一区二区三卡| 国产精品偷伦视频观看了| 黄色毛片三级朝国网站| 国产成人一区二区在线| 夫妻午夜视频| 国产成人精品一,二区| 亚洲综合色惰| 欧美成人午夜免费资源| av福利片在线| 婷婷成人精品国产| 亚洲精品,欧美精品| 一边摸一边做爽爽视频免费| 男女啪啪激烈高潮av片| 国产日韩欧美视频二区| 一区二区av电影网| 精品视频人人做人人爽| 看免费av毛片| 中文字幕人妻丝袜制服| 韩国高清视频一区二区三区| 日韩制服骚丝袜av| 人妻 亚洲 视频| 一区二区三区四区激情视频| 寂寞人妻少妇视频99o| 国产日韩欧美视频二区| 少妇人妻 视频| 丝袜喷水一区| 亚洲av电影在线观看一区二区三区| 少妇高潮的动态图| 亚洲国产精品成人久久小说| 日本午夜av视频| 国产精品麻豆人妻色哟哟久久| 亚洲av电影在线观看一区二区三区| 欧美最新免费一区二区三区| 久久久久久久亚洲中文字幕| 一二三四中文在线观看免费高清| 波野结衣二区三区在线| 黄片播放在线免费| 伦精品一区二区三区| 亚洲综合精品二区| 国产黄频视频在线观看| 91成人精品电影| 久久午夜综合久久蜜桃| 九九在线视频观看精品| 亚洲精品日本国产第一区| 久久久亚洲精品成人影院| 国产精品久久久久久精品古装| 18禁裸乳无遮挡动漫免费视频| 国产精品不卡视频一区二区| 人妻人人澡人人爽人人| 91国产中文字幕| 国产色爽女视频免费观看| 亚洲情色 制服丝袜| 日本免费在线观看一区| 超碰97精品在线观看| 国产欧美另类精品又又久久亚洲欧美| 在线精品无人区一区二区三| 国产亚洲精品久久久com| 香蕉国产在线看| 在线观看一区二区三区激情| 日本av手机在线免费观看| 制服丝袜香蕉在线| 欧美日韩亚洲高清精品| 国产男人的电影天堂91| 久久精品aⅴ一区二区三区四区 | 我的女老师完整版在线观看| 午夜福利,免费看| 久久国内精品自在自线图片| 亚洲天堂av无毛| 国产又爽黄色视频| 中文字幕av电影在线播放| 国产永久视频网站| 乱人伦中国视频| 中国国产av一级| 肉色欧美久久久久久久蜜桃| 999精品在线视频| 久久久国产一区二区| 国产一区二区激情短视频 | 午夜福利乱码中文字幕| 99久久综合免费| 最新的欧美精品一区二区| 精品亚洲成国产av| av天堂久久9| 肉色欧美久久久久久久蜜桃| 黄色 视频免费看| 有码 亚洲区| 久久精品人人爽人人爽视色| 97人妻天天添夜夜摸| 亚洲国产av影院在线观看| 亚洲三级黄色毛片| 国产日韩一区二区三区精品不卡| 五月开心婷婷网| 少妇人妻精品综合一区二区| 成人国产av品久久久| 久久人人97超碰香蕉20202| 国产片内射在线| 日本免费在线观看一区| 晚上一个人看的免费电影| 男女边吃奶边做爰视频| 最近中文字幕2019免费版| 婷婷色av中文字幕| 精品久久国产蜜桃| 99国产综合亚洲精品| 亚洲精品456在线播放app| 国产男女内射视频| 国产av精品麻豆| 丝袜在线中文字幕| 黑人猛操日本美女一级片| 国产av码专区亚洲av| 如何舔出高潮| 亚洲精品国产色婷婷电影| 精品熟女少妇av免费看| 中文字幕免费在线视频6| 搡老乐熟女国产| 亚洲国产精品一区二区三区在线| 熟妇人妻不卡中文字幕| 制服人妻中文乱码| 最近最新中文字幕大全免费视频 | 有码 亚洲区| 精品国产一区二区三区久久久樱花| 999精品在线视频| 欧美少妇被猛烈插入视频| 午夜精品国产一区二区电影| 18禁裸乳无遮挡动漫免费视频| 在线天堂中文资源库| 侵犯人妻中文字幕一二三四区| 久久久久视频综合| 少妇高潮的动态图| 麻豆精品久久久久久蜜桃| 一级片'在线观看视频|