An example device for retrieving media data includes a memory configured to store media data; and one or more processors implemented in circuitry and configured to: send a request to retrieve media data according to a background data transfer to a media streaming application function (AF); in response to the request, receive an indication of a background data transfer opportunity from the media streaming AF; in response to the indication of the background data transfer opportunity, retrieve the media data according to the background data transfer; and store the retrieved media data to the memory.

A system and a method for traffic management on a network. The method including: determining a desired intent for a network operator's traffic; determining a set of classes for a traffic flow through a link; determining a minimum and target bandwidth for each class in the set of class based on the desired intent; measure user score and bandwidth use for each class; allocate a bandwidth per class based on the minimum and target bandwidth and measured user score; and shape the traffic flow to the allocated bandwidth.

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.

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.

A method and apparatus for transmitting a service flow based on a flexible Ethernet, where a bandwidth resource corresponding to a bundling group (BG) of a flexible Ethernet is divided into M timeslots, service data of a service flow is encapsulated in N timeslots in the M timeslots, and the method includes: when a first PHY in the BG fails, determining, based on a preconfigured first timeslot configuration table (TCT), a target timeslot (TTS) in the N timeslots that is mapped to the first PHY; searching the M timeslots for an idle timeslot (ITS) based on the first TCT; adjusting the first TCT when a quantity of ITSs is greater than or equal to a quantity of TTSs, so that all the N timeslots are mapped to PHYs other than the first PHY; and transmitting the service flow by using the mapped PHYs of the bundling group.

Embodiments of the present application provide a method and apparatus for bandwidth adjustment, an electronic device and a computer-readable storage medium. The method comprise obtaining an overload node; determining whether an overload bandwidth of the overload node is greater than a total available bandwidth amount of all target nodes for the overload node; if not, determining the overload node as a to-be-adjusted node and determining a to-be-adjusted bandwidth amount of the to-be-adjusted node based on the overloaded bandwidth of the overload node; decreasing a total carrying bandwidth amount of the to-be-adjusted node by the to-be-adjusted bandwidth amount corresponding to the to-be-adjusted node, and increasing a total target carrying bandwidth amount of the to-be-adjusted node by the to-be-adjusted bandwidth amount corresponding to the to-be-adjusted node. By applying the method provided by the embodiments of the present application, the bandwidth can be adjusted more accurately.

A first node of a packet switched network transmits at least one flow of protocol data units of a network to at least one output context of one of a plurality of second nodes of the network. The first node includes X virtual output queues (VOQs). The first node receives, from at least one of the second nodes, at least one fair rate record. Each fair rate record corresponds to a particular second node output context and describes a recommended rate of flow to the particular output context. The first node allocates up to X of the VOQs among flows corresponding to i) currently allocated VOQs, and ii) the flows corresponding to the received fair rate records. The first node operates each allocated VOQ according to the corresponding recommended rate of flow until a deallocation condition obtains for the each allocated VOQ.

A method and apparatus for transmitting a service flow based on a flexible Ethernet, where a bandwidth resource corresponding to a bundling group (BG) of a flexible Ethernet is divided into M timeslots, service data of a service flow is encapsulated in N timeslots in the M timeslots, and the method includes: when a first PHY in the BG fails, determining, based on a preconfigured first timeslot configuration table (TCT), a target timeslot (TTS) in the N timeslots that is mapped to the first PHY; searching the M timeslots for an idle timeslot (ITS) based on the first TCT; adjusting the first TCT when a quantity of ITSs is greater than or equal to a quantity of TTSs, so that all the N timeslots are mapped to PHYs other than the first PHY; and transmitting the service flow by using the mapped PHYs of the bundling group.

Various embodiments provide a resource allocation method and an apparatus. In those embodiments, a terminal device obtains a first parameter indicating a maximum service data volume to be provided by an access network device for a first service in a first time length; and determines, based on the maximum service data volume, a resource of a media access control protocol data unit MAC PDU, the resource being occupied by buffered data of the first service. In those embodiments, the terminal device determines, based on the maximum service data volume of the first service, the resource of the MAC PDU. Compared with a conventional method, the maximum service data volume of the first service is considered. This helps improve reasonableness of allocating the resource of the MAC PDU to the data of the first service.

A first node of a packet switched network transmits at least one flow of protocol data units of a network to at least one output context of one of a plurality of second nodes of the network. The first node includes X virtual output queues (VOQs). The first node receives, from at least one of the second nodes, at least one fair rate record. Each fair rate record corresponds to a particular second node output context and describes a recommended rate of flow to the particular output context. The first node allocates up to X of the VOQs among flows corresponding to i) currently allocated VOQs, and ii) the flows corresponding to the received fair rate records. The first node operates each allocated VOQ according to the corresponding recommended rate of flow until a deallocation condition obtains for the each allocated VOQ.