-
公开(公告)号：JPH10276220A
公开(公告)日：1998-10-13
申请号：JP5633098
申请日：1998-03-09
Applicant: IBM
Inventor： DELP GARY SCOTT , LEICHTY PHILIP LYNN
Abstract: PROBLEM TO BE SOLVED: To provide the method and device for scheduling transmission of cells in a data stream through a communication network. SOLUTION: In the case that a best effort scheduler includes pluralities of timing wheels, the priority of a best effort timing wheel is placed lower than the priority of the others. Data of each data stream are stored in a corresponding data queue. A next object transfer time of each data cell queue is calculated by using a prescribed logic channel descriptor parameter. A timing wheel with lower or higher priority is selected, a time slot of a timing wheel is calculated based on an identified object transmission time of each active data cell queue, an active indication is set and an entry pointing out a corresponding data cell queue is stored. A relative speed between data streams is maintained but the absolute speed is adjusted in a wheel with lower priority.
-
公开(公告)号：JPH1069468A
公开(公告)日：1998-03-10
申请号：JP15324897
申请日：1997-06-11
Applicant: IBM
Inventor： AAKER KENNETH DALE , DELP GARY SCOTT , BRECH BRAD LOUIS
Abstract: PROBLEM TO BE SOLVED: To efficiently process the response of a server by making a server predict a next request on the basis of a current request of a client and set a trigger, and send the response with the trigger when the predicted request of the client arrives. SOLUTION: A computer communication network system 20 is defined as a multiprocessor mutual communication network which has many processor systems connected to a communication network 160 and uses a clinet/server request/response interacting method. The server system 200 generates a predicted response by using prediction logic 230 and sets the trigger. This trigger uses a data comparison trigger setting function 234 to recognize a match of the predicted request of the client. Then when the predicted request of the client arrives, the trigger sends the response by using a data transmitting function 236.
-
公开(公告)号：DE69332532D1
公开(公告)日：2003-01-16
申请号：DE69332532
申请日：1993-02-23
Applicant: IBM
Inventor： AUERBACK RICHARD ALLAN , BLADES JERRY ALLAN , BYRN JONATHAN WILLIAM , DELP GARY SCOTT
Abstract: A method and a system in a distributed data processing network for enhancing the processing of a plurality of related data packets received at a receiving station (100) within the distributed data processing network, each of the data packets having a header associated herewith includes sequentially receiving a number of data packets at the receiving station. Next, the header associated with a first data packet is examined and a predicted profile is generated for comparison with a related subsequent data packet. The next data packet received is then compared with the predicted profile to determine whether or not the two data packets may be consolidated.
-
公开(公告)号：DE69735866T2
公开(公告)日：2007-01-25
申请号：DE69735866
申请日：1997-03-19
Applicant: IBM
Inventor： AAKER KENNETH DALE , DELP GARY SCOTT , BRECH BRAD LOUIS
Abstract: A method and apparatus are provided for generation of predicted responses in a computer communications network system (20). A server (200) in the computer communications network system predicts the client's next request (604) based on the present client's request (600). The server sets a trigger (608) that recognizes a match of the client's predicted request. When a client's predicted request arrives, the trigger sends the response. Additionally, the server associates a timeout action (610) with the predicted response so that if a predicted request is not received within the timeout interval or other events occur before the predicted request arrives, the triggered response is removed and an alternative action is performed.
-
公开(公告)号：DE69735866D1
公开(公告)日：2006-06-22
申请号：DE69735866
申请日：1997-03-19
Applicant: IBM
Inventor： AAKER KENNETH DALE , DELP GARY SCOTT , BRECH BRAD LOUIS
Abstract: A method and apparatus are provided for generation of predicted responses in a computer communications network system (20). A server (200) in the computer communications network system predicts the client's next request (604) based on the present client's request (600). The server sets a trigger (608) that recognizes a match of the client's predicted request. When a client's predicted request arrives, the trigger sends the response. Additionally, the server associates a timeout action (610) with the predicted response so that if a predicted request is not received within the timeout interval or other events occur before the predicted request arrives, the triggered response is removed and an alternative action is performed.
-
Patent Agency Ranking
公开(公告)号：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.
-
公开(公告)号：CA2086695C
公开(公告)日：1997-07-01
申请号：CA2086695
申请日：1993-01-05
Applicant: IBM
Inventor： AUERBACH RICHARD ALLAN , BLADES JERRY ALLEN , BYRN JONATHAN WILLIAM , DELP GARY SCOTT
Abstract: A method and a system in a distributed data processing network for enhancing the processing of a plurality of related data packets received at a receiving station within the distributed data processing network, each of the data packets having a header associated herewith includes sequentially receiving a number of data packets at the receiving station. Next, the header associated with a first data packet is examined and predicted profile is generated for comparison with a related subsequent data packet. The next data packet received is then compared with the predicted profile to determine whether or not the two data packets may be consolidated.
-
公开(公告)号：ES2184740T3
公开(公告)日：2003-04-16
申请号：ES93480010
申请日：1993-02-23
Applicant: IBM
Inventor： AUERBACK RICHARD ALLAN , BLADES JERRY ALLAN , BYRN JONATHAN WILLIAM , DELP GARY SCOTT
Abstract: A method and a system in a distributed data processing network for enhancing the processing of a plurality of related data packets received at a receiving station (100) within the distributed data processing network, each of the data packets having a header associated herewith includes sequentially receiving a number of data packets at the receiving station. Next, the header associated with a first data packet is examined and a predicted profile is generated for comparison with a related subsequent data packet. The next data packet received is then compared with the predicted profile to determine whether or not the two data packets may be consolidated.
-
公开(公告)号：GB2341751B
公开(公告)日：2000-08-09
申请号：GB9928907
申请日：1998-03-05
Applicant: IBM
-
公开(公告)号：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.
-
-
-
-
-
-
-
-
-
Search Results
16
records
(took 0.016 seconds)
