Grade of service and fairness policy for bandwidth...

Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S342000

Reexamination Certificate

active

07933249

ABSTRACT:
A scheme for assigning priority levels to users based upon a history of their request for access to the resources. If a user has, over a historical period of time, made fewer demands than a stated amount, that user is given a higher priority than a user who has made greater use of the resources than their stated amount. Thus, users making the heaviest demand on the available resources are allocated fewer resources despite their demand, whereas users that make less demands for the resources are granted more of the resources they request. An additional feature of an access allocation scheme according to the present invention is to reserve at least some resources for the users at the lowest priority levels. Thus, even users being assigned to a lowest priority queue will be granted at least some access once in a while. A third feature in connection with the present invention is to use the time of continuous transfer as a threshold to drop a presently assigned priority. For example, when a user at a particular priority level has made continuous use of resources for a predetermined time, that user is reassigned to the next lowest priority level and its resources are taken away. The user is then required to vie again for access to resources at this lower priority level.

REFERENCES:
patent: 5276681 (1994-01-01), Tobagi et al.
patent: 5519691 (1996-05-01), Darcie et al.
patent: 5673259 (1997-09-01), Quick, Jr.
patent: 5729542 (1998-03-01), Dupont
patent: 5742592 (1998-04-01), Scholefield et al.
patent: 5752193 (1998-05-01), Scholefield et al.
patent: 5784358 (1998-07-01), Smith et al.
patent: 5857147 (1999-01-01), Gardner et al.
patent: 5862485 (1999-01-01), Linneweh, Jr. et al.
patent: 6005855 (1999-12-01), Zehavi et al.
patent: 6011800 (2000-01-01), Nadgauda et al.
patent: 6049549 (2000-04-01), Ganz et al.
patent: 6085241 (2000-07-01), Otis
patent: 6101176 (2000-08-01), Honkasalo et al.
patent: 6115390 (2000-09-01), Chuah
patent: 6134226 (2000-10-01), Reed et al.
patent: 6163697 (2000-12-01), Peterson et al.
patent: 6226277 (2001-05-01), Chuah
patent: 6229795 (2001-05-01), Pankaj et al.
patent: 6243580 (2001-06-01), Garner
patent: 6262980 (2001-07-01), Leung et al.
patent: 6275695 (2001-08-01), Obhan
patent: 6324184 (2001-11-01), Hou et al.
patent: 6426943 (2002-07-01), Spinney et al.
patent: 6473793 (2002-10-01), Dillon et al.
patent: 6560460 (2003-05-01), Horneman et al.
patent: 2384472 (2005-04-01), None
patent: 0 790 725 (1997-08-01), None
patent: 0 847 220 (1998-06-01), None
patent: 0 977 402 (2000-02-01), None
patent: 1 865 628 (2007-12-01), None
patent: 08-154267 (1996-06-01), None
patent: 11-331187 (1999-11-01), None
patent: WO 96/37081 (1996-11-01), None
patent: 98/45966 (1998-10-01), None
Yu, D. et al., “Fairness in Broadband ISDNS”, Computers & Industrial Engineering, GB, Headington Hill Hall, Oxford, vol. 21, Nos. 1/04, pp. 325-327, 1991 XP002038657.

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

Grade of service and fairness policy for bandwidth... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Grade of service and fairness policy for bandwidth..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grade of service and fairness policy for bandwidth... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2659310

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