|Numéro de publication||US7423979 B2|
|Type de publication||Octroi|
|Numéro de demande||US 10/672,303|
|Date de publication||9 sept. 2008|
|Date de dépôt||26 sept. 2003|
|Date de priorité||18 mai 2001|
|État de paiement des frais||Caduc|
|Autre référence de publication||EP1393503A1, EP1393503A4, EP1393503B1, US6744739, US20030026212, US20040233859, WO2002096033A1|
|Numéro de publication||10672303, 672303, US 7423979 B2, US 7423979B2, US-B2-7423979, US7423979 B2, US7423979B2|
|Inventeurs||Daniel J. Martin|
|Cessionnaire d'origine||International Business Machines Corporation|
|Exporter la citation||BiBTeX, EndNote, RefMan|
|Citations de brevets (106), Citations hors brevets (20), Référencé par (19), Classifications (12), Événements juridiques (8)|
|Liens externes: USPTO, Cession USPTO, Espacenet|
This application is a Continuation of U.S. application Ser. No. 09/861,167, filed May 18, 2001, now U.S. Pat. No. 6,744,739.
A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
This invention relates to computer networks: More particularly, the invention relates to methods and systems for determining a routing topology of a computer network by obtaining and utilizing Interior Gateway Protocol (IGP) routing information or Exterior Gateway Protocol (EGP) routing information.
Computer networks are growing in complexity and criticality. For example, a large corporation may support a computer network with tens of thousands of individual computers and thousands of network routers, hubs, repeaters or other network connectivity hardware. These networks are in many cases vital to an organization's functioning, and in some cases are mission- or life-critical.
Because of increasing network size and complexity, service provider networks (such as Internet service providers or application service providers) in particular are quickly growing beyond the ability of current methods to manage them. For example, the typical level of modification and reconfiguration in a complex service provider network is at best difficult and time-consuming to understand or document.
Although several commercially and freely available software packages attempt to address network complexity problems, and some theoretical work has been done in this field, effective solutions to comprehensive network management problems in complex networks remain elusive or non-existent.
Increasingly, the problem in a large, complex network is not a change in the actual physical topology. There are known methods for solving the problem of single points of failure and link layer failures. For example, protection switching on the SONET layer of a network, as known to one skilled in the art, can address physical topology management issues such as single-points of failure or link layer failures among other things. The automatic protection switching (APS) feature is supported, for example, on Cisco 7500 series routers and Cisco 12000 series routers, which allow switchover of packet-over-SONET (POS) circuits in the event of circuit failure, and is often required when connecting SONET equipment to Telco equipment. Here, APS refers to the mechanism of using a “protect” POS interface in the SONET network as the backup for a “working” POS interface. When the working interface fails, the protect interface quickly assumes its traffic load.
The problem in many service provider networks is the topology change produced by the routing protocols. Routing protocols and routing policies are how service providers control traffic and manage traffic across their network and with other service provider networks. For example, a large service provider network may have a relatively stable configuration of computing nodes and interconnection hardware, which can dynamically load balance a variety of incoming network traffic primarily through packet traffic rerouting. Thus, when one node on the service provider network is overwhelmed by traffic, software methods can be used to reconfigure routers and compute nodes so that incoming traffic is redistributed and congestion is decreased or eliminated.
The existing efforts in this area are concerned with discovering physical networks and physical topologies, not routing topologies. However, physical topologies alone do not necessarily provide a complete and accurate representation of the topology of information flow in a network or networks, which is affected not only by the topology but also by routing considerations. For example, even though a router may be directly connected to a particular network or networks, traffic bound for that network or those networks may never cross that router. The actual flow of packets through the network or networks is controlled by the routing protocols via techniques known to those skilled in the art of network management, such as, for example, route summarization (where an internetwork is divided into logical areas, with each area's border router advertising only a single summary route to other areas in order to reduce routing table size), route filters (where an additional metric rates relative reliability of individual networks as a source from which to determine optimal routes), and related routing polices.
As a further example, physical topology alone does not take into account information flow within a network as affected by multiple routers being directly connected to a particular network. How the traffic bound for that network is distributed, if at all, across those routers is a result of specific settings in the routing protocols. Thus, by changing settings in the routing protocols, traffic distribution, and thus routing topology, is fundamentally altered.
In terms of the ISO/OSI network model, (described in Douglas Comer's two volume work entitled “Internetworking with TCP/IP,” which is hereby incorporated by reference), previous work is focussed on understanding layer 2 and layer 3 topologies. The previous work does not analyze or take into account actual traffic flow.
While several commercial products for determining network topology are available, these products have serious drawbacks relating to their inability to take into account routing topology. For example, HP's Openview does not consider subnet masks. Other commercial products such as Riversoft's Openriver do not take into account routing protocols at all.
As recognized by the inventors, IGP information, such as may be obtained by IGP link state databases, may be particularly useful in determining routing topologies. However, the existing methods do not utilize IGP information in routing topology determination. Thus, there is a need in the art for a method of determining routing topology of a computer network, particularly in the context of complex networks, and for obtaining IGP information useful in determining routing topology of a computer network.
It is an object of the present invention to solve the problems described above associated with existing methods of determining network topologies.
It is still another object of the invention to provide a method for determining routing topologies in networks, including complex networks.
It is still another object of the invention to provide a method for determining routing topologies in networks, including complex networks, that takes into account actual packet routing traffic flows and routing topologies.
In one embodiment, the invention provides a method and system for determining routing topology in a computer network, and comprises obtaining IGP information, obtaining EGP information, and utilizing the IGP and EGP information to determine network topologies.
In another embodiment, the invention provides a method and system for determining routing topology in a computer network, and comprises obtaining IGP information to determine the effects of routing protocols on network topology; obtaining EGP information by obtaining Border Gateway Protocol (BGP) information utilizing an EGP peer; and utilizing the IGP and EGP information to create topological network views.
In still another embodiment, the invention provides a method and system for obtaining IGP information by querying IGP link state databases.
In still another embodiment, the invention comprises a method for obtaining IGP network information useful in determining network routing topologies, comprising querying a router for its router identifier and all its area identifiers, counting the router's number of area identifiers to determine whether the router is an ABR or an ASBR, querying the router's link state database for the lowest area identifier on the router, importing all the Type 1 and Type 2 LSAs for that area into the database of the network discovery software engine, importing from the router's link state database only those networks outside the router's autonomous system that are also directly connected to an ASBR, then moving to the next highest area identifier in the router's database to repeat importing Type 1 and Type 2 LSAs for that area into the database of the network discovery software engine and importing from the router's link state database only those networks outside the router's autonomous system that are also directly connected to an ASBR repeating this process until there are no more areas on the router that have not been processed, then starting with the lowest area identifier discovered, sweeping all networks in the area making LSAs other than Type 1 or Type 2, and repeating the entire process for every router discovered.
In still another embodiment, a method in accordance with the invention comprises obtaining EGP information, useful in determining network routing topologies, by obtaining BGP information utilizing an EGP peer, by using a software based routing engine on a host that the network discovery software is installed on, configuring the routing software to enable the specific EGP and to announce only the host route to the software-based router, establishing a peer relationship with an EGP speaking router in the network, loading the EGP database from the EGP router, and importing the EGP database into the network discovery software for processing.
In still another embodiment, a method in accordance with the invention comprises obtaining and utilizing the IGP and EGP information, useful in creating topological network views, by instantiating the routing protocol created topology using routing and software methods described in U.S. Pat. No. 6,108,702 titled “Method and Apparatus for Determining Accurate Topology Features of a Network,” issued Aug. 22, 2000 and incorporated herein by reference in its entirety, drawing a map of the network starting with IGP areas and allowing the user to select the BGP topology or the EGP topology including confederations, communities, and route reflectors.
In still another embodiment, the invention provides a method and system for determining routing topology in a computer network, and comprises obtaining IGP information to determine the effects of routing protocols on network topology using techniques described herein; obtaining EGP information by obtaining BGP information utilizing an EGP peer by using a software based routing engine on a host that the network discovery software is installed on, configuring the routing software to enable specific the EGP and to announce only the host route to the software-based router, establishing a peer relationship with an EGP speaking router in the network, loading the EGP database from the EGP router, and importing the EGP database into the network discovery software for processing; and utilizing the IGP and EGP information to create topological network views by instantiating the routing protocol created topology using routing and software methods described, for example, in the above referenced U.S. Pat. No. 6,108,702. The method further involves drawing a map of the network starting with IGP areas and allowing the user to select the BGP topology or the EGP topology including confederations, communities, and route reflectors.
The invention is illustrated in the figures of the accompanying drawings which are meant to be exemplary and not limiting, in which like references are intended to refer to like or corresponding parts, and in which:
The present invention will now be described in detail with reference to the accompanying drawings in
Every autonomous system contains at least one Area 0 or backbone 56 containing an ASBR 58. In addition to an ASBR 58, Area 0 56 may contain internal area routers 62 connected to other internal area routers 62 and/or additional network devices such as a printer 64, a network server 66, or some other networkable device 68 as known in the art. Area 0 56 may also contain an area border router (ABR) 70 connected to other areas 74 or stub areas 80 within the autonomous system 52.
In the preferred embodiment, all ASBRs 58, internal area routers 62, and ABRs 70 of the autonomous system 52 communicate using the Open Shortest Path First (OSPF) protocol as an Interior Gateway Protocol (IGP). OSPF protocol, an IGP used to distribute routing information within a single autonomous system, uses flooding between routers to exchange link state advertisements (LSAs) describing the status of each router's network interface. These LSAs associated with the IGP are contained in each router's Management Information Base (MIB) and provide an accurate view of all the routers and networks in a particular area. The ASBR 58 of the first system 52 communicates with the ASBR 59 of the second system 54 using a non-OSPF protocol 60 as known in the art.
There are several types of LSAs used by routers. Type 1 LSAs 72 are Router Link advertisements which are flooded in the area a router belongs to and describe the states of a router's link to the area. Type 2 LSAs 72 are Network Link advertisements which are flooded in the area a router belongs to describing the set of other routers attached to a particular network.
OSPF uses areas to limit the flooding of the entire autonomous system and reduce network congestion. ABRs 70 receive Type 1 and 2 LSAs 72, but do not flood them on to additional areas 74 within the autonomous system 52. Instead, Type 3 LSAs 74 are Summary Link advertisements generated by Area Border Routers and describe intra-area routes. In addition, Type 4 LSAs 74 are Summary Link advertisements generated by Area Border Routers and describe routes to the Autonomous System Boundary Router(s). Type 5 LSAs 76 are originated by the Autonomous System Boundary Router(s) which are flooded throughout all areas of a particular autonomous system (except stub areas) and describe routes to routers outside the autonomous system. An autonomous system 52 may contain a stub area 80 which does not receive all type 5 LSAs 76. Instead, Type 7 LSAs 78 summarize and filter selected type 5 LSAs which are directed to stub areas. This further reduces network congestion in the stub area 80.
In one embodiment of the invention, step 102 as depicted in
Every router in a particular area will store at least that same database. In other words, some information regarding the IGP within the MIBs of routers in a particular area is redundant and contained in each area router. Whether a particular router's MIB contains such redundant information can be determined quickly by querying the type of LSA contained with that router's MIB. The same type 1 and type 2 LSAs, for example, are contained within the MIB of every router in a particular area of an autonomous system.
Accordingly, network discovery can be accomplished much more efficiently utilizing this information, since further analysis of the redundant information is not required for each router. Much of the IGP routing topology for a particular area can be accurately represented from the information obtained from just one router. Further analysis is only required on the remaining non-redundant information contained in the MIBs of the routers of a particular area. Similarly, storage of the MIB data in a topology database as described below results in the need to query only updates to the MIBs since a previous analysis, thus further streamlining the routing protocol discovery process.
In one embodiment, step 104 as depicted in
In one embodiment, step 106 comprises combining the information obtained from the first two components to allow the creation of an IGP and EGP topology view of the network. This component leverages the collected IGP and EGP information by using the information to determine data points to create a visual representation of the routing topology of the network. Thus, in one embodiment, the present invention utilizes both information contained in router configuration databases as well as in EGP information obtained by utilizing a special peer router running a BGP, to create a protocol-based network topology, which topology may then be presented in a variety of tabular or visual formats.
Because the system is computationally efficient, and minimizes the need to redundantly collect data, real-time information can be produced to better understand dynamically changing networks. Furthermore, by better understanding network topologies and traffic patterns, more effective network configurations can be produced and network traffic or routing problems can be better understood. Still further, these techniques can be used to understand, detect and, in some cases, eliminate certain security threats such as worms or other viruses which propagate on a network. Thus, the present invention significantly contributes to network performance understanding and optimization.
In one embodiment, step 102 of
At step 206, the router is queried for its area identifier. A router can belong to more than one area. The area(s) that a router are in give it its context for any advertisements that it makes about what network it is connected or “knows” about. Thus, the method “moves” from area to area, but prevents “leakage” in of unwanted networks.
Step 208 queries whether there is more than one area identifier on the router. If so, then it belongs to more than one area inside the autonomous system, and the router is an Area Border Router (ABR).
Step 210 queries whether the router is defined as an Autonomous System Boundary Router (ASBR). A router can border only one area and still be connected to networks that are outside its area, which makes the router an ASBR.
Step 212 queries the link state database for the numerically lowest area identifier on the router. This step starts the sweeping of the networks in each area. The order is arbitrary, but may start with the router 0.0.0.0.
At step 214, all Type 1 and Type 2 LSAs for an area are imported into the routing topology information database. The router identifiers of all the routers in the area are announced as type 1 advertisements and the networks in the area are announced as type 2 advertisements. There are several reasons for looking at only an announcement from inside the system. First, networks announced by the routers outside the area may be summarized, so that instead of announcing each of a thousand networks, an area border router can be configured to announce those networks as though they were a single, much larger network. Second, networks outside the autonomous system can also be announced, and the method 200 only sweeps those networks outside the autonomous system that are directly connected to one of the routers inside the autonomous system.
At step 216, if the router is directly connected to networks that are outside the autonomous system, the method 200 imports those networks into the routing topology database. Thus, only autonomous networks that are directly connected to an autonomous system boundary router are imported, preventing “leakage” in of unwanted networks.
At step 218, after going to the next highest area identifier, the method 200 queries whether there are any remaining areas on the router that have not been processed. If so, the method returns to step 214 to process the remaining area(s). If not, the method 200 proceeds to step 220.
At step 220, starting with the lowest area identifier, the method 200 sweeps all the networks in the area that are announced by routers that are also making Type 3, 4, 5, or 7 advertisements. Thus, the method 200 sweeps for networks announced by routers that are connected to other areas and the autonomous system.
At step 222, the method 200 queries whether there is another such router (as from step 220). If so, the method 200 returns to step 204 to begin processing the next router. If there are no other such routers, the method proceeds to step 224.
At step 224, starting with the lowest area identifier, the method 200 sweeps all the networks in the area that are announced by routers that are not making Type 3, 4, 5, or 7 advertisements.
At step 226, the method queries whether there is another such router. If there is, the method returns to step 204 to begin processing the next router. If there is no other such router, then the method ends at step 228.
The diagram in
The diagram in
Step 1006 queries the router for its Router Identifier using SNMP and import this information into the Database of the network discovery software. This information is used to correlate the IGP information obtained in steps 1004-1020 with a particular router and assists in IGP Topology Discovery.
Step 1008 queries the router for its Area Identifier using SNMP and import this information into the Database of the network discovery software. This Area Identifier will be used in step 1010 to determine whether the router is an Area Boundary Router (ABR) or an Autonomous System Boundary Router (ASBR).
Step 1012, if the router is an ABR, queries the router for which areas it borders and imports this information into the Network Topology Information Database 314.
Step 1014, if the router is an ASBR, queries the router for the networks it is directly connected to that are outside the autonomous system, imports this information into the Network Topology Information Database 314 of the network discovery software, and ignores all other similar and related Type 5 LSAs contained in the link state database. Type 5 LSAs are used by the IGP to identify other autonomous systems.
Step 1016, if the router is an ABR and it is bordering a stub area, imports the stub area network information into the Network Topology Information Database 314. A stub area is an area that is connected to exactly one other area.
At step 1018, if the router is an ABR and it is bordering a non-stubby or less stubby area, imports this additional network information into the Database of the network discovery software. A non-stubby or less stubby area is a virtual link to another area.
Step 1020 parses the link state database for all routers providing Type 3, Type 4, or Type 5 LSAs that are in the area, and ignores all additional Type 1 and Type 2 LSAs, since this redundant information was obtained from the first router in the area that was queried and is contained in all area routers.
Step 1022 goes to those routers and repeats this algorithm beginning at step 1008 for the existing area and step 1006 for any other area the router is in. Finally, the method 1000 ends at step 1024.
At step 126, a peer relationship is established with an EGP-speaking router in the network, to acquire EGP information and establish an EGP database. At step 128, the EGP database is loaded from the EGP router. At step 130, the EGP database is imported into the network discovery Network Topology Information Database 314, and then the method ends at step 132. The EGP information can then be utilized, for example, in addition to stored IGP information, to create views of the network topology, one method of which is described below with reference to
While the invention has been described and illustrated in connection with preferred embodiments, many variations and modifications as will be evident to those skilled in this art may be made without departing from the spirit and scope of the invention, and the invention is thus not to be limited to the precise details of methodology or construction set forth above as such variations and modification are intended to be included within the scope of the invention.
|Brevet cité||Date de dépôt||Date de publication||Déposant||Titre|
|US3855456||22 nov. 1972||17 déc. 1974||Ebasco Serv||Monitor and results computer system|
|US3906454||18 mai 1973||16 sept. 1975||Bell Telephone Labor Inc||Computer monitoring system|
|US4135662||15 juin 1977||23 janv. 1979||Pitney-Bowes, Inc.||Operator prompting system|
|US4410950||16 déc. 1980||18 oct. 1983||Hitachi, Ltd.||Method of and apparatus for monitoring performance of steam power plant|
|US4438494||25 août 1981||20 mars 1984||Intel Corporation||Apparatus of fault-handling in a multiprocessing system|
|US4503534||30 juin 1982||5 mars 1985||Intel Corporation||Apparatus for redundant operation of modules in a multiprocessing system|
|US4503535||30 juin 1982||5 mars 1985||Intel Corporation||Apparatus for recovery from failures in a multiprocessing system|
|US4517468||30 avr. 1984||14 mai 1985||Westinghouse Electric Corp.||Diagnostic system and method|
|US4545013||31 déc. 1981||1 oct. 1985||Infinet Inc.||Enhanced communications network testing and control system|
|US4568909||19 déc. 1983||4 févr. 1986||United Technologies Corporation||Remote elevator monitoring system|
|US4585975||21 avr. 1983||29 avr. 1986||Tektronix, Inc.||High speed Boolean logic trigger oscilloscope vertical amplifier with edge sensitivity and nested trigger|
|US4591983||9 juil. 1984||27 mai 1986||Teknowledge, Inc.||Hierarchical knowledge system|
|US4622545||30 sept. 1982||11 nov. 1986||Apple Computer, Inc.||Method and apparatus for image compression and manipulation|
|US4648044||6 juin 1984||3 mars 1987||Teknowledge, Inc.||Basic expert system tool|
|US4727545||2 sept. 1986||23 févr. 1988||Digital Equipment Corporation||Method and apparatus for isolating faults in a digital logic circuit|
|US4817092||5 oct. 1987||28 mars 1989||International Business Machines||Threshold alarms for processing errors in a multiplex communications system|
|US4823345||15 juin 1987||18 avr. 1989||International Business Machines Corp.||Method and apparatus for communication network alert record identification|
|US4866712||19 févr. 1988||12 sept. 1989||Bell Communications Research, Inc.||Methods and apparatus for fault recovery|
|US4881230||5 oct. 1987||14 nov. 1989||Ibm Corporation||Expert system for processing errors in a multiplex communications system|
|US4914657||15 avr. 1987||3 avr. 1990||Allied-Signal Inc.||Operations controller for a fault tolerant multiple node processing system|
|US4932026||19 déc. 1986||5 juin 1990||Wang Laboratories, Inc.||Apparatus for distributing data processing across a plurality of loci of control|
|US4935876||24 juin 1988||19 juin 1990||Hitachi, Ltd.||Knowledge base management method and system|
|US5107497||28 juil. 1989||21 avr. 1992||At&T Bell Laboratories||Technique for producing an expert system for system fault diagnosis|
|US5109486||6 janv. 1989||28 avr. 1992||Motorola, Inc.||Distributed computer system with network and resource status monitoring|
|US5123017||29 sept. 1989||16 juin 1992||The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration||Remote maintenance monitoring system|
|US5125091||8 juin 1989||23 juin 1992||Hazox Corporation||Object oriented control of real-time processing|
|US5133075||19 déc. 1988||21 juil. 1992||Hewlett-Packard Company||Method of monitoring changes in attribute values of object in an object-oriented database|
|US5159685||6 déc. 1989||27 oct. 1992||Racal Data Communications Inc.||Expert system for communications network|
|US5179556||2 août 1991||12 janv. 1993||Washington University||Bandwidth management and congestion control scheme for multicast ATM networks|
|US5204955||10 sept. 1990||20 avr. 1993||Hitachi, Ltd.||Network management method and system|
|US5214653||22 oct. 1990||25 mai 1993||Harris Corporation||Fault finder expert system|
|US5247517||2 sept. 1992||21 sept. 1993||Novell, Inc.||Method and apparatus for analyzing networks|
|US5261044||7 nov. 1991||9 nov. 1993||Cabletron Systems, Inc.||Network management system using multifunction icons for information display|
|US5293629||30 nov. 1990||8 mars 1994||Abraxas Software, Inc.||Method of analyzing computer source code|
|US5295244||3 août 1993||15 mars 1994||Cabletron Systems, Inc.||Network management system using interconnected hierarchies to represent different network dimensions in multiple display views|
|US5309448||3 janv. 1992||3 mai 1994||International Business Machines Corporation||Methods and systems for alarm correlation and fault localization in communication networks|
|US5321837||11 oct. 1991||14 juin 1994||International Business Machines Corporation||Event handling mechanism having a process and an action association process|
|US5375070||1 mars 1993||20 déc. 1994||International Business Machines Corporation||Information collection architecture and method for a data communications network|
|US5432934||26 juil. 1993||11 juil. 1995||Gensym Corporation||Access restrictions as a means of configuring a user interface and making an application secure|
|US5436909||7 nov. 1991||25 juil. 1995||Cabletron Systems, Inc.||Network management system using status suppression to isolate network faults|
|US5483637||27 juin 1994||9 janv. 1996||International Business Machines Corporation||Expert based system and method for managing error events in a local area network|
|US5485455||28 janv. 1994||16 janv. 1996||Cabletron Systems, Inc.||Network having secure fast packet switching and guaranteed quality of service|
|US5491694||5 oct. 1994||13 févr. 1996||Cabletron Systems, Inc.||System and method for allocating a shared resource among competing devices|
|US5495470||23 nov. 1993||27 févr. 1996||Applied Digital Access, Inc.||Alarm correlation system for a telephone network|
|US5504921||16 mai 1994||2 avr. 1996||Cabletron Systems, Inc.||Network management system using model-based intelligence|
|US5521910||5 oct. 1994||28 mai 1996||Cabletron Systems, Inc.||Method for determining a best path between two nodes|
|US5528516||25 mai 1994||18 juin 1996||System Management Arts, Inc.||Apparatus and method for event correlation and problem reporting|
|US5559955||13 déc. 1994||24 sept. 1996||Cabletron Systems, Inc.||Method and apparatus for monitoring the status of non-pollable device in a computer network|
|US5590120||31 oct. 1995||31 déc. 1996||Cabletron Systems, Inc.||Port-link configuration tracking method and apparatus|
|US5627819||9 janv. 1995||6 mai 1997||Cabletron Systems, Inc.||Use of multipoint connection services to establish call-tapping points in a switched network|
|US5649103||13 juil. 1995||15 juil. 1997||Cabletron Systems, Inc.||Method and apparatus for managing multiple server requests and collating reponses|
|US5666481||26 févr. 1993||9 sept. 1997||Cabletron Systems, Inc.||Method and apparatus for resolving faults in communications networks|
|US5675741||25 oct. 1994||7 oct. 1997||Cabletron Systems, Inc.||Method and apparatus for determining a communications path between two nodes in an Internet Protocol (IP) network|
|US5687290||15 oct. 1996||11 nov. 1997||Cabletron Systems, Inc.||Method and apparatus for monitoring and controlling communications networks|
|US5696486||16 nov. 1995||9 déc. 1997||Cabletron Systems, Inc.||Method and apparatus for policy-based alarm notification in a distributed network management environment|
|US5706436||1 févr. 1995||6 janv. 1998||Cabletron Systems, Inc.||Apparatus and method for evaluation network traffic performance|
|US5722427||13 déc. 1994||3 mars 1998||Eyesys Technologies, Inc.||Method of refractive surgery|
|US5727157||19 déc. 1996||10 mars 1998||Cabletron Systems, Inc.||Apparatus and method for determining a computer network topology|
|US5734642||22 déc. 1995||31 mars 1998||Cabletron Systems, Inc.||Method and apparatus for network synchronization|
|US5748781||4 janv. 1995||5 mai 1998||Cabletron Systems, Inc.||Method and apparatus for digital data compression|
|US5751933||12 sept. 1996||12 mai 1998||Dev; Roger H.||System for determining the status of an entity in a computer network|
|US5751965||21 mars 1996||12 mai 1998||Cabletron System, Inc.||Network connection status monitor and display|
|US5754532||12 nov. 1996||19 mai 1998||Cabletron Systems, Inc.||Use of multipoint connection services to establish call-tapping points in a switched network|
|US5764955||19 oct. 1995||9 juin 1998||Oasys Group, Inc.||Gateway for using legacy telecommunications network element equipment with a common management information protocol|
|US5768501||28 mai 1996||16 juin 1998||Cabletron Systems||Method and apparatus for inter-domain alarm correlation|
|US5777549||29 mars 1995||7 juil. 1998||Cabletron Systems, Inc.||Method and apparatus for policy-based alarm notification in a distributed network management environment|
|US5790546||4 déc. 1995||4 août 1998||Cabletron Systems, Inc.||Method of transmitting data packets in a packet switched communications network|
|US5791694||20 févr. 1997||11 août 1998||Dover Corporation||Lock for coupling cam arms|
|US5793362||4 déc. 1995||11 août 1998||Cabletron Systems, Inc.||Configurations tracking system using transition manager to evaluate votes to determine possible connections between ports in a communications network in accordance with transition tables|
|US5812750||27 mars 1997||22 sept. 1998||Cabletron Systems, Inc.||Method and apparatus for monitoring the status of non-pollable devices in a computer network|
|US5822305||17 oct. 1996||13 oct. 1998||Cabletron Systems, Inc.||Port-link configuration tracking method and apparatus|
|US5832503||24 févr. 1995||3 nov. 1998||Cabletron Systems, Inc.||Method and apparatus for configuration management in communications networks|
|US5872928||25 mai 1995||16 févr. 1999||Cabletron Systems, Inc.||Method and apparatus for defining and enforcing policies for configuration management in communications networks|
|US5881246||12 juin 1996||9 mars 1999||Bay Networks, Inc.||System for generating explicit routing advertisements to specify a selected path through a connectionless network to a destination by a specific router|
|US5889953||29 mars 1996||30 mars 1999||Cabletron Systems, Inc.||Policy management and conflict resolution in computer networks|
|US5907696||3 juil. 1996||25 mai 1999||Cabletron Systems, Inc.||Network device simulator|
|US5940376||29 janv. 1997||17 août 1999||Cabletron Systems, Inc.||Method and apparatus to establish a tap-point in a switched network using self-configuring switches having distributed configuration capabilities|
|US5970984||23 oct. 1997||26 oct. 1999||Eyesys-Premier, Inc.||Method of refractive surgery|
|US5980984||9 oct. 1997||9 nov. 1999||The Regents Of The University Of California||Method for sealing remote leaks in an enclosure using an aerosol|
|US5987442||24 oct. 1997||16 nov. 1999||Cabeltron Systems, Inc.||Method and apparatus for learning network behavior trends and predicting future behavior of communications networks|
|US5995503 *||12 juin 1996||30 nov. 1999||Bay Networks, Inc.||Method and apparatus for providing quality of service routing in a network|
|US6000045||8 juin 1998||7 déc. 1999||Cabletron Systems, Inc.||Method and apparatus for inter-domain alarm correlation|
|US6003090||23 avr. 1997||14 déc. 1999||Cabletron Systems, Inc.||System for determining network connection availability between source and destination devices for specified time period|
|US6014697||18 déc. 1996||11 janv. 2000||Cabletron Systems, Inc.||Method and apparatus for automatically populating a network simulator tool|
|US6026442||24 nov. 1997||15 févr. 2000||Cabletron Systems, Inc.||Method and apparatus for surveillance in communications networks|
|US6041383||22 juil. 1996||21 mars 2000||Cabletron Systems, Inc.||Establishing control of lock token for shared objects upon approval messages from all other processes|
|US6049828||15 sept. 1998||11 avr. 2000||Cabletron Systems, Inc.||Method and apparatus for monitoring the status of non-pollable devices in a computer network|
|US6057757||6 juil. 1998||2 mai 2000||Cabletron Systems, Inc.||Method and apparatus for policy-based alarm notification in a distributed network management environment|
|US6064304||10 mai 1999||16 mai 2000||Cabletron Systems, Inc.|
|US6064986||19 janv. 1999||16 mai 2000||Edelman Financial Services, Inc.||Computer assisted and/or implemented process and architecture for customer account creation, maintenance and administration for an investment and/or retirement program|
|US6064996||29 sept. 1997||16 mai 2000||Yamaha Hatsudoki Kabushiki Kaisha||Evolutionary controlling system with behavioral simulation|
|US6084858||29 janv. 1997||4 juil. 2000||Cabletron Systems, Inc.||Distribution of communication load over multiple paths based upon link utilization|
|US6115362||28 mars 1997||5 sept. 2000||Cabletron Systems, Inc.||Method and apparatus for determining frame relay connections|
|US6131112||17 mai 1996||10 oct. 2000||Cabletron Systems, Inc.||Method and apparatus for integrated network and systems management|
|US6138122||2 mars 1998||24 oct. 2000||Agilent Technologies||Modeling of internet services|
|US6141720||12 juin 1997||31 oct. 2000||Cabletron Systems, Inc.||Method and apparatus for coordination of a shared object in a distributed system|
|US6199172||6 févr. 1996||6 mars 2001||Cabletron Systems, Inc.||Method and apparatus for testing the responsiveness of a network device|
|US6205563||6 déc. 1999||20 mars 2001||Cabletron Systems, Inc.||Method and apparatus for inter-domain alarm correlation|
|US6209033||13 mai 1997||27 mars 2001||Cabletron Systems, Inc.||Apparatus and method for network capacity evaluation and planning|
|US6216168||17 mars 1997||10 avr. 2001||Cabletron Systems, Inc.||Perspective-based shared scope address resolution method and apparatus|
|US6418476 *||29 juin 1998||9 juil. 2002||Nortel Networks, Limited||Method for synchronizing network address translator (NAT) tables using the open shortest path first opaque link state advertisement option protocol|
|US6711152 *||6 juil. 1999||23 mars 2004||At&T Corp.||Routing over large clouds|
|US6744739 *||18 mai 2001||1 juin 2004||Micromuse Inc.||Method and system for determining network characteristics using routing protocols|
|US6820134 *||28 déc. 2000||16 nov. 2004||Cisco Technology, Inc.||Optimizing flooding of information in link-state routing protocol|
|US6850524 *||31 juil. 2000||1 févr. 2005||Gregory Donald Troxel||Systems and methods for predictive routing|
|US6977937 *||10 avr. 2000||20 déc. 2005||Bbnt Solutions Llc||Radio network routing apparatus|
|1||Gilbert R., et al., CNMGRAF-Graphic Presentation Services for Network Management, ACM 0-89791-164 (1985).|
|2||Integrated Network Management V: Integrated Management in a Virtual World, Proceedings of the Fifth IFIP/IEEE International Symposium on Integrated Network Management, San Diego, California, May 12-16, 1997, Lazar A. et al, eds., Chapman & Hall, 1997.|
|3||ISO/IEC 10164-1: 1993, Information technology-Open Systems Interconnection-Systems Management: Object Management Function.|
|4||ISO/IEC 10164-2:1993, Information technology-Open Systems Interconnection-Systems Management: State Management Function.|
|5||ISO/IEC 10164-4:1992, Information technology-Open Systems Interconnection-Systems management: Alarm reporting function.|
|6||ISO/IEC 10164-5:1993, Information technology-Open Systems Interconnection-Systems management: Event Report Management Function.|
|7||ISO/IEC 10165-1:1993, Information technology-Open Systems Interconnection-Management Information Services-Structure of management information: Management Information Model.|
|8||ISO/IEC 7498-4:1989, Information processing systems-Open Systems Interconnection-Basic Reference Model-Part 4: Management framework.|
|9||ISO/IEC 9595:1998, Information technology-Open Systems Interconnection-Common management information service.|
|10||ISO/IEC 9596-2:1993, Information technology-Open Systems Interconnection-Common management information protocol: Protocol Implementation Conformance Statement (PICS) proforma.|
|11||Lewis, Lundy, Service Level Management for Enterprise Networks, Artech House, 1999.|
|12||M. Gargano, et al., A Logical Data Model for Integrated Geographical Databases, IEEE (1990).|
|13||Micromuse's Netcool/Omnibus, A Cool MOM Makes It Easy, Data Communications, Jan. 1995.|
|14||Network and Distributed Systems Management, Morris Sloman, Ed., Addison-Wesley, 1994.|
|15||RFC 1155-Structure and identification of management information for TCP/IP-based internets, Network Working Group, M. Rose and K. McCloghrie, Eds., May 1990, http://www.faqs.org/rfcs/rfc1155.html (visited Aug. 30, 2004).|
|16||RFC 1156-Management Information Base for network management of TCP/IP-based internets, Network Working Group, K. McCloghrie and M. Rose, Eds., May 1990, http://www.faqs.org/rfcs/rfc1156.html (visited Aug. 30, 2004).|
|17||RFC 1157-Simple Network Management Protocol (SNMP), Network Working Group, J. Case et al., Eds., May 1990, http://www.faqs.org/rfcs/rfc1157.html (visited Aug. 30, 2004).|
|18||RFC 1158-Management Information Base for network management of TCP/IP-based internets: MIB-II, Network Working Group, M. Rose, Ed., May 1990, http://www.faqs.org/rfcs/rfc1158.html (visited Aug. 30, 2004).|
|19||Stevenson Douglas W., Network Management: What it is and what it isn't, Apr. 1995, http://www.sce.carleton.ca/netmanage/NetMngmnt/NetMngmnt.html (visited Aug. 30, 2004).|
|20||Subramanian, Mani, Network Management: Principles and Practice, Addison Wesley Longman, 2000.|
|Brevet citant||Date de dépôt||Date de publication||Déposant||Titre|
|US7684347||21 mai 2009||23 mars 2010||Solera Networks||Method and apparatus for network packet capture distributed storage system|
|US7855974||16 déc. 2005||21 déc. 2010||Solera Networks, Inc.||Method and apparatus for network packet capture distributed storage system|
|US8438302 *||17 juil. 2003||7 mai 2013||International Business Machines Corporation||Splitting and sharing routing information among several routers acting as a single border router|
|US8521732||25 mai 2009||27 août 2013||Solera Networks, Inc.||Presentation of an extracted artifact based on an indexing technique|
|US8625642||23 mai 2008||7 janv. 2014||Solera Networks, Inc.||Method and apparatus of network artifact indentification and extraction|
|US8666985||15 mars 2012||4 mars 2014||Solera Networks, Inc.||Hardware accelerated application-based pattern matching for real time classification and recording of network traffic|
|US8849991||15 déc. 2010||30 sept. 2014||Blue Coat Systems, Inc.||System and method for hypertext transfer protocol layered reconstruction|
|US9160654||9 janv. 2013||13 oct. 2015||International Business Machines Corporation||Splitting and sharing routing information among several routers acting as a single border router|
|US9210046 *||14 mars 2011||8 déc. 2015||Hewlett Packard Enterprise Development Lp||Zone-based network traffic analysis|
|US9411787||13 mars 2014||9 août 2016||Thousandeyes, Inc.||Cross-layer troubleshooting of application delivery|
|US9455890 *||13 mars 2014||27 sept. 2016||Thousandeyes, Inc.||Deep path analysis of application delivery over a network|
|US9497113||8 sept. 2015||15 nov. 2016||International Business Machines Corporation||Splitting and sharing routing information among several routers acting as a single border router|
|US9729414||21 avr. 2015||8 août 2017||Thousandeyes, Inc.||Monitoring service availability using distributed BGP routing feeds|
|US20040039840 *||17 juil. 2003||26 févr. 2004||International Business Machines Corporation||Method and system for splitting and sharing routing information among several routers acting as a single border router|
|US20070258447 *||4 mai 2006||8 nov. 2007||Robert Raszuk||Inter-area summarization of edge-device addresses using RFC3107|
|US20120166672 *||16 nov. 2011||28 juin 2012||Electronics And Telecommunications Research Institute||Path computation apparatus and path computation method for the same|
|US20120239796 *||14 mars 2011||20 sept. 2012||Sumanth Narasappa||Zone-based network traffic analysis|
|US20140280917 *||13 mars 2014||18 sept. 2014||Thousand Eyes, Inc.||Deep path analysis of application delivery over a network|
|US20170026262 *||24 août 2016||26 janv. 2017||Thousandeyes, Inc.||Deep path analysis of application delivery over a network|
|Classification aux États-Unis||370/255, 370/401|
|Classification internationale||H04L12/56, H04L12/24, H04L12/28|
|Classification coopérative||H04L45/04, H04L41/00, H04L45/28|
|Classification européenne||H04L45/04, H04L45/28, H04L41/00, H04L12/24|
|14 nov. 2007||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MICROMUSE INC.;REEL/FRAME:020105/0359
Effective date: 20060701
|13 août 2008||AS||Assignment|
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MARTIN, DANIEL J;REEL/FRAME:021371/0657
Effective date: 20080811
|23 avr. 2012||REMI||Maintenance fee reminder mailed|
|29 juin 2012||SULP||Surcharge for late payment|
|29 juin 2012||FPAY||Fee payment|
Year of fee payment: 4
|22 avr. 2016||REMI||Maintenance fee reminder mailed|
|9 sept. 2016||LAPS||Lapse for failure to pay maintenance fees|
|1 nov. 2016||FP||Expired due to failure to pay maintenance fee|
Effective date: 20160909