Communications network

• US 20040071147A1
• Filed: 08/19/2003
• Published: 04/15/2004
• Est. Priority Date: 03/13/2001
• Status: Abandoned Application

• Current Assignee: British Telecommunications PLC (BT Group PLC)
• Original Assignee: British Telecommunications PLC (BT Group PLC)
• Inventors: Marshall, Ian W., Roadknight, Christopher M.
• Application Number:
  US10/468,283
• Publication Number:
  US 20040071147A1
• Time in Patent Office: Days
• US Class Current: 370/400
• CPC Class Codes: H04L 41/00 Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks

Abstract

The present invention provides an emergent network that is autonomous at the service level. Network nodes have policies that enable them to process different types of service requests, with the processing earning the nodes ‘rewards’. Successful nodes can pass some or all of their policies to other nodes using the evolutionary biology of bacteria as a model. The network is arranged into clusters of nodes, with unprocessed service requests being passed from cluster to cluster.

Claims

1. A multi-service communications network comprising a plurality of clusters, each cluster comprising more than one node and being connected to one or more other clusters,

each node comprising one or more nodal policy and being configured to process one or more services in accordance with said one or more nodal policy, each nodal policy comprising;

(i) a service request identifier, said service request identifier determining the type of service request that may be processed by each respective node; and

(ii) one or more service request criteria, said service request criteria determining whether a type of service request defined by said service request identifier will be processed by each respective node

characterised in that, in use, un-processed service requests are forwarded to other nodes within a cluster and un-processed service requests which reach the perimeter of the cluster are forwarded to one of the connected clusters.

2. A multi-service communications network according to claim 1, in which a service request may contain a nodal policy.

3. A multi-service communications network according to any preceding claim such that if the activity indicator reaches an upper threshold then the node replicates all of the nodal policies to generate a clone of the node.

4. A multi-service communications network according to claim 2, such that if the activity indicator reaches a first lower threshold then the node may import the policy contained in the service request.

5. A multi-service communications network according to claim 4 such that if the activity indicator reaches a second lower threshold then the node deletes an enabled nodal policy and enables a dormant nodal policy.

6. A multi-service communications network according to claim 4 such that if the activity indicator reaches a second lower threshold then the node exchanges position with an adjacent node.

7. A multi-service communications network according to any preceding claim wherein service requests are injected into the uppermost layer of the cluster.

8. A multi-service communications network according to any of the preceding claims herein a variable within a nodal policy is randomly varied.

9. A multi-service communications network according to any of the preceding claims wherein each node further comprises a variable that encodes a preference for existing in a defined region of a cluster.

10. A data carrier comprising computer code means for implementing a multi-service communications network according to any preceding claim.

11. A method of operating a multi-service communications network according to any of claims 1 to 9.