OPTIMISATION OF PASSIVE OPTICAL NETWORKS

• US 20100003030A1
• Filed: 03/14/2007
• Published: 01/07/2010
• Est. Priority Date: 03/24/2006
• Status: Abandoned Application

• Current Assignee: British Telecommunications PLC (BT Group PLC)
• Original Assignee: British Telecommunications PLC (BT Group PLC)
• Inventors: Conway, Anthony S., Dorne, Raphael JH, Gilfedder, Timothy H.
• Application Number:
  US12/293,903
• Publication Number:
  US 20100003030A1
• Time in Patent Office: Days
• US Class Current: 398/67
• CPC Class Codes: H04L 41/0856 by backing up or archiving configuration information
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network
• CPC Class Codes: H04Q 11/0067 Provisions for optical access or distribution networks, e.g. Gigabit Ethernet Passive Optical Network (GE-PON), ATM-based Passive Optical Network (A-PON), PON-Ring
• CPC Class Codes: H04Q 2011/0086 Network resource allocation, dimensioning or optimisation

Abstract

The present invention relates to communications network design, and in particular the use of passive optical networks (PONs) for optimising an existing large network infrastructure such as a backhaul network. The present invention provides a computer implemented method of designing a PON based network, the method comprising: receiving data representing a plurality of network nodes having cable interconnection routes; determining a combination of core nodes from the network nodes, the core nodes being selected by allocating a combined cost to a series of core node combinations and selecting the lowest combined cost core node combination, the combined cost of each core node combination comprising a cost allocated for each of a number of core node selection criteria; allocating a number of network nodes to each core node in the selected core node combination; for each core node in the selected core node combination, determining a combination of PONS having respective cable interconnection routes for servicing the respective allocated nodes from the core node, the PONS being selected by allocating a combined cost to a series of PON combinations and selecting the lowest combined cost PON combination, the combined cost of each PON combination comprising a cost allocated to each PON within the respective combination for each of a number of PON selection criteria; and outputting data representing each of the lowest cost PON combinations.

Claims

1. A computer implemented method of designing a PON based network, the method comprising:

receiving data representing a plurality of network nodes having cable interconnection routes;

determining a combination of core nodes from the network nodes, the core nodes being selected by allocating a combined cost to a series of core node combinations and selecting the lowest combined cost core node combination, the combined cost of each core node combination comprising a cost allocated for each of a number of core node selection criteria;

allocating a number of network nodes to each core node in the selected core node combination;

for each core node in the selected core node combination, determining a combination of PONS having respective cable interconnection routes for servicing the respective allocated nodes from the core node, the PONS being selected by allocating a combined cost to a series of PON combinations and selecting the lowest combined cost PON combination, the combined cost of each PON combination comprising a cost allocated to each PON within the respective combination for each of a number of PON selection criteria; and

outputting data representing each of the lowest cost PON combinations.

2. A method according to claim 1, wherein the series of core node combinations and PON combinations are determined according to respective heuristic search algorithms applied to the respective total core node combinations and the total PON combinations for each core node.

3. A method according to claim 2, wherein the first core node combination in the respective series is a random combination of core nodes and wherein the first PON combination in the respective series for each core node comprises a number of predetermined PONS.

4. A method according to claim 1, wherein the core node selection criteria comprise the distance from each network node to a core node using one or more of the cable interconnection routes and the total number of core nodes.

5. A method according to claim 4, wherein the core node selection criteria further comprises bandwidth viability and/or connectivity for each core node.

6. A method according to claim 1, wherein the PON selection criteria comprise the total number of PONS for a said core node.

7. A method according to claim 6, wherein the PON criteria for each core node further comprises one or a combination of:

the number of network nodes;

bandwidth validity;

PON splitter configuration;

equipment required;

differential distance which is dependent on the respective cable interconnection routes used;

power budget which is dependent on the respective cable interconnection routes used.

8. A method according to claim 1, further comprising allocating each exchange node a splitter configuration type dependent on its distance from a respective core node, and generating a table of all permissible splitter configurations for the exchange nodes, and using the table together with the splitter configuration type allocated to each exchange node within a PON combination to allocate a cost to said PON combination.

9. A method according to claim 1, wherein the step of allocating costs to each PON combination for a number of PON selection criteria is performed in an order according to the speed of processing each PON selection criteria, and wherein performance of all PON selection criteria may be terminated for any one PON combination where this has already attracted a threshold high cost from previous PON selection criteria.

10. A method according to claim 1, wherein for each core node:

each respective allocated network node is represented in a first array and has an entry corresponding to a respective PON;

each allocated network node is further represented in a second array and has an entry corresponding to a network or core node having the nearest splitter within the PON;

each PON is represented in a third array and has an entry corresponding to a network or core node having the primary splitter for that PON; and

wherein these entries are variables manipulated according to the respective heuristic search.

11. A method according to claim 1, wherein a first combination of core nodes is determined using a first core node criteria, and wherein a second combination of core nodes is determined using a second core node criteria.

12. A method according to claim 11, wherein the first core node criteria comprise:

existing core node locations, bandwidth threshold, distance from existing core node threshold; and

wherein the second core node criteria comprise;

distance from each network node to a core node, the total number of core nodes in the second combination of core nodes.

13. A method of building a PON based network for a plurality of network nodes having cable interconnections, the method comprising allocating a number of core nodes and PONS according to claim 1, and coupling core node equipment at each core node to respective PON termination equipment at respective network nodes.

14. A computer program product for carrying computer code arranged when executed on a computer to carry out a method according to claim 1.

16. Computer apparatus according to claim 1, further comprising:

means for receiving data representing the network nodes and the cable interconnection routes from a database;

means for outputting data representing each of the lowest cost PON combinations to a database.

15. Computer apparatus for designing a PON based network for a plurality pf network nodes having cable interconnection routes, the apparatus comprising:

means for determining a combination of core nodes from the network nodes, the core nodes being selected by allocating a combined cost to a series of core node combinations and selecting the lowest combined cost core node combination, the combined cost of each core node combination comprising a cost allocated for each of a number of core node criteria;

means for allocating a number of network nodes to each core node in the selected core node combination;

means for determining a combination of PONS for servicing the respective allocated network nodes to each respective selected core node, the PONS for each core node being selected by allocating a combined cost to a series of PON combinations and selecting the lowest combined cost PON combination, the combined cost of each PON combination comprising a cost allocated to each PON within the respective combination for each of a number of PON criteria.