Unlock instant, AI-driven research and patent intelligence for your innovation.

Adjustable heuristic routing method of quality of service based on width first search

A breadth-first, quality-of-service technology, applied in data exchange through path configuration, digital transmission systems, electrical components, etc., to solve problems such as inability to find, high computational complexity, and low algorithm performance

Inactive Publication Date: 2003-05-07
TSINGHUA UNIV
View PDF0 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, these algorithms often have great limitations: (1) The computational complexity is too high to be applied to the actual environment; (2) The performance of the algorithm is too low to find a feasible path; (3) The algorithm is only for Designed for some special cases, not universal
Due to the non-linear nature of the cost function, it is not guaranteed to find the minimum g in polynomial time λ The path p of (p), so the algorithm uses a variant of Dijkstra's algorithm to calculate the K shortest path, and the complexity of the algorithm is O(Knlog(Kn)+K 3 km)

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
  • Adjustable heuristic routing method of quality of service based on width first search
  • Adjustable heuristic routing method of quality of service based on width first search
  • Adjustable heuristic routing method of quality of service based on width first search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] Use a directed graph G(V, E) to represent a network, where V is a node set, and element v∈V is called a vertex (node) of graph G; E is an arc set, and element e ij ∈E is denoted as e=v i → j is called an edge of graph G. In QoSR, each link e is associated with a set of independent weights (w 1 (e), w 2 (e),...,w k (e)) is called the QoS measure of link e, abbreviated as w(e). where w l (e)∈R + (ie, the set of real numbers greater than 0) is the measure of the path constraint type, for 1≤l≤k. That is, for the path p=v 0 → 1 →…→v n , the weight w l ( p ) = Σ i = 1 n w l ( v i - 1 → v i ...

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 belongs to the technique area of the route of the interconnecting network. First, each parameter of the quality of service request is input to the computer. Based on the linear energy function, the shortest route tree in reverse direction is built by using the Dijkstra algorithm and the target node as the root of the tree. The K weighted value of each node of the shortest route tree in reverse direction to the target node is calculated. Based on the value, all nodes are marked in revrese direction. Finally, based on the non linear energy function, the shortest route tree in positive direction is calculated by using the Dijkstra algorithm. When a node being added to the tree, it is needed to consider that whether all sub-nodes within the search depth are optimal.

Description

technical field [0001] A performance-tunable heuristic quality of service routing algorithm based on breadth-first search belongs to the technical field of Internet routing, and in particular relates to a quality of service routing technology with multiple quality of service parameters. Background technique [0002] How to provide different quality of service (Quality-of-service, QoS) guarantees for applications is an important problem facing the Internet, and quality of service routing (QoS Routing, QoSR) is one of the core technologies and hot issues, its The main function is to find a feasible path for QoS services that can satisfy multiple QoS constraints at the same time. Usually QoS restriction can be divided into link restriction and path restriction. Among them, the link limitation can be transformed into a limitation on the bottleneck link on the entire path, such as bandwidth; and the path limitation is a limitation on all links on the end-to-end path, such as del...

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/24H04L12/28H04Q3/00
Inventor 吴建平崔勇徐恪
Owner TSINGHUA UNIV