Method and apparatus for relative error scheduling in a communic

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

709224, 370252, H04L 100, G06F 1516

Patent

active

061083054

ABSTRACT:
A method of scheduling a plurality of data flows in a shared resource in a computer system, each of the data flows containing a plurality of data cells including the steps of providing a scheduler in the shared resource, initializing the scheduler to receive the plurality of data flows, receiving a first data flow in the scheduler, said first data flow having a first flow rate, receiving a second data flow in the scheduler, said second data flow having a second flow rate, scheduling, by the scheduler, the first data flow and the second data flow such that the first flow rate and the second flow rate are less than an available bandwidth in the shared resource and a relative error is minimized between an actual scheduling time and an ideal scheduling time on a per cell basis, and repeating the steps of receiving and scheduling.

REFERENCES:
patent: 5301333 (1994-04-01), Lee
patent: 5367678 (1994-11-01), Lee et al.
patent: 5392280 (1995-02-01), Zheng
patent: 5434860 (1995-07-01), Riddle
patent: 5506969 (1996-04-01), Wall et al.
patent: 5533009 (1996-07-01), Chen
patent: 5533020 (1996-07-01), Byrn et al.
patent: 5555244 (1996-09-01), Gupta et al.
patent: 5566163 (1996-10-01), Petit
patent: 5577035 (1996-11-01), Hayter et al.
patent: 5602830 (1997-02-01), Fichou et al.
patent: 5619502 (1997-04-01), Kahn et al.
patent: 5748614 (1998-05-01), Wallmeier
patent: 5751709 (1998-05-01), Rathnavedu
patent: 5754529 (1998-05-01), Heiss
patent: 5771234 (1998-06-01), Wu et al.
patent: 5781531 (1998-07-01), Charny
patent: 5828878 (1998-10-01), Bennett
patent: 5835494 (1998-11-01), Hughes et al.
Brown, R., "Calendar Queues: A Fast 0(1) Priority Queue Implementation for the Simulation Event Set Problem," Communications of the ACM 31(10):1220-1227 (1988).
Xie, G.G. and Lam, S.S., "Delay Guarantee of Virtual Clock Server," IEEE/ACM Transactions on Networking 3(6):683-689 (1995).
Aggarwal, A., et al., "Efficient Routing and Scheduling Algorithms for Optical Networks," (IBM--Research Division T.J. Watson Research Center Yorktown Heights, NY 10598) pp. 412-423.
Hui, J.Y., "Network, Transport, and Switching Integration for Broadband Communications," IEEE Network, pp. 40-51 (1989).
Samokhvalenko, A.S., "Integration Errors Due to Nonlinear Frequency Sweeping," Russian Article, pp. 1-5 (1998).
Kline, D., "Scheduler for Rate Based ABR," Memorandum, pp. 1-7 (1994).
Zhang, H., "Service Disciples for Guaranteed Performance Service in Packet-Switching Networks," School of Computer Science, Carnegie Mellon University, pp. 1-23.
Stallings, W., "Data and Computer Communications," 4th Edition, (NJ: Prentice Hall), pp. 203-211 (1994).

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

Rate now

     

Profile ID: LFUS-PAI-O-589115

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