Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Multiple-constraint multicast routing algorithm based on iteration coding

A multi-constraint and routing technology, applied in the field of network communication, can solve problems such as slow solution speed and high computational complexity, and achieve the effect of ensuring equipment investment, simple algorithm implementation, and solving multi-constraint multicast routing problems

Active Publication Date: 2014-07-02
NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, when the above algorithm solves the multi-constraint multicast routing problem, it has the disadvantages of slow solution speed and high computational complexity.

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
  • Multiple-constraint multicast routing algorithm based on iteration coding
  • Multiple-constraint multicast routing algorithm based on iteration coding
  • Multiple-constraint multicast routing algorithm based on iteration coding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0047] For a communication network with multi-constraint requirements, it can be abstracted as a directed connected graph, V represents the node set of the network, and E represents the link set of the network, which is the source routing node, the destination routing node, and any one in the network link. The network routing in this network has the following QoS constraints: Delay (De req ), delay jitter (DJ req ), throughput (Th req ), packet loss rate (PLR req ). The purpose of the present invention is to efficiently generate a multicast routing tree so that it can satisfy the above-mentioned routing constraints as much as possible. Unicast and broadcast routing can be regarded as two special cases of multicast routing (unicast routing is a link without forks; broadcast routing is the source node sends data to all nodes in the communication network; this is multicast The two extreme cases of the tree, the multicast tree is to send data from the source node to the selec...

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 relates to the field of network communication, in particular to a multiple-constraint multicast routing algorithm based on iteration coding. The multiple-constraint multicast routing algorithm based on iteration coding is applied to a communication network with multiple-constraint requirements aiming at the problems existing in the prior art. According to the method, a multicast tree coding method capable of eliminating a loop and high in coding and decoding applicability is designed, and meanwhile, the method can also eliminate a loop of a generated multicast tree. According to the method, a new multicast tree is generated by combining two multicast trees, and the new multicast tree is output after it is confirmed that the new multicast tree meets a routing constraint condition or the calculating process reaches iteration times.

Description

technical field [0001] The invention relates to the field of network communication, in particular to a multi-constraint multicast routing algorithm based on iterative coding. Background technique [0002] In current network communication, multicast communication is an important way. Compared with unicast communication, multicast communication is more effective in point-to-multipoint data transmission. The key to realizing multicast communication is to establish multicast routing. Different from the transmission path in unicast communication, the topology of multicast routing is a multicast tree. At present, services carried by communication networks have differentiated network transmission QoS requirements. These requirements are mainly reflected in several aspects such as transmission delay, delay jitter, throughput and packet loss rate in the network communication process. This makes the problem of multicast routing under multi-constraints a research hotspot. In the e...

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
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/761H04L45/16
Inventor 刘杰田永春姜永广胡薇
Owner NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com