Method and system for designing ring-based telecommunications networks
First Claim
Patent Images
1. A method for designing a bi-connected ring-based network comprising:
- receiving a list of locations where network traffic is at least one of originated and delivered;
receiving a list of pairs of directly connected locations, each defining a corresponding network traffic carrying connection including one or more signal carrying connections between each of the directly connected locations, and a capacity for each of the network traffic carrying connections;
receiving a list of traffic demand between each of the listed pairs of locations;
determining a dual homed cover including one or more dual homed cycles, each cycle comprising a closed loop sequence of directly connected locations and corresponding network traffic carrying connections, wherein each location, which is capable of being bi-connected, is included in at least one of the one or more dual homed cycles;
routing the traffic demand over the one or more cycles via the one or more of the network traffic carrying connections;
at least one of outputting a report and storing a representation containing the designed bi-connected ring-based network;
where determining includes;
finding a list of candidate cycles by finding a minimal length cycle for each unordered pair of locations;
selecting one or more of the candidate cycles from the list and, after routing the traffic demand over the one or more cycles, adding additional traffic carrying capacity for each of the network traffic carrying connections where the routed traffic demand exceeds the available capacity.
3 Assignments
0 Petitions
Accused Products
Abstract
A method and system for designing a bi-connected ring-based network is provided, which designs from scratch or converts an existing network to a dual-homed ring-based network. The network covers the locations capable of being bi-connected with one or more cycles/rings. The traffic demand is then routed via the cycles, in such a way so as to minimize the amount of network traffic management equipment required.
45 Citations
29 Claims
-
1. A method for designing a bi-connected ring-based network comprising:
-
receiving a list of locations where network traffic is at least one of originated and delivered; receiving a list of pairs of directly connected locations, each defining a corresponding network traffic carrying connection including one or more signal carrying connections between each of the directly connected locations, and a capacity for each of the network traffic carrying connections; receiving a list of traffic demand between each of the listed pairs of locations; determining a dual homed cover including one or more dual homed cycles, each cycle comprising a closed loop sequence of directly connected locations and corresponding network traffic carrying connections, wherein each location, which is capable of being bi-connected, is included in at least one of the one or more dual homed cycles; routing the traffic demand over the one or more cycles via the one or more of the network traffic carrying connections; at least one of outputting a report and storing a representation containing the designed bi-connected ring-based network; where determining includes; finding a list of candidate cycles by finding a minimal length cycle for each unordered pair of locations; selecting one or more of the candidate cycles from the list and, after routing the traffic demand over the one or more cycles, adding additional traffic carrying capacity for each of the network traffic carrying connections where the routed traffic demand exceeds the available capacity. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A method of designing networks comprising:
-
defining and storing a plurality of network nodes; defining and storing a plurality of traffic limited links between the nodes; defining a plurality of dual-homed communications rings formed of nodes joined by links; specifying and storing system traffic; allocating traffic on the links in accordance with link capacity to support the specified traffic; and storing a representation of at least the rings in a writeable medium; and which includes representing the nodes and links as a graph having weighted edges wherein the weightings of the edges correspond to numbers of fibers in respective links, wherein a pre-stored minimal length criterion is applied to the rings and wherein a set of minimum length rings is selected and stored and which includes defining locations of traffic add/drop ports in accordance with a predetermined criterion. - View Dependent Claims (15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25)
-
-
26. Software pre-stored on a computer readable storage medium, for designing communications networks comprising:
-
a computer readable storage medium; a first plurality of stored executable instructions pre-stored on the medium, for receiving information defining a network including a plurality of nodes joined by connecting communications links including an indicium of the number of communications paths in each link and a multi-dimensional representation of a traffic pattern; a second plurality of stored, executable instructions pre-stored on the medium, for forming a biconnected representation of the network; a third plurality of stored, executable instructions pre-stored on the medium, for forming a file defining connecting links between nodes; and a fourth plurality of stored executable instructions pre-stored on the medium, for forming a traffic data file; and which includes a plurality of instructions pre-stored on the medium, for forming a minimal set of dual-homed rings covering the network in accordance with a predetermined criterion and which includes a plurality of instructions for evaluating intra-ring traffic and inter-ring traffic. - View Dependent Claims (27, 28)
-
-
29. A method comprising:
-
establishing a plurality of locations of traffic add/drop ports in accordance with a previously determined criterion; establishing a plurality of dual homed cycles which cover at least some of the locations; establishing a dual homed cover which includes at least some of the members of the plurality; selecting one or more cycles, wherein selecting one or more cycles comprises; rating each cycle; selecting the best rated cycle; determining if the selected cycles cover all the locations capable of being bi-connected; if the selected cycles do not cover all locations capable of being bi-connected, selecting an additional cycle, which is bi-connected with at least one of the previously selected cycles, and which in combination with the previously selected cycles has the best rating, and repeating the selection process for additional cycles until all locations capable of being bi-connected are covered.
-
Specification