Methods and systems for managing data transmissions are disclosed. An example method can comprise determining a plurality of time allocations for a time cycle. The plurality of time allocations can comprise a first time allocation which can be determined based on an information rate, a committed information rate, an excess information rate, an effective bandwidth rate, other factors, or a combination thereof. Data can be received from multiple sources into a buffer, for example, and can be processed within a time cycle if processing the data will not exceed the time allocation.

An OS (70) includes: a ring buffer (72); and a poll list (186). A kernel (171) includes a server delay control device (100) that spawns a thread configured to monitor packet arrivals according to a polling model. A packet arrival monitoring part (110) configured to monitor the poll list (186), a packet dequeuer (120) configured to, when a packet has arrived, reference the packet held in the ring buffer (72), and perform, on the basis of the processing to be performed next, dequeuing to remove the corresponding queue entry from the ring buffer (72), and a sleep management part (130) configured to, when there is no packet arrival over a predetermined period of time, cause a thread to sleep and, when a packet arrives, cancel the sleep by a hardware interrupt of the thread are provided.

A method for traffic management at a network node in a packet-switched network is proposed. The method comprises performing traffic shaping on a current packet belonging to a packet flow and stored in a memory queue associated with the packet flow, the traffic shaping comprising, if a theoretical reception time, TRT, value of the current packet is smaller than or equal to a time counter value, output the current packet through an egress port. The TRT value of the packet is determined by performing traffic policing of incoming packets of the packet flow.

A network device and a method for maintaining a count of network events in a network device are provided. A first memory is configured as a first counter, where the first counter is configured to store a least significant bit (LSb) portion of a count value. A second memory is configured as a second counter, where the second counter is configured to store a most significant bit (MSb) portion of the count value. Update circuitry is configured to (i) selectively increment or decrement the LSb portion of the count value stored in the first memory upon occurrence of an event, and (ii) selectively increment or decrement the MSb portion of the count value stored in the second memory upon occurrence of a wrap-around event in the first memory.

A traffic manager is shared amongst two or more egress blocks of a network device, thereby allowing traffic management resources to be shared between the egress blocks. Schedulers within a traffic manager may generate and queue read instructions for reading buffered portions of data units that are ready to be sent to the egress blocks. The traffic manager may be configured to select a read instruction for a given buffer bank from the read instruction queues based on a scoring mechanism or other selection logic. To avoid sending too much data to an egress block during a given time slot, once a data unit portion has been read from the buffer, it may be temporarily stored in a shallow read data cache. Alternatively, a single, non-bank specific controller may determine all of the read instructions and write operations that should be executed in a given time slot.

Systems and methods of performing rate limiting traffic shaping with a time-indexed data structure in a network device are provided. A network interface driver of the network device can received packets at the packet layer of a network host from a plurality of applications. The network interface driver can prevent one of the applications from sending additional packets for transmission until the application received a transmission completion notification indicating a packet previously forwarded to the packet layer of the network host has been transmitted. The network interface driver can process the received packets to determine a transmission time for each packet based on at least on rate limit policy. The network interface driver can store an identifier associated with the respective packet in a time-indexed data structure at a position associated with the transmission time determined for the packet. The network interface driver can determine that a time indexed in the time-indexed data structure has been reached and in response transmit a packet associated with the identifier stored in the time-indexed data structure at a position associated with the reached time. The network interface driver can communicate a transmission completion notification subsequent to the network interface driver transmitting the packet.

Systems and methods of performing rate limiting with a time-indexed data structure in a network device are provided. A transport protocol module of the network device can receive data packets from a remote computing device. The transport protocol module can generate a packet acknowledgement message which is received by the network interface driver. The network interface driver can process the received packet acknowledgement message to determine a transmission time for the packet acknowledgement message based on at least on rate limit policy. The network interface driver can store an identifier associated with the packet acknowledgement message in a time-indexed data structure. The network interface driver can determine that a time indexed in the time-indexed data structure has been reached and in response transmit a packet acknowledgement message associated with the identifier stored in the time-indexed data structure at a position associated with the reached time.

A packet forwarding method, an electronic device, and a storage medium are disclosed. The method may include: determining a flow identifier of the service flow; determining a basic time slot number of a first packet in the service flow according to the flow identifier; determining a time slot offset of the first node for the service flow according to the flow identifier; and determining an enqueue slot number of the first packet according to the basic time slot number and the time slot offset.

A method for traffic management at a network node in a packet-switched network is proposed. The method comprises performing traffic shaping on a current packet belonging to a packet flow and stored in a memory queue associated with the packet flow, the traffic shaping comprising, if a theoretical reception time, TRT, value of the current packet is smaller than or equal to a time counter value, output the current packet through an egress port. The TRT value of the packet is determined by performing traffic policing of incoming packets of the packet flow.

In some embodiments, a vehicle ad hoc network routing method based on WAVE (Wireless Access in Vehicular Environments), includes: generating one or more random ID; packaging an arbitrary random ID among the one or more random ID in a WAVE message; and sending the WAVE message through a DSRC short message, and recording the random ID packaged in the WAVE message in a message forwarding record queue. Embodiments of a vehicle ad hoc network routing device and system based on WAVE are also disclosed. Message routing and forwarding in an Ad hoc network can be achieved.