Systems and methods are disclosed for dynamically adjusting a wait time between packets. The wait time may be increased to improve the packet loss rate. Once increased, the wait time may be decreased if the packet loss rate improves. The packet loss rate is monitored after a predetermined number of packets are sent so that additional adjustments may be made as needed.

One embodiment provides a system that facilitates querying of historical network information. During operation, the system generates a query for historical information associated with interest and content object packets, wherein a name for an interest is a hierarchically structured variable length identifier that includes contiguous name components ordered from a most general level to a most specific level, wherein the query is based on a name prefix that includes one or more contiguous name components. The system transmits the query to a responding entity. In response to receiving the historical information from the responding entity, the system performs an operation that increases network efficiency based on the historical information, thereby facilitating a protocol for querying the historical information to increase network efficiency.

An apparatus for use in a packet-based communication system, comprises an input and an output. The apparatus is configured to receive a stream of data packets, having an inter-packet spacing, and store the received data packets and information representing the inter-packet spacing in a buffer, wherein the data packets are no longer than a common maximum data-packet length. The apparatus is further configured to schedule, at intervals, all the contents of the buffer except for a constant amount, into a respective container of a sequence of containers and, if the container then contains an incomplete data packet, schedule the remainder of the incomplete packet into the container. The apparatus is further configured to send the sequence of containers, wherein the positions of the data packets within the containers depend on the received inter-packet spacing, and wherein the constant amount is equal to or greater than the common maximum data-packet length.

Methods and apparatus for efficient data transfer within a user space network stack. Unlike prior art monolithic networking stacks, the exemplary networking stack architecture described hereinafter includes various components that span multiple domains (both in-kernel, and non-kernel). For example, unlike traditional “socket” based communication, disclosed embodiments can transfer data directly between the kernel and user space domains. Direct transfer reduces the per-byte and per-packet costs relative to socket based communication. A user space networking stack is disclosed that enables extensible, cross-platform-capable, user space control of the networking protocol stack functionality. The user space networking stack facilitates tighter integration between the protocol layers (including TLS) and the application or daemon. Exemplary systems can support multiple networking protocol stack instances (including an in-kernel traditional network stack).

This disclosure provides methods and systems for reducing congestion in RoCEv2 networks. The method is configured to operate large-scale in data centers on traffic flowing from a sender node to a receiver node. The method described has three stages: a fast start stage, a transition stage, and a regulation stage. In the fast start stage, the sender sends data to the receiver at a fast initial rate. This may continue until the receiver observes a congestion event. When this happens, the sender reduces the data transfer rate as the method enters the transition stage. From a reduced rate, the method enters the regulation stage, where the rate is increased using a combination of a feedback control loop and an additive increase multiplicative decrease (AIMD) algorithm.

A system that determines whether a trigger has occurred within a cloud infrastructure. The system, in response to determining that a trigger has occurred, extracts characteristics from one or more virtual network functions (VNFs) of a service chain. The system, in response to extracting characteristics from the one or more VNFs, determines rehoming actions for each of the one or more VNFs. The system, in response to determining rehoming actions, predicts a rehoming delay or a chain downtime for each of the rehoming actions for each of the one or more VNFs. The system determines an optimal rehoming action from the rehoming actions for at least one of the one or more VNFs using the rehoming delay or the chain downtime for each rehoming action of the rehoming actions. The system performs the optimal rehoming action for the at least one of one or more VNFs.

A method for continuously providing an edge computing service to user equipment (UE) by an edge enabler server (EES) of a mobile edge computing (MEC) system is provided, which includes receiving, from a source edge application server (EAS), update information including UE information and source EAS information, wherein the source EAS provides the edge computing service to the UE; retrieving, from an edge configuration server (ECS), target EES information based on the update information; transmitting, to a target EES, the UE information and the EAS information based on the target EES information; receiving, from the target EES, target EAS information; and transferring, to the source EAS, the target EAS information.

A method of managing transport of packets transmitted over a time division multiplexed, TDM, link in a network. The method performed at a second network node comprises: receiving (102) blocks of data from a first network node. Data from one packet is received in a plurality of blocks and a first block from a packet has a time-stamp indicating arrival time of the packet at the first network node. The blocks are multiplexed for transmission over the TDM link. The method also comprises: queuing (106) the received blocks and if a block from the top of the queue (108, 110) has a time-stamp (110—yes) and a maximum allowed latency has been exceeded (112) the method discards (116) blocks containing data from the same packet as the block with said time-stamp if there is at least one block containing data from another packet in the queue (114—yes). An apparatus is also disclosed.

Operations, Administration, and Maintenance (OAM) scaling systems and methods are implemented by a network function performed by one of a physical network element and a virtual network element executed on one or more processors. The OAM scaling method includes providing N packet services, N is an integer; and, responsive to determined OAM session scaling limits, providing OAM sessions for the N packet services in an oversubscribed manner, wherein the determined OAM session scaling limits include M OAM sessions supported by the network function, M is an integer and less than N.

In a general aspect, a network transmission interface can include, within an egress data path, a physical coding sublayer (PCS) operating in a constant bitrate domain for transmitting data frames on a network link; a timestamp unit configured to insert timestamps in payloads of the frames; a transmission media access control (MAC) unit located at a boundary between the constant bitrate domain and a variable bitrate domain, configured to receive the frames at a variable bitrate, encapsulate the frames, and provide the encapsulated frames at a constant bitrate; a MAC layer security unit located downstream from the timestamp unit, configured to sign and optionally encrypt the payloads and expand each frame with a security tag and an integrity check value (ICV). The timestamp unit and the MAC layer security unit (26b) can both operate in the constant bitrate domain.