Service Composition Based on Niching Particle Swarm Optimization in Service Overlay Networks

( Jianxin Liao ),( Yang Liu ),( Jingyu Wang ),( Xiaomin Zhu ) 한국인터넷정보학회 2012 KSII Transactions on Internet and Information Syst Vol.6 No.4

Service oriented architecture (SOA) lends itself to model the application components to coarse-grained services in such a way that the composition of different services could be feasible. Service composition fulfills numerous service requirements by constructing composite applications with various services. As it is the case in many real-world applications, different users have diverse QoS demands issuing for composite applications. In this paper, we present a service composition framework for a typical service overlay network (SON) considering both multiple QoS constraints and load balancing factors. Moreover, a service selection algorithm based on niching technique and particle swarm optimization (PSO) is proposed for the service composition problem. It supports optimization problems with multiple constraints and objective functions, whether linear or nonlinear. Simulation results show that the proposed algorithm results in an acceptable level of efficiency regarding the service composition objective under different circumstances.

Load-Balanced One-hop Overlay Multipath Routing with Path Diversity

( Jianxin Liao ),( Shengwen Tian ),( Jingyu Wang ),( Tonghong Li ),( Qi Qi ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.2

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. For one-hop overlay source routing, when a given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination via a strategically placed relay node. However, the over-heavy traffic passing through the same relay node may cause frequent package loss and delay jitter, which can degrade the throughput and utilization of the network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Multipath Routing algorithm (LB-OOMR), in which the traffic is first split at the source edge nodes and then transmitted along multiple one-hop overlay paths. In order to determine an optimal split ratio for the traffic, we formulate the problem as a linear programming (LP) formulation, whose goal is to minimize the worse-case network congestion ratio. Since it is difficult to solve this LP problem in practical time, a heuristic algorithm is introduced to select the relay nodes for constructing the disjoint one-hop overlay paths, which greatly reduces the computational complexity of the LP algorithm. Simulations based on a real ISP network and a synthetic Internet topology show that our proposed algorithm can reduce the network congestion ratio dramatically, and achieve high-quality overlay routing service.

Topology-aware Virtual Network Embedding Using Multiple Characteristics

( Jianxin Liao ),( Min Feng ),( Tonghong Li ),( Jingyu Wang ),( Sude Qing ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.1

Network virtualization provides a promising tool to allow multiple heterogeneous virtual networks to run on a shared substrate network simultaneously. A long-standing challenge in network virtualization is the Virtual Network Embedding (VNE) problem: how to embed virtual networks onto specific physical nodes and links in the substrate network effectively. Recent research presents several heuristic algorithms that only consider single topological attribute of networks, which may lead to decreased utilization of resources. In this paper, we introduce six complementary characteristics that reflect different topological attributes, and propose three topology-aware VNE algorithms by leveraging the respective advantages of different characteristics. In addition, a new KS-core decomposition algorithm based on two characteristics is devised to better disentangle the hierarchical topological structure of virtual networks. Due to the overall consideration of topological attributes of substrate and virtual networks by using multiple characteristics, our study better coordinates node and link embedding. Extensive simulations demonstrate that our proposed algorithms improve the long-term average revenue, acceptance ratio, and revenue/cost ratio compared to previous algorithms.

Conflicts in Overlay Environments: Inefficient Equilibrium and Incentive Mechanism

( Jianxin Liao ),( Jun Gong ),( Shan Jiang ),( Tonghong Li ),( Jingyu Wang ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.5

Overlay networks have been widely deployed upon the Internet by Service Providers (SPs) to provide improved network services. However, the interaction between each overlay and traffic engineering (TE) as well as the interaction among co-existing overlays may occur. In this paper, we adopt both non-cooperative and cooperative game theory to analyze these interactions, which are collectively called hybrid interaction. Firstly, we model a situation of the hybrid interaction as an n+1-player non-cooperative game, in which overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE) for this game. Secondly, we model another situation of the hybrid interaction as a 1-leader-n-follower Stackelberg-Nash game, in which TE is the leader and co-existing overlays are followers, and prove that the cost at Stackelberg-Nash equilibrium (SNE) is at least as good as that at NE for TE. Thirdly, we propose a cooperative coalition mechanism based on Shapley value to overcome the inherent inefficiency of NE and SNE, in which players can improve their performance and form stable coalitions. Finally, we apply distinct genetic algorithms (GA) to calculate the values for NE, SNE and the assigned cost for each player in each coalition, respectively. Analytical results are confirmed by the simulation on complex network topologies.

Estimating the Effects of Multipath Selection on Concurrent Multipath Transfer

( Jingyu Wang ),( Jianxin Liao ),( Jing Wang ),( Tonghong Li ),( Qi Qi ) 한국인터넷정보학회 2014 KSII Transactions on Internet and Information Syst Vol.8 No.4

Multi-mode device which combines multiple access technologies into a device will offer more cost-effective solution than a sole access implementation. Its concurrent multipath transfer (CMT) technology can transmit media flows over multiple end-to-end paths simultaneously, which is essential to select at least two paths from all available paths. At real networks, different paths are likely to overlap each other and even share bottleneck, which can weaken the path diversity gained through CMT. Spurred by this observation, it is necessary to select multiple independent paths as much as possible to avoid underlying shared bottleneck between topologically joint paths. Recent research in this context has shown that different paths with shared bottleneck can weaken the path diversity gained through CMT. In our earlier work, a grouping-based multipath selection (GMS) mechanism is introduced and developed. However, how to estimating the selection is still to be resolved. In this paper, we firstly introduce a Selection Correctness Index (SCI) to evaluate the correctness of selection results in actual CMT experiment. Therefore, this metric is helpful to discuss and validate the accuracy of the output paths. From extensive experiments with a realized prototype, the proposed scheme provides better evaluation tool and criterion in various network conditions.

Resilient Routing Overlay Network Construction with Super-Relay Nodes

( Shengwen Tian ),( Jianxin Liao ),( Tonghong Li ),( Jingyu Wang ),( Guanghai Cui ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.4

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.