The Experts below are selected from a list of 38514 Experts worldwide ranked by ideXlab platform

Min Huang - One of the best experts on this subject based on the ideXlab platform.

  • Intelligent QoS Unicast Routing Scheme in SON
    2010 International Conference on Communications and Mobile Computing, 2010
    Co-Authors: Xingwei Wang, Min Huang, Hui Cheng, Weidong Wang, Xiaolei Huang
    Abstract:

    In this paper, a swarm intelligence based quality of service (QoS) unicast routing scheme is proposed for self-organized Network (SON). The inaccurate routing information is described with fuzzy methods whilst the utilities of both the user and the Network Provider are taken into account by applying gaming. Based on AntNet algorithm, a QoS unicast path is found on which Pareto optimum is approached or achieved under Nash equilibrium of the user utility and the Network Provider utility.

  • ACIIDS - ABC Supporting QoS Unicast Routing Scheme with Particle Swarm Optimization
    2009 First Asian Conference on Intelligent Information and Database Systems, 2009
    Co-Authors: Xingwei Wang, Min Huang, Hai-quan Yang, Lei Guo
    Abstract:

    In this paper, a QoS unicast routing scheme withABC supported is proposed. With gaming analysis and particle swarm optimization algorithm, it tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the Network Provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective.

  • a beehive algorithm based qos unicast routing scheme with abc supported
    APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies, 2007
    Co-Authors: Xingwei Wang, Guang Liang, Min Huang
    Abstract:

    In this paper, a QoS unicast routing scheme with ABC supported is proposed based on beehive algorithm. It deals with inaccurate Network status information and imprecise user QoS requirement, introduces edge bandwidth pricing, edge evaluation and path evaluation, and tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the Network Provider utility and the user utility achieved or approached.

  • APPT - A beehive algorithm based QoS unicast routing scheme with ABC supported
    Lecture Notes in Computer Science, 2007
    Co-Authors: Xingwei Wang, Guang Liang, Min Huang
    Abstract:

    In this paper, a QoS unicast routing scheme with ABC supported is proposed based on beehive algorithm. It deals with inaccurate Network status information and imprecise user QoS requirement, introduces edge bandwidth pricing, edge evaluation and path evaluation, and tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the Network Provider utility and the user utility achieved or approached.

  • NPC - A small-world optimization algorithm based and ABC supported QoS unicast routing scheme
    Lecture Notes in Computer Science, 2007
    Co-Authors: Xingwei Wang, Shuxiang Cai, Min Huang
    Abstract:

    In this paper, by introducing knowledge of fuzzy mathematics, probability theory and gaming theory, a QoS unicast routing scheme with ABC supported is proposed based on small-world optimization algorithm. Under inaccurate Network status information and imprecise user QoS requirement, the proposed scheme uses the range to describe the user QoS requirement and the edge parameter, introduces the user satisfaction degree function, the edge evaluation function and the path evaluation function, trying to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the Network Provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective with better performance.

Xingwei Wang - One of the best experts on this subject based on the ideXlab platform.

  • Intelligent QoS Unicast Routing Scheme in SON
    2010 International Conference on Communications and Mobile Computing, 2010
    Co-Authors: Xingwei Wang, Min Huang, Hui Cheng, Weidong Wang, Xiaolei Huang
    Abstract:

    In this paper, a swarm intelligence based quality of service (QoS) unicast routing scheme is proposed for self-organized Network (SON). The inaccurate routing information is described with fuzzy methods whilst the utilities of both the user and the Network Provider are taken into account by applying gaming. Based on AntNet algorithm, a QoS unicast path is found on which Pareto optimum is approached or achieved under Nash equilibrium of the user utility and the Network Provider utility.

  • ACIIDS - ABC Supporting QoS Unicast Routing Scheme with Particle Swarm Optimization
    2009 First Asian Conference on Intelligent Information and Database Systems, 2009
    Co-Authors: Xingwei Wang, Min Huang, Hai-quan Yang, Lei Guo
    Abstract:

    In this paper, a QoS unicast routing scheme withABC supported is proposed. With gaming analysis and particle swarm optimization algorithm, it tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the Network Provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective.

  • New insights on survivability in multi-domain optical Networks
    Information Sciences, 2008
    Co-Authors: Lei Guo, Xingwei Wang, Qingyang Song, Xuetao Wei, Weigang Hou, Ting Yang, Fei Yang
    Abstract:

    With the development of intelligent optical Networks and the general multi-protocol label switching (GMPLS) technique, the seamless convergence between IP Network and optical Network is no longer be a dream but a practical reality. Similar to the Internet, current optical Networks have been divided into multiple domains each of which has its own Network Provider and management policy. Therefore, the development of multi-domain optical Networks will be the trend of new-generation intelligent optical Networks, and GMPLS-based survivability for multi-domain optical Networks will become a hot topic of research in the future. This paper provides a comprehensive review of the existing survivable schemes in multi-domain optical Networks and analyzes the shortcomings of current research. Based on previous studies, we present possible challenges and propose new ideas to design efficient survivable schemes to guide the future work of researchers in multi-domain optical Networks.

  • a beehive algorithm based qos unicast routing scheme with abc supported
    APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies, 2007
    Co-Authors: Xingwei Wang, Guang Liang, Min Huang
    Abstract:

    In this paper, a QoS unicast routing scheme with ABC supported is proposed based on beehive algorithm. It deals with inaccurate Network status information and imprecise user QoS requirement, introduces edge bandwidth pricing, edge evaluation and path evaluation, and tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the Network Provider utility and the user utility achieved or approached.

  • APPT - A beehive algorithm based QoS unicast routing scheme with ABC supported
    Lecture Notes in Computer Science, 2007
    Co-Authors: Xingwei Wang, Guang Liang, Min Huang
    Abstract:

    In this paper, a QoS unicast routing scheme with ABC supported is proposed based on beehive algorithm. It deals with inaccurate Network status information and imprecise user QoS requirement, introduces edge bandwidth pricing, edge evaluation and path evaluation, and tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the Network Provider utility and the user utility achieved or approached.

