In one example in accordance with the present disclosure, a system may comprise a node accessor to access a first node belonging to a plurality of nodes and an interface determiner to determine a hardware interface associated with the first node. The system may comprise a template determiner to determine a template corresponding to the hardware interface, wherein the template contains a predefined identifier associated with the hardware interface. The system may comprise a network handler to identify a network associated with the predefined identifier associated with the hardware interface; and a network associater to associate each node in the plurality of nodes, including the first node, with a network specified in the template.

A data storage system can have adaptive data path routing that consists of a network controller connected to a plurality of data storage units that each have a local controller and memory. A front-end module of the network controller may direct a first data set from a first data storage unit of the plurality of data storage units via a primary data. A back-end routing module of the network controller can adapt to an amount of data accesses by transferring a second data set from a second data storage unit of the plurality of data storage units via a back-end data path.

A method, system and a network element for routing at least one data stream in a telecommunications network, the network having at least one transmitting node providing at least one data stream, at least one receiving node receiving the at least one data stream, and zero or more processing nodes, and at least one link connecting said nodes. All nodes communicate their capabilities to a system database on a database server which receives at least one request with at least one condition for sending at least one data stream between two nodes. For or each request, a measure is calculated for at least one route between said two nodes, and instructions are provided to use only the at least one route having measures compliant with the at least one condition in the request. An optimal route can be determined using at least one heuristic rule or linear programming.

A computerized system for performing preparation operations for a maintenance activity that causes a disruption in a communication path of traffic over a multilayer network. The system comprising: a maintenance tool configured to coordinate maintenance activities of the multi-layer network based on maintenance activity-data, a storage unit to store the maintenance activity data; and a multi-layer control system comprising a processor, wherein said processor is configured to: receive from the maintenance tool an indication that one or more maintenance activities are required on an indicated optical resource, determine an affected optical path, determine an affected IP link utilizing said affected optical path; remove traffic from the affected IP link; remove the affected optical path; activate an alternative optical path; configure the packet switching layer to utilize the alternative optical path; and repeat for each alVecied optical path and each affected IP link.

Communication allowance determination means determines, using information of a packet received by a packet relay unit and based on a policy which is information associating a match condition with communicability information, whether to allow or not to allow communication to a destination unit for the packet that meets the match condition, the match condition being information identifying the packet, and the communicability information indicating whether to allow or not to allow the communication to the destination unit for the packet that meets the match condition. Rule setting means sets, at least in the packet relay unit receiving the packet, a rule of executing a process for suppressing forwarding of the packet to the destination unit, on condition that the communication allowance determination means determines not to allow the communication to the destination unit for the packet that meets the match condition.

A method and system for sending a flow table in a Software Defined Network (SDN) are described in the present disclosure, an OpenFlow (OF) controller, and an OF switch. The method includes that an OF switch receives a flow table entry modification message sent from an OF controller, wherein the message includes a table number, a flow table entry, and a cache label; and the OF switch stores, in a control module of the OF switch, the table number and the flow table entry in the flow table entry modification message according to an indication of the cache label.

A route update system (RUS) may support increased efficiency and speed for performing a routing table update. The RUS may include a control plane processor device, which may implement update snoop module circuitry. The RUS may also include a data routing switch, which may implement update inject module circuitry. The RUS may include one or more RUS connectivity systems that link the update snoop module circuitry and the update inject module circuitry.

Technologies are described herein for routing a service request to an appropriate web service. A first service request is routed from a first web service to a second web service. Routing factors associated with the second web service are monitored. A determination is made as to whether the routing factors indicate that the second web service is no longer appropriate for handling service requests. If the routing factors indicate that the first web service is no longer appropriate for handling service requests, then a second service request is routed from the first web service to a third web service. The first web service, the second web service, and the third web service are included in a composite service.

Aspects of the present disclosure involve systems, methods, computer program products, and the like, for managing routes through a telecommunications network in response to a change of state of a link between components of the network. In particular, a router may determine the nature of the link event and the link upon which the event occurred. If the link event is on the same link or in some way related to a previously detected link event, the component may ignore the occurrence of the received link event in determining when the shortest route path is calculated. In this manner, a toggling link may be ignored by the router when applying a dampening effect to the calculation of the shortest route such that the network can respond to a singular link event faster than when a traditional dampening effect with exponential back-off is applied.

Disclosed are system, methods, and non-transitory computer readable media for accurately calculating a default gateway of an endpoint without probing the endpoint for the configured values to determine the path between network elements. Tracing the path of a flow in a network and displaying that on a user interface is extremely useful for network troubleshooting purposes. In order to find the gateway the flow would take cut of the L2 domain, the endpoint's L2 default gateway is required. Usually the L2 gateway for network endpoints is configured on the endpoints themselves and this information cannot be accessed by network controllers (e.g., APIC-EM) directly. In such cases APIC-EM needs to determine the L2 gateway based on the information available to it from the network elements, instead of the endpoints themselves.