Apparatus and method for template-based scheduling processes usi

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

370230, 370253, 370337, G01R 3108, G06F 1100, G08C 1500

Patent

active

060163054

ABSTRACT:
An advantageous scheduling template slot ordering for use in establishing a scheduling order of events such as transmitting communication signals in a communication network is determined by assigning at least two initial slot positions to a particular signal class and then determining a regularity measure based on a lower bound for the regularity measure of such assignments and the remaining unassigned slot positions. This lower bound for the regularity measure of the unassigned slots is advantageously based on a hypothetical assignment of fractions of the slot positions to different signal classes instead of limiting the assignment of a slot to a single signal class. This fractional slot assignment produces a regularity measure that is better than or equal to a corresponding regularity measure based on assigning a whole slot to a particular signal class. The lower bound of the regularity measure is then compared with a threshold regularity measure, such as from a known reference scheduling template. If the threshold regularity measure is lower than the determined lower bound, then it is known that the reference template would provide a more desirable regularity of events than any template having the assigned slot positions to that particular signal class. As a consequence, other slot assignments can be compared to the reference template to rapidly identify scheduling templates with enhanced regularity characteristics.

REFERENCES:
patent: 5241465 (1993-08-01), Oba et al.
patent: 5706288 (1998-01-01), Radhakrishnan et al.
Gupta et al. "Traf. Clas. R/R Sch Sch ATM Net." Mar. 28 -Apr. 1, 1993 IEEE.
Li et al. "Pseudo-Isoch. Cell Sw. ATM Net" Dec. 6, 1994 IEEE.
Y. Arian, et al., "Algorithms for generalized round robin routing", Operations Research Letters, vol. 12, No. 5, pp. 313-319 (Nov. 1992).
A. Itai, et al., "A Golden Ratio Control Policy for a Multiple-Access Channel", IEEE Trans. on Automatic Control, vol. AC-29, No. 8, pp. 712-718 *Aug. 1984.
M.G.C. Resende, et al., "Computign Lower Bounds For The Quadratic Assignment Problem With An Interior Point Algorithm For Linear Programming", Operations Research, vol. 43, No. 5, pp. 781-791 (1995).
S.C. Borst, et al., "Optimization of fixed time polling schemes", Telecommunication Systems, No. 3, pp. 31-59, (1994).
M. Hofri, et al., "Packet Delay under the Golden Ratio Weighted TDM Policy in a Multiple-Access Channel", IEEE Transactions on Information Theory, vol. IT-33, No. 3, pp. 341-349 (May 1987).
B. Hajek, "Extremal Splittings Of Point Processes", Mathematics Of Operations Research, vol. 10, No. 4, pp. 543-556 (Nov. 1985).

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

Apparatus and method for template-based scheduling processes usi does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Apparatus and method for template-based scheduling processes usi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for template-based scheduling processes usi will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-567584

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