IP Library Granted Patent US 7,590,420
Granted Patent B1
US 7,590,420 · App. 11/425,631 · Granted Sep 15, 2009

Intelligent home agent selection mechanism (IHASM) for dynamic home agent (HA) assignment

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 7,590,420
App. No.
11/425,631
Granted
Sep 15, 2009
Kind
B1
Abstract

A method, system, and medium are provided for an intelligent home agent selection mechanism (IHASM) for dynamic home agent assignment. The present invention has several practical applications in the technical arts including dynamically selecting a HA, determining available HAs in a network, and implementing an HA selection policy. The IHASM solves the redundancy problem in round robin selection methods by using normalized load concepts.

Claims (29)

1. An IHASM system for dynamically selecting a home agent (HA), comprising:

a monitoring function connected to a prediction function and a selection function, the prediction function connected to the selection function, a policy engine connected to the selection function, and the selection function connected to one or more HAs;

the monitoring function operable to acquire data from the one or more HAs to at least one of provide a number of user sessions from the one or more HAs to the prediction function and provide a health status of the one or more HAs to the selection function wherein the health status is a set of SNMP traps, SNMP polls, or RADIUS authentication messages;

the prediction function operable to aggregate the number of user sessions into one or more data sets to model user traffic patterns at the one or more HAs and to predict a load capacity on the one or more HAs;

the policy engine operable to implement a set of instructions based on a set of preferences for a group of HAs to determine a subgroup of HAs wherein the group of HAs includes the one or more HAs; and

the selection function operable to receive a predicted load capacity of each HA from the prediction function, to receive the subgroup of HAs from the policy engine, to receive the health status of an unhealthy HA, and to select an HA with a smallest predicted load capacity from the predicted load capacity of each HA wherein the unhealthy HA is excluded from a selection process in the selection function.

2. The system of claim 1 , wherein the monitoring function resides in at least one of a separate hardware or a AAA server.

3. The system of claim 1 , further comprising re-modeling user traffic patterns at the one or more HAs and predicting another load capacity on the one or more HAs after receiving an updated number of user sessions.

4. The system of claim 1 , wherein a selection of the HA is based on a set of criteria.

5. A computer system having a processor and a memory, the computer system operable to execute a method for determining one or more available HAs from a group of HAs, comprising:

counting users respectively at one or more HAs by periodically polling the one or more HAs;

calculating at a time period one or more load normalizations for the one or more HAs using the users respectively assigned to the one or more HAs and one or more load capacities for the one or more HAs;

determining one or more incremental normalized loads wherein an incremental normalized load represents an addition of a user at an HA;

during a time period after the time period but before a next time period, predicting one or more changes respectively in the one or more load normalizations for the one or more HAs by using one or more past load normalizations for each of the one or more HAs in a prediction method; and

selecting a subset of the one or more HAs wherein for each HA, an aggregation of 1) a load normalization, 2) the incremental normalized load, and 3) a predicted change in the load normalization are below a threshold.

6. The system of claim 5 , wherein the threshold is selected from a group including an operable amount and a capacity limit.

7. The system of claim 5 , further comprising excluding from the subset an unhealthy HA wherein the unhealthy HA is selected from a group including an overloaded HA, an HA with a failure, an HA experiencing an outage, and an HA sending a warning or an alarm.

8. The system of claim 5 , wherein a load normalization is a total number of sessions at an HA divided by a capacity of the HA.

9. The system of claim 5 , wherein one or more HA functions reside in the HA.

10. One or more computer-readable media having instructions stored thereon for performing the system of claim 5 .

11. A computer system having a processor and a memory, the computer system operable to execute a method for implementing a home agent (HA) selection policy, comprising:

defining a set of policies that implement compound load balancing in an authentication, authorization, and accounting (AAA) server or an intelligent home agent selection mechanism (IHASM) to select an HA for a data session;

arranging the set of policies in a preferential structure to achieve the compound load balancing wherein one or more policies are associated with one or more preferred groups of HAs wherein the one or more policies are arranged into a hierarchy of a most preferred group and respectively have one or more thresholds for execution;

executing a first policy starting with the most preferred group until a first threshold associated with the most preferred group is reached or exceeded; and

executing a subsequent policy with a next most preferred group until a next threshold associated with the next most preferred group is reached or exceeded.

12. The system of claim 11 , wherein the IHASM is selected from a group including a computing software with a policy engine and a computer hardware with a policy engine.

13. The system of claim 12 , wherein the IHASM operates within the AAA server.

14. The system of claim 11 , further comprising a default policy to enable connecting a user to an HA for the data session.

15. One or more computer-readable media having instructions stored thereon for performing the system of claim 11 .

Assignments (6)
RELEASE OF SECURITY INTEREST Recorded Aug 23, 2022
From: DEUTSCHE BANK TRUST COMPANY AMERICAS
To: SPRINT INTERNATIONAL INCORPORATED; IBSV LLC; LAYER3 TV, LLC; PUSHSPRING, LLC; T-MOBILE CENTRAL LLC; T-MOBILE USA, INC.; ASSURANCE WIRELESS USA, L.P.; BOOST WORLDWIDE, LLC; CLEARWIRE COMMUNICATIONS LLC; CLEARWIRE IP HOLDINGS LLC; SPRINTCOM LLC; SPRINT COMMUNICATIONS COMPANY L.P.; SPRINT SPECTRUM LLC
Reel/Frame 062595/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 4, 2021
From: SPRINT COMMUNICATIONS COMPANY L.P.
To: T-MOBILE INNOVATIONS LLC
Reel/Frame 055604/0001 →
TERMINATION AND RELEASE OF FIRST PRIORITY AND JUNIOR PRIORITY SECURITY INTEREST IN PATENT RIGHTS Recorded Apr 2, 2020
From: DEUTSCHE BANK TRUST COMPANY AMERICAS
To: SPRINT COMMUNICATIONS COMPANY L.P.
Reel/Frame 052969/0475 →
SECURITY AGREEMENT Recorded Apr 2, 2020
From: T-MOBILE USA, INC.; ISBV LLC; T-MOBILE CENTRAL LLC; LAYER3 TV, INC.; PUSHSPRING, INC.; BOOST WORLDWIDE, LLC; CLEARWIRE COMMUNICATIONS LLC; CLEARWIRE IP HOLDINGS LLC; CLEARWIRE LEGACY LLC; SPRINT COMMUNICATIONS COMPANY L.P.; SPRINT INTERNATIONAL INCORPORATED; SPRINT SPECTRUM L.P.; ASSURANCE WIRELESS USA, L.P.
To: DEUTSCHE BANK TRUST COMPANY AMERICAS
Reel/Frame 053182/0001 →
GRANT OF FIRST PRIORITY AND JUNIOR PRIORITY SECURITY INTEREST IN PATENT RIGHTS Recorded Mar 6, 2017
From: SPRINT COMMUNICATIONS COMPANY L.P.
To: DEUTSCHE BANK TRUST COMPANY AMERICAS
Reel/Frame 041895/0210 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 21, 2006
From: ZAGHLOUL, SAID ISMAIL SAID; SIVASHANMUGAM, SUDHA; ZHU, LEI
To: SPRINT COMMUNICATIONS COMPANY L.P.
Reel/Frame 017824/0755 →