CN101305558A - Scheduling data spanning shared communication link in honeycomb communication system - Google Patents

Scheduling data spanning shared communication link in honeycomb communication system Download PDF

Info

Publication number
CN101305558A
CN101305558A CNA2005800520128A CN200580052012A CN101305558A CN 101305558 A CN101305558 A CN 101305558A CN A2005800520128 A CNA2005800520128 A CN A2005800520128A CN 200580052012 A CN200580052012 A CN 200580052012A CN 101305558 A CN101305558 A CN 101305558A
Authority
CN
China
Prior art keywords
resource
availability
resource allocator
allocator
data
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CNA2005800520128A
Other languages
Chinese (zh)
Other versions
CN101305558B (en
Inventor
彼得·J·莱格
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nvidia Corp
Original Assignee
IPWireless Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by IPWireless Inc filed Critical IPWireless Inc
Publication of CN101305558A publication Critical patent/CN101305558A/en
Application granted granted Critical
Publication of CN101305558B publication Critical patent/CN101305558B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/52—Queue scheduling by attributing bandwidth to queues
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/11—Identifying congestion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
    • H04L47/2458—Modification of priorities while in transit
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/26—Flow control; Congestion control using explicit feedback to the source, e.g. choke packets
    • H04L47/266—Stopping or restarting the source, e.g. X-on or X-off
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L49/00—Packet switching elements
    • H04L49/90—Buffering arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W92/00—Interfaces specially adapted for wireless communication networks
    • H04W92/04—Interfaces between hierarchically different network devices
    • H04W92/12—Interfaces between hierarchically different network devices between access points and access point controllers

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A system is provided for scheduling data from a network element (101), such as an RNC (101), of a cellular communication system to at least one base station (103) across a shared communication link (105) shared between a plurality of cell sectors (107-111). The apparatus comprises resource allocators (113, 115, 117) each of which schedules data for a single cell sector (107-111). A resource determination processor (119) dynamically determines a resource requirement parameter for at least one of the cell sectors (107-111). The resource determination processor (119) is coupled to a resource assignment processor (121) which dynamically assigns a resource availability of the shared communication link (105) to each of the resource allocators (113, 115, 117) in response to the resource requirement parameter.; The resource allocators (113, 115, 117) then schedule data for communication over the shared communication link in response to the resource availability. The invention provides improved utilisation of a shared communication link (105) while allowing independent scheduling by resource allocators associated with a single cell.

Description

Cross over the common user communication link scheduling data in the cellular communication system
Technical field
The present invention relates to cross over the common user communication link between a plurality of cell sectors, from the network components of cellular communication system equipment and method at least one base station scheduling data.
Background technology
In cellular communication system, a geographic area is divided into many sub-districts, and each sub-district provides service by the base station.The base station is by fixed network interconnects, described fixed network can be between the base station Data transmission.Mobile station via obtains service from the Radio Communications Link of the base station of this mobile radio station sub-district of living in.
Typical cellular communication system to whole country, comprises hundreds if not thousands of sub-districts of supporting thousands of even millions of mobile radio stations to coverage extension.Communication from the mobile radio station to the base station is called as up link, and the communication from the base station to the mobile radio station is called as down link.
The fixed network of interconnection base station can send data between any two base stations, thus make a mobile radio station in the sub-district can with the mobile station communicate in any other sub-district.In addition, the gateway function that fixed network comprises and the external network such as internet or public switch telephone network (PSTN) interconnects, thus allow mobile radio station to communicate by letter with other communication terminal that is connected by land line with land line phone.In addition, fixed network comprises the required many functions of the conventional cellular communications networks of management, comprises route data, permission control, and resource allocation, the subscriber charges, functions such as mobile radio station discriminating.
At present, the most general cellular communication system is the second generation communication system that is called global system for mobile communications (GSM).GSM uses the technology that is called time division multiple access visit (TDMA), wherein realizes that by carrier frequency being divided into 8 discrete time slots the user separates, and each time slot can be distributed to a user separately.The base station can be assigned with a carrier wave or a plurality of carrier wave.More descriptions of GSM tdma communication system can be at Michel Mouly and Marie Bernadette Pautet " The GSM System for Mobile Communications " (Bay ForeignLanguage Books, 1992, ISBN 2950719007) in obtain.
At present, third generation system constantly is pushed into, the communication service that provides to the mobile subscriber with further enhancing.The third generation communication system of extensive employing is based on code division multiple access (CDMA) and Frequency Division Duplexing (FDD) (FDD) or time division duplex (TDD).In cdma system,, realize that the user separates by on same carrier with in the identical time interval, distributing different extended codes and scrambler to different users.An example that uses the communication system of this principle is Universal Mobile Telecommunications System (UMTS).More descriptions of CDMA pattern, particularly wideband CDMA (WCDMA) pattern of UMTS can be at " WCDMA for UMTS " (Harri Holma (editor), AnttiToskala (editor), Wiley﹠amp; Sons, 2001, ISBN 0471486876) in obtain.
In third generation cellular communication system, communication network comprises core network and Radio Access Network (RAN).Core network can send to another part to data from the part of RAN, and is connected with other communication system.In addition, it realizes the many operations and the management function of cellular communication system, such as billing function.RAN supports subscriber equipment by the radio link of air interface.RAN is included in the base station that is called as Node B among the UMTS, and radio network controller (RNC), and radio network controller passes through air interface Control Node B and communicates by letter.
RNC realizes the many controlled function relevant with air interface, comprises provided for radio resources management and the route of being to and from the data of suitable Node B.It also provides the interface between RAN and the core network.RNC is called as RNS (RNS) with relevant Node B.
Interface between RNC and the Node B is called as Iub interface.Since with realize in RNC by the relevant many functions of the communication of air interface, therefore and, pass Iub interface transmission lot of data because air interface communication amount data are sent to RNC.So, need the high capacity communication link between RNC and the Node B.
Especially, for 3GPP UTRAN (UMTS grounding wireless access network network), the grouped data that is used for downlink transmission is buffered in RNC, and transmission is also dispatched at RNC.Scheduler is the part of RRC (control of RRC-radio resource) agreement.In general, independently carry out, do not have the direct communication between the different schedulers about the scheduling of each sub-district.The data of scheduling are passed to Node B by Iub interface from RNC.System for uplink packet data is also dispatched by RNC, and passes Iub in opposite direction.
In most cellular communication systems, the cost of the communication link between RNC and the Node B is the most important operation relevant with cellular communication system and advances one of cost.So, it would be desirable any message capacity of using the Iub communication link as far as possible effectively, to reduce unloaded transmission cost.A kind of method that reduces unloaded transmission cost is in different sub-districts, shared Iub communication link between cell sector or the base station.For example, two or more sub-district can sharedly provide the wall scroll E1 leased line of 2Mb/s on each direction.
In some deployment of shared Iub communication link, these shared Iub communication links can be resized (dimension), to support the total air-interface capacity less than subtend sub-district (subtended cell).For example, three sub-districts can sharedly provide the wall scroll E1 leased line of 2Mb/s (typical 3GPP sub-district has the capacity of about 1Mb/s on each direction) on each direction.In this case, with regard to simply dividing equally of Iub, each sub-district be assigned with the E1 link capacity 1/3, cause each sub-district to have the capacity of 2/3Mb/s on each direction.
The method escapable cost of even now, but it also can cause the reduction of cellular communication system performance.For example, the sub-district of high capacity may require 1Mb/s on each direction, to support current load of traffic.Because the restriction that shared Iub connects, this is impossible, so the available capacity of sub-district is lowered, thereby causes the reduction of the capacity of whole cellular communication system.
As another example, communication link shared very dumb may cause the loading of a sub-district limited by the partition capacity of shared link, and its adoptable capacity fully do not used in another sub-district.Thereby the loading that produces the sub-district is subjected to having the situation of restriction of the Iub communication link of idle capacity.
Data from network components, the improvement system that is dispatched to the base station of a plurality of cell sectors of service such as RNC can be favourable, specifically, be convenient to improve the common user communication link flexibility, improve its performance, reduce complexity and/or the dispatching method of increasing operation rate can be favourable.
Summary of the invention
Therefore, the present invention attempts preferably separately or combination in any ground alleviates, and relaxes or eliminates one or more above-mentioned shortcomings.
According to a first aspect of the present invention, the common user communication link that provides a kind of leap to share between a plurality of cell sectors is dispatched to data the equipment of at least one base station from the network components of cellular communication system; Described equipment comprises: a plurality of resource allocators, each resource allocator are the single subdistrict sector data dispatching in a plurality of cell sectors; Resource is determined processor, is used for dynamically determining the resource requirement parameter of at least one cell sector of described a plurality of cell sectors; And distribution processor, be used for the resource response demand parameter, dynamically each in described a plurality of resource allocators is distributed the resource availability of common user communication link; Wherein resource allocator resource response availability is dispatched the data that are used for by the transmission of common user communication link.
The present invention is convenient to more effectively use the common user communication link.Owing to need less average bandwidth, therefore can reduce the cost that forms the communication link between network components and at least one base station.Can increase the capacity of the raising of each cell sector.The communication resource of common user communication passage can more effectively be distributed to each cell sector that needs it.Can reduce the quantity of not using capacity of common user communication passage.Specifically, in certain embodiments, the present invention is convenient to discern the resource of not used by a cell sector, and it is distributed to another cell sector effectively.The present invention allows to distribute neatly and shared resource between different cell sectors.In addition, the present invention is convenient to the complexity lowland and/or is easily realized scheduling of resource for the common user communication link of at least one base station.Specifically, transmit by air interface, still notice the bandwidth constraints that effectively utilizes the common user communication link simultaneously thereby the present invention allows the resource allocator data dispatching.
The present invention especially provides the flexible of resource of common user communication link to share, and allows resource allocator to be independent of other resource allocator data dispatching simultaneously.Specifically, resource availability (resource availability) can be represented the maximum resource that each resource allocator can use.For at least some resource allocators, the resource availability generally may be different.
The term cell sector can comprise the sub-district.For example, a plurality of cell sectors can be corresponding to the different districts sector of same fanned partition sub-district, and wherein each cell sector has relevant resource allocator.Alternatively or additionally, cell sector can comprise by a resource allocator it is carried out a plurality of (son) cell sector that single combined resource is distributed.For example, in one embodiment, the data of each sub-district can be scheduled independently with other sub-district, but are to be dispatched by the resource allocator that carries out combined schedule for all cell sectors of sub-district.Thereby the term cell sector can comprise one group of cell sector.Network components can be a radio network controller.The resource requirement parameter can relate to the past of resource allocator, present or following resource requirement.For example, the resource requirement parameter can be will be by the measuring of the data bulk of resource allocator scheduling, and perhaps can be the measuring of quantity of the resource used of resource allocator.
Described equipment can be the radio network controller (RNC) of cellular communication system.
According to an optional feature of the present invention, distribution processor responds at least one utilization of resources of resource allocator formerly (resource usage), and order is to resource allocator Resources allocation availability.
Resource allocator formerly is to be the resource allocator before the resource allocator of its Resources allocation availability in the sequence.Distribution processor can determine all or at least one sequences of some resource allocators, and according to the order of this sequence to each resource allocator Resources allocation availability.After the first resource allocator Resources allocation availability, and before the resource availability was assigned to next resource allocator, first resource allocator can data dispatching.
This feature is convenient to share very effectively the common user communication link, and/or easy, complexity lowland distribution common communications resources, and/or allows the independent scheduling of resource allocator.
According to an optional feature of the present invention, the resource availability is the residual resource availability.
The surplus resources availability of first resource allocator can respond the utilization of resources of the resource allocator of data dispatching to be determined, and/or responds that the combined resource of the resource allocator of data dispatching is used to determine.This feature is convenient to share effectively the common user communication link, and/or easy, complexity lowland distribution common communications resources.Especially, it can simplify the independent scheduling of resource allocator, effectively and dynamically shares the common user communication link simultaneously.
According to an optional feature of the present invention, distribution processor is determined the first surplus resources availability of first resource allocator; First resource allocator responds the first surplus resources availability data dispatching, and the utilization of resources of response institute data dispatching, determines the resource requirement parameter; Distribution processor responds the first surplus resources availability and resource requirement parameter, determines the second surplus resources availability of second resource allocator; Second resource allocator responds the second surplus resources availability data dispatching.
This feature is convenient to share very effectively the common user communication link, and/or easy, complexity lowland distribution common communications resources.Especially, it can simplify the independent scheduling of resource allocator, shares the common user communication link simultaneously.Specifically, the resource requirement parameter of allocated resource distributor can be the measuring of resource of specifying the common user communication link that resource allocator used.
According to an optional feature of the present invention, all data co-pending that the scheduling of first resource allocator is relevant with first resource allocator.Data co-pending can be the data that for example are kept in the data buffer relevant with first resource allocator.This can simplify the scheduling of resource allocator, and/or efficient resource allocation is provided.
According to an optional feature of the present invention, resource determines that processor is defined as the first surplus resources availability to the second surplus resources availability and deducts the resource requirement parameter.
Specifically, resource requirement parameter can be the measuring of resource of the common user communication link that used of first resource allocator.But the scheduling that this implementation complexity is low effectively utilizes the common user communication link simultaneously.
According to an optional feature of the present invention, distribution processor resource response demand parameter is the subclass of a plurality of resource allocators of resource allocation circulation selection.
For example, the resource requirement parameter can comprise the resource requirement of each resource allocator, can include only the resource allocator that resource requirement is higher than a certain threshold value.Specifically, described threshold value can be substantially zero threshold value, and described subclass includes only has the resource allocator for the treatment of data dispatching.This can further simplify the data dispatch of common user communication link.
According to an optional feature of the present invention, distribution processor is the sequence of different resource allocation varying cyclically resource allocator.Different sequences allows to change the order to different resource allocator Resources allocation availabilities.In certain embodiments, in first round distribution, the resource availability of distributing to first resource allocator may depend on the utilization of resources of second resource allocator, and in next round was distributed, the resource availability of distributing to second resource allocator may depend on the utilization of resources of first resource allocator.This is convenient to realize effectively and the low resource allocation of complexity that this resource allocation is convenient to realize independently resource allocation again.
According to an optional feature of the present invention, respond the native region priority relevant with resource allocator, determine the frequency of at least one resource allocator in the resource allocation of many wheels.For example, if first resource allocator has higher related cell priority, so its comparable second resource allocator more times be included in the resource allocation of described many wheels.This allows resource allocation to have precedence over second resource allocator, and deflection is to the first resource allocator Resources allocation.This feature allows flexibly and the low resource allocation of complexity, and priority can be distinguished in wherein a plurality of sub-districts.
According to an optional feature of the present invention, respond the native region priority relevant with resource allocator, determine the order at least one wheel of at least one resource allocator in the resource allocation of many wheels.
For example, if first resource allocator has higher related cell priority, it can be included in wherein before second resource allocator so.This allows resource allocation to have precedence over second resource allocator, and deflection is to the first resource allocator Resources allocation.This feature allows flexibly and the low resource allocation of complexity, and priority can be distinguished in wherein a plurality of sub-districts.
In certain embodiments, the response native region priority is revised described order and frequency.The native region priority that is used to be provided with order can be identical or different with the native region priority that is used to be provided with frequency.
According to an optional feature of the present invention, the service features that responds the remote unit of the sub-district relevant with resource allocator distributes, and determines the native region priority of resource allocator.
For example, service features distributes and can represent to have the remote unit of high-grade service and to have distribution between the remote unit of inferior grade service.For the higher sub-district of the number of high-grade service remote unit, native region priority is higher.This can make service features be suitable for present case, and allows to have precedence over the performance that inferior grade service remote unit improves high-grade service remote unit.
According to an optional feature of the present invention, the related combined resource demand of remote unit of response and the sub-district relevant with resource allocator is determined the native region priority of resource allocator.
This can improve data dispatch by the common user communication link being suitable for present case, and can improve the performance of cellular communication system.
The combined resource demand is the summation of assurance resource allocation of the remote unit of the sub-district relevant with resource allocator.This can improve scheduling by the data of common user communication link being suitable for present case, and can improve the performance of cellular communication system.
According to an optional feature of the present invention, resource determines that processor determines the resource requirement parameter of each resource allocator in a plurality of resource allocators, and the resource requirement parameter is will be by the indication of the data bulk of this resource allocator scheduling; Distribution processor responds the resource requirement parameter of first resource allocator, to the first resource allocator Resources allocation availability.
This can provide a kind of complexity low and effective scheduling of resource, and this scheduling of resource allows independently resource allocator data dispatching, provide simultaneously the common user communication link dynamically, resource allocation flexibly.
According to an optional feature of the present invention, distribution processor only has first group of resource allocator Resources allocation availability that quantity is higher than the resource requirement parameter for the treatment of data dispatching of threshold value to having the expression resource allocator.
This can simplify scheduling, and improves the resource allocation of common user communication link.
According to an optional feature of the present invention, distribution processor is distributed the total resources availability of common user communication link substantially equably between first group of resource allocator.This can provide a kind of very simple, however the scheduling of the data that effectively transmit by the common user communication link.
According to an optional feature of the present invention, distribution processor is considered the data that the quantity by the resource allocator scheduling is increased progressively, and distributes the resource availability that increases progressively to resource allocator.This is convenient to improve the distribution of the resource of common user communication link, especially is convenient to give the sub-district that needs most by the common user communication link communication with resource allocation.
According to an optional feature of the present invention, distribution processor is distributed the least resource availability at least to having each resource allocator for the treatment of data dispatching.This can provide a kind of flexibly and/or the low scheduling of complexity, guarantee that simultaneously each sub-district can transmit the data of minimum number at least by the common user communication link.
The least resource availability can be all identical for all resource allocators, can be different for some or all of resource allocators perhaps.
According to an optional feature of the present invention, distribution processor responds the least resource availability of at least one other resource allocator, determines the resource availability of resource allocator.This can provide a kind of to the resource allocator Resources allocation, guarantees practicality and the low mode of complexity to each cell allocation minimum of resources simultaneously.
According to an optional feature of the present invention, distribution processor responds the native region priority of the sub-district relevant with resource allocator, determines the least resource availability of resource allocator.For the native region priority that increases, can determine the least resource availability that increases, thereby the sub-district that allows for higher priority guarantees the stock number that increases.This is convenient to realize a kind of flexible and low resource allocation of complexity, and this resource allocation allows the variable worst case resource allocation for each sub-district.
According to an optional feature of the present invention, distribution processor responds the least resource availability, reduces the total resources availability of common user communication link.
For example, in using the embodiment of resource availability as the sequential scheduling on basis that determines in response to the real resource utilization of first distributor, the resource availability of distributing to first resource allocator can be corresponding to the difference of the least resource availability sum of total resource availability and other resource allocator.This can provide a kind of to the resource allocator Resources allocation, guarantees practicality and the low mode of complexity to each cell allocation minimum of resources simultaneously.
According to an optional feature of the present invention, in certain embodiments, described equipment also comprises determines the processor of not using remaining resource relevant with the least resource availability; With the processor of the remaining resource allocation of usefulness not being given resource allocator.This can improve the utilization of the available resources of common user communication link.
According to an optional feature of the present invention, the common user communication link is that Iub interface connects.The common user communication link can be the common user communication link of UMTS grounding wireless access network network (UTRAN).
According to an optional feature of the present invention, cellular communication system is a third generation cellular communication system.Especially, cellular communication system can be according to the technical specification work by third generation partner plan (3GPP) definition.
According to a second aspect of the present invention, provide a kind of leap the common user communication link shared in a plurality of minizones, data are dispatched to the method for at least one base station from a network components of cellular communication system; Described method comprises: each resource allocator in a plurality of resource allocators is the single subdistrict data dispatching in a plurality of sub-districts; Dynamically determine the resource requirement parameter of at least one sub-district in described a plurality of sub-districts; The resource response demand parameter, dynamically each in described a plurality of resource allocators is distributed the resource availability of common user communication link; With resource allocator resource response availability, scheduling is used for the data by the transmission of common user communication link.
According to an optional feature of the present invention, dynamic assignment comprises at least one utilization of resources of resource allocator formerly of response, and order is to resource allocator Resources allocation availability.
Resource allocator formerly is to be the resource allocator before the resource allocator of its Resources allocation availability in the sequence.Order assignment resource availability can comprise to be determined all or at least one sequence of some resource allocators, and according to the order of this sequence to each resource allocator Resources allocation availability.After the first resource allocator Resources allocation availability, and before the resource availability was assigned to next resource allocator, first resource allocator can data dispatching.
According to an optional feature of the present invention, described method comprises: the first surplus resources availability of determining first resource allocator; First resource allocator responds the first surplus resources availability data dispatching, and the utilization of resources of response institute data dispatching, determines the resource requirement parameter; Respond the first surplus resources availability and resource requirement parameter, determine the second surplus resources availability of second resource allocator; Respond the second surplus resources availability data dispatching with second resource allocator.
This feature is convenient to share very effectively the common user communication link, and/or easy, complexity lowland distribution common communications resources.Especially, it can simplify the independent scheduling of resource allocator, shares the common user communication link simultaneously.Specifically, the resource requirement parameter of allocated resource distributor can be the measuring of resource of specifying the common user communication link that resource allocator used.
According to an optional feature of the present invention, described method comprises the resource response demand parameter, selects the subclass of a plurality of resource allocators for the resource allocation circulation.
For example, the resource requirement parameter can comprise the resource requirement of each resource allocator, can include only the resource allocator that resource requirement is higher than a certain threshold value.Specifically, described threshold value can be substantially zero threshold value, and described subclass can include only particularly has the resource allocator for the treatment of data dispatching.This can further simplify the data dispatch of common user communication link.
According to an optional feature of the present invention, dynamically determine to comprise the resource requirement parameter of determining each resource allocator in a plurality of resource allocators, the resource requirement parameter is will be by the indication of the data bulk of resource allocator scheduling; Dynamic assignment comprises the resource requirement parameter that responds first resource allocator, to the first resource allocator Resources allocation availability.
This can provide a kind of complexity low and effective scheduling of resource, and this scheduling of resource allows independently resource allocator data dispatching, provide simultaneously the common user communication link dynamically, resource allocation flexibly.
With reference to the embodiment that the following describes, these and other aspect of the present invention, feature and advantage are conspicuous.
Description of drawings
Illustrate embodiments of the invention below with reference to accompanying drawing, wherein
Fig. 1 graphic extension comprises the parts according to the UMTS communication system of the equipment of the data dispatching of embodiments of the invention;
Fig. 2 graphic extension is according to the method for the data dispatching of embodiments of the invention; With
Fig. 3 graphic extension is according to the method for the data dispatching of embodiments of the invention.
Embodiment
Following explanation concentrates on the embodiments of the invention that are applicable to UMTS third generation cellular communication system, but the present invention is not limited to this application, can be applicable to other many communication systems on the contrary.
The parts of Fig. 1 graphic extension UMTS communication system 100, UMTS communication system 100 comprises the equipment according to the data dispatching of one embodiment of the present of invention.
Communication system 100 comprises the RNC 101 that is connected with base station (Node B) by common user communication link 105.Three sub-districts 107,109,111 are supported in base station 103, and described three sub-districts can be the different cell sectors of a sub-district, or the sub-district of various level sub-district (for example macrocell and Microcell) or geographical superior displacement.
RNC 101 is included as the function by the communication scheduling data of air interface.Specifically, RNC 101 comprises the single resource allocator that is used for each sub-district of being served base station 103.Thereby in the embodiment in figure 1, first resource allocator 113 is first sub-district, 107 data dispatchings, and second resource allocator 115 is second sub-district, 109 data dispatchings, and information resources distributor 117 is the 3rd sub-district 111 data dispatchings.Any scheduling that each resource allocator and other resource allocator carry out is data dispatching irrespectively.Thereby first resource allocator 113 is first sub-district, 107 data dispatchings, and does not consider the data dispatch of the second and the 3rd sub-district 109,111.Independently scheduling reduces the complexity of scheduling operation.
Common user communication link 105 transmits the data dispatching of all sub-districts 107,109,111 between RNC 101 and base station 103.Thereby common user communication link 105 is at a plurality of resource allocators 113,115,117 and a plurality of sub-district/cell sector 107,109, between 111 by shared.
In different embodiment, resource allocator 113,115,117 can be along up link and/or downlink scheduling data.For simplicity and for the purpose of clear, following explanation will mainly concentrate on the downlink transmission of data, but the present invention is not limited to this example, can be applicable to for example uplink communication on the contrary.
Although top explanation includes only a base station of supporting a plurality of sub-districts or cell sector, but in other embodiments, RNC can comprise resource allocator and the scheduling feature that is used for other base station and/or other sub-district or cell sector, the common user communication link can by with different base stations, the resource allocator of sub-district and/or cell sector association is shared.
Resource allocator 113,115,117 independent data dispatchings are so that transmit by the air interface of each sub-district 107,109 and 111.But data are transmitted by common user communication link 105, thereby the resource influence of the common user communication link 105 of a resource allocator use can be by the resource of another resource allocator use.Conventional solution for this problem is the resource of distributing common user communication link 105 statically to each resource allocator 113,115,117.If the resource of static allocation greater than the peak value requirement of each resource allocator 113,115,117, can be carried out the scheduling of each resource allocator 113,115,117 so, and does not consider the restriction of common user communication link 105.But the high bandwidth that this requires common user communication link 105 causes expensive.
But, by the resource of reduction static allocation, resource allocator 113,115,117, thus the capacity of sub-district can be subjected to the restriction of common user communication link 105.In addition, when resource allocator 113,115,117 when carrying out independently resource allocation, and a resource allocator can be subjected to 105 restrictions of common user communication link, is its bandwidth reserved although another resource allocator fully uses.
According to one embodiment of the present of invention, RNC 101 determines the resource availability of each resource allocator 113,115,117.Resource allocator 113,115,117 data dispatchings independently subsequently are up to the level of the resource availability of being distributed.The resource response demand parameter is dynamically revised the resource availability, and described resource requirement parameter dynamically determined, to provide each resource allocator to use or to need or the measuring of the bandwidth of the common user communication link 105 that requires.Thereby, when allowing each resource allocator to be independent of other resource allocator ground data dispatching, the bandwidth of realization common user communication link 105 dynamic and shared flexibly.
Specifically, RNC 101 comprises that resource determines processor 119, and resource determines that processor 119 dynamically determines the resource requirement parameters of at least one sub-district in a plurality of sub-districts.In the example of Fig. 1, resource determines that processor 119 and three resource allocators 113,115,117 couple, and determines the resource requirement parameter of required bandwidth of the expression common user communication link 105 of each resource allocator 113,115,117.For example, the resource requirement parameter can comprise by three resource allocators 113,115, measuring of the data bulk of each scheduling in 117, perhaps can comprise measuring by the data bulk of the one or more resource allocators scheduling in these three resource allocators 113,115,117.
Resource determines that processor 119 and RAP 121 couple, RAP 121 responses are determined the resource requirement parameter that processor 119 is received from resource, the resource availability of each the dynamic assignment common user communication link in a plurality of resource allocators.The resource availability of allocated resource distributor provides the indication of the resource that this resource allocator can use.
RAP 121 and three resource allocators 113,115,117 couple, resource allocator 113,115, and 117 all are supplied to the resource availability.In response, under the situation of the resource availability of distributing considering, the resource allocator data dispatching is so that by the common user communication link transmission.
Recognize determining of resource requirement parameter, the distribution of resource availability and the data dispatch of resource allocator can walk abreast to small part, perhaps to small part be successively, and can use any suitable order of operation or order.
For example, can determine the resource requirement parameter, pass to RAP 121 afterwards for all resource allocators.RAP 121 is determined the resource availability of each resource allocator 113,115,117 subsequently, and these resource availabilities are offered resource allocator.Resource allocator 113,115,117 utilize the resource availability subsequently, set about data dispatching independently of each other.
In other embodiments, can use a kind of more orderly method, the resource requirement parameter is determined in the wherein scheduling carried out of resource response distributor.Only after one or more other resource allocators have been dispatched, just determine the resource availability for the resource allocator of appointment.
The resource availability can be explained with any suitable form, for example state as and can be scheduled so that the number or the data volume of the packet that transmits by air interface perhaps can be the indications of the bandwidth ratio of the operable common user communication link 105 of resource allocator.Thereby the resource availability of resource allocator can provide when data dispatching, the upper limit of the resource that this resource allocator can use.Thereby the resource availability can be used as the restriction of the scheduling that resource allocator carries out.But resource allocator can be up to the resource utilization ground data dispatching corresponding to the resource availability, and irrelevant with the operation of other resource allocator.
Therefore, can realize a kind of method very flexibly, dynamically and flexibly sharing of the available bandwidth of this method permission common user communication link allows each resource allocator to be independent of other resource allocator work simultaneously.
Fig. 2 graphic extension is according to the method for the data dispatching of some embodiments of the present invention.Specifically, this method can be carried out by the RNC 101 of Fig. 1, and for the sake of clarity, will this method be described with regard to this situation.
In step 201, be all sub-districts, that is, be that in three resource allocators 113,115,117 each is determined resource requirement.In the method for Fig. 2, specifically, the resource requirement parameter is will be by the indication of the data bulk of each resource allocator 113,115,117 scheduling.
In certain embodiments, three resource allocators 113,115,117 all can be about each resource allocation circulation, determine that to resource processor 119 provides the measuring of present load (in other words about uplink scheduling, the load of the transmission buffer of the remote unit of sub-district) of transmission buffer of the sub-district of resource allocator.The buffer load represents that resource allocator attempts scheduling in current scheduling circulation, so that the quantity of the data of being transmitted in this sub-district by base station 103.Therefore, resource determines that processor 119 determines the resource requirement parameters, and described resource requirement parameter comprises the measuring of quantity of the data co-pending of each resource allocator.
After the step 201 is step 203, and in step 203, RAP 121 responses are determined the resource requirement parameter that processor 119 receives from resource, determine the resource availability of each resource allocator.
In certain embodiments, RAP 121 can respond the quantity of data co-pending, assigns total resource availability simply between resource allocator.For example, the resource availability of resource allocator N can be confirmed as
B N = B TOT · V N Σ i V i
B wherein TOTBe total resource availability, V iBe the quantity for the treatment of data dispatching of resource allocator i.
For example, if having, first resource allocator 113 doubles second and information resources distributor 115,117 each data to be transmitted, so the resource availability of first resource allocator be common user communication link 105 total bandwidth 50%, second and the resource availability of information resources distributor 115,117 be common user communication link 105 total bandwidth 25%.
Thereby in this example, considering will be by the quantity that increases progressively of the data of resource allocator scheduling, and RAP 121 distributes the resource availability that increases progressively to this resource allocator.
The resource availability of each resource allocator 113,115,117 is provided for each resource allocator 113,115,117.
In certain embodiments, but whether RAP 121 resource response distributors 113,115,117 have any data co-pending, determine the resource availability.Specifically, RAP 121 can be each resource allocator 113,115,117 and determines whether indexed resource distributor 113,115,117 has the data dispatching amount for the treatment of that is higher than assign thresholds to resource requirement parameters.In this example, RAP 121 can include only the resource allocator that threshold value is exceeded.For example, for 0 threshold value, RAP 121 can be to all resource allocator 113,115, the 117 Resources allocation availabilities with any data co-pending, still not to resource allocator 113,115, the 117 Resources allocation availabilities that do not have data co-pending.
In certain embodiments, RAP 121 can distribute the total resources availability of common user communication link simply substantially equably at the resource allocator 113,115,117 with data co-pending.Thereby in the object lesson of Fig. 2, RAP 121 obtains whether to exist the indication of data queued in each sub-district 107,109,111.If all three sub-districts 107,109,111 all have data queued, RAP 121 is B to each resource allocator 113,115,117 transmission indication available bandwidth so TOT/ 3 resource availability.But if having only two sub-districts to have data queued, RAP 121 is B to two relevant resource allocators transmission indication available bandwidths so TOT/ 2 resource availability sends the message that indication does not have available bandwidth to another resource allocator.If have only a sub-district to have data queued, so Xiang Guan resource allocator is assigned with bandwidth B TOT, other resource allocator is assigned with zero bandwidth.
After the step 203 is step 205, and in step 205, the resource availability of first resource allocator 113 is distributed in 113 responses of first resource allocator, dispatches data co-pending.Thereby first resource allocator 113 can utilize suitable dispatching algorithm to set about data dispatching.But this scheduling is to carry out under the restriction that is no more than the resource availability.Thereby if the transmission buffer of first resource allocator 113 comprises the more data co-pending of data co-pending that can comprise than the resource availability of distributing, some data can not be scheduled so, are retained in the transmission buffer, wait for the next round scheduling.
For second resource allocator 115, step 207 is corresponding to step 205.Therefore, second resource allocator 115 is dispatched any data co-pending under the restriction that is no more than the resource availability of distributing to second resource allocator 115.
For information resources distributor 117, step 209 is corresponding to step 205 and 207.Therefore, information resources distributor 117 is dispatched any data co-pending under the restriction that is no more than the resource availability of distributing to information resources distributor 117.
Recognize in certain embodiments, step 205,207 and 209 executed in parallel, and in other embodiments, step 205,207 and 209 orders are carried out.
Therefore, the method for Fig. 2 provides dynamically a kind of and shares the bandwidth of common user communication link 105 neatly, allows each resource allocator 113,115,117 to be independent of the simple of other resource allocator 113,115,117 works, the approach that complexity is low simultaneously.This method can more effectively be utilized the message capacity of common user communication link 105, advances and/or operating cost thereby reduce.Can increase the capacity of sub-district, thereby increase the capacity of whole communication system.
Fig. 3 graphic extension is according to the method for the data dispatching of some embodiments of the present invention.Specifically, this method can be carried out by the RNC 101 of Fig. 1, and for the sake of clarity, will this method be described with regard to this situation.
In the method for Fig. 3, RAP 121 order is to resource allocator 113,115,117 Resources allocation availabilities.At least one resource utilization of resource allocator formerly that data dispatch has been carried out in response determines to distribute to the resource availability of a resource allocator.
In step 301, resource allocator 113,115,117 residue availability is configured to the maximum bandwidth corresponding to the operable common user communication link 105 of single resource allocator.In certain embodiments, single resource allocator can use whole available bandwidths, and in some such embodiment, the residual resource availability can be configured to the value corresponding with the total capacity of shared communication link 105.
After the step 301 is step 303, in step 303, determines the sequence of resource allocator 113,115 and 117.For example, can determine that after first resource allocator 113 be second resource allocator 115, next be the initiation sequence of information resources distributor 117 again.
After the step 303 is step 305, in step 305, selects the initial resource allocation device in this sequence.In this object lesson, thereby select first resource allocator 113.
After the step 305 is step 307, and in step 307, the residual resource availability is provided for the resource allocator of selection.The resource allocator of selecting is set about data dispatching subsequently, so that transmit by common user communication link 105, and by base station 103 transmission.For the initial resource allocation device of this sequence, the residual resource availability can be the resource availability corresponding with whole bandwidth of shared communication link 105.
When guaranteeing that the residual resource availability is not exceeded, the resource allocator of selection is set about according to any suitable scheduling standard or algorithmic dispatching data co-pending.In this object lesson, if the resource allocator of selecting has than the more data co-pending of data co-pending that can hold in the residual resource availability, dispatch the data of maximum quantity so, remaining data are retained in the buffer, wait for scheduling circulation subsequently.Otherwise the resource allocator of selection sets about dispatching all data co-pending, and empties transmission buffer.
After the step 307 is step 309, in step 309, and the quantity of the resource that definite resource allocator of selecting has used.Specifically, the resource allocator of selection can be provided with the resource requirement parameter, has been used to debug the resource availability of data co-pending with indication.
After the step 309 is step 311, in step 311, determines the surplus resources availability after the scheduling of the resource allocator of selecting.Specifically, the previous surplus resources availability of determining is deducted the used quantity of resource allocator of selection.Thereby the surplus resources availability of upgrading provides the indication how many resources can supply the usefulness of the follow-up resource allocator in this sequence.
After the step 311 is step 313, in step 313, selects the next resource allocator in this sequence.In this object lesson, thereby after first resource allocator, 113 operation dispatchings, select second resource allocator 115.
After the step 313 is step 315, in step 315, determines whether to arrive the end of this sequence.If not, method is returned step 307 so, proceeds the scheduling of the next resource allocator in this sequence, promptly proceeds the scheduling of second resource allocator 115 in this object lesson.If arrived the end of this sequence, this method is returned step 301 so, begins new scheduling circulation.
Thereby in the operation in tandem of Fig. 3, each resource allocator 113,115,17 is assigned with the residual resource availability successively, and responds described residual resource availability and dispatch independently.Because resource used by resource allocator, according to the actual use of resource allocator formerly, calculating can be for the quantity of the resource of follow-up resource allocator use.Thereby, can realize a kind of very flexible and efficient scheduling system.
In certain embodiments, not every resource allocator 113,115,117 all can be included in the scheduling circulation.For example, but the resource requirement of RAP 121 resource response distributors 113,115,117 is that the resource allocation circulation selects the subclass of resource allocator 113,115,117.Specifically, RAP 121 quantity that can include only data co-pending is higher than the resource allocator 113,115,117 of assign thresholds.
In certain embodiments, between different distribution circulations, change the sequence of resource allocator 113,115,117.For example, during each execution in step 303, can determine new sequence according to any suitable standard or algorithm.For example, sequence can be changed between the scheduling circulation, to form the endless-chain of resource allocator.Thereby sequence can be changed, so that in many circulations, each resource allocator is positioned at each position of this sequence.In certain embodiments, sequence can be changed, and the institute that consequently comprises the single clauses and subclauses of each resource allocator might sequence be selected successively.
Be included in the object lesson of system of the diverse location of sequence coequally as each resource allocator wherein, sequence can be corresponding to following described (RA-N represents N resource allocator):
Scheduling circulation 1 sequence is RA1-RA2-RA3
Scheduling circulation 2 sequences are RA2-RA3-RA1
Scheduling circulation 3 sequences are RA3-RA1-RA2
Scheduling circulation 4 sequences are RA1-RA2-RA3
Or the like
In this example, for the bandwidth B of the 2Mb/s of common user communication link 105, the result of concrete illustrations scheduling operation is as follows:
Scheduling circulation 1
Sequence location Resource allocator Bandwidth/the kb/s that provides Bandwidth/the kb/s that uses Utilized bandwidth/the kb/s that adds up to
1 1 2000 1200 1200
2 2 800 500 1700
3 3 300 250 1950
Scheduling circulation 2
Sequence location Resource allocator Bandwidth/the kb/s that provides Bandwidth/the kb/s that uses Utilized bandwidth/the kb/s that adds up to
1 3 2000 1000 1000
2 1 1000 700 1700
3 2 300 300 2000
Scheduling circulation 3
Sequence location Resource allocator Bandwidth/the kb/s that provides Bandwidth/the kb/s that uses Utilized bandwidth/the kb/s that adds up to
1 2 2000 1900 1900
2 3 100 100 2000
3 1 - - -
In certain embodiments, other sub-district or cell sector be can have precedence over, some sub-district or cell sector are partial to the resource allocation of different districts or cell sector.For example, each sub-district can be related with native region priority, can make the resource of common user communication link be partial to the higher sub-district of priority.
For example, in the example of Fig. 2, can revise the resource availability of different resource distributor according to corresponding native region priority.For example, can use different weights to each resource requirement according to native region priority.
In the example of Fig. 3, can respond the sequence that resource allocator 113,115,117 was revised or selected to native region priority.
In some such embodiment, can respond the frequency that native region priority is determined resource allocator in the resources circulation.For example, the sub-district of high priority can be included in every the wheel in the scheduling, and only takes turns the sub-district that scheduling comprises low priority every one.
In addition, can respond and resource allocator 113,115,117 native region priorities of being correlated with are determined resource allocator 113,115,117 order.For example, the priority of sub-district is high more, just more relevant resource allocator is included in resource allocator 113,115, in 117 the sequence.
In certain embodiments, can respond relevant native region priority, determine resource allocator 113,115,117 frequency and order.
As an object lesson, cyclic sequence can be adjusted, so that adjusts the sub-district according to native region priority and at first obtain the frequency of serving.For example, if the priority of first sub-district is higher than the second and the 3rd sub-district, among seven three-wheels of taking turns in the scheduling, first sub-district can at first obtain service so, and the second and the 3rd sub-district at first obtains service in seven two-wheeleds of taking turns in the scheduling.
Scheduling circulation 1 sequence is RA1-RA2-RA3
Scheduling circulation 2 sequences are RA2-RA3-RA1
Scheduling circulation 3 sequences are RA3-RA1-RA2
Scheduling circulation 4 sequences are RA1-RA2-RA3
Scheduling circulation 5 sequences are RA1-RA3-RA2
Scheduling circulation 6 sequences are RA2-RA3-RA1
Scheduling circulation 7 sequences are RA3-RA1-RA2
Native region priority can be determined according to any suitable standard or algorithm.
In certain embodiments, the service features that can respond the remote unit of the sub-district relevant with resource allocator distributes, and determines the native region priority of sub-district and related resource distributor.
For example, communication system can allow to provide the grade of service of three kinds of quality.For example, gold user obtains expensive high-level service, and silver user obtains the middle rank service of average costs, and bronze user obtains low level services cheaply.In this case, possible native region priority tolerance can be confirmed as m1 *Number sum+m2 of the bronze user who allows *Number sum+the m3 of the silver user of allowing *The number sum of the gold user of allowing, wherein m1-m3 is suitable weight, and m1＜m2＜m3.In this case, under the situation of other sub-district of infringement, the native region priority that the higher sub-district acquisition of gold user number increases progressively.Thereby the limited resources of common user communication link are partial to advanced level user neatly.
In certain embodiments, can respond and the related combined resource demand of the remote unit of the single subdistrict relevant, determine native region priority with resource allocator.For example, each user can be assigned with respectively and gold user, silver user and the user-dependent certain minimum data rate of bronze.For each sub-district, at present and the assurance resource allocation of the remote unit of cell association can be added up, thereby obtain native region priority.
In certain embodiments, each resource allocator 113,115,117 that satisfies specified value can be guaranteed the minimum bandwidth of common user communication link 105.In some such embodiment, such standard can only be that resource allocator is available, so that all resource allocators all are assigned with the bandwidth of common user communication link 105, and no matter whether they have the data that will dispatch.
In other this embodiment, described standard can be a resource allocator 113,115, and 117 have the data co-pending that will dispatch.Specifically, RAP 121 can be configured to distribute minimum resource availability to having each resource allocator 113,115,117 for the treatment of data dispatching at least.
In these embodiment, RAP 121 can be configured to be necessary for other resource allocator resources reserved by considering, determines the resource availability of allocated resource distributor.Thereby by deducting the least resource availability relevant with other resource allocator, the resource availability of a resource allocator can be lowered.For example, the step 301 of the method for Fig. 3 can comprise that the total resources availability that initial surplus resources availability is defined as the common user communication link deducts the value that the least resource availability sum of resource allocator obtains; Perhaps the step 311 of the method for Fig. 3 can comprise the least resource availability sum that the residual resource availability is deducted the residual resource distributor.
More particularly, the resource availability B of resource allocator n ACan determine by following formula:
B A , n = B TOT - B guaranteed ( N a - n ) - Σ i = 1 n - 1 B used , i
B wherein TOTBe the total resources availability of common user communication link, B GuaranteedBe the least resource availability of each sub-district, N aBe in last rotation degree, share the number of the resource allocator of common user communication link, B Used, iIt is the resource that resource allocator i has used.
In certain embodiments, the least resource availability can be static, and equates for all resource allocators.But, in other embodiments, can respond suitable standard or algorithm and dynamically change the least resource availability.For example, can respond relevant native region priority, multiply by the current area priority metrics, change the least resource availability of resource allocator such as least resource availability fiducial value appointment.
In the ending of scheduling circulation, some resources that keep for the least resource availability of resource allocator generally are not used.Therefore, can determine the remaining resource that always is not used.Can give other resource allocator described remaining resource allocation according to any suitable algorithm or standard subsequently.For example, the residual resource availability can be configured to remaining resource, can select first resource allocator of sequence, and repeating step 307-315, is fully used up to remaining resource, and perhaps all data are by till all resource allocator scheduling.
As an object lesson, each efficient cell guarantee that bandwidth is configured to be 500kb/s, and the capacity of common user communication link be configured to 2Mb/s once more greater than zero.In this example, make a certain sub-district untapped any (assurance) bandwidth can be all the other sub-districts and use.This causes taking turns from one and is dispatched to another and takes turns scheduling, the minor variations of the bandwidth that provides to designated cell.
Scheduling circulation 1
Sequence location Resource allocator Bandwidth/the kb/s that provides Bandwidth/the kb/s that uses Utilized bandwidth/the kb/s that adds up to
1 1 1000 1000 1000
2 2 500 500 1500
3 3 500 250 1750
Scheduling circulation 2
Sequence location Resource allocator Bandwidth/the kb/s that provides Bandwidth/the kb/s that uses Utilized bandwidth/the kb/s that adds up to
1 3 1000 1000 1000
2 1 500 500 1500
3 2 500 300 1800
Scheduling circulation 3
Sequence location Resource allocator Bandwidth/the kb/s that provides Bandwidth/the kb/s that uses Utilized bandwidth/the kb/s that adds up to
1 2 1000 1000 1000
2 3 500 200 1200
3 1 800 600 1800
Recognize that for the sake of clarity above-mentioned explanation about different functional units and processor, described embodiments of the invention.But, obviously can any suitable distribution of function of use between different function units or processor, and do not impair the present invention.Thereby, only should be counted as quoting of described functional appropriate device is provided quoting of specific functional units, rather than strict logic OR physical structure or the tissue of expression.
Can adopt any suitable form, comprise hardware, software, firmware or their combination in any realize the present invention.Optionally, the present invention can partly be embodied as the computer software that runs on one or more data processors and/or the digital signal processor at least.Can according to any suitable mode physically functionally and logically realize the parts and the assembly of embodiments of the invention.In fact, described function can realize in single unit, realizes in a plurality of unit, perhaps is realized as the part of other functional unit.Thereby the present invention can realize in single unit, perhaps physically and be distributed on the function between the different unit and processor.
Although the present invention has been described, but be not intended the concrete form that is confined to state here about some embodiment.On the contrary, scope of the present invention is only limited by additional claim.In addition, although described a certain feature, but those skilled in the art will recognize that the various features that can make up described embodiment according to the present invention about certain embodiments.In the claims, term comprises the existence of not getting rid of other parts or step.
In addition, although listed singly, but multiple arrangement, parts or method step can be realized by single unit or processor; In addition, although single feature is included in the different claims, but these features can advantageously be made up, and are included in and do not mean in the different claims that combination of features is infeasible and/or unfavorable.In addition a certain feature is included in and does not mean in the claim of a kind and be confined to this claim type, mean that on the contrary this feature takes the circumstances into consideration to be applicable to other claim classification equally.In addition, the order of the feature in the claim is not meaned any particular order that must make each feature functions according to it, and specifically, the order of each step is not meaned and must be carried out each step in proper order according to this in the claim to a method.On the contrary, can carry out each step according to any suitable order.In addition, singular reference is not got rid of plural number.Thereby to " one ", " first ", plural number is not got rid of in quoting of " second " etc.

Claims (31)

1, a kind of common user communication link of sharing between a plurality of cell sectors of crossing over is dispatched to the equipment of at least one base station to data from the network components of cellular communication system, and described equipment comprises:
A plurality of resource allocators, each resource allocator are the single subdistrict sector data dispatching in a plurality of cell sectors;
Resource is determined processor, is used for dynamically determining the resource requirement parameter of at least one cell sector of described a plurality of cell sectors; With
Distribution processor is used for the resource response demand parameter, and dynamically each in described a plurality of resource allocators is distributed the resource availability of common user communication link,
Wherein the resource availability of its distribution of resource allocator response is dispatched the data that are used for by the transmission of common user communication link.
2, according to the described equipment of claim 1, wherein distribution processor response is previous to the utilization of resources of at least one other resource allocator of its Resources allocation availability, and order is to resource allocator Resources allocation availability.
3, according to the described equipment of claim 2, wherein the resource availability is the residual resource availability.
4, according to the described equipment of claim 3, wherein:
Distribution processor is determined the first surplus resources availability of first resource allocator;
First resource allocator responds the first surplus resources availability data dispatching, and the utilization of resources of response institute data dispatching, determines the resource requirement parameter;
Distribution processor responds the first surplus resources availability and resource requirement parameter, determines the second surplus resources availability of second resource allocator; With
Second resource allocator responds the second surplus resources availability data dispatching.
5, according to the described equipment of claim 4, wherein first resource allocator is dispatched all co-pending data relevant with first resource allocator.
6, according to the described equipment of claim 4, wherein resource determines that processor is defined as the first surplus resources availability to the second surplus resources availability and deducts the resource requirement parameter.
7, according to the described equipment of claim 2, wherein distribution processor resource response demand parameter is the subclass of a plurality of resource allocators of resource allocation circulation selection.
8, according to the described equipment of claim 2, wherein distribution processor is the sequence of different resource allocation varying cyclically resource allocator.
9, according to the described equipment of claim 7, wherein the response cell sector priority relevant with resource allocator is determined the frequency of at least one resource allocator in a plurality of resources circulation.
10, according to the described equipment of claim 8, wherein the response cell sector priority relevant with resource allocator is determined the order at least one resource allocator at least one resources circulation in a plurality of resources circulation.
11, according to the described equipment of claim 9, wherein the service features of the remote unit of the cell sector that response is relevant with resource allocator distributes, and determines the cell sector priority of resource allocator.
12, according to the described equipment of claim 9, the related combined resource demand of remote unit of response and the cell sector relevant with resource allocator is wherein determined the cell sector priority of resource allocator.
13, according to the described equipment of claim 12, wherein the combined resource demand is the summation of assurance resource allocation of the remote unit of the cell sector relevant with resource allocator.
14, according to the described equipment of claim 1, wherein resource determines that processor determines the resource requirement parameter of each resource allocator in a plurality of resource allocators, and the resource requirement parameter is will be by the indication of the data bulk of the resource allocator scheduling of correspondence; Wherein distribution processor responds the resource requirement parameter of first resource allocator, to the first resource allocator Resources allocation availability.
15, according to the described equipment of claim 1, wherein distribution processor is only to first group of resource allocator Resources allocation availability, and each in described first group of resource allocator has the expression resource allocator and have the resource requirement parameter for the treatment of data dispatching that quantity is higher than threshold value.
16, according to the described equipment of claim 15, the total resources availability of distributing the common user communication link substantially equably between the resource allocator of distribution processor in first group of resource allocator wherein.
17, according to the described equipment of claim 14, wherein distribution processor is considered the data that the quantity by the resource allocator scheduling is increased, and distributes the resource availability that increases to resource allocator.
18, according to the described equipment of claim 1, wherein distribution processor is distributed the least resource availability at least to having each resource allocator for the treatment of data dispatching.
19, according to the described equipment of claim 18, wherein distribution processor responds the least resource availability of at least one other resource allocator, determines the resource availability of resource allocator.
20, according to the described equipment of claim 18, wherein distribution processor responds the cell sector priority of the cell sector relevant with resource allocator, determines the least resource availability of resource allocator.
21, according to the described equipment of claim 18, wherein distribution processor responds the least resource availability, reduces the total resources availability of common user communication link.
22,, also comprise and determine the not processor of the remaining resource of usefulness relevant with the least resource availability according to the described equipment of claim 18; With the processor of the remaining resource allocation of usefulness not being given resource allocator.
23, according to the described equipment of claim 1, wherein the common user communication link is that Iub interface connects.
24, according to the described equipment of claim 1, wherein cellular communication system is a third generation cellular communication system.
25, a kind of common user communication link of sharing between a plurality of cell sectors of crossing over is dispatched to the method for at least one base station to data from the network components of cellular communication system, and described method comprises the steps:
Each resource allocator in a plurality of resource allocators is the single subdistrict sector data dispatching in a plurality of cell sectors;
Dynamically determine the resource requirement parameter of at least one cell sector in described a plurality of cell sectors; With
The resource response demand parameter, dynamically each in described a plurality of resource allocators is distributed the resource availability of common user communication link; With the resource availability of its distribution of resource allocator response, scheduling is used for the data by the transmission of common user communication link.
26, in accordance with the method for claim 25, wherein the dynamic assignment step comprises at least one utilization of resources of resource allocator formerly of response, and order is to resource allocator Resources allocation availability.
27, in accordance with the method for claim 26, also comprise the steps:
Determine the first surplus resources availability of first resource allocator;
First resource allocator responds the first surplus resources availability data dispatching, and the utilization of resources of response institute data dispatching, determines the resource requirement parameter;
Respond the first surplus resources availability and resource requirement parameter, determine the second surplus resources availability of second resource allocator; With
Second resource allocator responds the second surplus resources availability data dispatching.
28, in accordance with the method for claim 26, also comprise the resource response demand parameter, select the step of the subclass of a plurality of resource allocators for the resource allocation circulation.
29, in accordance with the method for claim 25, wherein:
Dynamically determining step comprises the resource requirement parameter of determining each resource allocator in a plurality of resource allocators, and the resource requirement parameter is will be by the indication of the data bulk of the resource allocator scheduling of correspondence; With
The dynamic assignment step comprises the resource requirement parameter that responds first resource allocator, to the first resource allocator Resources allocation availability.
30, a kind of computer-readable medium of preserving executable instruction, described executable instruction are used to cross between a plurality of cell sectors the common user communication link of sharing, and data are dispatched at least one base station from the network components of cellular communication system, comprise following instruction:
Each resource allocator in a plurality of resource allocators is the single subdistrict sector data dispatching in a plurality of cell sectors;
Dynamically determine the resource requirement parameter of at least one cell sector in described a plurality of cell sectors; With
The resource response demand parameter, dynamically each in described a plurality of resource allocators is distributed the resource availability of common user communication link; With
Resource allocator resource response availability, scheduling is used for the data by the transmission of common user communication link.
31, a kind of record carrier comprises computer program as claimed in claim 30.
CN2005800520128A 2005-09-16 2005-09-16 Scheduling data spanning shared communication link in honeycomb communication system Expired - Fee Related CN101305558B (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2005/054637 WO2007031116A1 (en) 2005-09-16 2005-09-16 Scheduling data across a shared communication link in a cellular communication system

Publications (2)

Publication Number Publication Date
CN101305558A true CN101305558A (en) 2008-11-12
CN101305558B CN101305558B (en) 2011-12-28

Family

ID=36282797

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2005800520128A Expired - Fee Related CN101305558B (en) 2005-09-16 2005-09-16 Scheduling data spanning shared communication link in honeycomb communication system

Country Status (4)

Country Link
EP (1) EP1938519A1 (en)
JP (1) JP2009508418A (en)
CN (1) CN101305558B (en)
WO (1) WO2007031116A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7948962B2 (en) 2007-08-31 2011-05-24 Wireless Technology Solutions Llc Cellular communication system, apparatus and method for management of backhaul resources
US8325661B2 (en) 2008-08-28 2012-12-04 Qualcomm Incorporated Supporting multiple access technologies in a wireless environment
CN101778312B (en) * 2009-01-14 2012-11-28 中兴通讯股份有限公司 Detection method of residual connection of ASON/GMPLS (automatic switch optical network/generalized multiprotocol label switching)
WO2011072735A1 (en) * 2009-12-16 2011-06-23 Nokia Siemens Networks Oy Coordinated transport and radio interface scheduling for a mobile communication network
GB2497318A (en) 2011-12-06 2013-06-12 Nec Corp Sharing backhaul bandwidth between home basestations of a dual mode basestation
CN109660993A (en) * 2018-12-29 2019-04-19 中国电子科技集团公司第二十研究所 A kind of time slot resource dynamic adjusting and optimizing method based on TDMA
CN112996018B (en) * 2021-02-24 2022-12-02 中国联合网络通信集团有限公司 Determination method, device and readable storage medium

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2985930B2 (en) * 1995-01-05 1999-12-06 エヌ・ティ・ティ移動通信網株式会社 Method of using radio base station and transmission line in mobile communication system
US5831976A (en) * 1996-05-03 1998-11-03 Motorola, Inc. Method and apparatus for time sharing a radio communication channel
US6452933B1 (en) * 1997-02-07 2002-09-17 Lucent Technologies Inc. Fair queuing system with adaptive bandwidth redistribution
CA2245367A1 (en) * 1998-08-19 2000-02-19 Newbridge Networks Corporation Two-component bandwidth scheduler having application in multi-class digital communication systems
JP2003018647A (en) * 2001-06-28 2003-01-17 Mitsubishi Electric Corp Base station in wireless communication system
JP4395277B2 (en) * 2001-07-13 2010-01-06 富士通株式会社 Mobile communication system
GB2381406A (en) * 2001-10-24 2003-04-30 Ipwireless Inc Packet data queuing and processing
US8406235B2 (en) * 2003-11-26 2013-03-26 Qualcomm Incorporated Quality of service scheduler for a wireless network

Also Published As

Publication number Publication date
JP2009508418A (en) 2009-02-26
WO2007031116A1 (en) 2007-03-22
CN101305558B (en) 2011-12-28
EP1938519A1 (en) 2008-07-02

Similar Documents

Publication Publication Date Title
CN101467403B (en) Mapping services to radio bearers and allocating bandwidth to the radio bearers according to weight values
CN101305558B (en) Scheduling data spanning shared communication link in honeycomb communication system
CN101305562B (en) Qos-aware radio resource management (for wireless communication) with activity detection
US7729307B2 (en) Scheduling data across a shared communication link in a cellular communication system
CN101790895B (en) Cellular communication system, apparatus and method for management of backhaul resources
CN101480077B (en) Dynamic resource reuse pattern selection in a cellular communication system
CN100399856C (en) Resource management apparatus and a method of resource management therefor
KR100956259B1 (en) Methods and apparatus to select a request group for a request report
CN1812374B (en) Method and apparatus for managing packet data resources
CN101390428B (en) Methods and apparatus for communicating backlog related information
US20080318587A1 (en) Cellular Communication System, a Base Station and a Method of Resource Allocation
CN102065554A (en) Resource scheduling method and base station
CN101399763A (en) Downlink service data scheduling method and apparatus
CN102223687B (en) Transmitting method and equipment for interference coordination request
WO2003037025A1 (en) Method and arrangement for allocation of resources in a radio communication system
CN103379630B (en) A kind of Physical Downlink Shared Channel resource allocation methods and system
CN102791028B (en) The distribution method of a kind of shared resource and system
CN101237691B (en) Method for resource distribution in OFDMA network
CN105530705A (en) Method and device for allocating downlink control channel resources
CN101102601B (en) Method and a controller for controlling a connection
KR20080056209A (en) Scheduling data across a shared communication link in a cellular communication system
CN101795496B (en) Dispatching method and system of multi-BS (base station) multi-user network
CN101808412B (en) Dispatching method of multi-base-station and multi-user network
RU2320086C2 (en) Methods and device for transmitting user data using an information channel
CN105323860A (en) UE ordering realization method and apparatus

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
ASS Succession or assignment of patent right

Owner name: NVIDIA CORP.

Free format text: FORMER OWNER: IP WIRELESS INC.

Effective date: 20130305

C41 Transfer of patent application or patent right or utility model
TR01 Transfer of patent right

Effective date of registration: 20130305

Address after: American California

Patentee after: Nvidia Corp.

Address before: American California

Patentee before: IP Wireless Inc.

CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20111228

Termination date: 20140916

EXPY Termination of patent right or utility model