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

Resource scheduling method and device

A resource scheduling and scheduling method technology, applied in network traffic/resource management, electrical components, wireless communication, etc., can solve complex problems, different terminal configuration rates, low throughput, etc., and achieve the effect of solving fairness problems

Inactive Publication Date: 2010-11-17
HUAWEI TECH CO LTD
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] This scheduling algorithm enables users to schedule according to a certain order. Although the fairness of user time is guaranteed, the throughput is low, and the specific implementation is more complicated. For example, a certain connection is sometimes not available, and different terminals have different configuration rates.

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
  • Resource scheduling method and device
  • Resource scheduling method and device
  • Resource scheduling method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] In order to solve the scheduling fairness problem of the same type of business, the embodiment of the present invention provides a scheduling algorithm based on the rate satisfaction degree, the rate satisfaction degree is the ratio of the current rate of the connection to the predetermined rate, and adopts a new scheduling strategy to make the same Each terminal of the service type allocates resources reasonably, taking into account system throughput and fairness.

[0027] The embodiment of the present invention applies the concept of rate satisfaction degree to a specific solution, and uses the rate satisfaction degree to measure the resource scheduling situation of each terminal. In the whole scheduling process, the scheduling order of each terminal (that is, resource allocation and rate adjustment) is determined by the value of the rate satisfaction degree, and the scheduling order of each terminal has a direct impact on the value of the rate satisfaction degree (can...

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 resource scheduling method. The method comprises the following steps of: acquiring the current speed of each connection bearing the same type of services; calculating the speed satisfaction degree of each connection; selecting one or more connections according to the sequence of the speed satisfaction degree from small to large, and allocating resources for the selected connections; and adjusting the speed of the corresponding connections. The method provided by the invention is suitable for various types of services in spite of the consistency of speed allocation in any modulation coding modes; and the speed satisfaction degree-based scheduling algorithm can well solve the fairness problem of the scheduling of any same type of services.

Description

technical field [0001] The present invention relates to the technical field of wireless communication, in particular to a resource scheduling method and device in wireless communication. Background technique [0002] In the multi-terminal service scheduling of wireless communication systems (eg, Wimax), the fairness of the same type of service scheduling of different terminals is difficult to be guaranteed by using the original algorithm for service scheduling. This will result in a large difference in the bandwidth obtained by the same QoS, which cannot be received by customers. In addition, the original algorithm is very complicated, and there are many related parameters for maintaining the scheduling of each terminal, which may reach about 10. [0003] After repeated verifications, the algorithm cannot solve the fairness problem of the same type of business, resulting in a disadvantage in product performance. [0004] How to solve the fairness problem of multi-terminal ...

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): H04W28/22H04W72/08H04W72/12
Inventor 陈继德
Owner HUAWEI TECH CO LTD
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