Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints

A simple path, multi-constraint technology, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve problems such as mistakenly deleting suboptimal paths, difficult path quantity and quality, etc., to improve quantity and quality, and avoid calculation the effect of time

Inactive Publication Date: 2010-06-23
BEIHANG UNIV
View PDF0 Cites 21 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Obviously, the disadvantage of this approach is that many suboptimal paths that happen to be controlled in the cost comparison are deleted by mistake, so it is difficult to guarantee the quantity and quality of the found paths at the same time

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 method for working out a plurality of shortest simple routes in network under multiple constraints
  • Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints
  • Heuristic method for working out a plurality of shortest simple routes in network under multiple constraints

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0070] In order to better verify the performance of the method proposed by the present invention, it is respectively applied to a Mesh network with a regular topology and a Waxman network with a random topology for simulation. The simulation also considers the number of nodes N (including 25, 50, 100) and the constraint degree γ (including 4.5, 1.5) in various networks. Each link in the network has two uniformly distributed and uncorrelated cost components randomly generated in the [0, 10] interval. The performance of the method is evaluated by the average effect of executing 10,000 randomly generated routing requests of source and destination nodes. The parameters used for performance evaluation include: the average number of valid paths in the path search results (abbreviated as AN), the average optimality of valid paths (abbreviated as AO), and the probability of successfully finding at least one valid path (abbreviated as SR). The method used for performance comparison is...

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 heuristic method for working out a plurality of shortest simple routes in network under multiple constraints. The method uses improved route control rules and predication of lower price limit after extending the routes to destination nodes, and abandon the routes which contain rings, break the constraints and exceed the cost of the k obtained shortest simple route. In the reserved routes, front k shortest simple routes meeting constrain conditions are searched in the breadth-first way and adjustable precision. The method has strong adaptability on network types, scales and change of constrain degrees, and the complexity of the method is approaching to the traditional breadth-first searching method. The heuristic method for working out a plurality of shortest simple routes in network under multiple constraints can shown excellent and stable performances on the aspects like route quantity, quality and capacity for discovering routes by setting the probing depth of middle ring of route and retracting coefficients of controlled decision.

Description

technical field [0001] The heuristic method for obtaining multiple shortest simple paths in a network under multiple constraints belongs to the field of Internet routing technology, and in particular relates to the field of quality of service routing for quickly finding multiple simple paths under the constraints of multiple quality of service parameters. Background technique [0002] Providing routes that can guarantee Quality of Service (QoS) in the Internet has become a hot issue in today's network technology. QoS constraints are usually divided into two types of link constraints (such as bandwidth) and path constraints (such as delay): wherein the link constraint problem can be solved by pre-cutting the links that do not meet the constraints in the network; and the present invention focuses on The path constraint problem is relatively complicated, especially when the number of constraints m≥2, the problem is further transformed into finding the optimal path under multipl...

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/56H04L45/122
Inventor 刘阳郑铮刘兴春
Owner BEIHANG UNIV
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