Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for scheduling bandwidths of multiple fixed paths on high performance network for big data

A technology of fixed paths and scheduling methods, applied in the field of computer networks, can solve problems such as insufficient bandwidth utilization, and achieve the effects of improving transmission reliability, reducing data transmission time, and increasing transmission throughput.

Inactive Publication Date: 2017-06-30
NORTHWEST UNIV
View PDF0 Cites 14 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

It solves the limitation that the existing multi-path technology can only be used for static network transmission with constant bandwidth, and the defect of insufficient bandwidth utilization of the existing single-path bandwidth scheduling technology in high-performance networks with dynamically changing bandwidth

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
  • Method for scheduling bandwidths of multiple fixed paths on high performance network for big data
  • Method for scheduling bandwidths of multiple fixed paths on high performance network for big data
  • Method for scheduling bandwidths of multiple fixed paths on high performance network for big data

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0049] This embodiment provides a bandwidth scheduling method for two fixed paths in a high-performance network oriented to big data, including the following steps:

[0050] Step 1, establish the topology graph G(V,E) of the high-performance network (HPN):

[0051] G=(V,E)

[0052] Among them, V represents the node set in the high-performance network, V=(v 0 ,v 1 ,...,v n-1 ), n≥1; E represents the link set in the high-performance network;

[0053] The available bandwidth of the link changes in each time period, and the time-bandwidth triplet (t l [i],t l [i+1],b l [i]);

[0054] Among them, t l [i] indicates the i-th moment of the link l, t l [i+1] indicates the i+1th moment of link l, (t l [i],t l [i+1]) represents the i-th time slot of link l, b l [i] indicates the bandwidth value of the i-th time slot of link l, i=0,1,2...T l -1,T l is the total number of time slots of link l, T l ≥1;

[0055] The TB tables of all links are synthesized into a total TB (Aggr...

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 present invention discloses a method for scheduling bandwidths of multiple fixed paths on a high performance network for big data. According to the method, when a remaining bandwidth of a high performance network with a bandwidth reservation function changes dynamically, two fixed paths that do not intersect at nodes are calculated to reserve bandwidths for user data transmission, and a dedicated channel is assigned, so that data transmission can be completed as soon as possible. The method solves a limitation that an existing multi-path technology is only for static network transmission with a constant bandwidth, and solves a defect that a bandwidth is not fully used in an existing single-path bandwidth scheduling technology in a high performance network where the bandwidth changes dynamically.

Description

technical field [0001] The invention belongs to the technical field of computer networks and relates to a method for multipath bandwidth allocation and reservation for large data transmission. Background technique [0002] Massive data generated by various large-scale applications such as electronic scientific research, e-commerce, and social media are currently 10 12 、10 15 、10 18 The order of magnitude will be even higher in the future. These big data often need to be transmitted remotely to achieve remote operations. The next generation of scientific computing is a typical application. A large number of simulation data sets generated by supercomputers are shared by teams of scientists distributed in various places for collaborative visual analysis and processing. How to quickly and reliably complete the task of large data transmission is an urgent problem to be solved. The traditional Internet is not up to such a difficult task. High-performance networks (High-Perfor...

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/707H04L12/735H04L12/911H04L12/24H04L45/24H04L45/128
CPCH04L41/12H04L45/1287H04L45/24H04L47/72H04L47/78H04L47/829
Inventor 侯爱琴吴奇石房鼎益王猛王永强
Owner NORTHWEST UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com