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

Heuristic spanning method and system for link state routing

A free and node-based technology, applied in the transmission system, electrical components, wireless communication, etc., can solve the problems of not being able to generate trees, not taking into account the network status, and lack of information

Inactive Publication Date: 2014-12-24
MAXTECH COMM NETWORKS
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although only a few of these methods take into account the quality of communication between network nodes, none of these methods take into account the state of the entire network
This situation can cause considerable data loss during the operation of the network
Therefore, due to the lack of information (in terms of the state of the network or in terms of the strength of connections) during the spanning tree phase, a truly optimal tree cannot be generated

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
  • Heuristic spanning method and system for link state routing
  • Heuristic spanning method and system for link state routing
  • Heuristic spanning method and system for link state routing

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0108] This example is provided in a non-limiting manner to illustrate a scope of the invention, wherein in a method for selecting at least one relay in a communication network, the network comprising a plurality of nodes; each of the nodes comprising At least one processing unit; each pair of nodes is characterized by an integer between 0 and 3, where 0 means that the two nodes are not connected, and any number between 1 and 3 means that the nodes are connected and the strength. From image 3 As can be seen from , the relay 300 is connected to two nodes with the first connection number 3 and the first connection number 3, namely the second node 1301a and the second node 2301b. Node 1301a is connected with first connection number 3 and first connection number 3 to third node 4302a and third node 3302b. Node 2301b is connected to third node 5302c and third node 3302b with first connection number 1 and first connection number 2, respectively. The relay is not connected to the...

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

A system and method for selecting at least one relay in a communication network; the network comprises a plurality of nodes; each of the nodes comprises at least one processing unit; each pair of the nodes is characterized by a first connection number; a first score is associated with each pair of (i) a first first connection number and (ii) a second first connection number; and each of the processing unit is programmed to execute the method.

Description

technical field [0001] The present invention relates generally to the field of link-state routing protocols for finding optimal spanning trees in communication networks. Background technique [0002] The optimal management of communication networks has been a constant challenge for many years. Communication network management systems need to find a balance between using system resources and optimizing the connectivity of network users. [0003] The following prior art is considered to be the current state of the art. [0004] Various protocols have been used to optimize network management systems over the years, various protocols include: on-demand distance vector (AODV), on-demand multicast routing protocol (ODMRP), optimized link state routing protocol (OSLR), differential destination group broadcast (DDM) routing protocol, multicast on-demand distance vector (MAODV) routing protocol, topology broadcast based on reverse path forwarding (TBRPF), dynamic source routing (DS...

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): H04W40/22H04L45/24
CPCH04W40/30H04L45/48H04L45/24H04W40/22
Inventor 亚基尔·马图索夫斯基乌齐·哈努尼博阿茨·达冈
Owner MAXTECH COMM NETWORKS
Features
  • Generate Ideas
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

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

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