# US 2013/0155852 A1 · Systems and Methods for Resource Booking for Admission Control and Scheduling Using DRX

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0155852 A1
- Document ID: US20130155852A1
- Status: Published application
- Kind: A1
- Application number: 13/527,108
- Filed: 2012-06-19
- Published: 2013-06-20
- Earliest claimed: 2011-07-26
- Assignees: Telefonaktiebolaget L M Ericsson (publ)
- Inventors: Ricardo PAREDES; Xixian CHEN; Anders OHLSSON
- Web page: https://patentgrep.com/patent/US20130155852A1

## CPC

- H04W 28/16: Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
- H04W 28/26: Resource reservation
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

Systems and methods provide for performing admission control in a communications network. The method includes: receiving a request for an entity or service for admission to the communications network; calculating resources, wherein the step of calculating resources includes: estimating a first future resource use for current entities and services in the communications network; and estimating a second future resource use for the entity or service received in the request; determining admission to the communications network of the received request based at least in part on the step of calculating resources; and using a partitionable booking window, if admission is allowed for the received request, for booking the first and second future resource uses based at least in part on the step of calculating resources.

## Claims

### Claim 1

A method for performing admission control in a communications network, the method comprising:
receiving a request for an entity or service for admission to the communications network;
calculating resources, wherein the step of calculating resources include:
estimating a first future resource use for current entities and services in the communications network; and
estimating a second future resource use for the entity or service received in the request;
determining admission to the communications network of the received request based at least in part on the step of calculating resources; and
using a partitionable booking window, if admission is allowed for the received request, for booking the first and second future resource uses based at least in part on the step of calculating resources.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
scheduling the first and second future resources into a plurality of transition time interval slots in the partitionable booking window.

### Claim 3 (depends on 2)

The method of claim 2, further comprising:
prioritizing overflow list entries; and
using the overflow list entries to fill an unfilled transition time interval.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
booking the first future resource which is associated with a guaranteed bit rate bearer into a repetitive pattern at fixed intervals in the booking window.

### Claim 5 (depends on 4)

The method of claim 4, wherein the guaranteed bit rate bearer is associated with a Voice over Internet Protocol (VoIP) service.

### Claim 6 (depends on 1)

The method of claim 1, further comprising:
booking the first future resource which is associated with a non-guaranteed bit rate bearer such that the booking fills out transmission time slots.

### Claim 7 (depends on 6)

The method of claim 6, wherein the non-guaranteed bit rate bearer is associated with a web browsing service.

### Claim 8 (depends on 1)

The method of claim 1, wherein the communication node is an eNodeB.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
performing admission control by the eNodeB for requests from at least one user equipment.

### Claim 10 (depends on 1)

The method of claim 1, wherein the communication node is a gateway.

### Claim 11 (depends on 10)

The method of claim 10, further comprising:
performing admission control by the gateway for requests from at least one eNodeB.

### Claim 12 (depends on 1)

The method of claim 1, further comprising:
limiting bit rates for a service by distributing a desired resource use amount over time.

### Claim 13 (depends on 1)

The method of claim 1, further comprising:
implementing packet discards when booked resources are fully utilized when excess traffic arrives.

### Claim 14 (depends on 6)

The method of claim 6, further comprising:
allocating a minimum bit rate to the non-guaranteed bit rate bearer.

### Claim 15

A communications node for performing admission control in a communications network, the communications node comprising:
a communications interface configured to receive a request for an entity or service for admission to the communications network;
a processor configured to operate an admission control function and a scheduler; and
wherein the admission control function is configured to calculate resources, estimate a first future resource use for current entities and services in the communications network, estimate a second future resource use for the entity or service received in the request, determine admission to the communications network of the received request based at least in part on the results of calculating resources, and configured to use a partitionable booking window, if admission is allowed for the received request, for booking the first and second future resource uses based at least in part on the results of calculating resources.

### Claim 16 (depends on 15)

The communications node of claim 15, further comprising:
the scheduler configured to schedule the first and second future resources into a plurality of transition time interval slots in the partitionable booking window.

### Claim 17 (depends on 16)

The communications node of claim 16, further comprising:
the admission control function configured to prioritize overflow list entries and use the overflow list entries to fill an unfilled transition time interval.

### Claim 18 (depends on 15)

The communications node of claim 15, further comprising:
the admission control function configured to book the first future resource which is associated with a guaranteed bit rate bearer into a repetitive pattern at fixed intervals in the booking window.

### Claim 19 (depends on 18)

The communications node of claim 18, wherein the guaranteed bit rate bearer is associated with a Voice over Internet Protocol (VoIP) service.

### Claim 20 (depends on 15)

The communications node of claim 15, further comprising:
the admission control function configured to book the first future resource which is associated with a non-guaranteed bit rate bearer such that the booking fills out transmission time slots.

### Claim 21 (depends on 20)

The communications node of claim 20, wherein the non-guaranteed bit rate bearer is associated with a web browsing service.

### Claim 22 (depends on 15)

The communications node of claim 15, wherein the communication node is an eNodeB.

### Claim 23 (depends on 22)

The communications node of claim 22, further comprising:
the eNodeB configured to perform admission control for requests from at least one user equipment.

### Claim 24 (depends on 15)

The communications node of claim 15, wherein the communication node is a gateway.

### Claim 25 (depends on 24)

The communications node of claim 24, wherein admission control is performed by the gateway for requests from at least one eNodeB.

### Claim 26 (depends on 15)

The communications node of claim 15, wherein bit rates for a service are limited by distributing a desired resource use amount over time.

### Claim 27 (depends on 15)

The communications node of claim 15, wherein packet discards are implemented when booked resources are fully utilized when excess traffic arrives.

### Claim 28 (depends on 6)

The communications node of claim 6, wherein a minimum bit rate is allocated to the non-guaranteed bit rate bearer.

### Claim 29 (depends on 1)

The method of claim 1, wherein the step of calculating further comprises:
using at least one discontinuous reception (DRX) parameter to estimate the second future resource.

### Claim 30 (depends on 15)

The communications node of claim 15, wherein the admission control function is further configured to estimate the second future resource using at least one discontinuous reception (DRX) parameter.