公开(公告)号：DE69013886D1

公开(公告)日：1994-12-08

申请号：DE69013886

申请日：1990-04-11

Applicant: IBM

Inventor： HEINZMANN PETER DR ,  MUELLER JOHANN RUDOLF ,  NASSEHI MEHDI DR

IPC: G06F13/36 ,  H04L12/28 ,  H04L12/417 ,  H04L12/40

Abstract: In a communication system comprising node stations connected to a bus, a headend unit releases, for sequentially numbered cycles, time slots as previously requested in an order pad passing procedure. To enable reuse of time slots which otherwise would be utilized only during a fraction of their existence (i.e. from a source to a destination which in many cases are located close together), the order pad additionally includes a furthest destination label (DST-MAX) and a requested maximum (REQ-MAX) which are updated at each node. This allows to set, for any cycle, at some nodes a reuse flag (REU-FLG). In this way, the bus is partitioned into sections according to actual traffic, and the headend only releases a number of time slots which satisfies the needs of the section where the maximum of time slots was requested. Thus, the number of time slots, i.e. the length of each cycle can be significantly reduced, thereby increasing system throughput.

公开(公告)号：DE69013886T2

公开(公告)日：1995-05-18

申请号：DE69013886

申请日：1990-04-11

Applicant: IBM

Inventor： HEINZMANN PETER DR ,  MUELLER JOHANN RUDOLF ,  NASSEHI MEHDI DR

IPC: G06F13/36 ,  H04L12/28 ,  H04L12/417 ,  H04L12/40

Abstract: In a communication system comprising node stations connected to a bus, a headend unit releases, for sequentially numbered cycles, time slots as previously requested in an order pad passing procedure. To enable reuse of time slots which otherwise would be utilized only during a fraction of their existence (i.e. from a source to a destination which in many cases are located close together), the order pad additionally includes a furthest destination label (DST-MAX) and a requested maximum (REQ-MAX) which are updated at each node. This allows to set, for any cycle, at some nodes a reuse flag (REU-FLG). In this way, the bus is partitioned into sections according to actual traffic, and the headend only releases a number of time slots which satisfies the needs of the section where the maximum of time slots was requested. Thus, the number of time slots, i.e. the length of each cycle can be significantly reduced, thereby increasing system throughput.