Abstract: Disclosed are systems, apparatuses, methods, and computer-readable media for simulating traffic flow in a virtualized network fabric. A method includes: creating in a visualization tool one or more virtual network hubs, one or more virtual branch locations, and one or more virtual internet servers; generating one or more micro-probes for clients/servers to be simulated, one or more of the clients/servers is located in each of the one or more virtual network hubs, virtual branch locations, and the virtual internet servers; generating one or more network impairments, which are associated with one or more of the one or more of network hubs, branch locations, and/or internet server locations; and launching one or more, client-role or server-role traffic invokers in each micro-probe to simulate traffic between the one or more of the virtual network hubs, the virtual branch locations, and/or the virtual internet server.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: A mechanism includes receiving, at a local node, a Hello message including an application identifier (AppId) and a target link between a target port for a local node and target port for a neighbor node. The local node determines the AppId is associated with an application for performing database synchronization. The local node sets up a local database in memory at the local node as part of a database pair for use by the application, the database pair including a neighbor database at the neighbor node. The local node associates the database pair with the target link. The local node controls synchronization of the local database with the neighbor database via the target link.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: A mechanism includes receiving, at a local node, a Hello message including an application identifier (AppId) and a target link between a target port for a local node and target port for a neighbor node. The local node determines the AppId is associated with an application for performing database synchronization. The local node sets up a local database in memory at the local node as part of a database pair for use by the application, the database pair including a neighbor database at the neighbor node. The local node associates the database pair with the target link. The local node controls synchronization of the local database with the neighbor database via the target link.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

Abstract: A mechanism includes receiving, at a local node, a Hello message including an application identifier (AppId) and a target link between a target port for a local node and target port for a neighbor node. The local node determines the AppId is associated with an application for performing database synchronization. The local node sets up a local database in memory at the local node as part of a database pair for use by the application, the database pair including a neighbor database at the neighbor node. The local node associates the database pair with the target link. The local node controls synchronization of the local database with the neighbor database via the target link.

Abstract: A network node (N1) for handling IGP flooding topology (FT) inconsistency by obtaining a new FT and setting a FT flag field (FT field) in a data packet (DP) to indicate whether a link between N1 and a second node (N2) is on the new FT. N1 transmits the DP to N2. N1 receives a second DP from N2 that includes the FT field set by N2 to indicate whether the link between the network node and N2 is on the new FT as determined by N2. N1 sets a FT inconsistency field in a link state packet to indicate an inconsistency in the new FT when the FT field set by N2 and the FT field set by N1 are different for a given time. N1 distributes the LS to at least one node in the network.

Abstract: In one embodiment, an apparatus can include a service broker configured to: (i) register a service classifier, and to provide context information to the service classifier; and (ii) register a plurality of service nodes. The service broker can also receive capability and service requests from the service classifier. Further, the context information can include a service header, a reachability indication, and an encapsulation, where the service header and the encapsulation may be attached or related to a packet in the service classifier. In addition, the service classifier can use this information to redirect the packet to a first service node.

Abstract: A method and apparatus are described for managing congestion in a network. For a receiving node, a congestion status associated with a node in the network is determined. The congestion status is advertised to at least one other node in the network. For a sending node, a congestion status associated with a receiving node in the network is received. The congestion status corresponds to a measured node condition at the receiving node. A call is routed to the receiving node based on the received congestion status.

Abstract: In one embodiment, an apparatus can include a service broker configured to: (i) register a service classifier, and to provide context information to the service classifier; and (ii) register a plurality of service nodes. The service broker can also receive capability and service requests from the service classifier. Further, the context information can include a service header, a reachability indication, and an encapsulation, where the service header and the encapsulation may be attached or related to a packet in the service classifier. In addition, the service classifier can use this information to redirect the packet to a first service node.

Abstract: The invention discloses a method of manufacturing melt blown style activated carbon fiber filter elements, which comprises: putting polypropylene resin into plastic pressing machine, then melting it at high temperature, after pressing, the liquid polypropylene is produced and transported to fiber-injector, and spraying the melted liquid polypropylene to fiber-receiving device in fiber form, transporting activated carbon to fixed position of fiber-receiving device, by fiber-receiving device's inertia, polypropylene fiber can join activated carbon to produce filter cartridge in pre-set inner and outer diameters. This invention can reduce cost effectively and many different micron rating filtration elements can be easily produced automatically. Both of New activated carbon fiber filter cartridges and filter cloth are of excellent performance and long-service life.

Abstract: A method, and apparatus to transmit an ATM data message from a source node to a destination node, and reflect at least a portion of the data back t where it is compared to the transmitted data. The destination node includes a reflection circuit service located at a specific selector code address, and the destination node listens for a transmission to the specific selector code for reflecting the portion of received data in a subsequent data message for the connection. The source node addresses a setup message to the destination node containing the specific selector code, and compares the transmitted message with the received message. The source node also includes a method and apparatus to send alternatively trace and path trace information as an attachment to a transmitted message, receive the reflected information element, and pass hop data contained within the information element to a user interface for presentation to a user.

Abstract: Dynamically created routing table structures which may find application as routing tables for ATM or other computer networks provide a selection of pre-computed routes optimized to a specified constraint such as delay and delay variation (e.g., as measured by CTD and CDV), or administrative weight (AW). The routing tables may be implemented as shortest path trees, e.g., as may be generated by a Dijkstra process, which represent the computed routes within the network, optimized to a specified constraint for one or more specified network service categories. Thus, the routing tables allow for rapid compilation of one or more source-computed routes (e.g., DTLs in an ATM network). In some cases, the routing tables may include alternate routes between network nodes. Any number of tables, between a minimum of three and a maximum of ten, may be created.