A Periodic Scheduling Method in High Performance Networks

A scheduling method and high-performance technology, applied in the field of computer networks, can solve problems such as insufficient utilization of bandwidth resources, inability to adapt to larger-scale data transmission, etc., to improve bandwidth utilization, flexible path bandwidth, and improve The effect of scheduling success rate

Active Publication Date: 2022-07-29
NORTHWEST UNIV
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The periodic bandwidth scheduling of existing high-performance networks is based on single-path fixed bandwidth or multiple paths with fixed bandwidth, which cannot make full use of bandwidth resources, and cannot well adapt to larger-scale data transmission and higher real-time performance. transmission needs

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
  • A Periodic Scheduling Method in High Performance Networks
  • A Periodic Scheduling Method in High Performance Networks
  • A Periodic Scheduling Method in High Performance Networks

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0051] In order to better explain the method of the present invention, in figure 2 In the network diagram shown, a pair of 4 nodes is designated as the source node and the target node, and there are 5 links. The bandwidth allocation of each link is as follows: image 3 shown in the ATB table. Assuming that the four requests shown in Table 2 are randomly generated, the specific operations for scheduling these requests are as follows:

[0052] Table 2

[0053] brr v s

v d

B max (Gb / s)

D(Gb) [tS,t E ](s)

brr1 s a 20 54 [5,10] brr2 s d 9 16 [3,6] brr3 d b 15 62 [0,6] brr4 a d 12 10 [8,10]

[0054] step 1:

[0055] Sort by data size, and the sorted request is {brr4,brr2,brr1,brr3}.

[0056] Step 2:

[0057] First dispatch request brr4. Earliest start time according to request, deadline time and t min =D / B max =0.83s, the timewindow that satisfies the request is [8,10]. According to Dijkstra, find the p...

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 technical field of computer networks, and specifically discloses a periodic scheduling method in a high-performance network. The method of the present invention includes for a given batch of multiple user reservation requests under the constraints of the maximum transmission bandwidth of the local area network and the deadline, the present invention aims to find out the number of flexible paths in the transmission time slot, and utilize the flexible bandwidth For transmission, the scheduling method provided by the present invention can process more requests with the minimum bandwidth consumption ratio and the minimum average completion time.

Description

technical field [0001] The invention belongs to the technical field of computer networks, and relates to a periodic scheduling method in a high-performance network. Background technique [0002] Large-scale applications in various fields of science, engineering, and business generate massive amounts of data that often need to be transmitted quickly and reliably over long distances. Unfortunately, the traditional Internet is a sharable network, and it is difficult to meet the challenges of such unprecedented large-scale data transmission tasks. High-performance networks incorporating SDN technology to provide dedicated channels through bandwidth reservation have become a promising solution to meet big data transmission needs. Network infrastructure such as edge devices, core switches, and backbone routers in high-performance networks are usually coordinated by a management framework, the control plane, responsible for reserving link bandwidth, establishing end-to-end network...

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 Patents(China)
IPC IPC(8): H04L47/52H04L47/625H04L47/628
CPCH04L47/522H04L47/625H04L47/628
Inventor 吴奇石严丽荣侯爱琴乔芮敏许明睿张晓阳
Owner NORTHWEST 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