SDN data center network flow scheduling algorithm based on multi-layer virtual topology energy saving
A technology of data center network and virtual topology, applied in the field of communication network, can solve the problem of low energy utilization rate, and achieve the effect of low energy consumption ratio and short average completion time
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0050] In order to enable those skilled in the art to better understand the technical solution of the present invention, the technical solution of the present invention will be further described below in conjunction with embodiments.
[0051] This embodiment implements an energy-saving multi-layer virtual sub-topology traffic scheduling algorithm (EMV-SDN) in the Fat-Tree topology SDN data center network. Firstly, an optimized mathematical model of the energy-saving traffic scheduling problem is established, so that the network energy consumption is minimized under the premise of being able to carry all network data flows. Then solve the mathematical optimization model through the energy-saving multi-layer virtual topology traffic scheduling algorithm, obtain the energy-saving scheduling scheme of the data flow, and achieve the purpose of energy saving by dormant higher-level virtual topology and switch ports.
[0052] This embodiment includes the following steps:
[0053] S1...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



