Method and system for scheduling requests in a non-first in...

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Prioritized data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S238000

Reexamination Certificate

active

07908396

ABSTRACT:
A method and a system for scheduling requests generated for a plurality of mobile devices in a communication network (100) has been disclosed. The requests are generated for a transmission opportunity. The method includes computing a sort metric (302) for each request, based on an information update. A lead-time is then computed (304) with respect to a drop-dead time for each request, based on the sort metric for a time slice. The drop-dead time for a given time slice is the time before which scheduling has to be done so that data can be transmitted during the given time slice. Each request may be considered (306) for allocation in the time slice before the beginning of a next time slice, based on the lead-time.

REFERENCES:
patent: 6493331 (2002-12-01), Walton et al.
patent: 6985462 (2006-01-01), Hosein
patent: 2003/0108059 (2003-06-01), Yew et al.
patent: 2004/0185868 (2004-09-01), Jain et al.
patent: 2005/0043037 (2005-02-01), Loppe et al.
patent: 2007/0041364 (2007-02-01), Kakadia

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 and system for scheduling requests in a non-first in... 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 and system for scheduling requests in a non-first in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for scheduling requests in a non-first in... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2721209

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