Data center-oriented offline scene low-bandwidth cost flow scheduling scheme

A traffic scheduling, data-oriented technology, applied in the Internet field, can solve the problems of increasing the complexity of traffic scheduling, increasing storage overhead, etc., and achieve the effects of minimizing overhead, saving scheduling overhead, and strong practicability

Active Publication Date: 2017-12-08
TSINGHUA UNIV
View PDF4 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Both of these ideas require adding additional storage devices in each data center to temporarily store traffic passing through each data center, which not only increases additional storage overhead, but also increases the complexity of traffic scheduling

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
  • Data center-oriented offline scene low-bandwidth cost flow scheduling scheme
  • Data center-oriented offline scene low-bandwidth cost flow scheduling scheme
  • Data center-oriented offline scene low-bandwidth cost flow scheduling scheme

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0039] The implementation of the present invention will be described in detail below in conjunction with the drawings and examples.

[0040] Such as figure 1 As shown, the present invention considers the scheduling problem of a large transmission stream within a lease period, and divides the period into several transmission time slots, namely 1,...,T. Use a directed graph G=(V, E) to represent the link between the data center and the data center, where V is the node set of the directed graph, representing the collection of all data centers, and E is the edge of the directed graph Set, which represents the set of all links. with quintuple r i =(s i , t i , d i , a i , τ i) to represent a bulk transport stream, where s i , t i , d i , a i , τ i Represent the source node, destination node, data volume, arrival time, and deadline of the i-th large block transmission stream, respectively.

[0041] For a bulk transport stream r i , the time it transmits data is limited...

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 relates to an internet transmission control technology, specifically to a data center-oriented offline scene low-bandwidth cost flow scheduling scheme, and aims to reasonably schedule each block transmission stream on the premise of guaranteeing that all block transmission flows are completed on time, so that bandwidth hiring cost of a data center owner is minimum. The execution flow includes 1) obtaining the source nodes, destination nodes, data sizes, and arrival and cutoff time of all block transmission streams in a hiring period; 2) dividing the hiring period into a plurality of transmission time slots, reasonably scheduling the transmitting path and transmitting rate of each block transmission stream in each transmission time slot, and achieving minimization of bandwidth cost on the premise of guaranteeing that all the block transmission streams are completed. The data center-oriented offline scene low-bandwidth cost flow scheduling scheme provided by the invention can, on the premise of guaranteeing service quality, effectively reduce cost of the data center owner of hiring bandwidth from an internet service provider, and reduce data center operating cost.

Description

technical field [0001] The invention belongs to the technical field of the Internet, relates to traffic scheduling technology, and in particular to a data center-oriented low-bandwidth overhead traffic scheduling scheme for offline scenarios. Background technique [0002] Today, many network service providers and cloud service providers such as Google and Microsoft have data centers in different geographical regions. These data centers run various globally distributed applications, so they have the need to communicate with each other. WAN is the guarantee These data centers distributed in different geographical locations are key facilities that can communicate with each other. The communication requirements between these data centers have resulted in high bandwidth overheads. Usually, data center owners pay hundreds of millions of dollars to Internet service providers every year to rent WAN bandwidth. However, the bandwidth utilization rate between data centers is not high,...

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/863
CPCH04L47/10H04L47/50
Inventor 崔勇杨振杰肖诗汉李楚鸣
Owner TSINGHUA 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