IP Library › Granted Patent US 10,051,518
Granted Patent B2
US 10,051,518 · App. 15/652,464 · Granted Aug 14, 2018

Admission control and load balancing

Inventors: Gavin Bernard Horn (La Jolla, CA); Nathan Edward Tenny (Poway, CA)
Assignee: QUALCOMM Incorporated
H04W28/08H04L43/16H04L47/801H04W24/08
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,051,518
App. No.
15/652,464
Filed
Jul 18, 2017
Granted
Aug 14, 2018
Kind
B2
Art Unit
2473
USPC
370/236
Abstract

Certain aspects of the present disclosure relate to methods and apparatus for wireless communication, and more particularly, to methods and apparatus to enable a node to be aware of active services and context for a mobile device in order to determine the load balancing and admission control for the services. For example, in certain aspects, a mobile device for managing at least one data flow between a core network and the mobile device may determine whether at least one of the data flow or a service related to the data flow should be reported and send a report to a first node based on the determination. The report may identify at least one of the data flow or service and indicates a packet data network (PDN) connection or bearer associated with the service or data flow.

Claims (34)

1. A method of wireless communication by a first node comprising:

determining that at least one data flow is active for an existing bearer or a new packet data network (PDN) connection, wherein the data flow has an associated aggregation layer of a protocol stack of the first node;

evaluating an availability of resources at the first node to serve the data flow, wherein the evaluating relates to resources managed by at least one protocol layer that is below the associated aggregation layer of the protocol stack of the first node; and

transmitting, to a second node, a message indicating the availability of resources at the first node for data flows associated with the second node and for data flows not associated with the second node.

2. The method of claim 1 , wherein the message indicates a need for reducing a resource load on the first node for the at least one data flow.

3. The method of claim 1 , further comprising receiving a request to terminate serving at least one data flow.

4. The method of claim 1 , further comprising receiving a request to deactivate a carrier or radio access technology (RAT), wherein active data flows are released via a handover (HO) or a deactivation of the connection with a mobile device associated with the at least one data flow.

5. The method of claim 1 , further comprising deactivating a carrier or RAT if no more data flows are served on that carrier or RAT.

6. The method of claim 1 , wherein evaluating the availability of resources at the first node to serve the data flow comprises comparing a resource load associated with the data flow to a threshold.

7. The method of claim 1 , wherein:

the first node has previously received from the second node a request for admission for the data flow; and

the message indicates the availability of resources at the first node for the data flow.

8. The method of claim 1 , wherein the data flow comprises a new data flow.

9. The method of claim 1 , wherein the data flow comprises data for an application.

10. The method of claim 1 , wherein the data flow comprises data for a service.

11. A first node comprising:

means for determining that at least one data flow is active for an existing bearer or a new packet data network (PDN) connection, wherein the data flow has an associated aggregation layer of a protocol stack of the first node;

means for evaluating an availability of resources at the first node to serve the data flow, wherein the evaluating relates to resources managed by at least one protocol layer that is below the associated aggregation layer of the protocol stack of the first node; and

means for transmitting, to a second node, a message indicating the availability of resources at the first node for data flows associated with the second node and for data flows not associated with the second node.

12. The first node of claim 11 , wherein the message indicates a need for reducing a resource load on the first node for the at least one data flow.

13. The first node of claim 11 , further comprising means for receiving a request to terminate serving at least one data flow.

14. The first node of claim 11 , further comprising means for receiving a request to deactivate a carrier or radio access technology (RAT), wherein active data flows are released via a handover (HO) or a deactivation of the connection with a mobile device associated with the at least one data flow.

15. The first node of claim 11 , further comprising means for deactivating a carrier or RAT if no more data flows are served on that carrier or RAT.

16. The first node of claim 11 , wherein means for evaluating the availability of resources at the first node to serve the data flow comprises means for comparing a resource load associated with the data flow to a threshold.

17. The first node of claim 11 , wherein:

the first node has previously received from the second node a request for admission for the data flow; and

the message indicates the availability of resources at the first node for the data flow.

18. The first node of claim 11 , wherein the data flow comprises a new data flow.

19. The first node of claim 11 , wherein the data flow comprises data for an application.

20. The first node of claim 11 , wherein the data flow comprises data for a service.

21. A non-transitory computer-readable medium having instructions stored thereon, that when executed by a processor, causes a first node to:

determine that at least one data flow is active for an existing bearer or a new packet data network (PDN) connection, wherein the data flow has an associated aggregation layer of a protocol stack of the first node;

evaluate an availability of resources at the first node to serve the data flow, wherein the evaluating relates to resources managed by at least one protocol layer that is below the associated aggregation layer of the protocol stack of the first node; and

transmit, to a second node, a message indicating the availability of resources at the first node for data flows associated with the second node and for data flows not associated with the second node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 18, 2017
From: HORN, GAVIN BERNARD; TENNY, NATHAN EDWARD
To: QUALCOMM INCORPORATED
Reel/Frame 043031/0229 →
Continuity (3)
Division 14599144 · Jan 16, 2015
Provisional Application 62039221 · Aug 19, 2014
Related Publication 20170318500A1 · Nov 2, 2017
Cited By (108)
US 12,192,776 US 12,192,778 US 12,207,097 US 12,212,973 US 12,219,364 US 12,225,386 US 12,231,902 US 12,231,906 US 12,238,526 US 12,245,046 US 12,250,558 US 12,250,559 US 12,262,212 US 12,262,214 US 12,273,726 US 12,273,728 US 12,273,729 US 12,273,730 US 12,284,526 US 12,284,527 US 12,289,602 US 12,289,603 US 12,289,604 US 12,294,865 US 12,294,867 US 12,302,111 US 12,302,115 US 12,309,598 US 12,309,604 US 12,309,605 US 12,317,090 US 12,323,814 US 12,323,815 US 12,328,591 US 12,328,592 US 12,335,743 US 12,342,174 US 12,348,973 US 12,348,974 US 12,348,975 US 12,363,550 US 12,369,040 US 12,375,931 US 12,375,932 US 12,375,933 US 12,382,297 US 12,382,299 US 12,395,854 US 12,402,014 US 12,432,569 US 12,432,570 US 12,439,265 US 12,445,855 US 12,445,856 US 12,445,857 US 12,445,858 US 12,452,683 US 12,452,684 US 12,452,786 US 12,464,364 US 12,470,938 US 12,470,939 US 12,470,940 US 12,483,897 US 12,483,898 US 12,490,103 US 12,490,104 US 12,490,105 US 12,495,307 US 12,501,272 US 12,507,073 US 12,507,074 US 12,507,075 US 12,507,076 US 12,520,162 US 12,526,640 US 12,549,954 US 12,549,955 US 12,563,403 US 12,563,404 US 12,574,745 US 12,574,746 US 12,581,315 US 12,581,316 US 12,587,866 US 12,598,474 US 12,598,475 US 12,604,198 US 12,604,200 US 12,604,201 US 12,604,202 US 12,604,203 US 12,621,675 US 12,627,991 US 12,627,992 US 12,627,993 US 12,627,994 US 12,634,708 US 12,641,442 US 12,647,797 US 12,652,544 US 12,684,360 US 12,689,906 US 12,689,907 US 12,701,424 US 12,720,321 US 12,739,647 US 12,745,094