×

System and method for multi-dimensional resource scheduling

  • US 5,978,363 A
  • Filed: 10/18/1996
  • Issued: 11/02/1999
  • Est. Priority Date: 10/18/1996
  • Status: Expired due to Term
First Claim
Patent Images

1. A satellite communication system comprising:

  • a. at least one telecommunication satellite in orbit,b. at least one ground site, communicating with said at least one satellite,c. at least one first control modem communicating with each said at least one ground site,d. at least one third party modem communicating with each said first control modem,e. a network management ground site communicating with the satellites,f. a second control modem electronically communicating with the network management ground site,g. a network management center electronically communicating with the second control modem,h. a scheduling terminal computer electronically communicating with the network management center,i. scheduling and control software in the scheduling terminal computer with algorithms for multidimensional scheduling and unscheduling of (a) indivisible resources, (b) percentage divisible resources, and (c) range divisible resources, andj. a database in the scheduling terminal computer containing data regarding the status of resources of the satellite system, and schedules for the use of such resources, wherein(A) the algorithm for scheduling the use of an indivisible resource, comprises;

    (Aa) receiving a request to schedule an indivisible resource for a requested interval,(Ab) searching in a resource database for an available record that matches the request, and, if such an available record is not found, rejecting the request, otherwise,(Ac) if an available record is found, making the available record unavailable for the requested interval,(Ad) creating a new record for any portion of the available record prior to the requested interval, and(Ae) creating a new record for any portion of the available record after the requested interval; and

    (B) the algorithm for scheduling the use of a percentage divisible resource, the process comprises;

    (Ba) receiving a request to schedule a percentage divisible resource,(Bb) searching all database records corresponding to a time period to be effected by the request, and, if the available resource level is inadequate in any such records, then rejecting the request, otherwise,(Bc) for each record that would be effected by satisfying the request, adjusting the available level up for any amount requested to be unscheduled, and adjusting the available resource level down for any resource requested to be scheduled,(Bd) creating a new record for any time slot prior to the time of the time period to be effected by the requests with an uncharged level of the available resource, and merging the new prior record with any left slot with the same level of resource available, and(Be) creating a new record for any time slot following the time of the time period to be effected by the requests with an uncharged level of the available resource, and merging the new following record with any right slot with the same level of resource available; and

    (C) the algorithm for scheduling the use of a range divisible resource comprises;

    (Ca) receiving a request to schedule a range divisible resource,(Cb) searching for an available record in a resource database with time and range that matches the request, and if no such record is found, rejecting the request, otherwise(Cc) finding all slots that intersect the requested slot,(Cd) for each such intersecting slot, creating a new database record in a temporary table,(Ce) deleting all slots that intersect the requested slot, and adding an unavailable database record for the requested slot, and(Cf) running an unload temporary table routine, moving unaffected pieces of intersecting slots to the schedule table as new records and merging such new records with contiguous larger slots.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×