Method for prioritizing, selectively discarding, and multiplexin

Multiplex communications – Wide area network – Packet switching

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

370 60, H04L 1256

Patent

active

052316335

ABSTRACT:
A queueing and dequeueing mechanism for use in an integrated fast packet network, wherein fast packets from differing traffic types are multiplexed with one another through use of a weighted round-robin bandwidth allocation mechanism (517). Fast packets within a particular traffic type are selected for transmission through use of a head of line priority service (514), a packet discard mechanism (516), or both. The weighted round-robin bandwidth allocation mechanism functions, in part, based upon a credit counter for each queue group that represents a particular traffic type.

REFERENCES:
patent: 4475192 (1984-10-01), Fernox et al.
patent: 4623996 (1986-11-01), McMillen
patent: 4847754 (1989-07-01), Obermarck et al.
patent: 4862454 (1989-08-01), Dias et al.
patent: 4868813 (1989-09-01), Suzuki
patent: 4894824 (1990-01-01), Hemmady et al.
patent: 4901348 (1990-02-01), Nichols et al.
patent: 4914650 (1990-04-01), Sriram
patent: 5001702 (1991-03-01), Teraslinna et al.
Message delays with prioritized HOLP and Round-Robin Packet Servicing, John N. Daigle, Jun. 1987, pp. 609-619.

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

Method for prioritizing, selectively discarding, and multiplexin does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for prioritizing, selectively discarding, and multiplexin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for prioritizing, selectively discarding, and multiplexin will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2347392

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