Methods, systems and computer program products for facilitating the design and analysis of virtual networks based on total hub value

• US 20050066036A1
• Filed: 06/11/2004
• Published: 03/24/2005
• Est. Priority Date: 09/19/2003
• Status: Abandoned Application

• Current Assignee: Bellsouth Intellectual Property Corporation (AT&T, Inc.)
• Original Assignee: Bellsouth Intellectual Property Corporation (AT&T, Inc.)
• Inventors: Gilmartin, Neil
• Application Number:
  US10/866,011
• Publication Number:
  US 20050066036A1
• Time in Patent Office: Days
• US Class Current: 709/226
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network

Abstract

A method for facilitating the design and assignment of virtual networks, such as virtual local area networks (VLANs). The method includes receiving a request to add a new node to a base virtual network including a number of base nodes. A plurality of potential routes are determined between the new access node and the base nodes. For each potential route, a virtual network total hub value is determined. The virtual network total hub value is the sum of a hub value for each base node and a hub value for the new node. The hub value is determined for a node in response to bandwidth received at the node multiplied by a number of trunks traversed in reaching the node. One of the potential routes yielding the minimum virtual network total hub value is selected.

Claims

1. A method for facilitating the design and assignment of at least one virtual network, said method comprising:

receiving a request to add a new node to a base virtual network including a number of base nodes;

determining a plurality of potential routes between said new node and said base nodes;

for each potential route determining a virtual network total hub value, said virtual network total hub value being the sum of a hub value for each base node and a hub value for said new node, said hub value being determined for a node in response to bandwidth received at said node multiplied by a number of trunks traversed in reaching said node,

selecting one of said potential routes yielding the minimum virtual network total hub value.

2. The method of claim 1 further comprising:

designing said base virtual network based on a list of routes between pairs of available nodes.

3. The method of claim 2 further comprising:

eliminating routes from consideration in said base virtual network if said route does not include a mandatory hub.

4. The method of claim 2 further comprising:

determining an approximate hub value for said routes in response to route length and route bandwidth;

retrieving a route from said list of routes having a lowest approximate hub value.

5. The method of claim 4 further comprising:

determining if said retrieved route has more than two nodes;

setting said retrieved route as said base virtual network if said retrieved route has only two nodes;

confirming capacity of said retrieved route if said route has more than two nodes.

6. The method of claim 1 wherein:

if multiple potential routes yield the same minimum total hub value, selecting one of said potential routes randomly.

7. The method of claim 1 further comprising:

obtaining a validity factor defining a characteristic of a route; and

eliminating a potential route from consideration if said potential route does not meet said validity factor.

8. A system for facilitating the design and assignment of virtual networks, the system comprising:

an input for receiving a request to add a new node to a base virtual network including a number of base nodes; and

a processor for determining a plurality of potential routes between said new node and said base nodes, wherein for each potential route, the processor determines a virtual network total hub value, said virtual network total hub value being the sum of a hub value for each base node and a hub value for said new node, said hub value being determined for a node in response to bandwidth received at said node multiplied by a number of trunks traversed in reaching said node, and wherein said processor selects one of said potential routes yielding the minimum virtual network total hub value.

9. The system of claim 8 wherein said processor designs said base virtual network based on a list of routes between pairs of available nodes.

10. The system of claim 9 wherein said processor eliminates routes from consideration in said base virtual network if said route does not include a mandatory hub.

11. The system of claim 9 wherein said processor determines an approximate hub value for said routes in response to route length and route bandwidth and retrieves a route from said list of routes having a lowest approximate hub value.

12. The system of claim 11 wherein said processor determines if said retrieved route has more than two nodes, sets said retrieved route as said base virtual network if said retrieved route has only two nodes and confirms capacity of said retrieved route if said route has more than two nodes.

13. The system of claim 8 wherein if multiple potential routes yield the same minimum total hub value, the processor selects one of said potential routes randomly.

14. The system of claim 8 wherein the processor obtains a validity factor defining a characteristic of a route and eliminates a potential route from consideration if said potential route does not meet said validity factor.

15. A computer program product for facilitating the design and assignment of virtual networks, the computer program product comprising:

a storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for implementing a method comprising;

receiving a request to add a new node to a base virtual network including a number of base nodes;

determining a plurality of potential routes between said new node and said base nodes;

for each potential route determining a virtual network total hub value, said virtual network total hub value being the sum of a hub value for each base node and a hub value for said new node, said hub value being determined for a node in response to bandwidth received at said node multiplied by a number of trunks traversed in reaching said node,

selecting one of said potential routes yielding the minimum virtual total hub value.

16. The computer program product of claim 15 further comprising:

instructions for execution by the processing circuit for implementing;

designing said base virtual network based on a list of routes between pairs of available nodes.

17. The computer program product of claim 16 further comprising:

instructions for execution by the processing circuit for implementing;

eliminating routes from consideration in said base VLAN if said route does not include a mandatory hub.

18. The computer program product of claim 16 further comprising:

instructions for execution by the processing circuit for implementing;

determining an approximate hub value for said routes in response to route length and route bandwidth;

retrieving a route from said list of routes having a lowest approximate hub value.

19. The computer program product of claim 18 further comprising:

instructions for execution by the processing circuit for implementing;

determining if said retrieved route has more than two nodes;

setting said retrieved route as said base virtual network if said retrieved route has only two nodes;

confirming capacity of said retrieved route if said route has more than two nodes.

20. The computer program product of claim 19 further comprising:

instructions for execution by the processing circuit for implementing;

if multiple potential routes yield the same minimum total hub value, selecting one of said potential routes randomly.

21. The computer program product of claim 15 further comprising:

instructions for execution by the processing circuit for implementing;

obtaining a validity factor defining a characteristic of a route; and

eliminating a potential route from consideration if said potential route does not meet said validity factor.