H04L12/869

Dynamic allocation of service components of information service in hierarchical telecommunication architecture
10693704 · 2020-06-23 · ·

Embodiments relate to allocating resources of computing devices for providing information service in a network. The computing devices may be hierarchically structured and may include, for instance, cloud servers, telecommunication servers, edge edges, gateways, and client devices. A system environment may include a hierarchical orchestrator coordinating with one or more local orchestrators to allocate service components (for example, a discrete functional software or hardware component) to computing devices. The orchestrators can automatically reallocate resources responsive to detecting update events such as a change in traffic or payload on the network.

SYSTEM FOR DATA TRANSFER BASED ON ASSOCIATED TRANSFER PATHS
20200186618 · 2020-06-11 ·

Methods, systems, and apparatus for transferring data are described. A list of recipients of the data is obtained and one or more paths to each recipient of the data is determined. An overall transfer cost of each path is computed and one or more transfer paths for each recipient are selected based on a corresponding overall transfer cost. Then a packet of data is transferred to a client device associated with each transfer path.

SYSTEMS AND METHODS FOR NETWORK SCHEDULING AND RE-TRANSMISSION BUFFERING
20200145345 · 2020-05-07 · ·

Described herein include systems, methods, and apparatuses for the scheduling of data over a network (e.g., a wired or wireless network). A scheduler may be configured to receive a portion of packets at a receiving buffer and classify the packets into real time packets or non-real time packets using associated first and second queues. Further, a first re-transmission component may receive the real time packets from the first queue, and a second re-transmission component may receive the non-real time packets from the second queue. The real time packets may be received, by a transmission component, from the first re-transmission component; the transmission component may also receive non-real time packets from the second re-transmission component. The scheduler may then transmit at least one real time packet or non-real time packet to another device over a network using any suitable scheduling algorithm.

NETWORK-BASED COORDINATION OF LOSS/DELAY MODE FOR CONGESTION CONTROL OF LATENCY-SENSITIVE FLOWS
20200112517 · 2020-04-09 ·

A controller of a network, including routers to forward flows of packets originated at senders to receivers along distinct network paths each including multiple links, such that the flows merge at a common link that imposes a traffic bottleneck on the flows, receives from one or more of the routers router reports that each indicate an aggregate packet loss that represents an aggregate of packet losses experienced by each of the flows at the common link. The controller sends to the senders aggregate loss reports each including the aggregate packet loss so that the senders have common packet loss information for the common link on which to base decisions as to whether to switch from delay-based to loss-based congestion control modes when implementing dual-mode congestion control of the flows. In lieu of the controller, another example employs in-band router messages populated with packet losses by the routers the messages traverse.

Multiplexing method for scheduled frames in an ethernet switch
10601733 · 2020-03-24 · ·

The method comprises the steps of: a) providing a plurality of memory buffers, associated to respective indexes of priority, each buffer comprising one queue of frames having a same index of priority, b) sorting the received frames in a chosen buffer according to their index of priority, c) in each buffer, sorting the frames according to their respective timestamps, for ordering the queue of frames in each buffer from the earliest received frame on top of the queue to the latest received frame at the bottom of the queue, and d) feeding the transmitting ports with each frame or block of frame to transmit, in an order determined according to the index of priority of the frame, as well as an order of the frame or of the block of frame in the queue associated to the index of priority of the frame.

System for data transfer based on associated transfer paths
10574788 · 2020-02-25 · ·

Methods, systems, and apparatus for transferring data are described. A list of recipients of the data is obtained and one or more paths to each recipient of the data is determined. An overall transfer cost of each path is computed and one or more transfer paths for each recipient are selected based on a corresponding overall transfer cost. Then a packet of data is transferred to a client device associated with each transfer path.

Method for transmitting service stream in flexible ethernet and apparatus
10554576 · 2020-02-04 · ·

Embodiments provide a method for transmitting a service stream in a flexible Ethernet and an apparatus. The method includes: obtaining a to-be-transmitted service stream, where the service stream is to be transmitted by using a target virtual connection supported by a physical connection group between a transmit end and a receive end, the physical connection group includes multiple physical connections and supports at least one virtual connection, and the target virtual connection is any one of the at least one virtual connection; determining, from total bandwidth resources of the multiple physical connections and according to timeslot configuration tables used by the multiple physical connections, a timeslot bandwidth resource that belongs to the target virtual connection; and transmitting the service stream to the receive end by using the timeslot bandwidth resource that belongs to the target virtual connection.

Systems and methods for low latency DOCSIS queueing and scheduling

A scheduling device for managing a packet queue of a communication gateway includes a receiving portion configured to receive data packets according to at least one communication protocol, a processor, and classification module configured to separate the received data packets into a first traffic queue and a second traffic queue separate from the first traffic queue. The first traffic queue includes a low latency service flow classified to have strict priority. The second traffic queue includes a primary service flow classified as having a classic priority.

Network node

A network node (15) is configured to switch data packets between a Remote Radio Unit (2) and a Digital Unit (4). The network node comprises one or more input port (33) configured to receive said data packets (52a) and receive further packets having a destination other than one of a Remote Radio Unit and a Digital Unit. One or more output port (35) is configured to transmit said data packets and said further packets. A scheduler (31) is configured to control transmission from the output port according to a scheduling cycle (41a). The scheduler is configured to schedule only said data packets to be transmitted in a first period of the scheduling cycle, and schedule one or more of said further packets to be transmitted in a separate second period of the scheduling cycle.

Packet scheduling using hierarchical scheduling process with priority propagation

System and method of data routing according to a hierarchical scheduling process. Incoming data traffic is allocated to various queues of a buffer. A scheduling tree has a top level for queues, a bottom level for egress ports, and a plurality of intermediate levels corresponding to different granularities with respect to service categories. Each queue is assigned to a particular node in each intermediate level of the scheduling tree. The scheduling tree traverses through multiple scheduling stages from the bottom to the top level to select a winner node in each level based on a variety of fairness and differentiating variables. A queue associated with the winner nodes in various levels is selected for outgoing transmission at the selected egress port. Priority information is dynamically propagated from upper nodes to lower nodes such that a subsequent scheduling process uses the updated priority information.