Currently,distributed routing protocols are constrained by offering a single path between any pair of nodes,thereby limiting the potential throughput and overall network performance.This approach not only restricts th...Currently,distributed routing protocols are constrained by offering a single path between any pair of nodes,thereby limiting the potential throughput and overall network performance.This approach not only restricts the flow of data but also makes the network susceptible to failures in case the primary path is disrupted.In contrast,routing protocols that leverage multiple paths within the network offer a more resilient and efficient solution.Multipath routing,as a fundamental concept,surpasses the limitations of traditional shortest path first protocols.It not only redirects traffic to unused resources,effectively mitigating network congestion,but also ensures load balancing across the network.This optimization significantly improves network utilization and boosts the overall performance,making it a widely recognized efficient method for enhancing network reliability.To further strengthen network resilience against failures,we introduce a routing scheme known as Multiple Nodes with at least Two Choices(MNTC).This innovative approach aims to significantly enhance network availability by providing each node with at least two routing choices.By doing so,it not only reduces the dependency on a single path but also creates redundant paths that can be utilized in case of failures,thereby enhancing the overall resilience of the network.To ensure the optimal placement of nodes,we propose three incremental deployment algorithms.These algorithms carefully select the most suitable set of nodes for deployment,taking into account various factors such as node connectivity,traffic patterns,and network topology.By deployingMNTCon a carefully chosen set of nodes,we can significantly enhance network reliability without the need for a complete overhaul of the existing infrastructure.We have conducted extensive evaluations of MNTC in diverse topological spaces,demonstrating its effectiveness in maintaining high network availability with minimal path stretch.The results are impressive,showing that even when implemented on just 60%of nodes,our incremental deployment method significantly boosts network availability.This underscores the potential of MNTC in enhancing network resilience and performance,making it a viable solution for modern networks facing increasing demands and complexities.The algorithms OSPF,TBFH,DC and LFC perform fast rerouting based on strict conditions,while MNTC is not restricted by these conditions.In five real network topologies,the average network availability ofMNTCis improved by 14.68%,6.28%,4.76%and 2.84%,respectively,compared with OSPF,TBFH,DC and LFC.展开更多
Loop free alternate(LFA)is a routing protection scheme that is currently deployed in commercial routers.However,LFA cannot handle all single network component failure scenarios in traditional networks.As Internet serv...Loop free alternate(LFA)is a routing protection scheme that is currently deployed in commercial routers.However,LFA cannot handle all single network component failure scenarios in traditional networks.As Internet service providers have begun to deploy software defined network(SDN)technology,the Internet will be in a hybrid SDN network where traditional and SDN devices coexist for a long time.Therefore,this study aims to deploy the LFA scheme in hybrid SDN network architecture to handle all possible single network component failure scenarios.First,the deployment of LFA scheme in a hybrid SDN network is described as a 0-1 integer linear programming(ILP)problem.Then,two greedy algorithms,namely,greedy algorithm for LFA based on hybrid SDN(GALFAHSDN)and improved greedy algorithm for LFA based on hybrid SDN(IGALFAHSDN),are proposed to solve the proposed problem.Finally,both algorithms are tested in the simulation environment and the real platform.Experiment results show that GALFAHSDN and IGALFAHSDN can cope with all single network component failure scenarios when only a small number of nodes are upgraded to SDN nodes.The path stretch of the two algorithms is less than 1.36.展开更多
With the increase of high-speed network backbones, the performance of server’s network interface gradually becomes a pivotal factor. This study provides a method called Ethernet Links Trunking (ELT) technology for ac...With the increase of high-speed network backbones, the performance of server’s network interface gradually becomes a pivotal factor. This study provides a method called Ethernet Links Trunking (ELT) technology for achieving efficient connec-tivity between backbones and servers, which provides higher bandwidth and availability of server network interface. The overview of the ELT technology and the results of performance experiment are presented in this paper. Findings showed that the network bandwidth can be scaled by multiple ELT technologies so that more reliable network connectivity can be guaranteed. Some crucial techniques such as Adapter Load Balancing (ALB) and Adapter Fault Tolerance (AFT) are presented in this paper. Experimental results showed that parallel channels of Fast Ethernet are both necessary and sufficient for supporting the data rates of multiple concurrent file transfers on file server.展开更多
Network failures are unavoidable and occur frequently.When the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence process.During this period,a large number of mes...Network failures are unavoidable and occur frequently.When the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence process.During this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be solved.Industry usually employs routing protection algorithms to improve intra-domain routing availability.However,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in practice.To address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes.Firstly,the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem.Then the simulated annealing algorithm ERPBONT is used to find the optimal solution.Finally,the algorithm is tested on the simulated topology and the real topology.The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.展开更多
To provide services in presence of failures or attacks in a timely manner, the network survivability was analyzed. Based on stochastic Petri nets, we put forward an effective model for ad hoe network and adopt a two-p...To provide services in presence of failures or attacks in a timely manner, the network survivability was analyzed. Based on stochastic Petri nets, we put forward an effective model for ad hoe network and adopt a two-phase approach consisting of the steady-state availability analysis and the system transient performance analysis, then provide a quantitative approach for analysis of the network survivability. The results show that the proposed model is useful for the design and evaluation of the wireless ad hoc network.展开更多
A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay an...A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth展开更多
The techniques to forecast available parking space(APS) are indispensable components for parking guidance systems(PGS). According to the data collected in Newcastle upon Tyne, England, the changing characteristics of ...The techniques to forecast available parking space(APS) are indispensable components for parking guidance systems(PGS). According to the data collected in Newcastle upon Tyne, England, the changing characteristics of APS were studied. Thereafter, aiming to build up a multi-step APS forecasting model that provides richer information than a conventional one-step model, the largest Lyapunov exponents(largest LEs) method was introduced into PGS. By experimental tests conducted using the same dataset, its prediction performance was compared with traditional wavelet neural network(WNN) method in both one-step and multi-step processes. Based on the results, a new multi-step forecasting model called WNN-LE method was proposed, where WNN, which enjoys a more accurate performance along with a better learning ability in short-term forecasting, was applied in the early forecast steps while the Lyapunov exponent prediction method in the latter steps precisely reflect the chaotic feature in latter forecast period. The MSE of APS forecasting for one hour time period can be reduced from 83.1 to 27.1(in a parking building with 492 berths) by using largest LEs method instead of WNN and further reduced to 19.0 by conducted the new method.展开更多
The evolution of computer networks has experienced several major steps, and research focus of each step has been kept changing and evolving, from ARPANET to OSI/RM, then HSN （high speed network） and HPN （high perfo...The evolution of computer networks has experienced several major steps, and research focus of each step has been kept changing and evolving, from ARPANET to OSI/RM, then HSN （high speed network） and HPN （high performance network）. During the evolution, computer networks represented by Internet have made great progress and gained unprecedented success. However, with the appearance and intensification of tussle, along with the three difficult problems （service customizing, resource control and user management） of modern network, it is found that traditional Internet and its architecture no longer meet the requirements of next generation network. Therefore, it is the next generation network that current Internet must evolve to. With the mindset of achieving valuable guidance for research on next generation network, this paper firstly analyzes some dilemmas facing current Internet and its architecture, and then surveys some recent influential research work and progresses in computer networks and related areas, including new generation network architecture, network resource control technologies, network management and security, distributed computing and middleware, wireless/mobile network, new generation network services and applications, and foundational theories on network modeling. Finally, this paper concludes that within the research on next generation network, more attention should be paid to the high availability network and corresponding architecture, key theories and supporting technologies.展开更多
基金supported by Fundamental Research Program of Shanxi Province(No.20210302123444)the Research Project at the College Level of China Institute of Labor Relations(No.23XYJS018)+2 种基金the ICH Digitalization and Multi-Source Information Fusion Fujian Provincial University Engineering Research Center 2022 Open Fund Project(G3-KF2207)the China University Industry University Research Innovation Fund(No.2021FNA02009)the Key R&D Program(International Science and Technology Cooperation Project)of Shanxi Province China(No.201903D421003).
文摘Currently,distributed routing protocols are constrained by offering a single path between any pair of nodes,thereby limiting the potential throughput and overall network performance.This approach not only restricts the flow of data but also makes the network susceptible to failures in case the primary path is disrupted.In contrast,routing protocols that leverage multiple paths within the network offer a more resilient and efficient solution.Multipath routing,as a fundamental concept,surpasses the limitations of traditional shortest path first protocols.It not only redirects traffic to unused resources,effectively mitigating network congestion,but also ensures load balancing across the network.This optimization significantly improves network utilization and boosts the overall performance,making it a widely recognized efficient method for enhancing network reliability.To further strengthen network resilience against failures,we introduce a routing scheme known as Multiple Nodes with at least Two Choices(MNTC).This innovative approach aims to significantly enhance network availability by providing each node with at least two routing choices.By doing so,it not only reduces the dependency on a single path but also creates redundant paths that can be utilized in case of failures,thereby enhancing the overall resilience of the network.To ensure the optimal placement of nodes,we propose three incremental deployment algorithms.These algorithms carefully select the most suitable set of nodes for deployment,taking into account various factors such as node connectivity,traffic patterns,and network topology.By deployingMNTCon a carefully chosen set of nodes,we can significantly enhance network reliability without the need for a complete overhaul of the existing infrastructure.We have conducted extensive evaluations of MNTC in diverse topological spaces,demonstrating its effectiveness in maintaining high network availability with minimal path stretch.The results are impressive,showing that even when implemented on just 60%of nodes,our incremental deployment method significantly boosts network availability.This underscores the potential of MNTC in enhancing network resilience and performance,making it a viable solution for modern networks facing increasing demands and complexities.The algorithms OSPF,TBFH,DC and LFC perform fast rerouting based on strict conditions,while MNTC is not restricted by these conditions.In five real network topologies,the average network availability ofMNTCis improved by 14.68%,6.28%,4.76%and 2.84%,respectively,compared with OSPF,TBFH,DC and LFC.
基金This work is supported by the Program of Hainan Association for Science and Technology Plans to Youth R&D Innovation(No.QCXM201910)the National Natural Science Foundation of China(No.61702315,No.61802092)+2 种基金the Scientific Research Setup Fund of Hainan University(No.KYQD(ZR)1837)the Key R&D program(international science and technology cooperation project)of Shanxi Province China(No.201903D421003)Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi(No.201802013).
文摘Loop free alternate(LFA)is a routing protection scheme that is currently deployed in commercial routers.However,LFA cannot handle all single network component failure scenarios in traditional networks.As Internet service providers have begun to deploy software defined network(SDN)technology,the Internet will be in a hybrid SDN network where traditional and SDN devices coexist for a long time.Therefore,this study aims to deploy the LFA scheme in hybrid SDN network architecture to handle all possible single network component failure scenarios.First,the deployment of LFA scheme in a hybrid SDN network is described as a 0-1 integer linear programming(ILP)problem.Then,two greedy algorithms,namely,greedy algorithm for LFA based on hybrid SDN(GALFAHSDN)and improved greedy algorithm for LFA based on hybrid SDN(IGALFAHSDN),are proposed to solve the proposed problem.Finally,both algorithms are tested in the simulation environment and the real platform.Experiment results show that GALFAHSDN and IGALFAHSDN can cope with all single network component failure scenarios when only a small number of nodes are upgraded to SDN nodes.The path stretch of the two algorithms is less than 1.36.
基金Project (No. 2001AA111011) supported by the the Hi-Tech Re-search and Development Program (863) of China
文摘With the increase of high-speed network backbones, the performance of server’s network interface gradually becomes a pivotal factor. This study provides a method called Ethernet Links Trunking (ELT) technology for achieving efficient connec-tivity between backbones and servers, which provides higher bandwidth and availability of server network interface. The overview of the ELT technology and the results of performance experiment are presented in this paper. Findings showed that the network bandwidth can be scaled by multiple ELT technologies so that more reliable network connectivity can be guaranteed. Some crucial techniques such as Adapter Load Balancing (ALB) and Adapter Fault Tolerance (AFT) are presented in this paper. Experimental results showed that parallel channels of Fast Ethernet are both necessary and sufficient for supporting the data rates of multiple concurrent file transfers on file server.
基金This work is supported by the Hainan Provincial Natural Science Foundation of China(620RC562)the Natural Science Foundation of Shanxi Province(Grant Nos.20210302123444,20210302123455)+5 种基金the China University industry university research innovation fund(No.2021FNA02009)the Open Project Program of the Key Laboratory of Embedded System and Service Computing of Ministry of Education(Tongji University)ESSCKF 2021-04the National Natural Science Foundation of China(Grant Nos.61702315,61802092)the Applied Basic Research Plan of Shanxi Province(No.201901D211168)the Program of Hainan Association for Science and Technology Plans to Youth R&D Innovation(QCXM201910)the Key R&D Program(International Science and Technology Cooperation Project)of Shanxi Province China(No.201903D421003).
文摘Network failures are unavoidable and occur frequently.When the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence process.During this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be solved.Industry usually employs routing protection algorithms to improve intra-domain routing availability.However,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in practice.To address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes.Firstly,the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem.Then the simulated annealing algorithm ERPBONT is used to find the optimal solution.Finally,the algorithm is tested on the simulated topology and the real topology.The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.
基金the PhD Programs Foundation for Young Researchers of Ministry of Education of China(Grant No.20070217051)the National High Technology Research and Development Program of China(Grant No.2007AA01Z491)
文摘To provide services in presence of failures or attacks in a timely manner, the network survivability was analyzed. Based on stochastic Petri nets, we put forward an effective model for ad hoe network and adopt a two-phase approach consisting of the steady-state availability analysis and the system transient performance analysis, then provide a quantitative approach for analysis of the network survivability. The results show that the proposed model is useful for the design and evaluation of the wireless ad hoc network.
基金This project was supported by the National Natural Science Foundation of China (90304018)and the Natural ScienceFoundation of Hubei Province of China (2004ABA023)
文摘A multicast routing algorithm of multiple QoS constraints based on widest-bandwidth （MRQW） which takes available bandwidth as the prime metric, considering the constraints of the surplus energy of the node, delay and delay jitter, is presented. The process of routing based on MRQW is provided for as well. Correctness proof and the complexity analysis of the MRQW are also given in the paper. Simulation results show that the MRQW has a good performance in creating multicast trees. It not only satisfys multiple QoS constraints but also makes multicast links have larger available bandwidth
基金Project(2012CB725402)supported by the National Key Basic Research Program of ChinaProjects(51338003,50908051)supported by the National Natural Science Foundation of China
文摘The techniques to forecast available parking space(APS) are indispensable components for parking guidance systems(PGS). According to the data collected in Newcastle upon Tyne, England, the changing characteristics of APS were studied. Thereafter, aiming to build up a multi-step APS forecasting model that provides richer information than a conventional one-step model, the largest Lyapunov exponents(largest LEs) method was introduced into PGS. By experimental tests conducted using the same dataset, its prediction performance was compared with traditional wavelet neural network(WNN) method in both one-step and multi-step processes. Based on the results, a new multi-step forecasting model called WNN-LE method was proposed, where WNN, which enjoys a more accurate performance along with a better learning ability in short-term forecasting, was applied in the early forecast steps while the Lyapunov exponent prediction method in the latter steps precisely reflect the chaotic feature in latter forecast period. The MSE of APS forecasting for one hour time period can be reduced from 83.1 to 27.1(in a parking building with 492 berths) by using largest LEs method instead of WNN and further reduced to 19.0 by conducted the new method.
基金supported in part by the National Natural Science Foundation of China under Grants No.90604003 and No.90604004by the National Grand Fundamental Research 973 Program of China under Grant No.2003CB314801.
文摘The evolution of computer networks has experienced several major steps, and research focus of each step has been kept changing and evolving, from ARPANET to OSI/RM, then HSN （high speed network） and HPN （high performance network）. During the evolution, computer networks represented by Internet have made great progress and gained unprecedented success. However, with the appearance and intensification of tussle, along with the three difficult problems （service customizing, resource control and user management） of modern network, it is found that traditional Internet and its architecture no longer meet the requirements of next generation network. Therefore, it is the next generation network that current Internet must evolve to. With the mindset of achieving valuable guidance for research on next generation network, this paper firstly analyzes some dilemmas facing current Internet and its architecture, and then surveys some recent influential research work and progresses in computer networks and related areas, including new generation network architecture, network resource control technologies, network management and security, distributed computing and middleware, wireless/mobile network, new generation network services and applications, and foundational theories on network modeling. Finally, this paper concludes that within the research on next generation network, more attention should be paid to the high availability network and corresponding architecture, key theories and supporting technologies.
