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

High-efficient resource allocation method based on sensitivity in reconfigurable network

A resource allocation and sensitivity technology, applied in the field of network communication, can solve problems such as low time complexity and lower network request acceptance rate, and achieve the effects of reducing delay, increasing average request acceptance rate, and improving overall performance

Inactive Publication Date: 2015-11-04
ZHENGZHOU UNIV
View PDF0 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0007] In a network that does not consider resource constraints, the layered graph algorithm can effectively solve the problem of service composition with low time complexity; while in a resource-constrained network, although the capacity tracking algorithm introduced in the layered graph algorithm can effectively avoid resources However, due to the existence of resource bottlenecks in the network, end-to-end requests may still be rejected in the presence of effective service paths, resulting in a decrease in the acceptance rate of network requests (1.Huang, Xin, Sivakumar Ganapathy, and Tilman Wolf."Evaluating algorithms for composable service placement in computer networks."In Communications,2009.ICC'09.IEEE International Conference on,pp.1-6.IEEE,2009.2.S.Choi,J.Turner, and T. Wolf, "Configuring sessions in programmable networks," Computer Networks, vol.41, no.2, pp.269–284, 2003.)

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
  • High-efficient resource allocation method based on sensitivity in reconfigurable network
  • High-efficient resource allocation method based on sensitivity in reconfigurable network
  • High-efficient resource allocation method based on sensitivity in reconfigurable network

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0033] Such as figure 1 As shown, an efficient resource allocation method based on sensitivity in a reconfigurable network, the method includes the following steps:

[0034] A1. In a reconfigurable network with limited resources, first use the layered graph and capacity tracking algorithm to process end-to-end connection requests, and select the service path with the lowest delay among all effective service paths; then calculate the reconfigurable network Sensitivity Sen(i) of each node i in , at the same time calculate the average utilization of CPU resources of the node and link bandwidth resource average utilization The sensitivity Sen(i) of node i is the difference between the average request acceptance rate of the reconfigurable network and the average request acceptance rate when the node i and its associated links are absent.

[0035] A2. Calculate the difference ΔSen between the maximum value and the second maximum value of the sensitivity Sen(i), and calculate the...

Embodiment 2

[0047] Such as figure 2 As shown, the reconfigurable core network includes 8 reconfigurable routers numbered 1-8 in sequence, and each router node can realize different types of meta-capabilities, for example: node 1 can realize meta-capability AC1 and meta-capability AC2, available CPU resources are at 50%. In the working environment, the reconfigurable core network will continuously receive end-to-end connection requests. The request packet contains the source node and destination node, functional requirements and performance requirements. For example, in the request packet 1, the source node is Node 1, the destination node is node 5, the functional requirements are the combination of meta-capabilities (AC1, AC3, AC4), the performance requirements are bandwidth requirements of 200Mb / s, and the computing resource requirements of the three meta-capabilities are determined by the CPU computing speed and data volume . In order to meet the requirements in the request packet 1,...

Embodiment 3

[0056] This embodiment specifically explains the process of allocating CPU resources to the node with the largest sensitivity value.

[0057] in such as Figure 4 In the topological structure of the reconfigurable network autonomous domain 1 shown, node 7 is the node with the largest sensitivity value, node 11 is the node with the second largest sensitivity value, ΔSen=Sen(7)-Sen(11), ΔSen> alpha, The candidate bottleneck node is node 7, the number is 1, and the resource type that needs to be allocated additionally is CPU resource. For the process of allocating CPU resources to node 7, see Image 6 , through the following steps:

[0058] 1) Additional allocated CPU resources t cpu initial value t cpu (0) is 100%, and its upper limit γ cpu is 500%;

[0059] 2) Start the iterative process:

[0060] 2-1) Compare the current value t cpu (j) and upper limit γ cpu the size of:

[0061] 2-2) If t cpu (j)≤γ cpu , and then increase the CPU resource of Δcpu, that is, t ...

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 high-efficient resource allocation method based on sensitivity in a reconfigurable network. The method comprises: computing a difference value between the maximum value and the secondary maximum value of the sensitivity Sen (i), comparing the difference value with a threshold value [alpha], and determining a candidate bottleneck node where a resource is required to be extra allocated according to a comparison result; computing a difference value between node CPU resource average utilization rate and link bandwidth resource average utilization rate, comparing the difference value with a threshold value [beta], and determining the type of the resource required to be extra allocated to the candidate bottleneck nods according to a comparison result; according to the determined candidate bottleneck node and the determined type of the resource required to be extra allocated, gradually increasing the corresponding recourse of the candidate bottleneck node by using an iterative method until a network average request acceptance rate converges or corresponding resource increment exceeds an upper limit. By effectively allocating extra resource to the candidate bottleneck node, the method solves a problem of a decrease in a request acceptance rate due to a resource bottleneck in a layered graph + capacity tracking algorithm.

Description

technical field [0001] The invention relates to the technical field of network communication, in particular to a sensitivity-based efficient resource allocation method in a network with a reconfiguration function. Background technique [0002] One research direction of the future Internet architecture is to decompose the network protocol stack into fine-grained network services, remove the constraints between different layers of the protocol stack, and then provide customizable end-to-end services for end systems at the edge of the network through service composition. side service. This research idea is reflected in SILO, NSA in the United States, ANA in Europe, and my country's reconfigurable network and SOFIA. [0003] Each node of the reconfigurable network is a reconfigurable router with a reconfigurable function. In reconfigurable networks, the data transmission and processing functions of reconfigurable routers are decomposed into fine-grained functional units: metac...

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/801H04L12/873H04L12/875H04L47/52H04L47/56
CPCH04L47/11H04L47/522H04L47/56H04L47/726
Inventor 庄雷马丁宋涛陈鸿昶胡颖宋玉王瑞民张坤丽王国卿
Owner ZHENGZHOU UNIV