A method of managing a queue and a communication node that may maintain state information for each flow of a corresponding node, may estimate a time of arrival of each packet of each flow based on flow information that is received from other communication nodes within a collision range and that includes the number of flows and the state information, and may determine dropping and queue scheduling associated with the packets based on the estimated time of arrival (ETA).

A computer implemented method, apparatus, and computer usable program code for processing data packets. A set of data fragments are received at the data processing system to form a set of received data fragments. Assembly of the set of data fragments is initiated into a data packet, and a determination as to whether the data packet is an incomplete data packet. Responsive to a determination that the data packet is an incomplete data packet, the incomplete data packet is filled with at least one character to form a final data packet. The final data packet is forwarded to the target.

Conventional packet network nodes react to congestion in the packet network by dropping packets in a manner which is perceived by users to be indiscriminate. In embodiments of the invention, indiscriminate packet discards are prevented by causing packets to be discarded on lower priority flows and flow aggregates. Further action is taken to reduce the likelihood of packet discards. When an aggregate set of flows raises a congestion alarm, action is taken to try to increase aggregate capacity by excising capacity from pre-assigned donor aggregates. A donor aggregate may be carrying flows, for example, classified as best effort. Another type of donor capacity is donor re-assignable unused capacity. Aggregates may have capacity added either up to a defined limit or, temporarily, exceeding any limit provided there is free capacity available, but removable back to the defined limit when other aggregates need increased capacity and are below their defined limits.

Congestion in respect to a network element operable to forward data items in a telecommunications networks, and in respect to a processing element operable to process requests for service is signaled. In either, the element is operable to perform its processing function at up to a processing rate which is subject to variation, and has a queue for items awaiting processing having a counter associated therewith which maintains a count from which a queue metric is derivable. A method comprises: updating the count at a rate dependent on the processing rate; further updating the count in response to receipt of items awaiting processing; and signalling a measure of congestion in respect of the element in dependence on the queue metric; then altering the rate at which the count is being updated and adjusting the counter whereby to cause a change in the queue metric if the processing rate has changed.

Methods, computer-readable media, and systems for up hole transmission of well data based on bandwidth are described. A down hole type data transmission tool includes an input device to receive data from a well tool. The tool includes a processor to determine that sufficient bandwidth is unavailable to transmit all of the received data up hole to a data receiving device in real time, and, responsively, divide the data into a portion to be transmitted up hole in real time and a remainder to be transmitted later. The remainder can be buffered in a memory and transmitted at a later time, for example, when sufficient bandwidth is available.

In one embodiment, when an ingress provider edge (PE) device of a computer network domain receives a frame at the ingress PE device destined to a destination media access control (MAC) address, it can determine whether the frame was received on a root or leaf Ethernet ingress segment, and also whether the destination MAC address is located via a root or leaf Ethernet segment. Accordingly, the ingress PE device may either drop or forward the frame based on the ingress Ethernet segment and destination MAC address Ethernet segment being either a root or a leaf, respectively.

An example system in accordance with an aspect of the present disclosure includes an inspection engine and a forwarding engine. The inspection engine is to identify whether a tunneled network packet is associated with the multicast group address and a VNI that is contained in the mapping table. The forwarding engine is to forward or discard the packet in response to whether the VNI is contained in the mapping table.

A determination method executed by a processor included in a device configured to receive a plurality of copied packets, the determination method includes receiving a first copied packet that is a copy of a first packet including an identifier and session information; determining that the first copied packet is a duplicate packet when information of the identifier is stored in a memory; storing the information of the identifier in the memory when the information of the identifier is not stored in the memory; and deleting the information of the identifier stored in the memory when a second copied packet that is a copy of a second packet that includes session information indicating a session that is the same as a session indicated by the session information included in the first packet, a communication direction of the second packet being opposite to a communication direction of the first packet, is received.

A network element of a software-defined networking (SDN) system forwards IP packet fragments without reassembly is disclosed. The network element receives an IP packet fragment and determines whether the fragment is the first fragment of an original IP packet. If the fragment is the first fragment, then fields in the first fragment that are associated with open systems interconnection layers (OSI) 4-7 are retrieved and placed in an entry in a fragment information table so that the entry is associated with the original IP packet. If the received fragment is not the first fragment, then a matching entry in the fragment information table is to be identified and the associated OSI layers 4-7 information is retrieved for processing the non-first fragment.

A switch receives a data packet containing training information. The switch learns a classifier based on the training information in the data packet, the classifier useable to classify data into at least one category.