Dynamic allocation method of coding vector based on graph coloring in multicast network

A coding vector and dynamic allocation technology, which is used in data exchange networks, devices that provide special services in branches, data exchange details, etc. Ensure that the destination node successfully decodes and other issues

Inactive Publication Date: 2009-11-11
BEIJING UNIV OF POSTS & TELECOMM
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] Therefore, due to the limitation of the encoding vector alphabet, the existing encoding vector allocation method cannot fully guarantee the linear independence of the global encoding vector received by the destination node, so it cannot guarantee that the destination node can decode successfully, and also It cannot dynamica...

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
  • Dynamic allocation method of coding vector based on graph coloring in multicast network
  • Dynamic allocation method of coding vector based on graph coloring in multicast network
  • Dynamic allocation method of coding vector based on graph coloring in multicast network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0034] Firstly, the relevant terms involved in the present invention will be introduced below.

[0035] Global coding vector: when network coding is performed, the source node selects from the finite field and allocates a vector for each link;

[0036] Local coding vector, when network coding is performed, the source node is allocated by the coding node, and is used to calculate the global coding vector of the downstream link of the node;

[0037] Disjoint path: multiple edge-disjoint transmission paths established from the source node to the same destination node;

[0038] Alphabet required for network coding: The information sent by the source, the information carried on the link, and various calculation criteria on the node all occur on the finite field Fq, which is called the alphabet required to realize network coding.

[0039] Network-coded multicast tree: Before transmitting data on a network-coded multicast network, a multicast tree suitable for network co...

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 discloses a dynamic allocation method of coding vector based on graph coloring in a multicast network. Coding vectors are allocated for the multicast network based on network coding, that target node receives global coding vector linearity is not related is guaranteed. Based on the purpose, the invention provides a coding vector allocation method based on graph coloring, the method comprises the following steps of: converting a multicast tree needing allocation coding vector into a line graph, then dividing the line graph into different areas for constructing simple planar graph, next, mapping different colors into different coding vectors which are allocated to each top point of the areas (namely each edge of the multicast tree). After the global coding vectors are allocated for all the edges of the multicast tree, a source node is needed to record original coding vectors, the target node records decoding matrix, and the coding node calculates and records local coding vectors. During the transmission of data, the source node and the coding node need to transmit linear combination of information vectors and coding vectors downward; and the target node calls the decoding matrix and adopts a Gaussian elimination method for decoding.

Description

technical field [0001] The present invention designs a method for allocating encoding vectors in a multicast network, mainly adopting a dynamic allocation method based on graph coloring to configure the encoding vectors in a network encoding multicast network. Background technique [0002] With the rapid development of network technology, multicast, as an indispensable technology in the future network, has been regarded as supporting various point-to-multipoint broadband applications such as high-definition television (HDTV), multimedia file distribution, and game distribution. key technologies. At the same time, with the rapid increase in the number of users, the diversification of network services and the continuous improvement of network transmission quality requirements, how to improve the utilization of existing network resources and optimize the network has become one of the important topics in today's network communication research. Network coding (Network coding) is...

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/18H04L29/06H04L12/56H04L45/16
Inventor 柏琳王肖玲
Owner BEIJING UNIV OF POSTS & TELECOMM
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