Techniques for providing closed-loop control and predictive analytics in packet-optical networks are described. For example, an integrated, centralized controller provides tightly-integrated, closed-loop control over switching and routing services and the underling optical transport system of a communication network. In one implementation, the controller includes an analytics engine that applies predictable analytics to real-time status information received from a monitoring subsystem distributed throughout the underlying optical transport system. Responsive to the status information, the analytics engine applies rules to adaptively and proactively identify current or predicted topology-changing events and, responsive to those events, maps reroutes packet flows through a routing/switching network and control and, based on any updated bandwidth requirements due to topology changes, dynamically adjusts allocation and utilization of the optical spectrum and wavelengths within the underlying optical transport system.

Systems and methods for bandwidth optimization in a network include monitoring a state of the network, wherein the network is a connection-oriented network; utilizing analytics based on the monitoring to predict trends, create triggers, and determine updates to policy associated with the network; and performing bandwidth optimization on one or more connections based on the trends, the triggers, and the policy, wherein each of the one or more connections has one or more of a Wave Division Multiplexing (WDM) component, a Time Division Multiplexing (TDM) component, and a packet component, and wherein the bandwidth optimization finds the one or more connections with inefficient resource usages and moves the one or more connections, in one or more of time and space, to more optimal paths.

Methods and systems for identifying the amount of a network's traffic that is attributable to each service running over the network. The method comprises generating a set of candidate demand vectors (each candidate demand vector comprising a predicted bandwidth value for each service) from the topology of the network, bandwidth utilization information for the network and routing information for the network; evaluating each of the candidate demand vectors against the bandwidth utilization information; and, determining if a stop condition is satisfied. If the stop condition is not satisfied then the set of candidate demand vectors is evolved. If, however, the stop condition is satisfied then the best candidate demand vector based on the evaluation is selected and output as the demand vector for the services.

The present disclosure provides a method and apparatus for learning a MAC address of a TRILL network. The method comprises: learning, by a routing bridge connected to an end system, a MAC address of the end system; encapsulating the MAC address in a link-state packet, sending the link-state packet to a neighbor routing bridge; after the neighbor routing bridge receives the link-state packet, judging whether the MAC address in the link-state packet is locally present; if not, learning the MAC address in the link-state packet and setting a local confidence to a confidence of the MAC address in the link-state packet; if yes, updating a confidence of a local MAC address to the confidence of the MAC address in the link-state packet, increasing the confidence of the MAC address in the link-state packet by 1, and sending the link-state packet to all neighbor routing bridges except a receiving end.

The breadth-first search (BFS) starts with a root node. In the first stage, all neighbors of the root node are discovered and added to the nodes frontier. In the following stages, unvisited nodes from the neighbors of the frontier nodes are discovered and added to the frontier. To improve the parallelization of the BFS, the bottom-up search iterates over all unvisited nodes, where each unvisited node searches for its visited neighbors. Communication between nodes and clusters is pipelined with the execution of the BFS.

A method of causing a computer to execute: classifying, based on topology for indicating connection relationships among a data-provision apparatus, distribution-destination apparatuses corresponding to distribution destinations of distribution targets, and relay apparatuses configured to relay communications between the data-provision apparatus and the distribution-destination apparatuses, the mutual distribution-destination apparatuses; identifying a first distribution-destination apparatus having a highest communication speed of a directly connected link among the distribution-destination apparatuses belonging to the group; and creating a distribution schedule of the data in a manner that the data is transmitted from the data-provision apparatus to the first distribution-destination apparatus in the same group, and next, the data is transmitted from the first distribution-destination apparatus to a second distribution-destination apparatus other than the first distribution-destination apparatus in the group.

Various systems and methods for using strict path forwarding. For example, one method involves receiving an advertisement at a node. The advertisement includes a segment identifier (SID). In response to receiving the advertisement, the node determines whether the SID is a strict SID or not. If the SID is a strict SID, the node generates information, such as forwarding information, that indicates how to forward packets along a strict shortest path corresponding to the strict SID.

A method for connecting, by a central control unit (CCU), a booting switch to a network. The network includes switches controlled by the CCU using control data packets that are transmitted via communications paths in the network. User packets are transmitted through the network using the same communications paths. A switch uses forwarding rules stored in a pipeline to forward packets in the network. A local port in each switch provides access to the pipeline. The paths in the network for the control data packets are established by storing forwarding rules configured by the CCU in the pipelines of the switches. At least one switch contains a connecting port via which the booting switch is connected to the network. The forwarding rules in the booting switch are stored by the CCU using a temporary path, which contains the existing path and a connecting path.

A method and apparatus are described for negotiating “keep-alive” message frequencies of applications running on a wireless transmit/receive unit (WTRU). A node may include a negotiation and synchronization function (NSF) configured to collect information including frequencies of keep-alive messages required by application servers for different applications running on the WTRU, and send a keep-alive message frequency negotiation request message to the application servers to negotiate for a more proper frequency for each application on behalf of the WTRU. The node may further include a buffering and caching function (BCF) configured to cache and buffer application specific attributes including an indication of whether each of the applications needs to send periodic keep-alive messages to an associated application server. The node may be a packet data network gateway, a negotiation and caching gateway, or a serving gateway.

Disclosed are a method, device, and computer storage medium for implementing IP address advertisement. An advertisement for controlling LSA11 and an advertisement control switch for flooding are added into a router. The router performs, according to a state indicated by the advertisement control switch, IP address advertisement or flooding for LSA11 encapsulated with an IP address.