The Experts below are selected from a list of 5400 Experts worldwide ranked by ideXlab platform
Min Huang - One of the best experts on this subject based on the ideXlab platform.
-
An IPv6 Based QoS Unicast Routing Mechanism
Applied Mechanics and Materials, 2014Co-Authors: Hong Chao Duan, Xingwei Wang, Min HuangAbstract:IPv6 is the core protocol of Future Internet. Thus, IPv6 based QoS (Quality of Service) Routing mechanisms need to be developed to support diverse QoS requirements of new network applications. In this paper, an IPv6 based QoS Unicast Routing mechanism is proposed based on OSPFv3 and BGP4 +. By introducing QoS state message and extending the link state database and link state advertisement, the collection, storage and release of intra-domain QoS information are realized. By introducing NLRI (Network Layer Reachability Information) which supports QoS, the release and revocation of inter-domain QoS Routing information are realized. The mechanism not only provides QoS support, but also is compatible with the existing Routing protocols. It can be quickly and effectively deployed in networks. A prototype implementation of the proposed mechanism is completed, which is tested under a video conference application over the CERNET2 topology. The results indicate that it is feasible and effective with good performance.
-
A Trustworthy QoS Unicast Routing Scheme Based on Population Adaptive Based Immune Algorithm
Applied Mechanics and Materials, 2014Co-Authors: Jin Yang Liu, Xingwei Wang, Min HuangAbstract:In this paper, a trustworthy QoS Unicast Routing scheme based on trustworthy network is proposed. First, a cognitive network model is designed, referring to the intelligence of artificial immune system. Then, trustworthiness of each node is evaluated by deploying sliding window mechanism and analyzing the behavior record of each node. Finally, a population adaptive based immune of trustworthy QoS Unicast Routing algorithm is proposed, referring to the adaptive process of antibody identifying antigen. We verify the effectiveness of our scheme by using large-scale computer emulation experiments and compare it to existing classical algorithms. The results show that the proposed algorithm is both feasible and effective for providing users with better QoS, etc.
-
A cross-layer dedicated protection Unicast Routing scheme in IP over WDM optical Internet
2014 IEEE 5th International Conference on Software Engineering and Service Science, 2014Co-Authors: Liya Duanmu, Xingwei Wang, Min HuangAbstract:In this paper, a cross-layer dedicated protection Unicast Routing scheme is proposed in IP over WDM optical Internet. It can groom the Routing requests, establish the protecting path in IP layer and provide the protection for the heavy-load working lightpaths in WDM layer under multi-constraints such as sparse-incomplete wavelength conversion capability and the number of optical transmitters and receivers. Finally, the systematic simulation results indicate the Routing scheme is feasible and effective in IP over WDM optical Internet.
-
A green intelligent Unicast Routing algorithm
2013 5th IEEE International Conference on Broadband Network & Multimedia Technology, 2013Co-Authors: Jinhong Zhang, Xingwei Wang, Min HuangAbstract:For the past years, the energy overconsumption problems, arising from the rapid growth of Internet scale and services types, are becoming more and more serious. In this context, the Information and Communication Technology (ICT) sector has given an extensive concern to the research on green networking. From an energy-saving point of view for Internet, this paper designs a power consumption model and a QoS model for Unicast. Furthermore, this paper proposes a Unicast Routing algorithm based on Chandy-Misra algorithm and Q-learning algorithm for green Internet, which is compared with an ant colony algorithm based self-adaptive energy saving Routing with respect to power consumption, the success rate of Routing and running time. Results show the intelligent Unicast Routing algorithm proposed can effectively reduce network energy consumption, while guaranteeing the good performance.
-
HPCC/EUC - An Evolutionary Multi-agent Preventive Fault-Tolerant QoS Unicast Routing Mechanism
2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquito, 2013Co-Authors: Xin Man, Xingwei Wang, Min HuangAbstract:Fault-tolerance needs to be improved and QoS (Quality of Service) Routing is necessary in the network, fault-tolerant QoS Routing is one of the effective mechanisms. However, due to the dynamic of network parameters, the fuzziness of user requirements, and the imprecise measurements of network parameters, fault-tolerant QoS Routing is actually based on the fuzzy information. Therefore, by introducing the knowledge of fuzzy mathematics and probability theory, and using SRLG-disjoint and shared-path protection strategy, in single SRLG (Shared Risk Link Group) failure situation, an evolutionary multi-agent preventive fault-tolerant QoS Unicast Routing mechanism is proposed. The objective of the mechanism is to find the working path and the protective path under meeting the user QoS constraints. The two paths optimize the end-to-end multiple objectives. Simulation results show that the proposed mechanism is feasible and effective.
Xingwei Wang - One of the best experts on this subject based on the ideXlab platform.
-
An IPv6 Based QoS Unicast Routing Mechanism
Applied Mechanics and Materials, 2014Co-Authors: Hong Chao Duan, Xingwei Wang, Min HuangAbstract:IPv6 is the core protocol of Future Internet. Thus, IPv6 based QoS (Quality of Service) Routing mechanisms need to be developed to support diverse QoS requirements of new network applications. In this paper, an IPv6 based QoS Unicast Routing mechanism is proposed based on OSPFv3 and BGP4 +. By introducing QoS state message and extending the link state database and link state advertisement, the collection, storage and release of intra-domain QoS information are realized. By introducing NLRI (Network Layer Reachability Information) which supports QoS, the release and revocation of inter-domain QoS Routing information are realized. The mechanism not only provides QoS support, but also is compatible with the existing Routing protocols. It can be quickly and effectively deployed in networks. A prototype implementation of the proposed mechanism is completed, which is tested under a video conference application over the CERNET2 topology. The results indicate that it is feasible and effective with good performance.
-
A Trustworthy QoS Unicast Routing Scheme Based on Population Adaptive Based Immune Algorithm
Applied Mechanics and Materials, 2014Co-Authors: Jin Yang Liu, Xingwei Wang, Min HuangAbstract:In this paper, a trustworthy QoS Unicast Routing scheme based on trustworthy network is proposed. First, a cognitive network model is designed, referring to the intelligence of artificial immune system. Then, trustworthiness of each node is evaluated by deploying sliding window mechanism and analyzing the behavior record of each node. Finally, a population adaptive based immune of trustworthy QoS Unicast Routing algorithm is proposed, referring to the adaptive process of antibody identifying antigen. We verify the effectiveness of our scheme by using large-scale computer emulation experiments and compare it to existing classical algorithms. The results show that the proposed algorithm is both feasible and effective for providing users with better QoS, etc.
-
A cross-layer dedicated protection Unicast Routing scheme in IP over WDM optical Internet
2014 IEEE 5th International Conference on Software Engineering and Service Science, 2014Co-Authors: Liya Duanmu, Xingwei Wang, Min HuangAbstract:In this paper, a cross-layer dedicated protection Unicast Routing scheme is proposed in IP over WDM optical Internet. It can groom the Routing requests, establish the protecting path in IP layer and provide the protection for the heavy-load working lightpaths in WDM layer under multi-constraints such as sparse-incomplete wavelength conversion capability and the number of optical transmitters and receivers. Finally, the systematic simulation results indicate the Routing scheme is feasible and effective in IP over WDM optical Internet.
-
A green intelligent Unicast Routing algorithm
2013 5th IEEE International Conference on Broadband Network & Multimedia Technology, 2013Co-Authors: Jinhong Zhang, Xingwei Wang, Min HuangAbstract:For the past years, the energy overconsumption problems, arising from the rapid growth of Internet scale and services types, are becoming more and more serious. In this context, the Information and Communication Technology (ICT) sector has given an extensive concern to the research on green networking. From an energy-saving point of view for Internet, this paper designs a power consumption model and a QoS model for Unicast. Furthermore, this paper proposes a Unicast Routing algorithm based on Chandy-Misra algorithm and Q-learning algorithm for green Internet, which is compared with an ant colony algorithm based self-adaptive energy saving Routing with respect to power consumption, the success rate of Routing and running time. Results show the intelligent Unicast Routing algorithm proposed can effectively reduce network energy consumption, while guaranteeing the good performance.
-
HPCC/EUC - An Evolutionary Multi-agent Preventive Fault-Tolerant QoS Unicast Routing Mechanism
2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquito, 2013Co-Authors: Xin Man, Xingwei Wang, Min HuangAbstract:Fault-tolerance needs to be improved and QoS (Quality of Service) Routing is necessary in the network, fault-tolerant QoS Routing is one of the effective mechanisms. However, due to the dynamic of network parameters, the fuzziness of user requirements, and the imprecise measurements of network parameters, fault-tolerant QoS Routing is actually based on the fuzzy information. Therefore, by introducing the knowledge of fuzzy mathematics and probability theory, and using SRLG-disjoint and shared-path protection strategy, in single SRLG (Shared Risk Link Group) failure situation, an evolutionary multi-agent preventive fault-tolerant QoS Unicast Routing mechanism is proposed. The objective of the mechanism is to find the working path and the protective path under meeting the user QoS constraints. The two paths optimize the end-to-end multiple objectives. Simulation results show that the proposed mechanism is feasible and effective.
Huang Min - One of the best experts on this subject based on the ideXlab platform.
-
ABC Supported Unicast Routing Scheme Based on Immune Selection and SOC Mutation Evolutionary Algorithm
Journal of Chinese Computer Systems, 2013Co-Authors: Huang MinAbstract:In this paper,a novel ABC(Always Best Connected) supported Unicast Routing scheme is proposed.Because it is difficult to measure network link parameter values accurately and express on user QoS(Quality of Service) requirements exactly,interval representation,preference sequences,probability density functions,satisfaction functions and evaluation functions are introduced to describe them;cost,price,billing and gaming are taken to deal with profits of both the user and the network provider due to the commercial operation of the network;finally,evolutionary algorithm based on immune selection and SOC(self-organized critical) mutation is used to find the specific QoS Unicast path with Pareto optimum under Nash Equilibrium among all parties' utilities achieved or approached.Simulation has been done based on NS2,and the proposed scheme has been compared with certain classical Routing scheme over several actual and virtual network topologies,showing that it is feasible and effective.
-
Organizational Evolution-based ABC Supported Unicast Routing Scheme
Computer Science, 2011Co-Authors: Huang MinAbstract:An ABC(Always Best Connected) supported QoS(Quality of Service) Unicast Routing scheme was proposed.In the proposed scheme,intervals were used to describe the user QoS requirements and network link parameters;preference sequences were introduced to reflect users' preferences to different types of networks;probability density functions,satisfaction functions and evaluation functions were adopted to overcome difficulties on accurately measuring network link parameter values and exactly expressing on user QoS requirements;cost,price,billing and gaming were taken to deal with profits of both the user and the network provider;finally,OEA(Organizational Evolutionary Algorithm) was used to find the specific QoS Unicast path with Pareto optimum under Nash Equilibrium among all parties' utilities achieved or approached.Simulation results show that the proposed scheme is both feasible and effective.
-
AntNet Based QoS Unicast Routing Scheme in SON
2010Co-Authors: Huang MinAbstract:In this paper,a swarm intelligence based QoS(Quality of Service) Unicast Routing scheme in SON(Self-Organizing Network) is proposed.Inexact Routing information is described with fuzzy mathematics at the same time profits of both user and network provider are taken into account with microeconomics.Based on AntNet algorithm,a QoS Unicast path is found with Pareto optimum under Nash equilibrium of both user and network provider utilities achieved or approached.The proposed scheme is implemented by simulation over NS2(Network Simulator 2) and its performance is evaluated.It was shown that the proposed scheme had good performance on user utility,network provider utility,path comprehensive evaluation value,Pareto optimum ratio under Nash equilibrium and Routing success ratio.
-
A Flexible QoS Unicast Routing Scheme Based on Utility and QGA
Computer Engineering and Science, 2010Co-Authors: Huang MinAbstract:Based on the knowledge of fuzzy mathematics,microeconomics and swarm intelligence,this paper proposes a flexible QoS Unicast Routing scheme with the QoS(Quality of Service) satisfaction degree and utility. By using QGA(Quantum Genetic Algorithm),the scheme searches for a QoS Unicast path which maximizes the network provider utility and the user utility while trying to strike a right balance between the two. Simulation results show that the proposed scheme is both feasible and effective.
-
ABC supporting QoS Unicast Routing scheme with particle swarm optimization
Journal of Computer Applications, 2009Co-Authors: Huang MinAbstract:A QoS Unicast Routing scheme with ABC supported was proposed.The interval was used to describe the uncertain users' QoS requirement and inaccurate edge(link) parameter.With the user satisfaction degree,edge evaluation and elitist solution set introduced,a QoS Unicast path was searched by particle swarm optimization algorithm and gaming analysis,achieving or approaching Pareto optimal solution under Nash equilibrium on both the network provider utility and the user utility along the found path.Simulation results show that the proposed scheme is both feasible and effective.
Yu Wang - One of the best experts on this subject based on the ideXlab platform.
-
ours optimal Unicast Routing systems in non cooperative wireless networks
ACM IEEE International Conference on Mobile Computing and Networking, 2006Co-Authors: Weizhao Wang, Stephan Eidenbenz, Yu WangAbstract:We propose novel solutions for Unicast Routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic inefficiency) of the VCG (Vickrey-Clark-Groves) mechanism, we design a mechanism that results in Nash equilibria rather than the traditional strate-gyproofness (using weakly dominant strategy). In addition, we systematically study the Unicast Routing system in which both the relay terminals and the service requestor (either the source or the destination nodes or both) could be selfish. To the best of our knowledge, this is the first paper that presents social efficient Unicast Routing systems with proved performance guarantee. Thus, we call the proposed systems: Optimal Unicast Routing Systems (OURS).Our main contributions of OURS are as follows. (1) For the principal model where the service requestor is not selfish, we propose a mechanism that provably creates incentives for intermediate terminals to cooperate in forwarding packets for others. Our mechanism substantially reduces the overpayment by using Nash equilibrium solutions as opposed to strategyproof solutions. We then study a more realistic case where the service requestor can act selfishly. (2) We first show that if we insist on the requirement of strategyproofness for the relay terminals, then no system can guarantee that the central authority can retrieve at least 1overn of the total payment. (3) We then present a strategyproof Unicast system that collects 1over2n of the total payment, which is thus asymptotically optimum. (4) By only requiring Nash Equilibrium solutions, we propose a system that creates incentives for the service requestor and intermediate terminals to correctly follow the prescribed protocol. More importantly, the central authority can retrieve at least half the total payment. We verify the economic efficiency of our systems through simulations that are based on very realistic terminal distributions.
-
MobiCom - OURS: optimal Unicast Routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking - MobiCom '06, 2006Co-Authors: Weizhao Wang, Stephan Eidenbenz, Yu WangAbstract:We propose novel solutions for Unicast Routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic inefficiency) of the VCG (Vickrey-Clark-Groves) mechanism, we design a mechanism that results in Nash equilibria rather than the traditional strate-gyproofness (using weakly dominant strategy). In addition, we systematically study the Unicast Routing system in which both the relay terminals and the service requestor (either the source or the destination nodes or both) could be selfish. To the best of our knowledge, this is the first paper that presents social efficient Unicast Routing systems with proved performance guarantee. Thus, we call the proposed systems: Optimal Unicast Routing Systems (OURS).Our main contributions of OURS are as follows. (1) For the principal model where the service requestor is not selfish, we propose a mechanism that provably creates incentives for intermediate terminals to cooperate in forwarding packets for others. Our mechanism substantially reduces the overpayment by using Nash equilibrium solutions as opposed to strategyproof solutions. We then study a more realistic case where the service requestor can act selfishly. (2) We first show that if we insist on the requirement of strategyproofness for the relay terminals, then no system can guarantee that the central authority can retrieve at least 1overn of the total payment. (3) We then present a strategyproof Unicast system that collects 1over2n of the total payment, which is thus asymptotically optimum. (4) By only requiring Nash Equilibrium solutions, we propose a system that creates incentives for the service requestor and intermediate terminals to correctly follow the prescribed protocol. More importantly, the central authority can retrieve at least half the total payment. We verify the economic efficiency of our systems through simulations that are based on very realistic terminal distributions.
Weizhao Wang - One of the best experts on this subject based on the ideXlab platform.
-
ours optimal Unicast Routing systems in non cooperative wireless networks
ACM IEEE International Conference on Mobile Computing and Networking, 2006Co-Authors: Weizhao Wang, Stephan Eidenbenz, Yu WangAbstract:We propose novel solutions for Unicast Routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic inefficiency) of the VCG (Vickrey-Clark-Groves) mechanism, we design a mechanism that results in Nash equilibria rather than the traditional strate-gyproofness (using weakly dominant strategy). In addition, we systematically study the Unicast Routing system in which both the relay terminals and the service requestor (either the source or the destination nodes or both) could be selfish. To the best of our knowledge, this is the first paper that presents social efficient Unicast Routing systems with proved performance guarantee. Thus, we call the proposed systems: Optimal Unicast Routing Systems (OURS).Our main contributions of OURS are as follows. (1) For the principal model where the service requestor is not selfish, we propose a mechanism that provably creates incentives for intermediate terminals to cooperate in forwarding packets for others. Our mechanism substantially reduces the overpayment by using Nash equilibrium solutions as opposed to strategyproof solutions. We then study a more realistic case where the service requestor can act selfishly. (2) We first show that if we insist on the requirement of strategyproofness for the relay terminals, then no system can guarantee that the central authority can retrieve at least 1overn of the total payment. (3) We then present a strategyproof Unicast system that collects 1over2n of the total payment, which is thus asymptotically optimum. (4) By only requiring Nash Equilibrium solutions, we propose a system that creates incentives for the service requestor and intermediate terminals to correctly follow the prescribed protocol. More importantly, the central authority can retrieve at least half the total payment. We verify the economic efficiency of our systems through simulations that are based on very realistic terminal distributions.
-
MobiCom - OURS: optimal Unicast Routing systems in non-cooperative wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking - MobiCom '06, 2006Co-Authors: Weizhao Wang, Stephan Eidenbenz, Yu WangAbstract:We propose novel solutions for Unicast Routing in wireless networks consisted of selfish terminals: in order to alleviate the inevitable over-payment problem (and thus economic inefficiency) of the VCG (Vickrey-Clark-Groves) mechanism, we design a mechanism that results in Nash equilibria rather than the traditional strate-gyproofness (using weakly dominant strategy). In addition, we systematically study the Unicast Routing system in which both the relay terminals and the service requestor (either the source or the destination nodes or both) could be selfish. To the best of our knowledge, this is the first paper that presents social efficient Unicast Routing systems with proved performance guarantee. Thus, we call the proposed systems: Optimal Unicast Routing Systems (OURS).Our main contributions of OURS are as follows. (1) For the principal model where the service requestor is not selfish, we propose a mechanism that provably creates incentives for intermediate terminals to cooperate in forwarding packets for others. Our mechanism substantially reduces the overpayment by using Nash equilibrium solutions as opposed to strategyproof solutions. We then study a more realistic case where the service requestor can act selfishly. (2) We first show that if we insist on the requirement of strategyproofness for the relay terminals, then no system can guarantee that the central authority can retrieve at least 1overn of the total payment. (3) We then present a strategyproof Unicast system that collects 1over2n of the total payment, which is thus asymptotically optimum. (4) By only requiring Nash Equilibrium solutions, we propose a system that creates incentives for the service requestor and intermediate terminals to correctly follow the prescribed protocol. More importantly, the central authority can retrieve at least half the total payment. We verify the economic efficiency of our systems through simulations that are based on very realistic terminal distributions.
