Stream scheduling method for task classes in data center

A technology of data center network and central scheduling algorithm, applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve problems such as inability to guarantee completion, and achieve the goal of improving throughput, reducing network task completion time, and saving network resources. Effect

Active Publication Date: 2015-07-08
TSINGHUA UNIV
View PDF5 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, most applications in the current data center network obey the Partition-Aggregate structure. A task in the network contains multiple network flows. If one flow can be completed before the deadline, it does not guarantee that all the flows in the task can be completed before the deadline.

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
  • Stream scheduling method for task classes in data center
  • Stream scheduling method for task classes in data center

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] The preferred embodiments will be described in detail below in conjunction with the accompanying drawings.

[0022] The present invention proposes a task-level flow scheduling method in a data center network, the main goal of which is to maximize the number of tasks completed before a deadline. The priority of the network flow is determined by the deadline of the network flow and the size of the network flow. At the same time, the higher priority network flow should be processed and transmitted first, which means that the higher priority flow can preempt the lower priority flow. bandwidth of the stream. In order to reduce the average network flow completion time, at most one network flow can be transmitted on a link at a time. This means that when a network flow starts to transmit, this network flow will monopolize the entire link bandwidth.

[0023] Steps of the present invention specifically include:

[0024] (1) When a new task arrives at the sending server, the n...

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 field of data center networks, and particularly relates to a stream scheduling method for task classes in a data center. The stream scheduling method includes the steps that an SDN controller is additionally arranged in a data center network, after servers receive new tasks, network stream information of the tasks is packaged in a message, and the packaged information message is sent to the SDN controller; the SDN controller operates a central scheduling algorithm, and whether the tasks should be received or abandoned is judged; for the received tasks, the SDN controller sends routing table items of the tasks to a middle switch according to the calculation result of the central scheduling algorithm and meanwhile sends transmission time slices of the tasks to the corresponding servers. Emergent network streams can be preferably scheduled before cut-off time, the network throughput is increased, the average network stream transmission time is shortened, and maximization of the number of the tasks finished before the cut-off time is achieved.

Description

technical field [0001] The invention belongs to the field of data center networks, and in particular relates to a task-level flow scheduling method in a data center. Background technique [0002] Data center network is an important direction of today's network research. With more and more delay-sensitive applications in the field of data center network, the requirements of data center network for transmission delay are increasing. In order to transmit network traffic more efficiently, so that the network flow can be transmitted before the deadline, the research on reasonable scheduling of network flow combined with the deadline information of network flow is attracting more and more attention from academia and industry. In the traditional data center network, the traditional transmission control protocol TCP is generally used. However, the average bandwidth allocation mechanism of TCP is not suitable for the delay-sensitive data center network. Some urgent network flows are ...

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/865H04L29/06H04L47/6275
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