Fair prioritized scheduling in an input-buffered switch

Details Fair prioritized scheduling in an input-buffered switch Fair prioritized scheduling in an input-buffered switch

1994-12-06

1996-05-14

Marcelo, Melvin

Multiplex communications

Wide area network

Packet switching

370 856, H04L 1256

Patent

active

055174957

ABSTRACT:
A Fair Arbitrated Round Robin (FARR) method is disclosed for scheduling the crossbar of an input-buffered asynchronous transfer mode (ATM) switch using an arbiter. Per-virtual-circuit queuing of ATM cells is performed.

REFERENCES:
patent: 5166926 (1992-11-01), Cisneros et al.
patent: 5255265 (1993-10-01), Eng et al.
patent: 5287182 (1994-02-01), Haskell et al.
patent: 5325356 (1994-06-01), Lyles
T. E. Anderson et al., "High-Speed Scheduling for Local-Area Networks", ACM Trans. on Computer Systems, vol. 11, No. 4, Nov. 1993, pp. 319-352.
M. J. Karol et al., "Input Versus Output Queueing on a Space-Division Packet Switch", IEEE Trans. on Comm., vol. COM-35, No. 12, 1987, pp. 1347-1356.
N. McKeown et al., "Scheduling Cells in an Input-Queued Switch", Electronics Lett., Dec. 1993, pp. 1-4.
H. Obara et al., "An Efficient Contention Resolution Algorithm for Input Queueing ATM Cross-Connect Switches", Int'l. J. of Digital and Analog Cabled Systems, vol. 2, 1989, pp. 261-267.

Affiliated with

Also associated with

Rating

Fair prioritized scheduling in an input-buffered switch does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fair prioritized scheduling in an input-buffered switch, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fair prioritized scheduling in an input-buffered switch will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1902299