Tree data center link layer load balancing routing method based on annealing method

A data center and load balancing technology, which is applied in data exchange networks, digital transmission systems, complex mathematical operations, etc., can solve problems such as link layer data congestion, load imbalance, low throughput, delay packet loss rate, etc., and achieve Effects of low time complexity, low latency, and reduced data flow packet loss rate

Active Publication Date: 2021-10-22
ZHEJIANG UNIV +1
View PDF7 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Solve the technical problems of unbalanced load and data congestion in the link layer of the traditional data center rou...

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
  • Tree data center link layer load balancing routing method based on annealing method
  • Tree data center link layer load balancing routing method based on annealing method
  • Tree data center link layer load balancing routing method based on annealing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0062] The present invention will be further described below in conjunction with drawings and embodiments.

[0063] 1. Establish a tree data center

[0064] Such as figure 1 As shown, the specific implementation to establish the topology of the tree data center is mainly composed of the edge layer, the aggregation layer and the core layer.

[0065] The edge layer is composed of M switches, and the switches at the edge layer are used as edge switches, and the M edge switches belong to N regional Pods on average;

[0066] The aggregation layer is composed of M switches, and the switches on the aggregation layer are used as aggregation switches. The M aggregation switches belong to N regional Pods on average; M is an integer multiple of N. In the Pod of the same area, each aggregation switch is connected to each edge switch, so that the aggregation switch and the edge switch are connected in pairs;

[0067] The core layer is composed of K switches, and the core switch is 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
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a tree data center link layer load balancing routing method based on an annealing algorithm. The method comprises the steps: setting a tree-shaped data center mainly composed of an edge layer, a convergence layer and a core layer up to serve as a link layer, wherein the edge layer, the convergence layer and the core layer each comprise a plurality of switches; then monitoring data of a switch in real time by a deterministic network, and calculating load bandwidths of uplinks and load bandwidths of downlinks of all links according to a bandwidth required by transmission and a topological structure of a tree-shaped data center; and iteratively processing the current iteration state according to the load bandwidth, and updating the routing scheme in real time according to the switching scheme to obtain the optimal routing scheme. According to the invention, the high-efficiency, high-reliability and low-delay routing method is realized, wherein the load of the data center is effectively balanced and the congestion condition of a switch port is reduced, so that the data flow routing delay is reduced, the data flow packet loss rate is reduced, and the method has the characteristics of low time complexity, low space complexity, high performance and the like.

Description

technical field [0001] The present invention proposes a routing method, especially a routing method for the link layer of a tree-shaped data center, so as to achieve the purpose of data center load balancing. Background technique [0002] With the advent of the era of big data, emerging services such as artificial intelligence, high-definition video, Internet of Things, and cloud computing have led to a rapid increase in the amount of network services processed by data centers. The traditional data Chinese network architecture cannot afford and meet existing business needs. As a new type of network architecture, software-defined network (SDN) realizes the separation of numerical control, and the data forwarding plane is implemented at the link layer. Real-time routing scheme calculated based on external authoring method. [0003] At present, there are some data center network load balancing solutions, but most of them cannot achieve high performance and low computational co...

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
IPC IPC(8): H04L12/721H04L12/803G06F17/10
CPCH04L45/38H04L47/125G06F17/10
Inventor 邓文琦胡冰
Owner ZHEJIANG 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