-
公开(公告)号：JP2000324159A
公开(公告)日：2000-11-24
申请号：JP12005899
申请日：1999-04-27
Applicant: IBM
Inventor： GUERIN ROCH A , KAMAT SANJAY DAMODAR , PAN PING P , PERIS VINOD GERARD JOHN , RAJAN RAJENDRAN
IPC: H04L12/813 , H04L12/835 , H04L12/56
Abstract: PROBLEM TO BE SOLVED: To give assurance of rate to every flow with no advanced scheduler required by deciding whether a stream should be accepted or not according to whether a sufficient buffer space is available in order to allocate the stream. SOLUTION: A router 102 checks whether the link capacity and a buffer space sufficient to satisfy a request are available or not to decide whether the request should be accepted. A deciding logic circuit of the router 102 calculates the 1st sum by adding a current receiving packet to an exclusive part of a total buffer space and decides whether the 1st sum exceeds the 1st threshold to set a 1st variable. Then the 2nd sum is calculated by adding the current receiving packet to a buffer space that is allocated to a stream (n) and a 2nd variable is set after it is decided whether the 2nd sum exceeds the 2nd threshold. Thus, a packet is accepted or rejected according to the 1st and 2nd variables.
-
公开(公告)号：JP2000049853A
公开(公告)日：2000-02-18
申请号：JP12007599
申请日：1999-04-27
Applicant: IBM
Inventor： GUERIN ROCH A , KAMAT SANJAY DAMODAR , PAN PING P , PERIS VINOD GERARD JOHN , RAJAN RAJENDRAN
Abstract: PROBLEM TO BE SOLVED: To obtain the method for providing a rate warrant to respective flows or a flow group in a router by a sophisticated function management of a buffer. SOLUTION: A rate warrant is provided by wisely assigning and separating a buffer usable for each flow. In the most fundamental mode, this method is applied to an output queue network system provided with a simple FIFO scheduler that multiplexes some streams using rate reservation and is going to transmit the multiplexed streams to an output link. This method strictly divides the buffer into some parts reserved strictly for each flow in proportion to link reservation. Thus, each stream is warranted to acquire the link reservation rate by the scalable method. In a specific embodiment of this system, part of the buffer is divided strictly and the streams can completely access the remaining areas of the buffer.
-
公开(公告)号：GB2341751B
公开(公告)日：2000-08-09
申请号：GB9928907
申请日：1998-03-05
Applicant: IBM
-
Patent Agency Ranking
公开(公告)号：GB2324678B
公开(公告)日：2000-05-24
申请号：GB9804618
申请日：1998-03-05
Applicant: IBM
Inventor： DELP GARY SCOTT , FIROIU VICTOR , GUERIN ROCH A , LEICHTY PHILIP LYNN , POULTER DAVID RICHARD , PERIS VINOD GERARD JOHN , RAJAN RAJENDRAN , SHAFFER JOHN HANDLEY
Abstract: A method and apparatus are provided for scheduling the transmission of cells of a plurality of data streams in a communications network. An earliest deadline first (EDF) scheduler is provided for scheduling the transmission of cells of a plurality of data streams in a communications network to ensure that the connection or data stream with the earliest deadline is transmitted first. Each of the multiple data streams has a delay bound or deadline. Data of each data stream is enqueued to a corresponding data cell queue. A timing wheel time slot based on an identified target transmission time for each data cell queue is calculated utilizing an addition of a maximum delay value. A move forward timing mechanism includes a scan forward feature to identify a succession of virtual connection or data stream cell queues for transmission. A multiple tier cell scheduler is provided that includes at least two scheduling timing wheels. The priority of a first timing wheel is higher than the priority of a second timing wheel. The priority of the second timing wheel is higher than the priority of an optional third timing wheel. The third timing wheel includes a best effort operational mode. The relative rates between data streams are maintained, while the absolute rates of the data streams are increased or decreased in the lowest priority wheel.
-
公开(公告)号：GB2324678A
公开(公告)日：1998-10-28
申请号：GB9804618
申请日：1998-03-05
Applicant: IBM
Inventor： DELP GARY SCOTT , FIROIU VICTOR , GUERIN ROCH A , LEICHTY PHILIP LYNN , POULTER DAVID RICHARD , PERIS VINOD GERARD JOHN , RAJAN RAJENDRAN , SHAFFER JOHN HANDLEY
Abstract: A method and apparatus are provided for scheduling the transmission of cells of a plurality of data streams in a communications network. An earliest deadline first (EDF) scheduler is provided for scheduling the transmission of cells of a plurality of data streams in a communications network to ensure that the connection or data stream with the earliest deadline is transmitted first. Each of the multiple data streams has a delay bound or deadline. Data of each data stream is enqueued to a corresponding data cell queue. A timing wheel time slot based on an identified target transmission time for each data cell queue is calculated utilizing an addition of a maximum delay value. A move forward timing mechanism includes a scan forward feature to identify a succession of virtual connection or data stream cell queues for transmission. A multiple tier cell scheduler is provided that includes at least two scheduling timing wheels. The priority of a first timing wheel is higher than the priority of a second timing wheel. The priority of the second timing wheel is higher than the priority of an optional third timing wheel. The third timing wheel includes a best effort operational mode. The relative rates between data streams are maintained, while the absolute rates of the data streams are increased or decreased in the lowest priority wheel.
-
公开(公告)号：GB2339371B
公开(公告)日：2003-10-08
申请号：GB9910771
申请日：1999-05-11
Applicant: IBM
Inventor： GUERIN ROCH A , KAMAT SANJAY DAMODAR , PAN PING P , PERIS VINOD GERARD JOHN , RAJAN RAJENDRAN
Abstract: A method of providing a rate guarantee to individual or groups of flows in a router through intelligent management of buffers. Rate guarantees are provided by intelligently allocating and isolating the buffers available to each flow. In its most basic form, the method applies to output queued network devices with a simple FIFO scheduler, where a number of streams some with rate reservations are sought to be multiplexed onto an outgoing link. The method involves strictly partitioning the buffer into portions strictly reserved for each flow in proportion to its link reservation. This ensures that each stream obtains the link reservation rate in a scalable manner. A particular embodiment of the invention allow for a portion of the buffer to be strictly partitioned while allowing streams full access to the remainder of the buffer. Other embodiments utilize the use of a link scheduler to divide bandwidth amongst a number of queues, while using buffer management to facilitate bandwidth amongst a number of flows in each queue.
-
公开(公告)号：GB2341751A
公开(公告)日：2000-03-22
申请号：GB9928907
申请日：1998-03-05
Applicant: IBM
Inventor： DELP GARY SCOTT , FIROIU VICTOR , GUERIN ROCH ANDRE , LEICHTY PHILIP LYNN , POULTER DAVID RICHARD , PERIS VINOD GERARD JOHN , RAJAN RAJENDRAN , SHAFFER JOHN HANDLEY
Abstract: A method and apparatus are provided for scheduling the transmission of cells of a plurality of data streams in a communications network. A multiple tier cell scheduler is provided that includes at least two scheduling timing wheels. The priority of a first timing wheel is higher than the priority of a second timing wheel. The priority of the second timing wheel is higher than the priority of an optional third timing wheel. The third timing wheel includes a best effort operational mode. The relative rates between data streams are maintained, while the absolute rates of the data streams are increased or decreased in the lowest priority wheel.
-
公开(公告)号：GB2339371A
公开(公告)日：2000-01-19
申请号：GB9910771
申请日：1999-05-11
Applicant: IBM
Inventor： GUERIN ROCH A , KAMAT SANJAY DAMODAR , PAN PING P , PERIS VINOD GERARD JOHN , RAJAN RAJENDRAN
Abstract: A method of providing a rate guarantee to individual or groups of flows in a router through intelligent management of buffers. Rate guarantees are provided by intelligently allocating and isolating the buffers available to each flow. In its most basic form, the method applies to output queued network devices with a simple FIFO scheduler, where a number of streams some with rate reservations are sought to be multiplexed onto an outgoing link. The method involves strictly partitioning the buffer into portions strictly reserved for each flow in proportion to its link reservation. This ensures that each stream obtains the link reservation rate in a scalable manner. A particular embodiment of the invention allow for a portion of the buffer to be strictly partitioned while allowing streams full access to the remainder of the buffer. Other embodiments utilize the use of a link scheduler to divide bandwidth amongst a number of queues, while using buffer management to facilitate bandwidth amongst a number of flows in each queue.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.017 seconds)
