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.

A network element (NE) comprising a receiver configured to receive a flow configuration message from a network controller via an information centric network (ICN), wherein the flow configuration message comprises a flow entry that identifies a flow in the ICN, wherein the flow is associated with a name of an application data object, and wherein the flow entry comprises a forwarding path associated with an application corresponding to the application data object name, and receive a packet, via the ICN, comprising the application data object name, a processor coupled to the receiver and configured to select the flow entry from a flow table based on the packet's application data object name, and a transmitter coupled to the processor and configured to forward the packet along the forwarding path in the selected flow entry.

The present invention provides a data packet routing method and device. When a Switch receives, form an SE, a traffic flow on which service processing is performed, the Switch can determine a forwarding rule of a corresponding service chain according to the traffic flow received from the SE, and route, according to the forwarding rule, a data packet received from the SE. Compared with a case in the prior art in which an SPC needs to deliver a forwarding rule corresponding to each traffic flow to a Switch, the embodiments of the present invention adopt the technical solutions in which the SPC only needs to deliver a forwarding rule corresponding to each service chain to the Switch, thereby reducing signaling interaction between the SPC and the Switch and saving a network overhead.

Multiple TCP/IP stack processors on a host. The multiple TCP/IP stack processors are provided independently of TCP/IP stack processors implemented by virtual machines on the host. The TCP/IP stack processors provide multiple different default gateway addresses for use with multiple processes. The default gateway addresses allow a service to communicate across an L3 network. Processes outside of virtual machines that utilize the TCP/IP stack processor on a first host can benefit from using their own gateway, and communicate with their peer process on a second host, regardless of whether the second host is located within the same subnet or a different subnet. The multiple TCP/IP stack processors can use separately allocated resources. Separate TCP/IP stack processors can be provided for each of multiple tenants on the host. Separate loopback interfaces of multiple TCP/IP stack processors can be used to create separate containment for separate sets of processes on a host.

Some embodiments provide a method for determining a router identifier for a centralized routing component of a logical router. The method determines that a dynamic routing protocol is enabled for the centralized routing component. When a router identifier was previously stored for the centralized routing component, the method assigns the stored router identifier as the router identifier for the centralized routing component only when the stored router identifier matches one of a set of valid addresses for the centralized routing component. When the centralized routing component does not have a previously stored router identifier that matches one of the set of valid addresses, the method assigns one of the set of valid addresses as the router identifier for the centralized routing component according to a hierarchy among the set of valid addresses.

A communication system includes a control device configured to calculate a packet forwarding path and set a flow based on the packet forwarding path in a node, and a plurality of nodes configured to forward a received packet based on a flow set by the control device. The control device, when receiving a detour instruction, calculates a new packet forwarding path which detours a detour target node and sets a flow based on the new packet forwarding path in the plurality of nodes on the new packet forwarding path.

A communication system of a vehicle receives data in wireless vehicle-to-surroundings. The communication system includes multiple control devices. A receiving control device receives data from objects located in the surroundings of the vehicle, and a communication stack is processed during reception. In order for the data to be expediently and effectively acquired, the received data is sorted into at least two classes of relevance and is further processed in the communication stack according to the class of relevance.

Improved path management techniques for storage networks are described. In one embodiment, for example, an apparatus may comprise a processor circuit, a detection component for execution by the processor circuit to receive an advertisement of a set of paths for accessing a logical storage volume and determine whether the set of paths comprises an optimized path, and a modification component for execution by the processor circuit to, when the set of paths does not comprise an optimized path, send a first instruction to update a reporting nodes parameter for the logical storage volume to identify an owner node for the logical storage volume and a corresponding partner node. Other embodiments are described and claimed.

A control apparatus, includes a first unit configured to be capable of specifying an identification rule to identify a packet based on a user of a virtual network including a plurality of virtual nodes; and a second unit configured to be capable of sending an instruction to a physical node corresponding to each of the virtual nodes of the virtual network, wherein each of the virtual nodes includes a predetermined network function being capable of providing a first packet operation to the packet, wherein the instruction includes that the physical node provides a second packet operation to the packet so as to emulate the first packet operation.

The present invention provides a path computation method, a Path Computation Element (PCE), a node device, and a network system. The method includes: receiving a path computation request message (S201), where the path computation request message carries a network type identifier and traffic parameter constraint conditions of a path required to be computed, and the network type identifier indicates a type of a network where the path required to be computed locates; determining the network through the network type identifier, and computing the path in the network according to the traffic parameter constraint conditions (S202); and sending a path computation response message (S203), where the path computation response message carries the computed path. The problem of distinguishing and computing Traffic Engineer (TE) paths for various types of services in a multi-region convergence network is solved.