REGISTER CLUSTERING IN A SIP-BASED NETWORK

• US 20110219133A1
• Filed: 05/13/2011
• Published: 09/08/2011
• Est. Priority Date: 07/25/2007
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Shanmugham, Saravanan
• Granted Patent: US 8,234,390 B2
• Time in Patent Office: Days
• US Class Current: 709/229
• CPC Class Codes: H04L 61/4511 using domain name system [DNS]
• CPC Class Codes: H04L 65/1073 Registration or de-registration
• CPC Class Codes: H04L 65/1104 Session initiation protocol [SIP]
• CPC Class Codes: H04L 67/1001 for accessing one among a plurality of replicated servers
• CPC Class Codes: H04L 67/1023 based on a hash applied to IP addresses or costs
• CPC Class Codes: H04L 67/288 Distributed intermediate devices, i.e. intermediate devices for interaction with other intermediate devices on the same level
• CPC Class Codes: H04L 67/306 User profiles
• CPC Class Codes: H04L 67/563 Data redirection of data network streams

Abstract

In one embodiment, a method can include: receiving a request for service in a first edge proxy; applying a hash function to a source address of an endpoint; and forwarding the request to a second edge proxy in response to a first result of the hash function, or servicing the request in the first edge proxy in response to a second result of the hash function.

Claims

1-20. -20. (canceled)

21. A method, comprising:

receiving a request at a first proxy;

applying a hash function to a source address associated with an endpoint that sent the request;

determining if the proxy is provisioned for servicing the request; and

forwarding the request to a second proxy based on a result of the hash function.

22. The method of claim 21, wherein applying the hash function includes evaluating a hash table that includes a plurality of proxies for servicing particular endpoint requests.

23. The method of claim 22, wherein the hash function is provided in a service control such that a particular one of the proxies is identified in advance of servicing a particular request.

24. The method of claim 21, wherein a proxy failure is determined such that a hash table provisioned in the first proxy is updated to remove an entry associated with the proxy failure.

25. The method of claim 21, wherein the hash function is provisioned in both the first proxy and the second proxy such that each of the proxies can automatically forward incoming registration requests to each other.

26. The method of claim 21, wherein the hash function utilizes an address on register (AOR).

27. The method of claim 21, wherein the request is associated with a session initiation protocol (SIP) INVITE, or a SIP REGISTER.

28. The method of claim 21, wherein the hash function considers a network address translator (NAT) parameter in determining which proxy should service the request.

29. The method of claim 21, wherein key groups within a plurality of proxies are identified based, at least, on a current load across the plurality of proxies.

30. Logic encoded in non-transitory tangible media that includes code for execution and when executed by a processor operable to perform operations comprising:

receiving a request at a first proxy;

applying a hash function to a source address associated with an endpoint that sent the request;

determining if the proxy is provisioned for servicing the request; and

forwarding the request to a second proxy based on a result of the hash function.

31. The logic of claim 30, wherein applying the hash function includes evaluating a hash table that includes a plurality of proxies for servicing particular endpoint requests.

32. The logic of claim 31, wherein the hash function is provided in a service control such that a particular one of the proxies is identified in advance of servicing a particular request.

33. The logic of claim 30, wherein a proxy failure is determined such that a hash table provisioned in the first proxy is updated to remove an entry associated with the proxy failure.

34. The logic of claim 30, wherein the hash function is provisioned in both the first proxy and the second proxy such that each of the proxies can automatically forward incoming registration requests to each other.

35. The logic of claim 30, wherein the hash function utilizes an address on register (AOR).

36. The logic of claim 30, wherein the hash function considers a network address translator (NAT) parameter in determining which proxy should service the request.

37. An apparatus, comprising:

a processor;

a hash table; and

a forwarding engine configured for forwarding information in a network environment, wherein the processor, the hash table, and the forwarding engine interact such that the apparatus is configured for;

receiving a request at a first proxy;

applying a hash function to a source address associated with an endpoint that sent the request;

determining if the proxy is provisioned for servicing the request; and

forwarding the request to a second proxy based on a result of the hash function.

38. The apparatus of claim 37, wherein applying the hash function includes evaluating the hash table, which includes a plurality of proxies for servicing particular endpoint requests, and wherein the hash function is provided in a service control such that a particular one of the proxies is identified in advance of servicing a particular request.

39. The apparatus of claim 37, wherein the hash function utilizes an address on register (AOR).

40. The apparatus of claim 37, wherein the hash function considers a network address translator (NAT) parameter in determining which proxy should service the request.