Techniques for mitigating transmission of stale data from an implantable device are provided. In one embodiment, a method includes monitoring one or more data items stored in a data management queue prior to submission to a packet transmission queue for transmission as packets on a communication network to one or more other devices. The method also includes discarding a data item from the data management queue based on a determination that the data item has an expected arrival time to another device that is after a latest acceptable arrival time associated with the data item. The method also includes estimating a size of the packet transmission queue, and transmitting another data item from the data management queue to the packet transmission queue based on a determination that the size of the packet transmission queue has a defined relationship to the threshold size.

According to an embodiment, an information processing apparatus includes one or more processors. The processors prefetch a scheduling entry corresponding a future time period in advance from scheduling information including one or more scheduling entries, each entry of which contains a transmission state and an interval for each of one or more transmission queues. The processors determine a starting time of transmission for one or more frames waiting for transmission in each queue, based on the scheduling entry. At least one of timing of the prefetching process and timing of the scheduling process is determined based on a result of comparison of a time difference and one or more thresholds. The time difference is a difference between current time and future time where the future time is a candidate for starting time of transmission.

This patent application relates generally to an age-based arbitration circuit for use in arbitrating access by a number of data streams to a shared resource managed by a destination (arbiter), in which age-based determinations are performed at the input sources of the data streams in order to designate certain packets as high-priority packets based on packet ages, and the destination expedites processing of the high-priority packets. Among other things, this approach offloads the age-based determinations from the destination, where they otherwise can cause delays in processing packets.

Techniques for mitigating transmission of stale data from an implantable device are provided. In one embodiment, a method includes monitoring one or more data items stored in a data management queue prior to submission to a packet transmission queue for transmission as packets on a communication network to one or more other devices. The method also includes discarding a data item from the data management queue based on a determination that the data item has an expected arrival time to an other device that is after a latest acceptable arrival time associated with the data item. The method also includes estimating a size of the packet transmission queue, and transmitting another data item from the data management queue to the packet transmission queue based on a determination that the size of the packet transmission queue has a defined relationship to the threshold size.

A system and method for routing network packets. A switch fabric connects a plurality of forwarding units, including an egress forwarding unit and two or more ingress forwarding units, each ingress forwarding unit forwarding network packets to the egress forwarding unit via the switch fabric. The egress forwarding unit includes a scheduler and an output queue. Each ingress forwarding unit includes a Virtual Output Queue (VOQ) connected to the output queue and a VOQ manager. The scheduler receives time of arrival information for network packets stored in the VOQs, determines, based on the time of arrival information for each network packet, a device resident time for the network packets stored in the VOQs, and requests, from one of the VOQs and based on the device resident times, the network packet with the longest device resident time.

Embodiments may include methods, systems, and apparatuses for integrating a first radio access technology and a second radio access technology in a wireless transmit/receive unit (WTRU). The embodiments may include: gathering, by the WTRU, one or more metrics related to uplink/downlink transmissions; determining, based on the one or more metrics, that an amount of data from the first radio access technology should be offloaded to the second radio access technology; transmitting a first portion of the data to a base station using the first radio access technology; and transmitting a second portion of the data to a wireless local access network (WLAN) access point (AP) using the second radio access technology, wherein the WLAN AP is connected to the base station through an interface.

The disclosure relates to a method and device for time-controlled data transmission in a TSN. A new traffic shaping method is described for time-sensitive data streams. The objective is to offer the same real-time performance and configuration complexity as in the prior art but without the need for time synchronization throughout the entire network. The traffic shaper provides that a data frame that is received by a bridge in a first-time interval is passed by this bridge to the next hop/bridge in the next time interval. Each bridge knows the start time of the time interval that belongs to a particular data stream. Each data frame must contain a so-called delay value, thus a delay value which is measured by each bridge using a local clock that measures the delay time spent by the data frame in the queue at the outgoing port.

A computing system uses a memory for storing data, one or more clients for generating network traffic and a communication fabric with network switches. The network switches include centralized storage structures, rather than separate input and output storage structures. The network switches store particular metadata corresponding to received packets in a single, centralized collapsing queue where the age of the packets corresponds to a queue entry position. The payload data of the packets are stored in a separate memory, so the relatively large amount of data is not shifted during the lifetime of the packet in the network switch. The network switches select sparse queue entries in the collapsible queue, deallocate the selected queue entries, and shift remaining allocated queue entries toward a first end of the queue with a delay proportional to the radix of the network switches.

The present disclosure relates to priority flow control (PFC) storm detection and processing methods. In one example method, a first network node performs PFC detection on a first port queue of a first port, and determines that a first preset condition is met. The first preset condition includes: detection is performed in N consecutive first time segments, when the detection is performed in each first time segment, a quantity of first PFC frames sent by the first port queue to a second network node is greater than a first threshold, and a quantity of one or more data packets received by the first port queue from the second network node is less than a second threshold. The first PFC frame is used to indicate the second network node to suspend sending all data flows in the first port queue, and N is a positive integer.

A computing system uses a memory for storing data, one or more clients for generating network traffic and a communication fabric with network switches. The network switches include centralized storage structures, rather than separate input and output storage structures. The network switches store particular metadata corresponding to received packets in a single, centralized collapsing queue where the age of the packets corresponds to a queue entry position. The payload data of the packets are stored in a separate memory, so the relatively large amount of data is not shifted during the lifetime of the packet in the network switch. The network switches select sparse queue entries in the collapsible queue, deallocate the selected queue entries, and shift remaining allocated queue entries toward a first end of the queue with a delay proportional to the radix of the network switches.