http://rdf.ncbi.nlm.nih.gov/pubchem/patent/CN-103563472-B
Outgoing Links
Predicate | Object |
---|---|
classificationCPCAdditional | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04W72-543 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04W84-047 |
classificationCPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04W72-04 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04W72-52 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04W72-12 http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/H04W72-535 |
classificationIPCInventive | http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/H04W72-12 |
filingDate | 2012-04-04-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
grantDate | 2017-04-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationDate | 2017-04-19-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
publicationNumber | CN-103563472-B |
titleOfInvention | Method and apparatus for scheduling network traffic in the presence of relays |
abstract | The present invention provides methods and apparatus that include scheduling best effort (BE) traffic for devices communicating with a relay. The Donor Evolved Node B (eNB) schedules the BE services of each device based on the historical throughput. The donor eNB can determine the number of devices served by the relay to deduct historical throughput and allocate resources accordingly based on the number of devices rather than this single relay. In this regard, the donor eNB can maintain proportional fairness for BE scheduling. Alternatively, the relay may request a Guaranteed Bit Rate (GBR) bearer to handle BE traffic, where the data rate of the requested GBR bearer allows the transmission of BE traffic to these multiple devices. In addition, resource allocation for BE services may also be limited by the maximum throughput of the relay and/or the data rate of one or more access links. |
priorityDate | 2011-04-04-04:00^^<http://www.w3.org/2001/XMLSchema#date> |
type | http://data.epo.org/linked-data/def/patent/Publication |
Incoming Links
Total number of triples: 32.