-
公开(公告)号：DE69534171D1
公开(公告)日：2005-06-02
申请号：DE69534171
申请日：1995-01-24
Applicant: IBM
Inventor： CIDON ISRAEL , GEORGIADIS LEONIDAS , GUERIN ROCH ANDRE , SHAVITT YUVAL YITZCHAK , SLATER ANDREW EMLYN
IPC: G06F13/00 , H04L12/433 , H04L12/24 , H04L12/42 , H04L29/00
Abstract: A non-quota access indicator is circulated among nodes in a multi-node quota based communication system with a shared resource, indicating maximum possible non-quota access to the shared resource to a given node receiving same. Upon arrival at a node, the indicator is saved and then updated to reflect the current status of that node as either starved or satisfied, the former being a condition of currently having quota remaining and a shared resource access requirement, and the latter being a condition of either currently having no remaining quota or having no current shared resource access requirement. After updating, the node immediately propagates the indicator to the next node in the system. When a node without quota requires access to the shared resource, it compares its requirement to the last stored indicator and accesses the shared resource if the stored indicator is equal to or greater than the access requirement.
-
公开(公告)号：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.
-
公开(公告)号：DE69328284D1
公开(公告)日：2000-05-11
申请号：DE69328284
申请日：1993-11-04
Applicant: IBM
Inventor： CIDON ISRAEL , GOPAL INDER SARAT , GUERIN ROCH ANDRE
Abstract: A fast bandwidth reservation method and system used in packet-switched networks that reserve bandwidth for a data transfer over links in a path between a source node, at least one intermediate node, and a destination node with minimal latency where the source node desires to send data to the destination node along the specific path using at least a minimum bandwidth and up to a maximum bandwidth. The goal of the method and system is to reserve bandwidth for a data transfer in the minimal amount of time. No link on the path between the source node and destination node has more band-width allocated for the source node than the minimum allocated for the previous forward links on the path. Links on the path between the source node and destination node have their bandwidth allocation for the data transfer adjusted based on the final minimum bandwidth allocated for the data transfer.
-
公开(公告)号：DE69017111T2
公开(公告)日：1995-08-10
申请号：DE69017111
申请日：1990-05-18
Applicant: IBM
Inventor： GUERIN ROCH ANDRE , LIEN YEONG-CHANG
-
公开(公告)号：DE69533680T2
公开(公告)日：2005-10-20
申请号：DE69533680
申请日：1995-01-24
Applicant: IBM
-
Patent Agency Ranking
公开(公告)号：DE68927472T2
公开(公告)日：1997-04-30
申请号：DE68927472
申请日：1989-09-29
Applicant: IBM
Inventor： LIEN YEONG-CHANG SA-S , GUERIN ROCH ANDRE
IPC: G06F15/173 , H04J14/00 , H04J13/00 , H04Q11/04 , G06F15/16
Abstract: In a data communications network the routing of data items from a group of eight source processors to a group of eight destination processors is controlled by code values assigned to each of the data values. The data items to be routed are bit-serial binary signals. These are encoded by the source processor using a pair of code values, one for each value of a bit of the binary signal. The eight source processors each encode eight bit-serial signals using respectively different code tables. The code tables are generated as different permutations of a basic code set. Each code table has the property that any additive combination of encoded values for all of the data items in a group produces a unique sum. The eight encoded values produced by each processor are summed to produce a set of analog channel symbols that are transmitted over an analog channel to a central switch fabric. In the switch fabric, the channel symbols are partially decoded to recover the encoded data values. The data values are regrouped according to their destination processors and summed to produce further sets of channel symbols which are transmitted to the destination processors. At the destination processors, the data values are completely decoded and assigned to separate input terminals of the destination processors based on their source processor.
-
公开(公告)号：DE68927472D1
公开(公告)日：1997-01-02
申请号：DE68927472
申请日：1989-09-29
Applicant: IBM
Inventor： LIEN YEONG-CHANG SA-S , GUERIN ROCH ANDRE
IPC: G06F15/173 , H04J14/00 , H04J13/00 , H04Q11/04 , G06F15/16
Abstract: In a data communications network the routing of data items from a group of eight source processors to a group of eight destination processors is controlled by code values assigned to each of the data values. The data items to be routed are bit-serial binary signals. These are encoded by the source processor using a pair of code values, one for each value of a bit of the binary signal. The eight source processors each encode eight bit-serial signals using respectively different code tables. The code tables are generated as different permutations of a basic code set. Each code table has the property that any additive combination of encoded values for all of the data items in a group produces a unique sum. The eight encoded values produced by each processor are summed to produce a set of analog channel symbols that are transmitted over an analog channel to a central switch fabric. In the switch fabric, the channel symbols are partially decoded to recover the encoded data values. The data values are regrouped according to their destination processors and summed to produce further sets of channel symbols which are transmitted to the destination processors. At the destination processors, the data values are completely decoded and assigned to separate input terminals of the destination processors based on their source processor.
-
公开(公告)号：DE69534171T2
公开(公告)日：2006-03-09
申请号：DE69534171
申请日：1995-01-24
Applicant: IBM
Inventor： CIDON ISRAEL , GEORGIADIS LEONIDAS , GUERIN ROCH ANDRE , SHAVITT YUVAL YITZCHAK , SLATER ANDREW EMLYN
IPC: G06F13/00 , H04L12/24 , H04L12/42 , H04L12/433 , H04L29/00
Abstract: A non-quota access indicator is circulated among nodes in a multi-node quota based communication system with a shared resource, indicating maximum possible non-quota access to the shared resource to a given node receiving same. Upon arrival at a node, the indicator is saved and then updated to reflect the current status of that node as either starved or satisfied, the former being a condition of currently having quota remaining and a shared resource access requirement, and the latter being a condition of either currently having no remaining quota or having no current shared resource access requirement. After updating, the node immediately propagates the indicator to the next node in the system. When a node without quota requires access to the shared resource, it compares its requirement to the last stored indicator and accesses the shared resource if the stored indicator is equal to or greater than the access requirement.
-
-
-
-
-
-
-
Search Results
11
records
(took 0.017 seconds)
