Cyclic buffering of a datastream

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

10255272

ABSTRACT:
Data is distributed over multiple connections through a network in successive groups of containers such that respective containers of each group are transmitted via respective ones of the connections. Each container contains an identifier of the group to which the container belongs. The output of the network data from containers that have been received is buffered to compensate differences in the delays of transport via different connections. An oldest identifier value received via the connections during a time frame is detected by determining a plurality of respective minimum values of the identifiers received in the time frame. Each minimum value is determined among received identifiers from a respective sub-range of possible identifier values. A “sequentially first” sub-range of successive sub-ranges, for which at least one of the minimum values has been determined, is then determined. The minimum value of the “sequentially first” sub-range is then selected as the oldest identifier.

REFERENCES:
patent: 2002/0163939 (2002-11-01), Grimbergen
Peter A. Alsberg, Extensible data features in the operating system language OSL/2, Oct. 1971, ACM Press, Proceedings of the third ACM symposium on Operating systems principles.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Cyclic buffering of a datastream does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cyclic buffering of a datastream, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cyclic buffering of a datastream will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3852173

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.