A method may include obtaining packet handling rules from network nodes in a network. The method also includes, using the rules, generating a transitive reduction of a partially ordered set of elements, where the elements correspond to match conditions in the rules, each match condition representing a set of packets identified by packet headers. The method may also include generating packet equivalence classes (PECs) by removing children elements from a parent element in the transitive reduction, where each PEC covers disjoint sets of packets, and each PEC is identified by fields in the packet headers including source address, destination address, and protocol of packets. The PECs may represent a group of packets treated in a same manner in the network. The method may also include generating a graph representation of the network nodes utilizing the PECs, and, using the graph representation, verifying properties of operation of the network.

Some embodiments are associated with multi-tenant software defined data center network traffic management. A data center computing system may calculate a first value for a first traffic flow, associated with a first user, using a dynamic, distributed, and substantially real-time model. The system may calculate a second value for to a second traffic flow, associated with a second user, using the dynamic, distributed, and substantially real-time model. The system may then dynamically allocate network resources to the first and second traffic flows based on the first and second priorities. Some embodiments may establish a plurality of network device queues and perform queue selection for optimization. According to some embodiments, the first user may be categorized as a premium user while the second user is categorized as an enterprise user.

A communication system includes a subscriber network unit and a communication device provided in an accommodating station. The subscriber network unit includes an acquisition unit that acquires uplink data from one or more lower-layer devices. The communication device includes: a data processing unit that acquires the uplink data from the subscriber network unit using a band of uplink communication and executes data processing on the acquired uplink data; a policy determination unit that determines a policy of band allocation of the uplink communication on the basis of the result of the data processing; and an allocation control unit that allocates the band of the uplink communication to the subscriber network unit on the basis of the policy.

A network device, associated with peer network devices, may receive policy information for a protocol; and compute a first update message based on information regarding a route associated with the policy information. The network device may determine that an upper utilization threshold for one or more of peer queues, associated with the peer network devices, is not satisfied; and write the first update message to the peer queues based on determining that the upper utilization threshold is not satisfied. The network device may compute a second update message based on the information regarding the route; determine that the upper utilization threshold for one or more of the peer queues is satisfied; and pause writing the second update message to the peer queues based on the upper utilization threshold being satisfied. The network device may permit the peer network devices to obtain data from corresponding ones of the peer queues.

Examples herein relate to allocation of an intermediate queue to a flow or traffic class (or other allocation) of packets prior to transmission to a network. Various types of intermediate queues are available for selection. An intermediate queue can be shallow and have an associated throughput that attempts to meet or exceed latency guarantees for a packet flow or traffic class. Another intermediate queue is larger in size and expandable and can be used for packets that are sensitive to egress port incast such as latency sensitive packets. Yet another intermediate queue is expandable but provides no guarantee on maximum end-to-end latency and can be used for packets where dropping is to be avoided. Intermediate queues can be deallocated after a flow or traffic class ends and related memory space can be used for another intermediate queue.

Aspects of the disclosure are directed to a high performance connection scheduler for reliable transport protocols in data center networking. The connection scheduler can handle enqueue events, dequeue events, and update events. The connection scheduler can include a connection queue, scheduling queue, and quality of service arbiter to support scheduling a large number of connections at a high rate.

In an embodiment, an apparatus is provided that may include an integrated circuit including switch circuitry to determine, at least in part, an action to be executed3 involving a packet. This determination may be based, at least in part, upon flow information determined, at least in part, from the packet, and packet processing policy information. The circuitry may examine the policy information to determine whether a previously-established packet processing policy has been established that corresponds, at least in part, to the flow information. If the circuitry determines, at least in part, that the policy has not been established and the packet is a first packet in a flow corresponding at least in part to the flow information, the switch circuitry may request that at least one switch control program module establish, at least in part, a new packet processing policy corresponding, at least in part, to the flow information.

A queue management method, system, and recording medium include a queue examining device configured to examine a reverse flow queue from a forwarder for an acknowledged packet and a dropping device configured to drop a packet in a forward flow queue if the packet in the forward flow queue includes the acknowledged packet in the reverse flow queue.

Implementations of the disclosure provide for queuing portions of the network traffic directed to a migrated guest for both receiving and transmitting at a source of the migration. In one implementation, a method is provided. The method comprises receiving, by a processing device via a network interface card (NIC), a first data packet. The first data packet includes a network address associated with a virtual machine (VM) that migrates from a first host to a second host. The first data packet is queued in a memory buffer at the first host in view of the network address. An indication that the network address of the VM is associated with the second host is received. Thereupon, the method causes the NIC to transmit the first data packet from the memory buffer over a network associated with the VM at the second host.

Aspects of the disclosure are directed to a high performance connection scheduler for reliable transport protocols in data center networking. The connection scheduler can handle enqueue events, dequeue events, and update events. The connection scheduler can include a connection queue, scheduling queue, and quality of service arbiter to support scheduling a large number of connections at a high rate.