Inter-data-center big-data transmission bandwidth scheduling method with deadline constraint

A deadline and scheduling method technology, applied in the field of computer networks, can solve the problem of low utilization of network resources, and achieve the effect of improving the success rate of scheduling and making full use of it

Active Publication Date: 2019-04-12
NORTHWEST UNIV(CN)
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] Aiming at the problem that a single type of large data transmission request in the prior art cannot satisfy the need to transmit multiple user requests, and the utilization rate of network resources is low, the purpose of the present invention is to provide a data center with a deadline Constrained Big Data Transmission Bandwidth Scheduling Method

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
  • Inter-data-center big-data transmission bandwidth scheduling method with deadline constraint
  • Inter-data-center big-data transmission bandwidth scheduling method with deadline constraint
  • Inter-data-center big-data transmission bandwidth scheduling method with deadline constraint

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0081] In order to explain the method of the present invention better, in figure 2 represents the user input request transmitted over the network in Table 1, figure 2 The available bandwidth of each link in the link is shown in Table 2, and the specific processing is as follows:

[0082] Table 1

[0083] R 1 (FBBR):(v s ,v d ,4s,10Gb,15Gb / s,true)

R 2 (VBBR):(v s ,v d ,5s,20Gb,12Gb / s,false)

[0084] Table 2

[0085]

[0086] Step 1, sort the two user input requests in Table 1, and get the sorted request sequence R 1 , R 2 ;

[0087] Step 2, sequentially process the sorted request sequence;

[0088] process request R 1 : Judgment R 1 Request FFBR for large data with fixed bandwidth;

[0089] Combined with Table 2, the time slot 3 is obtained through the cut-off time of 4s, and the sequence for calculating the time slot combination is: [0,0],[1,1],[0,1],[2,2],[1,2] [0,2],[3,3],[2,3],[1,3],[0,3]

[0090] For time slots [0,0], the pat...

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 an inter-data-center big-data transmission bandwidth scheduling method with a deadline constraint. Firstly, user input requests are divided into two types of fixed-bandwidth big-data requests and variable-bandwidth big-data requests, sorting is carried out, then decision processing is sequentially carriedout according to a sorted request sequence, and two different methods are employed to respectively process the fixed-bandwidth big-data requests and the variable-bandwidth big-data requests. According to the method, the two different types of user requests of the fixed-bandwidth big-data transmission requests and the variable-bandwidth big-data transmission requests can be transmitted; request transmission can be quickly completed for processing of the fixed-bandwidth big-data transmission requests; and a scheduling success rate and a user satisfaction degree can be maximized for processing of the variable-bandwidth big-data transmission requests. The method improves a scheduling success rate of the user requests, and fully uses network resources.

Description

technical field [0001] The invention belongs to the technical field of computer networks, and relates to a large data transmission bandwidth scheduling method with deadline constraints between data centers. Background technique [0002] Similar to Internet Service Providers (ISPs), Cloud Service Providers (CSPs) aim to use existing network resources to meet the data transmission needs of as many customers as possible. Many large CSPs have deployed data centers (DCs) in different places to provide customers with various services. These data centers are usually connected by high-bandwidth wide area network (WAN). The bandwidth scheduling method in the existing high-performance network considers It is a single type of large data transmission request, which cannot meet the current requirements of transmitting multiple user requests, and has a low utilization rate of network resources. It is an important technical challenge for CSP to receive as many data transmission requests a...

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/725H04L12/729H04L29/08H04L45/125
CPCH04L41/0896H04L45/125H04L45/30H04L67/63
Inventor 吴奇石乔芮敏侯爱琴严丽荣许明睿张晓阳房鼎益
Owner NORTHWEST UNIV(CN)
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