Planning system for broadband multi-service connections

• US 6,600,749 B1
• Filed: 11/18/1999
• Issued: 07/29/2003
• Est. Priority Date: 04/11/1997
• Status: Expired due to Term

• Current Assignee: Ciena Corporation
• Original Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Inventors: Tunnicliffe, Andrew J, Ross, Niall Forbes, Bragg, Nigel Lawrence, Hayball, Clive Colin
• Primary Examiner(s): Ton, Dang
• Assistant Examiner(s): Wilson, Robert W.
• Application Number:
  US09/380,347
• Time in Patent Office: 1,349 Days
• Field of Search: 370/351-352, 370/395, 370/60.1, 370/400, 370/401, 370/254, 370/255, 379/202, 395/51-52, 909/903, 709/223
• US Class Current: 370/400
• CPC Class Codes: H04L 2012/5619 Network Node Interface, e.g. tandem connections, transit switching
• CPC Class Codes: H04L 2012/5626 Network management, e.g. Intelligent nets
• CPC Class Codes: H04L 41/16 using machine learning or artificial intelligence
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A syntactical representation is used to generate data describing a hierarchical broadband network and relationships between it elements. The format of the syntactical representation resembles logic programming language clauses. The syntactical representation is used to specify a broadband connection problem to be solved. Data describing physical resources and functionality of a set of network elements is entered into an inference engine which applies an algorithm to its input in order to find a solution to a specified connections planning problem. The algorithm is recursive and uses artificial intelligence techniques; such as, first fail hierarchical planning and hill-climbing to guide the inference engine'"'"'s search for a solution.

Claims

1. A method of producing a connection plan representing at least one connection between a plurality of end points in a class-level hierarchical network comprising a plurality of nodes and a plurality of links, each said node having at least one end point connecting it to a said link, each said link being between at least a pair of said endpoints, characterized by said link having a type, said connection plan comprising data describing a set of end points and data describing said types of said links between said end points, said method comprising the steps of:

creating a multi-class-level data representation of at least part of said network;

creating a data representation of said end points of said connection; and

applying an algorithm utilizing artificial intelligence techniques to said data representations to generate said connection plan.

2. A method according to claim 1, wherein a said representation comprises a list of at least one clause, each said clause comprising at least one term.

3. A method according to claim 1, wherein a said representation comprises a list of at least one clause each said clause comprising at least one term, and said step of applying an algorithm to generate said connection plan comprises selecting (601) a said term of a said clause representing said connection as a sub-goal and recursively attempting to solve said sub-goal.

4. A method according to claim 3, wherein a said sub-goal is assigned a priority, and said algorithm selects (704) a said sub-goal with a highest said priority.

5. A method according to claim 3, wherein said algorithm selects (901) a said sub-goal which is a clause with fewest said terms.

6. A method according to claim 3, wherein said algorithm selects (903) a said sub-goal according to an order of its said terms.

7. A method according to claim 3, wherein a said algorithm selects (905) a sub-goal with a lowest position in said network hierarchy.

8. A method according to claim 3, wherein said algorithm selects (907) said sub-goal randomly.

9. A method according to claim 3, wherein said algorithm selects (1002) a said clause with which to solve said sub-goal according to a position of said clause in said list of clauses.

10. A method according to claim 3, wherein said algorithm selects (1003) a said clause with which to solve said sub-goal by selecting a said clause having a term included in said connection plan.

11. A method according to claim 3, wherein said algorithm selects (1005) a said clause with which to solve said sub-goal by selecting a clause which is lowest in said network hierarchy.

12. A method according to claim 3, wherein said algorithm randomly selects (1009) a clause with which to solve said sub-goal.

13. A method according to claim 2, wherein said clauses represent data describing features of said network, said features selected from the set:

classes of said network nodes;

end points of said network nodes; and

links of said network.

14. A method according to claim 1, wherein said link types may be selected from the set:

binding;

realization;

behavior;

containment.

15. A method according to claim 1, further comprising the step of:

displaying a graphical representation (1201-1208, 1402-1412) of said connection plan.

16. A method according to claim 1, further comprising the step of:

implementing said connection plan as a connection in said network.

17. A method according to claim 1 wherein said representation comprises a Prolog syntax.

18. Connection planning apparatus for planning at least one connection in a class-level hierarchical network comprising a plurality of nodes and links, each said node having at least one end point connecting it to a said link, characterized by each said link between said end points having a type, said apparatus capable of creating a connection plan comprising a set of end points and said types of links between said end points, said apparatus comprising:

means for creating a multi-class-level data representation of at least part of said network;

means for creating a data representation of end points of said connection; and

an inference machine comprising an algorithm which uses said data representations to generate said connection plan using artificial intelligence techniques.

19. Apparatus according to claim 18, wherein a said representation comprises a list of at least one clause, each said clause comprising at least one term.

20. Apparatus according to claim 19, wherein a said clauses comprises a horn clause.

