Multicast routing method based on particle swarm algorithm

A particle swarm algorithm and routing technology, applied in computing, computing models, instruments, etc., can solve problems such as long computing time, and achieve fast convergence and strong robustness

Inactive Publication Date: 2009-06-03
SUN YAT SEN UNIV
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the disadvantage of these two algorithms is that the calculation ti

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multicast routing method based on particle swarm algorithm
  • Multicast routing method based on particle swarm algorithm
  • Multicast routing method based on particle swarm algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0024] The method of the invention will be further described below in conjunction with the accompanying drawings.

[0025] Suppose N = {V, E} is an undirected, connected network cost graph, where V is the set of nodes and E represents the set of edges. A function c evaluates the cost of each edge e in E. A subset D of V contains all target nodes (source nodes are also considered target nodes), and a subset S=V / D contains all intermediate nodes. The goal of multicast routing is to find a minimum cost tree T connecting all target nodes and some intermediate nodes. If T can be expressed as T={V * ,E *}, then the objective can be expressed by the equation as

[0026] f = MinT = min Σ e ∈ E * c ( e ) , in V * ⊆...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention aims at solving the multicast routing problem by applying a particle swarm algorithm. Firstly, a connecting network is converted into a distance complete graph based on a Floyd algorithm, and then the particle swarm algorithm is applied to searching for an optimal multicast tree on the basis of the distance complete graph. In the particle swarm algorithm, each particle is encoded into a binary character string to represent a node for constructing the multicast tree, wherein, '1' means that the node is used while '0' means that the node is not used. Each particle constructs the multicast tree by a Prim algorithm based on the binary character string; and a constructed multicast tree can be evaluated when redundant parts of the multicast tree are cut off. Experimental results prove that a better result can be obtained by the particle swarm algorithm of the invention compared with the traditional heuristic algorithm.

Description

Technical field: [0001] The invention belongs to routing technology in computer network communication, in particular to a multicast routing method using particle swarm algorithm. technical background: [0002] With the development of computer network and communication technology, the problem of multicast routing has attracted attention from all over the world. In a nutshell, the problem of multicast routing can be described as looking for information transmission paths from source nodes to multiple destination nodes according to a certain standard in a specific network. This is a fundamental problem in many communication applications, such as mass mailing, broadcast television, telephony, and video-on-demand. Therefore, how to build an efficient multicast tree has become an important issue in multicast routing applications. If the network is regarded as a connected weighted undirected network, network nodes and related links are abstracted into corresponding graph nodes an...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H04L12/56H04L12/24G06N3/00H04L45/16
Inventor 张军詹志辉黄韬
Owner SUN YAT SEN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap