Forwarding tree generation in a communications network

• US 20040068578A1
• Filed: 08/18/2003
• Published: 04/08/2004
• Est. Priority Date: 02/19/2001
• Status: Abandoned Application

• Current Assignee: British Telecommunications PLC (BT Group PLC)
• Original Assignee: British Telecommunications PLC (BT Group PLC)
• Inventors: OʼNeill, Alan W, Corson, Mathew S
• Application Number:
  US10/468,236
• Publication Number:
  US 20040068578A1
• Time in Patent Office: Days
• US Class Current: 709/238
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 12/189 in combination with wireless systems selective distribution or broadcast in wireless communication networks H04W4/06
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04W 4/06 Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update
• CPC Class Codes: H04W 40/36 due to handover
• CPC Class Codes: H04W 48/17 Selecting a data network PoA [Point of Attachment]
• CPC Class Codes: H04W 68/08 using multi-step notification by increasing the notification area
• CPC Class Codes: H04W 8/085 involving hierarchical organized mobility servers, e.g. hierarchical mobile IP [HMIP]
• CPC Class Codes: H04W 8/087 for preserving data network PoA address despite hand-offs
• CPC Class Codes: H04W 80/04 Network layer protocols, e.g. mobile IP [Internet Protocol]

Abstract

The present invention provides a method of, computer programs for and apparatus adapted to operate a communications network to generate data defining a forwarding tree for the transmission of messages in said network, said method comprising:

a) storing data associating each of the nodes of said network with at least one of N levels of a hierarchy, where N is an integer greater than one;

b) operating each of the nodes in each of the first to (N-1)^th levels to periodically send a join message to one of the nodes in a superior level in said hierarchy;

c) in response to the receipt of a join message at a node, storing tree-defining data indicating that the sender of said join message is a member of a group of descendant nodes for which said receiving node is an ancestor node; whereby said tree-defining data so stored defines said forwarding tree.

Claims

1. A method of operating a communications network to generate data defining a forwarding tree for the transmission of messages in said network, said method comprising:

a) storing data associating each of the nodes of said network with at least one of N levels of a hierarchy, where N is an integer greater than one;

b) operating each of the nodes in each of the first to (N-1)th levels to send a join message to one of the nodes in a superior level in said hierarchy;

c) in response to the receipt of a join message at a node, storing tree-defining data indicating that the sender of said join message is a member of a group of descendant nodes for which said receiving node is an ancestor node;

whereby said tree-defining data so stored defines said forwarding tree.

2. A method according to claim 1 wherein the sending of a join message is carried out periodically.

3. A method according to claim 1 wherein the superior level is an immediately superior level.

4. A method according to any preceding claim wherein said join message is addressed to an address representing any node in said superior level.

5. A method according to claim 4 wherein said address is an anycast address.

6. A method according to any preceding claim wherein said data is used in paging for or broadcasting to a mobile node which has previously been associated with a node in said first level.

7. A method according to any preceding claim, wherein an identifier of a child node is stored at a different node of said communications network for routing data packets towards said child node.

8. A method according to any preceding claim, wherein an identifier of a parent node is stored at a different node of the communications network for routing data packets towards a child node.

9. A method according to claim 7 when dependent on claim 3, wherein the identifier of the parent node is stored at a grandparent node.

10. A method of paging for or broadcasting to a mobile node which has previously been associated with a node of a communications network, the communications network comprising a plurality of nodes interconnected by data packet communications links, said method comprising:

a) carrying out a method according to any preceding claim

b) sending a paging/broadcasting message from a node to a group of nodes which said tree-defining data indicates to be a group of descendant nodes of said node.

11. A method according to claim 10 wherein said paging/broadcasting message is addressed to an address representing all nodes in said group of descendant nodes.

12. A method according to claim 11 wherein said address is a multicast address.

13. A method of establishing a group of nodes of a communications network, said communications network comprising nodes interconnected by data communications links, the group being for group data communications, the method comprising assigning nodes of said communications network to the group using tree defining data generated according to the method of any of claims 1 to 9.

14. A computer program for performing the method of any preceding claim.

15. Apparatus adapted to perform the method of any of claims 1 to 13.