IP Library Granted Patent US 8,788,629
Granted Patent B2
US 8,788,629 · App. 12/599,714 · Granted Jul 22, 2014

HIP node reachability

Inventors: Patrik Salmela (Kirkkonummi, FI); Petri Jokela (Espoo, FI); Raimo Vuopionperë (Helsinki, FI); Jan Melén (Espoo, FI)
Assignee: Optis Wireless Technology, LLC
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 8,788,629
App. No.
12/599,714
Granted
Jul 22, 2014
Kind
B2
Abstract

A method of configuring a plurality of rendezvous servers to provide a Host Identity Protocol, HIP, based mobility service to HIP nodes, where the servers are arranged in a hierarchical branching structure. For each HIP node, a Host Identity Tag, HIT, and contact address mapping is registered with a rendezvous server. That server then identifies itself and the HIT to each higher level server within the same branch, without explicitly identifying the contact address to those higher level servers wherein, in use, when a first rendezvous server receives a HIP contact message addressed to a given HIT, if that first server is unaware of the destination HIT, it forwards the message to a higher level server within the same branch and if the first server is not the server at which the HIT is registered but is aware of the HIT, it forwards the contact message to the neighbouring rendezvous server corresponding to the HIT.

Claims (13)

1. A method of operating a plurality of rendezvous servers to provide a Host Identity Protocol, HIP, based mobility service to HIP nodes, the method comprising:

arranging the rendezvous servers in a hierarchical branching structure;

for each of the HIP nodes, registering a Host Identity Tag, HIT, and contact address mapping with a rendezvous server, and identifying to each higher level rendezvous server within the same branch of the hierarchical structure the HIT and a neighbouring or other lower level rendezvous server within the branch, without explicitly identifying the contact address to the higher level rendezvous servers,

wherein in use, when a first rendezvous server receives a HIP I1 message addressed to a destination HIT, if the first rendezvous server is unaware of the destination HIT of the HIP I1 message, the first rendezvous server forwards the HIP I1 message to a higher level rendezvous server within the same branch, and if the first rendezvous server is not the rendezvous server at which the destination HIT is registered but is aware of the destination HIT, the first rendezvous server forwards the HIP I1 message to a neighbouring or other lower level rendezvous server corresponding to the destination HIT.

2. The method according to claim 1 and comprising, following registration of a HIP node at a registration rendezvous server, sending a notification from that registering rendezvous server to one or more other rendezvous servers within the same hierarchical layer to identify to the other rendezvous server(s) the HIT to contact address mapping for the HIP node.

3. The method according to claim 2 and comprising sending said notification to rendezvous servers within the same geographic region as the registration rendezvous server.

4. The method according to claim 1 , wherein upon registration of a HIP node the registration rendezvous server sends notifications to other rendezvous servers accompanied with a certificate verifying that the registration rendezvous server is an approved rendezvous server.

5. The method according to claim 1 , wherein upon registration of a HIP node the registration rendezvous server sends notifications to other rendezvous servers with which the registration rendezvous server has an established trust relationship.

6. The method according claim 1 , wherein said contact address is an IP address.

7. The method according to claim 1 , wherein both the destination HIP node and the originating HIP node of said HIP I1 message are registered with one of said rendezvous servers.

8. The method according to claim 1 , wherein said step of identifying to each higher level rendezvous server within the same branch the HIT and a neighbouring or other lower level rendezvous server within the branch, comprises informing each rendezvous server above the rendezvous server at which the HIP node is registered of the HIT and the identity of the registering rendezvous server.

9. The method according to claim 1 , wherein said step of identifying to each higher level rendezvous server within the same branch the HIT and the neighbouring or other lower level rendezvous server within the branch, comprises identifying to each higher level rendezvous server in the same branch the HIT and an identity of the neighbouring rendezvous server and lower level rendezvous server.

10. A method according to claim 1 , further comprising receiving the I1 HIP message at the first rendezvous server, determining whether or not a contact address mapping for the destination HIT of the I1 message is registered at the first rendezvous server and, if a mapping is not registered, forwarding the I1 message to a rendezvous server higher in the hierarchical rendezvous server structure.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 19, 2014
From: TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
To: CLUSTER, LLC
Reel/Frame 032285/0421 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 19, 2014
From: CLUSTER, LLC
To: OPTIS WIRELESS TECHNOLOGY, LLC
Reel/Frame 032286/0501 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 25, 2010
From: SALMELA, PATRIK; MELEN, JAN; JOKELA, PETRI; VUOPIONPERA, RAIMO
To: TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
Reel/Frame 024945/0375 →
Priority Claims (1)
GB 0709086.3 · May 11, 2007 · national
Continuity (1)
Related Publication 20100306350A1 · Dec 2, 2010