An interface may be provided between i) a selective forwarding unit (SFU) configured to, in real-time, receive a data stream from a sender via a first network link of a communication network and selectively forward the data stream to one or more receivers via respective second network links, and ii) one or more core network functions (PCF, PCRF, NSMF, CSMF) for establishing service guarantees for data flows in the communication network. In a specific example, the interface may be established as a network function (SMGF) which translates streaming requirements for one-to-many flows coming from WebRTC SFUs into appropriate QoS/network slice configurations, such that the quality of RTC flows may be increased. Accordingly, negative side-effects of conservative congestion control algorithms in WebRTC clients and static/overprovisioned QoS at network operators may be overcome.

An object is to provide a communication apparatus, a communication method, and a program capable of avoiding an increase in network load when input traffic continues to be large and a communication delay when input traffic is very small. A communication apparatus according to the present invention prepares three token buckets and can transfer, discard, or hold a packet in accordance with the amount of tokens in each token bucket. This enables the communication apparatus to operate so as not to exceed a set maximum bandwidth when large traffic is received for the delay guarantee shaping. Further, When the maximum bandwidth is exceeded, the communication apparatus can select whether to discard a packet to prioritize a delay guarantee or to hold a packet to prioritize no loss of packets. Furthermore, the communication apparatus can immediately transmit a packet without increasing a communication delay when input traffic is very small.

Provided are a service flow transmission method and apparatus, a device, and a storage medium. The service flow transmission method includes: acquiring service flows; and performing transmission via different FlexE outgoing interfaces according to priorities of the service flows. By means of determining priorities of service flows, and performing transmission via different FlexE outgoing interfaces according to the priorities of the service flows, mutual interference between service flows can be prevented.

Techniques for orchestrating workloads based on policy to operate in optimal host and/or network proximity in cloud-native environments are described herein. The techniques may include receiving flow data associated with network paths between workloads hosted by a cloud-based network. Based at least in part on the flow data, the techniques may include determining that a utilization of a network path between a first workload and a second workload is greater than a relative utilization of other network paths between the first workload and other workloads. The techniques may also include determining that reducing the network path would optimize communications between the first workload and the second workload without adversely affecting communications between the first workload and the other workloads. The techniques may also include causing at least one of a redeployment or a network path re-routing to reduce the networking proximity between the first workload and the second workload.

According to an example, a method for bandwidth guarantee and work conservation includes determining virtual machine (VM) bandwidth guarantees assigned to VMs in a network including a source VM that communicates with destination VMs. The method further includes assigning minimum bandwidth guarantees to communications between the source VM with the destination VMs by dividing a VM bandwidth guarantee assigned to the source VM between the destination VMs based on active VM-to-VM communications between the source VM and the destination VMs. The method also includes allocating, by a processor, spare bandwidth capacity in the network to a communication between the source VM and a destination VM based on the assigned minimum bandwidth guarantees.

A crossbar switch has N input ports, M output ports, and a switching matrix with N×M crosspoints. In an embodiment, each crosspoint contains an internal queue (XQ), which can store one or more packets to be routed. Traffic rates to be realized between all Input/Output (IO) pairs of the switch are specified in an N×M traffic rate matrix, where each element equals a number of requested cell transmission opportunities between each IO pair within a scheduling frame of F time-slots. An efficient algorithm for scheduling N traffic flows with traffic rates based upon a recursive and fair decomposition of a traffic rate vector with N elements, is proposed. To reduce memory requirements a shared row queue (SRQ) may be embedded in each row of the switching matrix, allowing the size of all the XQs to be reduced. To further reduce memory requirements, a shared column queue may be used in place of the XQs. The proposed buffered crossbar switches with shared row and column queues, in conjunction with the row scheduling algorithm and the DCS column scheduling algorithm, can achieve high throughput with reduced buffer and VLSI area requirements, while providing probabilistic guarantees on rate, delay and jitter for scheduled traffic flows.

Systems and methods are disclosed for enhancing network performance by using modified traffic control (e.g., rate limiting and/or scheduling) techniques to control a rate of packet (e.g., data packet) traffic to a queue scheduled by a Quality of Service (QoS) engine for reading and transmission. In particular, the QoS engine schedules packets using estimated packet sizes before an actual packet size is known by a direct memory access (DMA) engine coupled to the QoS engine. The QoS engine subsequently compensates for discrepancies between the estimated packet sizes and actual packet sizes (e.g., when the DMA engine has received an actual packet size of the scheduled packet). Using these modified traffic control techniques that leverage estimating packet sizes may reduce and/or eliminate latency introduced due to determining actual packet sizes.

Systems, methods, and computer programs are presented for managing network traffic. A network switch includes a switch fabric and a resource coherency and analytics engine (RCAE) coupled to the switch fabric. The RCAE includes one or more virtualizable resource groups (VRGs) for managing network traffic flow across a plurality of network switches on the network. Further, the RCAE is operable to add network entities to each VRG, add flows to each VRG, and add other VRGs to each VRG. A virtualizable resource control list (VRCL), associated with each VRG, identifies which network entities in the VRG can communicate with each other, which network entities in the VRG can communicate with network entities in other VRGs, and a guaranteed bandwidth for the VRG associated with the VRCL. Furthermore, the RCAE is operable to exchange messages with other RCAEs in other network switches to implement traffic policies defined by each VRCL.

A method is used to select a multimode fiber meeting requirements of a first minimum bandwidth at a first wavelength and a second minimum bandwidth at a second wavelength different from the first wavelength. Differential mode delay (DMD) data is measured for the multimode fiber at the first wavelength. The DMD data comprises output laser pulse data as a function of the radial position of an input laser pulse having the first wavelength. The DMD data is transformed into mode group space, to obtain relative mode group delay data as a function of mode group. The multimode fiber is selected based on meeting requirements of the first minimum bandwidth at the first wavelength based on a first set of criteria, comprising a first criterion using as input the measured differential mode delay (DMD) data for the multimode fiber measured at the first wavelength. The multimode fiber is selected based on meeting requirements of the second minimum bandwidth at the second wavelength based on a second set of criteria, comprising: a second criterion using as input the relative mode group delay data. A related system is also described.

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.