Coding resource adaptive scheduling algorithm in distributed network

A scheduling algorithm and network coding technology, applied in broadcast service distribution, digital transmission systems, electrical components, etc., can solve the problem of coding resource consumption, unable to guarantee 100% successful decoding of destination nodes, and unable to dynamically adapt to network topology, etc.

Inactive Publication Date: 2010-06-30
BEIJING UNIV OF POSTS & TELECOMM
View PDF0 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method also has its inevitable limitations, that is, a large amount of coding resources are consumed and the destination node is difficult to decode.
[0008] Due to the limitation of the encoding vector alphabet, the existing encoding and decoding algorithms in the distributed network cannot

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
  • Coding resource adaptive scheduling algorithm in distributed network
  • Coding resource adaptive scheduling algorithm in distributed network
  • Coding resource adaptive scheduling algorithm in distributed network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] A preferred example of the present invention describes in detail the coding resource adaptive scheduling algorithm in this multicast network in conjunction with the accompanying drawings as follows:

[0027] figure 1 It is a classic NSFNet topology. In order to achieve effective coding resource scheduling and successfully realize multicast data transmission based on network coding, we need to number each node in turn. Select source node S, destination node T 1 ,T 2 ,T 3 ,T 4 and T 5 . Divide the remaining nodes except the source node into the same sub-domain according to the principle that the nodes through which the same data flow flows, divide the network graph into different sub-domains, and number each domain in sequence. By default, the node with the smallest number in each subdomain is the central node of the domain it is in, acting as a scheduling room to store all information of the domain, such as domain number, encoding vector, and neighborhood number. ...

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 coding resource adaptive scheduling algorithm in a multicast network, comprising: dividing the subdomain of network topology which is needed to be processed by coding multicast, and then according to the different demands of a destination node, adopting scheduling algorithm for scheduling and configuring network resource especially coding vector resource in real time; after all information transmitted by an upstream link circuit is collected by the destination node, extracting coding vector of data header to form decoding matrix; and adopting Gaussian elimination method for decoding, and obtaining the needed primary data. The method can lead network coding resource to be configured according to the need, ensures a target end to receive the needed coding information at the most rapid speed, and decodes in time. In addition, nodes are allowed to take part in or exit from multicast at any time, so that distributed network coding multicast can be realized.

Description

technical field [0001] The invention designs an adaptive scheduling algorithm of coding resources in a multicast network, and mainly adopts the idea of ​​resource scheduling to schedule coding resources of each sub-domain in a network coding multicast network, so as to realize optimal configuration of coding resources. Background technique [0002] Network coding is a new emerging technology. Its proposal meets the needs of modern networks. Its theory and application have become a new hotspot in the field of communication. Different from the traditional store-and-forward mechanism, network coding combines the two concepts of coding and routing. By allowing intermediate nodes to code and combine multiple received data packets, the amount of information transmitted in a single transmission is increased, and the network is maintained The maximum information flow, thereby improving the overall performance of the network, to meet the growing demand for business transmission. [...

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): H04L1/00H04W4/06H04W72/04H04W72/12
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

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