Huang Min - One of the best experts on this subject based on the ideXlab platform.

  • Organizational Evolution-based ABC Supported Unicast Routing Scheme
    Computer Science, 2011
    Co-Authors: Huang Min
    Abstract:

    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.

  • A Flexible QoS Unicast Routing Scheme Based on Utility and QGA
    Computer Engineering and Science, 2010
    Co-Authors: Huang Min
    Abstract:

    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.

  • AntNet Based QoS Unicast Routing Scheme in SON
    2010
    Co-Authors: Huang Min
    Abstract:

    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.

  • ABC supporting QoS unicast routing scheme with particle swarm optimization
    Journal of Computer Applications, 2009
    Co-Authors: Huang Min
    Abstract:

    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.

  • ABC Supporting QoS Unicast Routing Scheme Based on Beehive Algorithm
    Journal of Chinese Computer Systems, 2009
    Co-Authors: Huang Min
    Abstract:

    NGI(Next Generation Internet) needs to provide QoS(Quality of Service) routing and support ABC(Always Best Connected).However,due to the difficulty on the exact measurement of link status and the exact expression of the user QoS requirement,QoS routing should be capable of dealing with fuzzy information.Meanwhile,with the gradual commercialization of the Network operation,both the Network Provider and the user profits should be considered and thus their utility win-win should be supported when routing.In this paper,by introducing the knowledge of the fuzzy mathematics and the microeconomics,a QoS unicast routing scheme with ABC supported is proposed.The range is used to describe the flexible user QoS requirement and the edge suitability membership function is adopted to handle the inaccurate link status information.With the edge bandwidth pricing,edge evaluation and path evaluation introduced and based on the beehive algorithm,it tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the user utility and the Network Provider utility achieved or approached.Simulation results have shown that the proposed scheme is both feasible and effective.

Jorg Liebeherr - One of the best experts on this subject based on the ideXlab platform.

  • topology design for service overlay Networks with bandwidth guarantees
    International Workshop on Quality of Service, 2004
    Co-Authors: S L Vieira, Jorg Liebeherr
    Abstract:

    The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traffic that traverses multiple autonomous systems (ASs) requires a level of cooperation between ASs that is difficult to achieve in the current architecture. Recently, service overlay Networks have been considered as an approach to QoS deployment that avoids these difficulties. In this study, we address the problem of the topological synthesis of a service overlay Network, where endsystems and nodes of the overlay Network (Provider nodes) are connected through ISPs that supports bandwidth reservations. We express the topology design problem as an optimization problem. Even though the design problem is related to the (in general NP-hard) quadratic assignment problem, we are able to show that relatively simple heuristic algorithms can deliver results that are sometimes close to the optimal solution.

  • IWQoS - Topology design for service overlay Networks with bandwidth guarantees
    Twelfth IEEE International Workshop on Quality of Service 2004. IWQOS 2004., 1
    Co-Authors: S L Vieira, Jorg Liebeherr
    Abstract:

    The Internet still lacks adequate support for QoS applications with real-time requirements. In great part, this is due to the fact that provisioning of end-to-end QoS to traffic that traverses multiple autonomous systems (ASs) requires a level of cooperation between ASs that is difficult to achieve in the current architecture. Recently, service overlay Networks have been considered as an approach to QoS deployment that avoids these difficulties. In this study, we address the problem of the topological synthesis of a service overlay Network, where endsystems and nodes of the overlay Network (Provider nodes) are connected through ISPs that supports bandwidth reservations. We express the topology design problem as an optimization problem. Even though the design problem is related to the (in general NP-hard) quadratic assignment problem, we are able to show that relatively simple heuristic algorithms can deliver results that are sometimes close to the optimal solution.

Hubert Zimmermann - One of the best experts on this subject based on the ideXlab platform.

  • VNE-AC: Virtual Network Embedding Algorithm Based on Ant Colony Metaheuristic
    2011
    Co-Authors: Ilhem Fajjari, Guy Pujolle, Nadjib Aitsaadi, Hubert Zimmermann
    Abstract:

    In this paper, we address virtual Network embedding problem. Indeed, our objective is to map virtual Networks in the substrate Network with minimum physical resources while satisfying its required QoS in terms of bandwidth, power processing and memory. In doing so, we minimize the reject rate of requests and maximize returns for the substrate Network Provider. Since the problem is NP-hard and to deal with its computational hardness, we propound a new scalable embedding strategy named VNE-AC based on the Ant Colony metaheuristic. The intensive simulations and evaluation results show that our proposal enhances the substrate Provider's revenue and outperforms the related strategies found in current literature.

  • VNE-AC: Virtual Network embedding algorithm based on ant colony metaheuristic
    IEEE International Conference on Communications, 2011
    Co-Authors: Ilhem Fajjari, Nadjib Ait Saadi, Guy Pujolle, Hubert Zimmermann
    Abstract:

    In this paper, we address a virtual Network embedding problem. Indeed, our objective is to map virtual Networks in the substrate Network with minimum physical resources while satisfying its required QoS in terms of bandwidth, power processing and memory. In doing so, we minimize the reject rate of requests and maximize returns for the substrate Network Provider. Since the problem is NP-hard and to deal with its computational hardness, we propound a new scalable embedding strategy named \texttt{VNE-AC} based on the Ant Colony metaheuristic. The intensive simulations and evaluation results show that our proposal enhances the substrate Provider's revenue and outperforms the related strategies found in current literature.