Method for minimizing priority seizing cost

A priority and minimization technology, applied in the field of data communication, can solve the problems of reduced accuracy, reduced complexity, low selection accuracy, etc.

Active Publication Date: 2008-02-20
CHINA TELECOM CORP LTD
View PDF0 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0019] One of the purposes of the present invention is to overcome the problem that the preemption optimization function V-PREPT in the prior art only takes into account the total bandwidth of the preempted LSPs and does not consider the adaptability between the total bandwidth of the preempted LSPs and the bandwidth r that needs to be preempted The problem is to propose a minimum preemption cost optimization function that takes the adaptability between the total bandwidth of the actually preempted LSP and the bandwidth r that needs to be preempted as a component of the preemption optimization function, named H-PREPT, so that this The improved preemption optimization function is more reasonable
[0020] The...

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
  • Method for minimizing priority seizing cost
  • Method for minimizing priority seizing cost
  • Method for minimizing priority seizing cost

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0071] The method for minimizing the preemption cost of the present invention can be widely used in a network environment with differentiated requirements requiring priority preemption and a network environment where bandwidth resources are scarce. The method can be executed by Internet routers running routing protocols characterized by "distributed" to realize online selection of preempted LSPs, or by network management entities characterized by "centralized" to realize preempted LSPs offline selection.

[0072] The present invention defines a preemption cost function H-PREPT, namely

[0073] F(z)=α(z·y T )+β(z 1 T )+γ(z·b T -r)——Formula 1

[0074] The difference between it and the formula 3 in the prior art is that the third item on the right side of the formula is different. The prior art is z·b T , and the present invention is z · b T -r, that is to say, the present invention considers the bandwidth waste of the total bandwidth of the preempted label switching path c...

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 utility model relates to a method for realizing minimum priority preemption cost in the multiprotocol marking flow exchange, which comprises the following steps: defining a preemption cost function named as H-PREPT, that is, F(z)=Alpha(z x yT)+Beta(z x 1T)+Gamma(z x bT-r). When the condition z x bT is more than or equal to r is meet, the value of Z is solved when the F(z) in the formula reaches the minimum value, so as to ascertain which marked exchange paths are to be preempted. The utility model overcomes the problem in the prior art that the priority method only considers the total bandwidth of the preempted LSP but gives no consideration to the compatibility between the total bandwidth of the preempted LSP and the bandwidth r to be preempted. Compared with the heuristic method of U-PREPT in the prior art, the heuristic method of H-PREPT is put forth, and greatly enhances the accuracy of choices while with equally low complexity for computation.

Description

technical field [0001] The present invention relates to the field of data communication, in particular to a method for minimizing the cost of priority preemption by an Internet router or a network management entity in Multi-Protocol Label Switching Traffic Engineering (MPLS-TE). Background technique [0002] Provide traffic engineering based on Multi-Protocol Label Switching (MPLS) on the IP multi-service bearer network, especially the backbone network, to maximize network resource utilization, balance network load distribution, and implement multiple services such as voice, video and data. Differentiated service is the most active research topic in the field of IP communication network. The core of MPLS traffic engineering is bandwidth reservation and management. In a network environment where bandwidth resources become scarce and there are a large number of delay-sensitive traffic flows, preemption can ensure that high-priority traffic (label-switched path LSPs) can alway...

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/56H04L12/24H04L29/06H04L47/6275
Inventor 何晓明陈健儿王志中王俊松
Owner CHINA TELECOM CORP LTD
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