A system provisions global logical entities that facilitate the operation of logical networks that span two or more datacenters. These global logical entities include global logical switches that provide L2 switching as well as global routers that provide L3 routing among network nodes in multiple datacenters. The global logical entities operate along side local logical entities that are for operating logical networks that are local within a datacenter.

A first switch in a MPLS network receives a plurality of packets. The plurality of packets are part of a pair of flows. The first switch performs a packet prediction learning algorithm on the first plurality of packets and generates packet prediction information. The first switch communicates the packet prediction information to a Network Operation Center (NOC). In response, the NOC communicates the packet prediction information to a second switch within the MPLS network utilizing OpenFlow messaging. In a first example, the NOC communicates a packet prediction control signal to the second switch. In a second example, a packet prediction control signal is not communicated. In the first example, based on the packet prediction control signal, the second switch determines if it will utilize the packet prediction information. In the second example, the second switch independently determines if the packet prediction information is to be used.

A method for synchronizing topology information in a service function chain (SFC) network, where the SFC network includes at least one classifier (CF) and at least one service function forwarder (SFF). The method includes that a first network element in the at least two routing network elements establishes a Border Gateway Protocol (BGP) connection to at least one second network element other than the first network element in the at least two routing network elements, where the first network element is any one of the at least two routing network elements, and the first network element sends a first BGP update message to the at least one second network element, where the first BGP update message includes topology information of the first network element such that the at least one second network element obtains the topology information of the first network element.

The disclosure describes a data enqueuing method. The method may include: receiving a to-be-enqueued data packet, dividing the data packet into several slices to obtain slice information of the slices, and marking a tail slice of the data packet with a tail slice identifier; enqueuing corresponding slice information according to an order of the slices in the data packet, and in a process of enqueuing the corresponding slice information, if a slice is marked with the tail slice identifier, determining that the slice is the tail slice of the data packet, and generating a first-type node; and determining whether a target queue is empty, and if the target queue is empty, writing slice information of the tail slice into the target queue, and updating a head pointer of a queue head list according to the first-type node.

Some embodiments provide a method for a particular forwarding element (FE) in a network of FEs. The method receives a packet at the particular FE. The packet includes a packet header that includes, for each of multiple FEs along a path from a source of the packet to a destination of the packet, (i) an identifier for the FE and (ii) a set of one or more actions for the FE to perform on the packet. The method parses the packet header to identify the set of actions for the particular FE. The method performs the identified set of actions.

A computer-implemented method of generating an integrated circuit design comprises: using a computer, detecting communication paths between data handling nodes, the data handling nodes comprising data source nodes, data sink nodes and data routing nodes operating according to respective power domains, clock domains and data traffic parameters, in a network of the data handling nodes; using the computer, for a given communication path in a direction of data flow from a data source node to a data sink node, for each given data routing node in the given communication path to which data is communicated in the direction of data flow by a set of one or more other data handling nodes, to perform the following steps: (i) detecting a power domain and data traffic parameters of each data handling node of the set of one or more other data handling nodes communicating data to said each given data routing node; (ii) assigning a power domain to said each given data routing node in dependence upon the detected power domains and the detected data traffic parameters of the set of one or more other data handling nodes; and (iii) assigning a clock domain to said each given data routing node, from a set of one or more candidate clock domains applicable to the assigned power domain, so that said each given data routing node, operating in the assigned clock domain, provides data routing according to the detected data traffic parameters of at least those of the set of one or more other data handling nodes operating according to the assigned power domain of said each given data routing node.

A determination is made that network access between a virtualized graphics device and a compute instance of a client is to be enabled. A source network address for graphics-related traffic of the compute instance is identified. From a range of source port numbers associated with the source network address, a particular source port number which is unused is found. Routing metadata is transmitted to one or more routing devices indicating that a key based at least in part on (a) the source network address and (b) the particular source port number is to be used to identify a route for network packets from the first application compute instance to a virtualized graphics device.

In some examples, a network device is configured to obtain a set of N paths between a pair of nodes of a network topology model for a network of routers interconnected by a plurality of links in a network topology, where N>2, and configured to, for each label switched path from a plurality of label switched paths to be routed to the network topology: in response to identifying, from the set of N paths, a path for the label switched path that has capacity for a required bandwidth of the label switched path, deduct the required bandwidth of the label switched path from one or more links of the path of the network topology model to modify the network topology model and output data to the network for programming the label switched path in the network on the path; and in response to failing to identify a path for the label switched path from the set of N paths, add the label switched path to a set of failed label switched paths.

A tool for partitioning a switch into one or more logical switches in a distributed system. The tool creates, by one or more computer processors, one or more logical switch routers, based, at least in part, on a user configuration. The tool assigns, by one or more computer processors, based, at least in part, on a user configuration, one or more ports to the one or more logical switch routers. The tool manages, by one or more computer processors, the one or more logical switch routers.

The application disclose a method, an apparatus and a system for controlling routing information advertising, which relates to the field of communications and is used for reducing the configuration complexity and reinforcing the operability. The method includes: receiving, by a control device, first routing information sent by a first forwarding device; wherein the first routing information includes an identifier of the first forwarding device; determining a first routing path according to the identifier of the first forwarding device, an identifier of a second forwarding device and a routing path group; and determining an advertising range of second routing information for the second forwarding device according to the first routing path; for enabling the second forwarding device to advertise the second routing information according to the advertising range of the second routing information.