DISTRIBUTING CUSTOMER LOCATION ACCESS LINKS ACROSS NETWORK PROVIDER NODES DURING NETWORK PLANNING
First Claim
1. A computer-readable medium containing instructions executable by at least one processor, the computer-readable medium comprising:
- one or more instructions for obtaining a list of customer locations proposed to be connected to a network;
one or more instructions for obtaining a list of locations of network nodes of a network that is capable of providing network service to the customer locations;
one or more instructions for identifying nearest network nodes to a first customer location of the customer locations;
one or more instructions for ranking the identified nearest network nodes in order from closest to farthest from the first customer location to produce a ranked list;
one or more instructions for stepping through each network node in the ranked list until a network node is identified which will not be placed in an overloaded state if the first customer location is connected to the network node; and
one or more instructions for selecting the identified network node as the access node for the first customer location.
2 Assignments
0 Petitions
Accused Products
Abstract
A computing-device implemented network planning process distributes access links associated with customer locations to selected nodes of a provider network. The network planning process distributes the access links associated with the customer locations to the selected nodes of provider network such that overall latency goals for the network are met and such that the density of the connected customer locations to the network nodes in the network satisfy density requirements. The network planning process seeks diversity in customer location assignments by creating additional capacity through the re-assignment of customer locations to alternate network nodes in order to free up space on network nodes needed to off-load customer locations from other over-loaded network nodes. The network planning process permits an expanded ring of network nodes to accommodate dense customer traffic load across a wide area while meeting both individual connection and overall system requirements.
-
Citations
17 Claims
-
1. A computer-readable medium containing instructions executable by at least one processor, the computer-readable medium comprising:
-
one or more instructions for obtaining a list of customer locations proposed to be connected to a network; one or more instructions for obtaining a list of locations of network nodes of a network that is capable of providing network service to the customer locations; one or more instructions for identifying nearest network nodes to a first customer location of the customer locations; one or more instructions for ranking the identified nearest network nodes in order from closest to farthest from the first customer location to produce a ranked list; one or more instructions for stepping through each network node in the ranked list until a network node is identified which will not be placed in an overloaded state if the first customer location is connected to the network node; and one or more instructions for selecting the identified network node as the access node for the first customer location. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computing-device implemented method, comprising:
-
obtaining a list of customer locations proposed to be connected to a network; obtaining a list of locations of network nodes of the network that is capable of providing network service to the customer locations; identifying nearest network nodes to a first customer location of the customer locations; ranking the identified nearest network nodes in order from closest to farthest from the first customer location to produce a ranked list; stepping through each network node in the ranked list until a network node is identified which will not be placed in an overloaded state if the first customer location is connected to the network node; determining if a distance between the identified network node and the first customer location is less than a distance limit; and selecting the identified network node as the access node for the first customer location based on whether the distance is less than the distance limit. - View Dependent Claims (11, 12, 13, 14, 15, 16)
-
-
17. A computing-device, comprising:
-
means for obtaining a list of customer locations proposed to be connected to a network; means for obtaining a list of locations of network nodes of the network that is capable of providing network service to the customer locations; means for selecting a first customer location from the list of customer locations; means for identifying nearest network nodes to the first customer location; means for ranking the identified nearest network nodes to the first customer location in order from closest to farthest from the first customer location to produce a first ranked list; means for selecting a second customer location from the list of customer locations; means for identifying nearest network nodes to the second customer location; means for ranking the identified nearest network nodes to the second customer location in order from closest to farthest from the second customer location to produce a second ranked list; means for selectively stepping through each network node in the first ranked list and the second ranked list and comparing the respective network nodes in the first and second ranked lists to determine if the respective nodes are the same network node; and means for swapping the same network node with a network node at a top of the first ranked list and for swapping the same network node with a network node at a top of the second ranked list.
-
Specification