Techniques for identifying service paths for satisfying a service demand in a data communication network are disclosed. Aspects include identifying a plurality of vertices in a communications route cycle, the communications route cycle alternating through the plurality of vertices and a plurality of edges in a sequence; identifying a plurality of internal paths in the communications route cycle, each of the plurality of internal paths is disjoint to the plurality of edges; identifying a first internal path and a second internal path among the plurality of internal paths as a crossing pair of internal paths; detecting a failure of at least two edges among the plurality of edges; and identifying, based on the communications route cycle and the identified crossing pair of internal paths, a service path that satisfies the service demand in response to detecting the failure of the at least two edges.

An object is to provide an operation management apparatus, a method, and a program capable of predicting, when a service providing apparatus for providing services to users stops its operation for a predetermined time, effects on the services. An operation management apparatus according to the present disclosure includes an acquisition unit configured to acquire stop information indicating that a predetermined apparatus stops its operation for a predetermined time, and a specification unit configured to specify communication route information containing the predetermined apparatus from communication list information as specified communication route information, the communication list information including a plurality of pieces of communication route information in which communication transmission-source apparatus information, in-route apparatus information, transmission-destination apparatus information, and a communication allowable time are associated with each other.

Systems and techniques, including special messages and state machines, are described that configures an intermediate site to dynamically trigger creation of and removal of a dynamic conduit between two sites based on usage that is tracked at the sites. The intermediate site providing WAN-to-WAN forwarding between the two sites, monitors throughput statistics on each local WAN link (LWL) associated with the two sites. If traffic between the two sites passes a configured first threshold or if LWL usage passes a configured second threshold, the intermediate site sends a message to the two sites to set up a dynamic conduit directly coupling the two sites. Busy lists are used to keep track of eligible site pairs. Once a dynamic conduit is set up between two sites, a grow technique tests the dynamic conduit increasing communication flows between the two sites each configured sampling period before putting the conduit in normal use.

Techniques for inter-switch link (ISL) identification and monitoring are described herein. An aspect includes sending a query fabric path command to a switch, the query fabric path command including an origin address and a destination address. Another aspect includes receiving a query fabric path response from the switch based on the query fabric path command, the query fabric path response including a plurality of port identifiers. Another aspect includes monitoring a plurality of ports, each of the plurality of ports corresponding to a respective port identifier of the plurality of port identifiers in the query fabric path response.

Techniques for identifying service paths for satisfying a service demand in a data communication network are disclosed. Aspects include identifying a plurality of vertices in a communications route cycle, the communications route cycle alternating through the plurality of vertices and a plurality of edges in a sequence; identifying a plurality of internal paths in the communications route cycle, each of the plurality of internal paths is disjoint to the plurality of edges; identifying a first internal path and a second internal path among the plurality of internal paths as a crossing pair of internal paths; detecting a failure of at least two edges among the plurality of edges; and identifying, based on the communications route cycle and the identified crossing pair of internal paths, a service path that satisfies the service demand in response to detecting the failure of the at least two edges.

Systems and techniques are described for a path maximum transmission unit (MTU) discovery method that allows the sender of IP packets to discover the MTU of packets that it is sending over a conduit to a given destination. The MTU is the largest packet that can be sent through the network along a path without requiring fragmentation. The path MTU discovery method actively probes each sending path of each conduit with fragmentation enabled to determine a current MTU and accordingly increase or decrease the conduit MTU. The path MTU discovery process is resilient to errors and supports retransmission if packets are lost in the discovery process. The path MTU discovery process is dynamically adjusted at a periodic rate to adjust to varying network conditions.

Systems, methods, and devices for encoding and decoding a packet buffer for data exchange over a communications network, including parsing a data container definition file to determine a packet format; generating a code file based on the data container definition file; inserting the code file into a source tree of an application; compiling the source tree to generate an executable file; and executing the executable on a computing device in communication with the communications network, wherein the executable file encodes and decodes the packet buffer for data exchange over the communications network.

A method and system for a first node to transmit packets to a second none, comprising receiving a packet from a local area network (LAN) interface, inspecting the packet; determining whether the packet satisfies at least one packet condition; transmitting the packet through a predefined tunnel if the packet satisfies the at least one packet condition; transmitting the packet through a second tunnel if the packet does not satisfy the at least one packet condition. The predefined tunnel is a first tunnel and is established before the packet is received by the first node. The second tunnel belongs to a first tunnel group or a second tunnel group. The first tunnel, the second tunnel and other tunnels may together form an aggregated connection. Further, the use of predefined tunnel may be based on whether the packets satisfy a session condition.

Systems and techniques, including special messages and state machines, are described that configures an intermediate site to dynamically trigger creation of and removal of a dynamic conduit between two sites based on usage that is tracked at the sites. The intermediate site providing WAN-to-WAN forwarding between the two sites, monitors throughput statistics on each local WAN link (LWL) associated with the two sites. If traffic between the two sites passes a configured first threshold or if LWL usage passes a configured second threshold, the intermediate site sends a message to the two sites to set up a dynamic conduit directly coupling the two sites. Busy lists are used to keep track of eligible site pairs. Once a dynamic conduit is set up between two sites, a grow technique tests the dynamic conduit increasing communication flows between the two sites each configured sampling period before putting the conduit in normal use.

Provided is a machine-implemented method for operating a device in a network, comprising entering the device into a non-router membership relation with a self-organizing subnet of the network; receiving at least one message making known parameters of the subnet, the at least one message comprising a centrally-generated and propagated sequence number; detecting, based on the received at least one message comprising a sequence number, a deterioration in propagation of said at least one message; and responsive to the detecting, entering the device into a router membership relation with the self-organizing subnet of the network.