1. A method of transmitting and receiving data, the method comprising:
operating a first antenna proximate to a first vertex of an information handling system chassis, wherein:
the chassis has a generally triangular profile; and
the information handling system comprises a CPU;
operating a second antenna proximate to a second vertex of the chassis.
2. The method of claim 1, wherein the first antenna and second antenna each comprise multiple antenna elements.
3. The method of claim 1, wherein the first antenna and second antenna are omnidirectional.
4. The method of claim 1, further comprising:
operating a third antenna proximate to a third vertex of the chassis; and
operating a radio within the chassis to send information to and receive information from the first antenna, second antenna, and third antenna.
5. The method of claim 1, further comprising:
monitoring the operational effectiveness of the first antenna and second antenna.
6. The method of claim 5, further comprising:
determining which of the first antenna and second antenna should be used for sending or receiving information; and
selecting one of the first antenna or second antenna based on the determining step.
7. An information handling system comprising:
a chassis comprising a triangular profile;
a set of antennas comprising:
a first antenna proximate to a first vertex of the triangular profile; and
a second antenna proximate to a second vertex of the triangular profile;
a CPU within the chassis; and
a radio communicatively coupled to the first antenna and the second antenna.
8. The information handling system of claim 7, wherein the first antenna and second antenna are omnidirectional.
9. The information handling system of claim 7, wherein each of the first antenna and second antenna includes multiple antenna elements.
10. The information handling system of claim 7, wherein the first antenna is mounted under a plastic chassis assembly.
11. The information handling system of claim 10, wherein:
the radio comprises a transceiver enabled for sending and receiving information through each of the first antenna and second antenna.
12. The information handling system of claim 7, wherein at least one of the first vertex, second vertex, and third vertex is chamfered.
13. The information handling system of claim 7, further comprising:
a third antenna proximate to a third vertex of the triangular profile, wherein,
the triangular profile forms a front of the chassis;
a further triangular profile forms a back of the chassis; and
each of the first antenna, second antenna, and third antenna runs in a direction from the front of the chassis to the back of the chassis.
14. An information handling system comprising:
a triangular chassis comprising:
a first vertex;
second vertex, and
third vertex;
one or more antennas proximate to one or more of the first vertex, second vertex, or third vertex; and
a CPU located within the triangular chassis.
15. The information handling system of claim 14, wherein:
a first antenna of the one or more antennas is located proximate to the first vertex;
a second antenna of the one or more antennas is located proximate to the second vertex; and
a third antenna of the one or more antennas is located on the triangular chassis opposite to the first or second vertex.
16. The information handling system of claim 15, wherein one or more of the first vertex, second vertex, and third vertex is chamfered.
17. The information handling system of claim 15, wherein the one or more antennas are omnidirectional.
18. The information handling system of claim 15, wherein each of the one or more antennas include multiple antenna elements.
19. The information handling system of claim 14, wherein the triangular chassis further comprises:
a front triangular profile and a rear triangular profile that is generally parallel to the front triangular profile;
wherein the one or more antennas include a first antenna, a second antenna, and a third antenna; and
wherein each of the first antenna, second antenna and third antenna is located between the front triangular profile and the rear triangular profile.
20. The information handling system of claim 15, further comprising:
a radio;
a first transmission line communicatively coupled to the radio and a first antenna of the one or more antennas;
a second transmission line communicatively coupled to the radio and a second antenna of the one or more antennas; and
a third transmission line communicatively coupled to the radio and a third antenna of the one or more antennas.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of identifying virtual private networks (VPNs) in a network of a service provider, comprising:
generating a VPN routing forwarding\u2014route target (VRF-RT) table for said network;
generating at least one of a VRF-VRF table and a VRF connectivity graph from said VRF-RT table;
determining, from said VRF-RT table, a set of atomic full-mesh components; and
determining, from said at least one of a VRF-VRF table and a VRF connectivity graph, at least one set of other types of VPN components.
2. The method of claim 1, wherein said other types of VPN components comprise at least one of atomic single hub-and-spoke components, molecular multi-hub-and-spoke components, composite full-mesh components, composite single hub-and-spoke components, and composite multi hub-and-spoke components.
3. The method of claim 2, wherein an atomic full-mesh component is a full-mesh topology having one route target (RT), an atomic single hub-and-spoke component is a largest single hub-and-spoke topology having two RTs, and a molecular multi-hub-and-spoke component is a largest multi-hub-and-spoke topology having two RTs without restriction of overlapping links and nodes with atomic components.
4. The method of claim 1, wherein said generating said VRF-RT table comprises:
identifying n-VRF tables associated wit a plurality of nodes in the network;
identifying m-RTs in said network, where m and n are integers greater tan 1; and
determining unidirectional and bi-directional communications between said nodes based on said VRF tables and RTs.
5. The method of claim 1, wherein said generating at least one of a VRF-VRF table and a VRF connectivity graph comprises:
identifying export and import RT values associated with each of said nodes in said network; and
identifying in-degree and out-degree links therebetween said nodes.
6. The method of claim 5, further comprising removing unidirectional links from said graph.
7. The method of claim 5, further comprising reducing redundant RTs from said VRF-VRF table.
8. The method of claim 2, wherein determining each atomic full-mesh component of a set of atomic full-mesh components comprises:
identifying at least two nodes associated with a selected RT of said VRF-RT table that both export and import said selected RT.
9. The method of claim 8, further comprising:
removing at least one of table entries and links associated with said set of atomic full-mesh components respectively from said at least one of a VRF-VRF table and a VRF connectivity graph.
10. The method of claim 2, wherein determining each atomic single hub-and spoke component of a set of atomic singic hub-and-spoke components comprises:
determining a set of candidate hubs from said graph;
determining all distinct RTs used to export from each candidate hub;
identifying a set of spokes for each distinct RT;
determining, for each set of spokes, a largest subset of nodes that use a common RT to export to the hub;
determining a hub from the set of candidate hubs having a largest in-degree value; and
selecting one of said hubs from said set of candidate hubs.
11. The method of claim 10, wherein said selecting one of said hubs from said set of candidate hubs comprises selecting a candidate hub from a set of preferred hubs in an instance where multiple hubs in the set of candidate hubs qualify.
12. The method of claim 11, further comprising:
generating said set of preferred hubs from said set of candidate hubs, where an RT used for determining an atomic full-mesh component is also associated with at least one node that imports that RT.
13. The method of claim 11, wherein said selecting a candidate hub from a set of preferred hubs comprises randomly selecting one of said preferred hubs in an instance where there are multiple preferred hubs.
14. The method of claim 11, wherein said selecting one of said hubs from said set of candidate hubs comprises randomly selecting one of said hubs in an instance where said set of preferred hubs is empty.
15. The method of claim 10, further comprising:
removing at least one of table entries and links associated with the set of single hub-and-spoke components respectively from said at least one of a VRF-VRF table and a VRF connectivity graph, and
removing singleton nodes from said set of candidate hubs.
16. The method of claim 2, wherein determining a molecular multi hub-and-spoke component from a set of molecular multi hub-and-spoke components comprises;
identifying a new full-mesh component from said set of atomic full-mesh components, wherein node members of said new full-mesh component are associated with a preferred hub of said set of preferred hubs;
selecting a full-mesh component;
determining if each of said nodes in the full-mesh component is a hub in the single hub-and-spoke set; and
determining, for each atomic single hub-and spoke, whether an RT exported by a hub to its spokes is identical, the RT exported is used for creating said full-mesh component, and an RT imported by the hub from all its spokes is identical.
17. The method of claim 16, further comprising:
assigning identified full-mesh and associated single hub-and-spoke components to a set of multi hub-and spoke components; and
removing said identified full-mesh and associated single hub-and-spoke components respectively from a set full-mesh components and a set of single hub-and spoke components.
18. The method of claim 2, further comprising:
determining whether a complex VPN is a composite full-mesh component.
19. The method of claim 18, wherein said determining whether a complex VPN is a composite full-mesh component comprises:
determining, from said VRF-VRF table, whether each entry in an upper triangular matrix formed above a diagonal of said VRF-VRF table has a corresponding RT entry in a lower triangular matrix formed below said diagonal of said VRF-VRF table.
20. The method of claim 2, further comprising:
determining whether a complex VPN is a composite single hub-and-spoke component.
21. The method of claim 20, wherein said determining whether a complex VPN is a composite single hub-and-spoke component comprises:
determining that a set of all atomic full-mesh components is empty; and
defining said VPN network as a composite single hub-and-spoke topology in an instance where all single hub-and-spoke components in the set of atomic single hub-and-spoke spoke components have a common hub.
22. The method of claim 2, further comprising:
determining whether a complex VPN is a composite multi hub-and-spoke component.
23. The method of claim 22, wherein said determining whether a complex VPN is a composite multi hub-and-spoke component comprises:
identifying, from the VRF-VRF table, a composite full mesh component being largest in size;
identifying, from a set of all atomic hub and spokes, all the composite single hub-and-spoke components;
identifying, from all the composite hub-and-spoke components, that all the hubs belong to the composite full mesh component, and a spoke set of each composite single hub-and-spoke set are identical.
24. Apparatus for identifying virtual private networks (VPNs) in a network of a service provider, comprising:
means for generating a VPN routing forwarding\u2014route target (VRF-RT) table for said network;
means far generating at least one of a VRF-VRF table and a VRF connectivity graph from said VRF-RT table;
means for determining, from said VRF-RT table, a set of atomic full-mesh components; and
means for determining, from said at least one of a VRF-VRF table and a VRF connectivity graph, at least one set of other types of VPN components.
25. The apparatus of claim 24, wherein said other types of VPN components comprise at least one of atomic single hub-and-spoke components, molecular multi-hub-and-spoke components, composite full-mesh components, composite single hub-and-spoke components, and composite multi hub-and-spoke components.
26. The apparatus of claim 25, wherein an atomic full-mesh component is a full-mesh topology having one route target (RT), an atomic single hub-and-spoke component is a largest single hub-and-spoke topology having two RTs, and a molecular multi-hub-and-spoke component is a largest multi-hub-and-spoke topology having two RTs without restriction of overlapping links and nodes with atomic components.
27. The apparatus of claim 25, wherein determining each atomic full-mesh component of a set of atomic full-mesh components comprises:
means for identifying at least two nodes associated with a selected RT of said VRF-RT table that both export and import said selected RT.
28. The apparatus of claim 25, wherein determining each atomic single hub-and spoke component of said set of atomic single hub-and-spoke components comprises:
means for determining a set of candidate hubs from said graph;
means for determining all distinct RTs used to export from each candidate hub;
means for identifying a set of spokes for each distinct RT;
means for determining, for each set of spokes, a largest subset of nodes that use a common RT to export to the hub;
means for determining a hub from the set of candidate hubs having a largest in-degree value; and
means for selecting one of said hubs from said set of candidate hubs.
29. The apparatus of claim 25, wherein determining a molecular multi hub-and-spoke component from a set of molecular multi hub-and-spoke components comprises:
means for identifying a new full-mesh component from said set of atomic full-mesh components, wherein node members of said new full-mesh component are associated with a preferred hub of said set of preferred hubs;
means for selecting a full-mesh component;
means for determining if each of said nodes in the full-mesh component is a hub in the single hub-and-spoke set; and
means for determining, for each atomic single hub-and spoke, whether an RT exported by a hub to its spokes is identical, the RT exported is used for creating said full-mesh component, and an RT imported by the hub from all its spokes is identical.
30. The apparatus of claim 25, further comprising:
means for determining whether a complex VPN is one of a composite full-mesh component, a composite single hub-and-spoke component, and a composite multi hub-and-spoke component.