21. Apparatus according to claim 19, wherein said inference engine selects (601) a said term of a said clause representing said connection as a sub-goal and recursively attempts to solve said sub-goal.

22. Apparatus according to claim 21, wherein a said sub-goal is assigned a priority, and said inference engine selects (704) a said sub-goal with a highest said priority.

23. Apparatus according to claim 21, wherein said inference engine selects (901) a said sub-goal which is a clause with a fewest said terms.

24. Apparatus according to claim 21, wherein said inference engine selects (903) a sub-goal according to an order of its said terms.

25. Apparatus according to claim 21, wherein said inference engine selects (905) a said sub-goal with a lowest position in said network hierarchy.

26. Apparatus according to claim 21, wherein said inference engine selects (907) said sub-goal randomly.

27. Apparatus according to claim 21, wherein said inference engine selects (1002) a said clause with which to solve said sub-goal according to a position of said clause in said list of clauses.

28. Apparatus according to claim 21, wherein said inference engine selects (1003) a said clause with which to solve said sub-goal by selecting said clause having a term included in said connection plan.

29. Apparatus according to claim 21, wherein said inference engine selects (1005 a said clause with which to solve said sub-goal by selecting a clause which is lowest in said network hierarchy.

30. Apparatus according to claim 21, wherein said inference engine randomly selects (1009) a clause with which to solve said sub-goal.

31. Apparatus according to claim 19, wherein said clauses represent data describing features of said network, said features selected from the set:

classes of said network nodes;

end points of said network nodes; and

links of said network.

32. Apparatus according to claim 18, wherein said link types may be selected from the set:

binding;

realization;

behavior;

containment.

33. Apparatus according to claim 18, further comprising:

means for displaying a graphical representation (1201-1208, 1402-1412) of said connection plan.

34. Apparatus according to claim 18, further comprising:

means for implementing said connection plan as a connection in said network.

35. Apparatus according to claim 18, wherein said representation comprises a Prolog syntax.

36. A method of processing data describing a hierarchical network comprising a plurality of nodes each said node comprising a set of equipment items, and a plurality of physical links connecting said plurality of nodes, said method characterized by comprising the steps of:

representing a said node equipment as a syntax data describing said node equipment;

representing a plurality of capabilities of said node equipment by creating syntax data describing said capabilities;

representing said links by syntax data describing said links, wherein said syntax data comprises a plurality of clauses; and

manipulating said clauses by means of an artificial intelligence technique to obtain a solution of connections which are capable of being transformed into an aggregated connection suitable for application in said network.

37. The method according to claim 36, wherein a said syntax data representation comprises:

at least two nodes representing end points of said links; and

a hierarchical network layer upon which said link appears.

38. A syntactical representation according to claim 36, comprising a Prolog syntax.

39. A network management apparatus for a communications network, which network comprises a plurality of interconnected network element devices, which network element devices perform a plurality of functions, said network management apparatus comprising:

a plurality of device controllers each controlling a corresponding network element device, and

the device controllers each comprising a plurality of device sub-controllers, each sub-controller representing a corresponding function of the network element device controlled by said device controller;

wherein a set of connections between said device controllers are provided, which connections are arranged in a manner which represents the connections of said network element devices.

40. The network management apparatus as claimed in claim 39, wherein each said device sub-controller comprises:

a data storage means storing data describing a function of a network element device, and

a means for generating management control signals for controlling a said network element device.

41. The device sub-controller as claimed in claim 39, wherein a said device sub-controller comprises an object data representation.

42. A method of controlling a network comprising a plurality of network element devices characterised by each supporting a plurality of service functions, said method comprising the steps of:

representing each network element device by a corresponding device controller;

for each device controller, representing each function capability provided by a said corresponding network element device by a corresponding device sub-controller; and

linking a plurality of said sub-controllers of different device controllers in a manner which represents an aggregated connection supported by said network element devices.

43. The method as claimed in claim 42, wherein each said device sub-controller comprises:

a data storage medium for storing a set of data signals describing a functionality of a network element device; and

a control signal generating means for generating control signals for controlling a function of said network element device.

44. A method of planning a connection supporting a multi-media service function in a communications network comprising a plurality of interconnected nodes capable of supporting said multi-media service function, said method characterized by comprising the steps of:

translating a plurality of function capabilities of said nodes into a plurality of syntax constructs;

translating another plurality of connections between said nodes into a plurality of syntax constructs;

taking each said syntax construct as an operator in a planning system to obtain a connection plan solution; and

transforming said connection plan solution into a connection model suitable for application within a network manager apparatus.

45. The method as claimed in claim 44, wherein a said syntactical operator comprises a connection operator.

46. The method as claimed in claim 44, wherein a said syntactical operator comprises a transform operator representing a said function capability of a said node.

47. The method as claimed in claim 44, wherein a said service is represented in terms of a layered structure.

48. The method as claimed in claim 44, wherein said connection plan solution is obtained using an artificial intelligence technique.

49. The method as claimed in claim 44, wherein a said connection comprises a multi-media service connection.