The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Apr. 10, 2012
Filed:
Sep. 26, 2007
Avneesh Singh Balyan, Columbus, OH (US);
Randy J. Paul, Lancaster, OH (US);
Satish Polakampalli, Blacklick, OH (US);
Khalid H. Sheta, Columbus, OH (US);
Pranil P. Vaidya, Aurora, IL (US);
Avneesh Singh Balyan, Columbus, OH (US);
Randy J. Paul, Lancaster, OH (US);
Satish Polakampalli, Blacklick, OH (US);
Khalid H. Sheta, Columbus, OH (US);
Pranil P. Vaidya, Aurora, IL (US);
Alcatel Lucent, Paris, FR;
Abstract
The invention includes a method and apparatus for establishing DIAMETER associations between nodes of a network. The invention uses a DIAMETER application server disposed between DIAMETER nodes in order to establish DIAMETER associations between nodes and, further, to provide DIAMETER traffic load balancing using established associations. A method includes receiving a DIAMETER connection establishment request from an originating node requesting an association with a destination node, terminating the DIAMETER connection establishment request, obtaining respective DIAMETER associations for the originating node and the destination node, linking the obtained DIAMETER associations, and storing the linked DIAMETER associations. The DIAMETER association for a node may be obtained by identifying a node associated with the DIAMETER connection establishment request, determining if an association exists for the identified node, and retrieving the association from memory if an association exists for the identified node, retrieving the association from memory, or, if an association does not exist for the identified node, establishing the association.