The present system relates to the field of network troubleshooting and analysis and particularly to a system and method of identifying tiers present in an activity data file.
In the field of network application performance prediction and analysis, it is not uncommon to capture network activity, such as packets transferring between points in a network, using packet sniffers, protocol analyzers, etc. In operation, data related to network activity, such as packet transfers, may be recorded to one or more activity data files, such as trace files. The activity data files may be later analyzed using one or more analysis tools.
Typically, one part of the analysis process is to determine the network devices, termed tiers or nodes, which are responsible for activity that is recorded in the activity data file. It is also desirable to determine the number of network devices responsible for activity. This is typically accomplished by assigning one tier to each unique IP address. However, in many cases this approach is insufficient. For example, in a case wherein some of the network activity is attributed to a router (tier) that utilizes network address translation (NAT) to route data from an internal network to an external network, such as the Internet, activity that actually is attributed to multiple objects (e.g., devices or portions thereof, such as a network interface card (NIC)) within the private network may all appear within the activity data file as attributed to the router. This problem occurs because in the use of NAT, separate (private) addresses of the multiple network objects may be mapped to a single public Internet Protocol (IP) address. Due to the NAT, the public IP address is actually a virtual IP address that is resolved to the private IP address of a given object by the router when data is received from the public network. Similarly, when data is received by the router from a device within the internal network (e.g., private network), the source of the data is altered by the router to reflect the virtual IP address of the router before being sent to a destination device accessible on the public network. It is desirable to be able to separate out the network activity (e.g., traffic) sent from/to a given host to/from the virtual address.
This problem may be ameliorated by locating a packet sniffer within the private network so that the tiers responsible for activity may be captured by the sniffer, however, this approach is not practical for many applications. For example, it may not be practical to position a sniffer within each of potentially numerous private networks that may exist in a network configuration and/or one or more of the private networks may not be under the direct control of the party operating the activity capture. In addition, different private networks may internally utilize a same addressing scheme (e.g., 192.168.0.1's). So even in a case wherein a sniffer is placed within the private network, if you simply combine the trace files, you might end up seeing several (different) tiers having a same address. Further, it is oftentimes more convenient to capture network activity from some point outside of the network portion wherein NAT occurs. In these and other instances where more than one machine appears to have the same IP address (e.g., load balancing, failover, transparent proxying, overlapping networks, etc.), the analysis tools may determine that there are fewer tiers than there really are, and thereby, present the user with inaccurate or incomplete data.
It is an object of the present system to overcome disadvantages and/or make improvements in the prior art.
The present system includes a system, method and device for remapping a Media Access Control (MAC) address mapped to a virtual IP addresses. The method includes examining an activity data file to identify the virtual IP address mapped to the MAC address and remapping the identified MAC address to an IP address. The MAC address may be one of two or more MAC addresses mapped to the virtual IP address. The virtual IP address may be identified by determining that the virtual IP address has at least two mapped MAC addresses. Other criteria may also (or in place of) be utilized for identifying virtual IP addresses. A portion of the IP address may be automatically generated. A user may be queried to confirm the generated portion of the IP address. The portion of the IP address may be determined based on prior user entrance of an IP address that includes the portion of the IP address. The portion of the IP address may be predetermined by a user assigning a naming convention.
The remapping may include querying a user to enter a portion of the IP address. Tiers may be assigned to each MAC address recorded in the activity data file. A user may be provided with a interface (UI) depicting the virtual IP address and the MAC address(es) including an identification whether the virtual IP address and the corresponding MAC address(es) are sources or destinations for given activity. The UI may include a tree-view depicting the virtual IP address and the MAC address(es). The UI may include a table view depicting the MAC address(es). The table view may include an indication of the virtual IP address and a field for the IP address. The table view may list a remapped MAC address. The remapping may be saved in the activity data file or in another activity data file. A number of tiers corresponding to activity recorded in the activity data file may be determined after the MAC address is remapped. Through operation of the present system, a source and destination endpoint (e.g., true endpoints) may be readily determined.
The invention is explained in further detail, and by way of example, with reference to the accompanying drawings wherein:
The following are descriptions of illustrative embodiments that when taken in conjunction with the following drawings will demonstrate the above noted features and advantages, as well as further ones. In the following description, for purposes of explanation rather than limitation, specific details are set forth such as architecture, interfaces, techniques, etc., for illustration. However, it will be apparent to those of ordinary skill in the art that other embodiments that depart from these details would still be understood to be within the scope of the appended claims. Moreover, for the purpose of clarity, detailed descriptions of well-known devices, circuits, and methods are omitted so as not to obscure the description of the present system.
It should be expressly understood that the drawings are included for illustrative purposes and do not represent the scope of the present system. In the drawings, a first part of an element's reference number typically corresponds to the drawing number in which the element appears.
The system and method described herein address problems in prior art systems. The present system is directed towards providing a new and intuitive system for determining a proper number of tiers responsible for activity within an activity data file. To facilitate the following discussion, for purposes of simplifying a description, the term “activity” as utilized herein is intended to include any activity related to a network object, including traffic, delays, collisions, housekeeping processes, and any other operations of a network object. The term “activity data file” is utilized herein to refer to a record of network activity, such as a trace file, although is intended to include any one or more files utilized to record network activity. Through use of the present system, an activity data file may be corrected to properly reflect a number of tiers responsible for network activity. The present system, including a graphical user interface for facilitating user interaction, offers a range of features and provides functionality for the user that is unavailable in prior systems. In accordance with the present system, an activity data file may be altered to reflect a proper number of tiers. The altered activity data file may then be saved as a separate file or in place of the original activity data file for use by an analysis tool. Further, a naming convention for added tiers may be selected by the user to facilitate an identification of the added tiers in subsequent analysis.
The present system will be further described referring to
In accordance with an embodiment, the GUI 200 includes a tree-view portion 210, such as a window pane, that lists virtual IP addresses that are associated with more than one MAC address. The tree-view 210 may be provided as a hierarchical view wherein objects, such as multiple MAC addresses associated with a virtual IP address are depicted as sub-objects of an object representing the virtual IP address. Further sub-objects of sub-objects, when present in the network, may be similarly represented. In accordance with an embodiment and to facilitate a review of virtual IP addresses, virtual IP addresses associated with (e.g., mapped to) only one (1) MAC address may not appear in the tree-view. For example, in one embodiment, if a single MAC address is associated with a virtual IP address, the present system may automatically remap the MAC address to a private network address, such as a one of designated private IP address subnets suggested as Best Current Practice in response to a Request for Comments (RFC) 1918 from the Network Working Group. RFC 1918 suggests Private Network Addresses may be designated as 192.168.x.x, 172.16.x.x through 172.31.x.x or 10.x.x.x, wherein the “x's” designate sub-addresses that may be automatically allocated by the present system. For example, the present system may allocate private network addresses in the 10.100.x.x range to facilitate an identification of automatically mapped MAC addresses by a user. As may be readily appreciated, other addresses and addressing schemes may be readily applied in accordance with the present system, such as sequential address allocation, allocation to represent network structure, network hierarchy, etc. In this way, a virtual IP address that only has one associated MAC address may be remapped to an IP address without requiring user intervention. In another embodiment of the present system, remapped IP addresses may be suggested to the user in accordance with a scheme as suggested above, so that the user may approve a suggested remapping. Naturally in another embodiment, a virtual IP address associated with a single MAC address may be depicted within the GUI 200 for remapping as described further herein.
The virtual IP address and underlying MAC address(es) may be provided in a hierarchical view wherein the virtual IP address is depicted as a root object with the underlying MAC address(es) provided as sub-objects. For example, in
Through operation of a user selection device, such as a computer mouse, a user may select a MAC address depicted in the tree-view 210 by manipulation of a mouse-cursor as may be readily appreciated. In accordance with an embodiment of the present system, the selected MAC address may be mapped to a new IP address. In accordance with one embodiment of the present system, when a MAC address is selected in the tree-view 210, the MAC address may also appear in a table-view 240 as described further herein to facilitate review and/or remapping. After the MAC address is assigned (remapped) to a new IP address, the MAC address may disappear from the tree-view 210. In a further embodiment, when all MAC addresses assigned to a virtual IP address have been remapped, the virtual IP address may disappear from the tree-view 210. In this way, only virtual IP addresses that have MAC addresses that have not been remapped will appear/remain in the tree-view 210. As may be readily appreciated, the present system facilitates review and/or remapping of virtual IP addresses that have two or more (underlying) associated MAC addresses and one associated MAC address (as described above).
The table-view 240 may list one or more selected MAC addresses in a MAC address field 242 and corresponding Old IP addresses in an Old IP address field 244. A New IP address field 246 may also be provided associated with the one or more selected MAC addresses to facilitate reassignment of a MAC address (assigned to a virtual IP address) to a new IP address. The table view 240 may also or in place of depict a virtual IP address that only has one associated MAC address. As may be readily appreciated, the following discussion regarding two or more selected MAC address applies equally wherein only one MAC address is associated with a virtual IP address. As such, the new IP address field 246 may be modifiable to enable a user to enter the new IP address.
In accordance with the present system, the New IP address field 246 may be partially filled in utilizing a predetermined or determinable system for selecting a portion of the New IP address. For example, in one embodiment, the portion of the New IP address may be filled in by the present system based on an identifier utilized to designate a sub-portion of a network from which the virtual IP address is physically and/or hierarchically (e.g., structurally) located. In one embodiment, the portion of the New IP address may be filled in with a designation of a network node for which the virtual IP address is structurally located as a sub-node. In another embodiment, the portion of the New IP address may be filled in based on past behavior by the user. For example, in one embodiment wherein a user repeated one or more particular portions of the New IP address two or more times, the present system may fill in the portion(s) of the New IP address that were previously repeated. In an alternate embodiment, the New IP address may start off blank enabling ready reassignment. The fields 242, 244, 246 may be visually organized to facilitate association between the MAC address, the Old IP address and the New IP address. For example, the fields may be organized in rows and columns to facilitate the association. In another embodiment, a further visual metaphor may be employed to facilitate the association.
The table-view 240 may list newly mapped (remapped) MAC addresses as well as, or in place of, the above described MAC address that has not been remapped. The newly mapped MAC addresses may include the old IP address (e.g., field 244) and the new IP address (e.g., field 246). In one embodiment, users may edit elements depicted in the new IP address column (e.g., New IP addresses), as well as “un-map” (e.g., de-assign) a MAC address. For example, a New IP address may be cleared in the field 246 by the user to un-map a virtual IP address. In accordance with an embodiment, a de-assigned MAC address may re-appear in the tree-view 210.
Load and/or Save Settings buttons 250, 254 may enable the user to load or save the current mappings. In one embodiment, the mappings may be saved to a text file. In a further embodiment, the text file may be manually edited by the user if desired to facilitate mapping/remapping/de-mapping without use of the GUI 200, prior to use of the GUI, and/or subsequent to use of the GUI 200. In response to actuation of the Load Settings button 250, an embodiment of the present system will load a file that includes a remapping of a MAC address. The remapping present in the loaded file will have an effect of remapping the MAC address for the activity data file currently being analyzed (e.g., see,
A Separate button 260 and/or a Separate All button 262 may be provided to automatically reassign one or more MAC addresses associated with a virtual address. For example, in one embodiment, an auto-split feature may be performed through selection of the Separate All button 262. The auto-split feature in operation may remap all MAC addresses into new IP addresses without a need to perform the remapping process manually. The separate button 260 may operate to remap a selected MAC address to a New IP address without requiring user selection of the New IP address.
In an alternate embodiment of the present system, MAC addresses may be automatically assigned New IP addresses without any user intervention or operation. In this embodiment, the GUI 200 may be utilized to confirm/edit automatically assigned IP addresses. The automatically assigned IP addresses may be assigned according to a predetermined convention such that the user may easily identify the affected tiers. In one embodiment, the predetermined convention may facilitate a ready identification of the mapping as being automatically generated. For example a given IP address or address portion may be utilized for all automatically remapped addresses. A template may be utilized to configure automatic mappings.
Returning to
The methods of the present system are particularly suited to be carried out by a computer software program, such program may contain modules corresponding to the individual steps or acts of the methods. Such program may of course be embodied in a computer-readable medium, such as an integrated chip, a peripheral device or memory, such as the memory 320 or other memory, such as a cache memory coupled to the processor 310.
The computer-readable medium and/or memory 320 may be any recordable medium (e.g., RAM, ROM, removable memory, CD-ROM, hard drives, DVD, floppy disks or memory cards) or may be a transmission medium (e.g., a network comprising fiber-optics, the world-wide web, cables, or a wireless channel using time-division multiple access, code-division multiple access, or other radio-frequency channel). Any medium known or developed that may store information suitable for use with a computer system may be used as the computer-readable medium and/or memory 320.
Additional memories may also be used. The computer-readable medium (e.g., the memory 320) and/or any other memories may be long-term, short-term, or a combination of long-term and short-term memories. These memories configure processor 310 to implement the methods, operational acts, and functions disclosed herein. The memories may be distributed such as residing on one or more servers connected within a network or may reside local to the device 300 and the processor 310, where additional processors may be provided that may also be distributed or may be singular. The memories may be implemented as electrical, magnetic or optical memory, or any combination of these or other types of storage devices. Moreover, the term “memory” should be construed broadly enough to encompass any information able to be read from or written to an address in an addressable space accessible by the processor 310. With this definition, information on a network is still within memory 320, for instance, because the processor 310 may retrieve the information from the network for operation in accordance with the present system.
The processor 310 is capable of providing control signals and/or performing operations in response to input signals from the user input device 370 and executing instructions stored in the memory 320. The processor 310 may be an application-specific or general-use integrated circuit(s). Further, the processor 310 may be a dedicated processor for performing in accordance with the present system or may be a general-purpose processor wherein only one of many functions operates for performing in accordance with the present system. The processor 310 may operate utilizing a program portion, multiple program segments, or may be a hardware device utilizing a dedicated or multi-purpose integrated circuit.
As should now be apparent, the present system aids a user in remapping virtual IP addresses to facilitate a proper identification of tiers responsible for network activity including an identification of the true source and destination endpoints and/or tier count in an activity data file. Of course, it is to be appreciated that any one of the above embodiments or processes may be combined with one or more other embodiments or processes or be separated into additional parts in accordance with the present system.
Finally, the above-discussion is intended to be merely illustrative of the present system and should not be construed as limiting the appended claims to any particular embodiment or group of embodiments. For example, while much of the illustrative discussion presented focuses on assisting in manual selection and remapping, the remapping process may be fully automatic in accordance with the present system, wherein the GUI 200 is provided for reviewing the remapping. In addition, while virtual IP addresses are illustratively identified and split in the above illustrative discussion by determining that the virtual IP address has at least two mapped MAC addresses, as would readily occur to a person skilled in the art, other criteria may also be suitably employed or combined with the illustrative system. For example, the virtual IP addresses may be identified and split based on an examination of an X-Forwarded-For (XFF) HTTP header to identify an originating IP address of a client that is different than a reported IP address of the client connecting to a web server through an HTTP proxy. In these cases, without the use of XFF or other criteria, any connection through a proxy server may reveal only an originating IP address of the proxy server, effectively turning the proxy server into a virtual IP address rendering the true originating IP address unavailable. However, in accordance with the present system, through an examination of criteria, such as examination of the XFF HTTP header, the true originating IP address may be discerned. Clearly other criteria for identifying virtual IP address would readily occur to a person of ordinary skill in the art and are intended to be within the scope of the present system.
Thus, while the present system has been described with reference to exemplary embodiments, it should also be appreciated that numerous modifications and alternative embodiments may be devised by those having ordinary skill in the art without departing from the broader and intended spirit and scope of the present system as set forth in the claims that follow. In addition, the section headings included herein are intended to facilitate a review but are not intended to limit the scope of the present system. Accordingly, the specification and drawings are to be regarded in an illustrative manner and are not intended to limit the scope of the appended claims.
In interpreting the appended claims, it should be understood that:
a) the word “comprising” does not exclude the presence of other elements or acts than those listed in a given claim;
b) the word “a” or “an” preceding an element does not exclude the presence of a plurality of such elements;
c) any reference signs in the claims do not limit their scope;
d) several “means” may be represented by the same item or hardware or software implemented structure or function;
e) any of the disclosed elements may be comprised of hardware portions (e.g., including discrete and integrated electronic circuitry), software portions (e.g., computer programming), and any combination thereof,
f) hardware portions may be comprised of one or both of analog and digital portions;
g) any of the disclosed devices or portions thereof may be combined together or separated into further portions unless specifically stated otherwise;
h) no specific sequence of acts or steps is intended to be required unless specifically indicated; and
i) the term “plurality of” an element includes two or more of the claimed element, and does not imply any particular range of number of elements; that is, a plurality of elements may be as few as two elements, and may include an immeasurable number of elements.
This application claims the benefit of U.S. Provisional Patent Application No. 60/821,822, filed Aug. 8, 2006.
Number | Name | Date | Kind |
---|---|---|---|
5821937 | Tonelli et al. | Oct 1998 | A |
6229540 | Tonelli et al. | May 2001 | B1 |
6691165 | Bruck et al. | Feb 2004 | B1 |
6775278 | Britton et al. | Aug 2004 | B1 |
6801949 | Bruck et al. | Oct 2004 | B1 |
6856591 | Ma et al. | Feb 2005 | B1 |
7020796 | Ennis et al. | Mar 2006 | B1 |
7134012 | Doyle et al. | Nov 2006 | B2 |
7152119 | Na et al. | Dec 2006 | B2 |
7260648 | Tingley et al. | Aug 2007 | B2 |
7290048 | Barnett et al. | Oct 2007 | B1 |
7299294 | Bruck et al. | Nov 2007 | B1 |
7480710 | Olson et al. | Jan 2009 | B1 |
7505399 | McGee et al. | Mar 2009 | B2 |
7506360 | Wilkinson et al. | Mar 2009 | B1 |
7561587 | Douglass et al. | Jul 2009 | B2 |
20020099937 | Tuomenoksa | Jul 2002 | A1 |
20020138628 | Tingley et al. | Sep 2002 | A1 |
20030043853 | Doyle et al. | Mar 2003 | A1 |
20030069993 | Na et al. | Apr 2003 | A1 |
20030145075 | Weaver et al. | Jul 2003 | A1 |
20030153328 | Booth et al. | Aug 2003 | A1 |
20030159071 | Martinez et al. | Aug 2003 | A1 |
20030179761 | Dobbins et al. | Sep 2003 | A1 |
20030191590 | Narayan et al. | Oct 2003 | A1 |
20040093419 | Weihl et al. | May 2004 | A1 |
20040095932 | Astarabadi et al. | May 2004 | A1 |
20040109447 | Douglass et al. | Jun 2004 | A1 |
20040162914 | St. Pierre et al. | Aug 2004 | A1 |
20040162915 | Caronni et al. | Aug 2004 | A1 |
20040249906 | Olbricht et al. | Dec 2004 | A1 |
20040249975 | Tuck et al. | Dec 2004 | A1 |
20050005006 | Chauffour et al. | Jan 2005 | A1 |
20050010819 | Williams et al. | Jan 2005 | A1 |
20050044199 | Shiga et al. | Feb 2005 | A1 |
20050111352 | Ho et al. | May 2005 | A1 |
20050111455 | Nozue et al. | May 2005 | A1 |
20050165961 | Unbehagen et al. | Jul 2005 | A1 |
20050198295 | Turkoglu | Sep 2005 | A1 |
20050198401 | Chron et al. | Sep 2005 | A1 |
20060031488 | Swales | Feb 2006 | A1 |
20060034190 | McGee et al. | Feb 2006 | A1 |
20060039386 | Park | Feb 2006 | A1 |
20060062141 | Oran | Mar 2006 | A1 |
20060088037 | Finley et al. | Apr 2006 | A1 |
20060129669 | Kojima | Jun 2006 | A1 |
20060161770 | Goto et al. | Jul 2006 | A1 |
20060253564 | Shiga et al. | Nov 2006 | A1 |
20060265515 | Shiga et al. | Nov 2006 | A1 |
20060274745 | Wang et al. | Dec 2006 | A1 |
20060279775 | Matsumoto et al. | Dec 2006 | A1 |
20060282527 | Chiou et al. | Dec 2006 | A1 |
20070011450 | McCreight et al. | Jan 2007 | A1 |
20070025253 | Enstone et al. | Feb 2007 | A1 |
20070124468 | Kovacsiss, III | May 2007 | A1 |
20070214282 | Sen | Sep 2007 | A1 |
20070237141 | Marchese | Oct 2007 | A1 |
20070239854 | Janakiraman et al. | Oct 2007 | A1 |
20070250845 | Walter et al. | Oct 2007 | A1 |
Number | Date | Country | |
---|---|---|---|
20080040573 A1 | Feb 2008 | US |
Number | Date | Country | |
---|---|---|---|
60821822 | Aug 2006 | US |