Entity

Time filter

Source Type


Zhang C.,Beijing University of Posts and Telecommunications | Zhang C.,EB Information Technology Co. | Liao J.-X.,Beijing University of Posts and Telecommunications | Liao J.-X.,EB Information Technology Co. | And 2 more authors.
Ruan Jian Xue Bao/Journal of Software | Year: 2010

Fault localization has theoretically been proven to be NP-hard. This paper takes a weighted bipartite graph, as fault propagation model, and proposes a heuristic fault localization algorithm based on Bayesian suspected degree (BSD) to reduce the computational complexity. It introduces a metric of BSD, which needs only to be calculated once, and uses incremental coverage, which makes the algorithm a low computation complexity O(|F|×|S|). Simulation results show that the algorithm has a high fault detection rate as well as low false positive rate and performs well even in the presence of unobserved and suspicious alarms. The algorithm, which has a polynomial computational complexity, can be applied to a large-scale communication network. © by Institute of Software, the Chinese Academy of Sciences.


Liao J.,Beijing University of Posts and Telecommunications | Liao J.,EB Information Technology Co. | Liu Y.,Beijing University of Posts and Telecommunications | Zhu X.,Beijing University of Posts and Telecommunications | And 3 more authors.
Journal of Systems and Software | Year: 2014

Service composition (SC) generates various composite applications quickly by using a novel service interaction model. Before composing services together, the most important thing is to find optimal candidate service instances compliant with non-functional requirements. Particle swarm optimization (PSO) is known as an effective and efficient algorithm, which is widely used in this process. However, the premature convergence and diversity loss of PSO always results in suboptimal solutions. In this paper, we propose an accurate sub-swarms particle swarm optimization (ASPSO) algorithm by adopting parallel and serial niching techniques. The ASPSO algorithm locates optimal solutions by using sub-swarms searching grid cells in which the density of feasible solutions is high. Simulation results demonstrate that the proposed algorithm improves the accuracy of the standard PSO algorithm in searching the optimal solution of service selection problem. © 2013 Elsevier Inc.


Gong J.,Beijing University of Posts and Telecommunications | Gong J.,EB Information Technology Co. | Li W.,Beijing University of Posts and Telecommunications | Li W.,EB Information Technology Co. | And 4 more authors.
Proceedings of 2013 5th IEEE International Conference on Broadband Network and Multimedia Technology, IEEE IC-BNMT 2013 | Year: 2013

Due to inevitable cross-layer conflict existing in route objectives of overlay routing and traffic engineering, the interaction between two selfish players causes route oscillations and network performance loss. The interaction is investigated as a Nash routing game with best-reply, where two players have equal status, and take turn to optimize their routes. Overlay routing aims to minimize the total latency of all the overlay paths, while traffic engineering aims to minimize the maximum link utilization of the native network. We propose two simple strategies for overlay and native layers. The simulation results under various network conditions show that these two strategies reduce the route flaps and increase the stability of the whole network. © 2013 IEEE.


Gong J.,Beijing University of Posts and Telecommunications | Gong J.,EB Information Technology Co. | Li W.,Beijing University of Posts and Telecommunications | Li W.,EB Information Technology Co. | And 4 more authors.
IET Seminar Digest | Year: 2013

Due to inevitable cross-layer conflict existing in route objectives of overlay routing and traffic engineering, the interaction between two selfish players causes network oscillations and routing performance loss. The interaction is investigated as a Nash routing game with best-reply, where two players have equal status, and take turn to optimize their routes. Overlay routing aims to minimize the total latency of all the overlay paths, while traffic engineering aims to minimize the maximum link utilization of the native network. We propose two simple, yet efficient strategies for overlay and native layers. The simulation results under various network conditions show that these two strategies help the interaction converge to an acceptable stable state in a short time and increase the stability of the whole network.


Liao J.,Beijing University of Posts and Telecommunications | Liao J.,EB Information Technology Co. | Liu Y.,Beijing University of Posts and Telecommunications | Liu Y.,EB Information Technology Co. | And 6 more authors.
2013 19th Asia-Pacific Conference on Communications, APCC 2013 | Year: 2013

Service composition is an efficient way to implement a service of complex business process. In service composition, service selection considering multiple QoS objectives is a challenge. Existing methods mainly utilize fitness function or constraint technique to convert multiple objectives service composition problems to single objective ones. These methods take effect with priori knowledge of problem's solution space. Besides, only one solution can be obtained in each execution of one existing method. Users can hardly acquire evenly distributed solutions with acceptable computation cost. In this paper, we propose a lightweight particle swarm optimization service selection algorithm using approximate distance and external archive mechanisms. Simulation results demonstrate that the proposed algorithm is more effective and efficient than the compared algorithm for multi-objective service composition problems. © 2013 IEEE.

Discover hidden collaborations