Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Patent
1997-03-25
1998-12-01
Patel, Ajit
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
370412, H04J 116, H04L 1228
Patent
active
058448900
ABSTRACT:
A method and apparatus are provided for scheduling the transmission of cells of a plurality of data streams in a communications network. A best effort scheduler is provided for scheduling the transmission of cells of a plurality of data streams in a communications network. The best effort scheduler includes a best effort operational mode and can include more than one timing wheel. When the best effort scheduler includes more than one timing wheel, then the priority of the best effort timing wheel is lower than the priority of the other timing wheel or wheels. Data of each data stream is enqueued to a corresponding data cell queue. A target next transmission time for each data cell queue is calculated utilizing predetermined logical channel descriptor parameters. A lower priority or a higher priority timing wheel is selected and a timing wheel time slot is calculated based on an identified target transmission time for each active data cell queue. An active indication is set for the identified timing wheel time slot and an entry is stored to point to the corresponding data cell queue for the identified timing wheel time slot. The relative rates between data streams are maintained, while the absolute rates of the data streams are increased or decreased in the low priority wheel. Scheduling opportunities can be defined utilizing a predefined pseudo data cell queue. Then the calculation of the target transmission time for each data cell queue includes the predefined pseudo data cell queue, and the identified target transmission time for the predefined pseudo data cell queue defines scheduling opportunities of multiple timing wheel time slots.
REFERENCES:
patent: 4839831 (1989-06-01), Imajo et al.
patent: 5274768 (1993-12-01), Traw et al.
patent: 5359592 (1994-10-01), Corbalis et al.
patent: 5381407 (1995-01-01), Chao
patent: 5533009 (1996-07-01), Chen
patent: 5533020 (1996-07-01), Byrn et al.
patent: 5533021 (1996-07-01), Branstad et al.
patent: 5537408 (1996-07-01), Branstad et al.
patent: 5579312 (1996-11-01), Regache
patent: 5610921 (1997-03-01), Christensen
patent: 5625625 (1997-04-01), Oskouy et al.
patent: 5629928 (1997-05-01), Calvignac et al.
patent: 5694548 (1997-12-01), Baugher et al.
"A Self-Clocked Fair Queueing Scheme For Braodband Applications" by S. Jamaloddin Golestani, Proceeding IEEE Infocom v2, 1994, IEEE, Piscataway, N.J., 94CH3401-7.
"ATM Forum Technical Committee Traffic Management Specification", Version 4.0 (af-tm-0056.000) Apr., 1996.
"Resource ReSerVation Protocol (RSVP)" Version 1, Internet Draft Document, Functional Specification of the Internet Engineering Task Force (IETF), Dated Mar. 18, 1996.
Delp Gary Scott
Leichty Philip Lynn
International Business Machines - Corporation
Lee Chiho Andrew
Patel Ajit
Pennington Joan
LandOfFree
Communications cell scheduler and scheduling method for providin does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Communications cell scheduler and scheduling method for providin, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communications cell scheduler and scheduling method for providin will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2401109