Methods and systems for managing data transmissions are disclosed. An example method can comprise determining a plurality of time allocations for a time cycle. The plurality of time allocations can comprise a first time allocation which can be determined based on an information rate, a committed information rate, an excess information rate, an effective bandwidth rate, other factors, or a combination thereof. Data can be received from multiple sources into a buffer, for example, and can be processed within a time cycle if processing the data will not exceed the time allocation.

Methods, systems, and devices for wireless communications are described. Some methods include receiving an indication of a traffic flow to be served by a wireless communication system, determining scheduling information for the traffic flow based on the indication, wherein the scheduling information comprises one or more of a time offset, a reliability, and a minimum throughput of delivery of data traffic for the flow, and transmitting the scheduling information in response to the indication. Some methods include determining delta time offset information relative to one or more existing time offsets of packet arrivals of one or more traffic flows for scheduling transmissions of a first traffic flow in the wireless communication system, and transmitting the delta time offset information to a node of the first traffic flow for scheduling transmissions of the first traffic flow in the wireless communication system. Other aspects and features are also claimed and described.

Various example embodiments for supporting packet scheduling in packet networks are presented. Various example embodiments for supporting packet scheduling in packet networks may be configured to support scheduling-as-a-service. Various example embodiments for supporting packet scheduling in packet networks based on scheduling-as-a-service may be configured to support a virtualized packet scheduler which may be provided as a service over a general-purpose hardware platform, may be instantiated in customer hardware, or the like, as well as various combinations thereof. Various example embodiments for supporting packet scheduling in packet networks may be configured to support scheduling of packets of packet queues based on association of transmission credits with timeslots of a periodic service sequence used to provide service to the packet queues.

In one embodiment, a method includes monitoring, by a control loop including a processor and a memory, a first environment. The control loop includes one or more predetermined control loop parameters. The method also includes receiving, by the control loop and in response to monitoring the first environment, first data from the first environment and receiving, by the control loop, information from an adaptation control loop. The method also includes determining, by the control loop, to automatically adjust at least one of the one or more predetermined control loop parameters based at least in part on the information received from the adaptation control loop and automatically adjusting, by the control loop, the one or more predetermined control loop parameters. The method further includes determining, by the control loop, to initiate an action based on the first data collected from the first environment and the one or more adjusted control loop parameters.

An apparatus includes a network interface for connection to a network and a database configured to store traffic shaping parameters for a traffic shaping scheme for a plurality of classes of data packets. A database loading circuit is configured to obtain the traffic shaping parameters from in-band communication received in a data packet by the network interface and load the traffic shaping parameters into the database. One or more traffic shapers are configured to access the traffic shaping parameters in the database and apply the traffic shaping scheme according to the traffic shaping parameters to the plurality of classes of data packets received by the network interface.

A system and method for managing shared memory packet buffers is disclosed. In some embodiments, the system is configured to receive and classify a packet as one of: network-network, network-host, host-network, or host-host; select a minimum guarantee space for the packet according to the classification thereof; if the selected minimum guarantee space is available, store the packet therein; otherwise, if a dedicated shared space is available, store the packet therein; otherwise, if a global shared space is available, store the packet therein; and otherwise, drop the packet.

Embodiments of this application provide a network flow control method and a network device. The method includes: receiving a packet flow; determining, based on a service type of the packet flow, a service pipeline used for transmitting the packet flow, where service types of all packet flows in the service pipeline are the same; and based on a bandwidth weight allocated to the service type, transferring the packet flow in the service pipeline to a physical port. In the embodiments of this application, packet flows are allocated to different service pipelines based on a service type, and bandwidth weights are allocated, in a centralized manner, to service pipelines that carry a same service type.

Methods to strengthen the cyber-security and privacy in a proposed deterministic Internet of Things (IoT) network are described. The proposed deterministic IoT consists of a network of simple deterministic packet switches under the control of a low-complexity ‘Software Defined Networking’ (SDN) control-plane. The network can transport ‘Deterministic Traffic Flows’ (DTFs), where each DTF has a source node, a destination node, a fixed path through the network, and a deterministic or guaranteed rate of transmission. The SDN control-plane can configure millions of distinct interference-free ‘Deterministic Virtual Networks’ DVNs) into the IoT, where each DVN is a collection of interference-free DTFs. The SDN control-plane can configure each deterministic packet switch to store several deterministic periodic schedules, defined for a scheduling-frame which comprises F time-slots. The schedules of a network determine which DTFs are authorized to transmit data over each fiber-optic link of the network. These schedules also ensure that each DTF will receive a deterministic rate of transmission through every switch it traverses, with full immunity to congestion, interference and Denial-of-Service (DoS) attacks.

Various example embodiments for supporting scalable deterministic services in packet networks are presented. Various example embodiments for supporting scalable deterministic services in packet networks may be configured to support delay guarantees (e.g., finite end-to-end delay bounds) for a class of traffic flows referred to as guaranteed-delay (GD) traffic flows. Various example embodiments for supporting scalable deterministic services in packet networks may be configured to support delay guarantees for GD traffic flows of a network based on a queuing arrangement that is based on network outputs of the network, a packet scheduling method that is configured to support scheduling of packets of the GD traffic flows, and a service rate allocation rule configured to support delay guarantees for the GD traffic flows.

A time synchronization maintenance method includes determining, by a node of a mesh communication network, a transmission time to transmit data in a transmission queue. The method also includes determining, by the node, an amount of time until commencement of a next beacon signal slot used to transmit a time synchronization beacon signal from the node or another node of the mesh communication network. Further, when the transmission time is greater than the amount of time until commencement of the next beacon signal slot, the method includes delaying transmission, by the node, of at least a portion of the data in the transmission queue until completion of the next beacon signal slot.