This application provides a dynamic bandwidth allocation method and a related device. The method includes: receiving, by a dynamic bandwidth allocation device, bandwidth request messages from bandwidth request devices through at least two access ports of a convergence device, wherein the bandwidth request messages include requested bandwidth information; allocating bandwidth information to the bandwidth request device based on the requested bandwidth information and remaining bandwidth information of an upstream egress port of the convergence device, wherein the remaining bandwidth information is a difference between limited bandwidth information of the upstream egress port and bandwidth information already allocated; and sending a response message to the bandwidth request device through the access port.

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.

Methods for dynamic routing of queued network-based communications using real-time information and machine learning are performed by systems and devices. Requests associated with fulfillments are received over a network from requestor systems, and the requests are queued in a data structure of a queue. Information that includes geolocation information from a user device of a user that is associated with the fulfillment, temporal information from the user device, or related request information associated with another request is then received over the network, and a fulfiller and a fulfillment time for the fulfillment are determined from the information. The request is provided from the queue to the fulfiller at the fulfillment time over the network.

A flow table management system can include a hardware memory module communicatively coupled to a network interface card. The hardware memory module is configured to store a flow table including a plurality of network flow entries. The network interface card further includes a flow table age cache configured to store a set of recently active network flows and a flow table management module configured to manage a duration for which respective network flow entries in the flow table stored in the hardware memory module remain in the flow table using the flow table age cache. In some implementations, age information about each respective flow in the flow table is stored in the hardware memory module in an age state table that is separate from the flow table.

Examples relate to apparatuses, methods, and computer programs for a remote unit and a central unit of an optical line terminal. In particular, a central unit apparatus for an optical line terminal comprises one or more interfaces configured to communicate with one or more remote unit apparatuses via one or more communication links. The apparatus further comprises a processor configured to receive information on one or more upstream reports from the remote unit apparatuses, the upstream reports relate to one or more optical networks used by the remote unit apparatuses to communicate with a plurality of optical network users. The processor further determines information on bandwidth assignments for the plurality of optical network users based on the information on the one or more upstream reports and transmits the information on bandwidth assignments to the one or more remote unit apparatuses.

A method for joint optimization of resource allocation includes: obtaining network data volumes of two services; obtaining queue statuses at a time t; computing sub-channel slices; computing a local CPU speed scaling, a user association, a sub-carrier assignment, and a power allocation of service 1; computing a user association, a video quality decision, and a sub-carrier assignment of service 2; obtaining an initial sub-carrier assignment and an initial power allocation; obtaining the user association; obtaining the power allocation and the sub-carrier assignment of service 1; obtaining the video quality decision; obtaining the sub-carrier assignment of service 2; obtaining an optimal data transmission rate and the user association to obtain a data rate allocation; and obtaining an optimal CPU speed scaling, an optimal user association, an optimal sub-carrier assignment, an optimal power allocation, an optimal video quality decision and an optimal sub-channel allocation.

Embodiments described herein relate to techniques for distributing shaped subinterfaces among physical interfaces of a port channel. Such techniques include receiving a request to configure a shape rate for a port channel subinterface; generating a physical interface set specifying: a first physical interface and a first allocated bandwidth associated with the first physical interface; and a second physical interface and a second allocated bandwidth associated with the second physical interface; making a selection, using the physical interface set, of the first physical interface based on the first allocated bandwidth being lesser than the second allocated bandwidth; assigning the first physical interface as a first anchor interface for the first port channel subinterface; and adding the first shape rate to the first allocated bandwidth to obtain a first new allocated bandwidth for the first physical interface.

Packets are differentiated based on their traffic class. A traffic class is allocated bandwidth for transmission. One or more core or thread can be allocated to process packets of a traffic class for transmission based on allocated bandwidth for that traffic class. If multiple traffic classes are allocated bandwidth, and a traffic class underutilizes allocated bandwidth or a traffic class is allocated insufficient bandwidth, then allocated bandwidth can be adjusted for a future transmission time slot. For example, a higher priority traffic class with excess bandwidth can share the excess bandwidth with a next highest priority traffic class for use to allocate packets for transmission for the same time slot. In the same or another example, bandwidth allocated to a traffic class depends on an extent of insufficient allocation or underutilization of allocated bandwidth such that a traffic class with insufficient allocated bandwidth in one or more prior time slot can be provided more bandwidth in a current time slot and a traffic class with underutilization of allocated bandwidth can be provided with less allocated bandwidth for a current time slot.

The present disclosure provides a message forwarding method, including: receiving a target message from an upstream device, the target message carrying first timeslot information including a first timeslot length and a first timeslot identifier; determining a second timeslot length and a second timeslot identifier according to the first timeslot length and the first timeslot identifier; and in response to that a preset waiting time elapses after the target message enters a cache queue corresponding to the second timeslot length and the second timeslot identifier, forwarding the target message. The present disclosure further provides a message forwarding device, and a computer-readable medium.

A network device may receive packets and may calculate, during a time interval, an arrival rate and a departure rate, of the packets, at one of multiple virtual output queues. The network device may calculate a current oversubscription factor based on the arrival rate and the departure rate, and may calculate a target oversubscription factor based on an average of previous oversubscription factors associated with the multiple virtual output queues. The network device may determine whether a difference exists between the target oversubscription factor and the current oversubscription factor and may calculate, when the difference exists, a scale factor based on the current oversubscription factor and the target oversubscription factor. The network device may calculate new scheduling weights based on prior scheduling weights and the scale factor, and may process packets received by the multiple virtual output queues based on the new scheduling weights.