B-TREE - A HIGH-PERFORMANCE SWITCHING STRUCTURE FOR ATM WITH DUAL INPUT BUFFERING()

A high-performance ATM switch (B+-tree switch) is proposed for B-ISDN. This switch embeds multiple baseline networks tightly to improve the performance. The interconnection algorithm offers many virtual multist age interconnection networks between the input and output ports to res olve the conflict problem. This proposed switch retains the advantages of multistage interconnection networks but is much more robust in the sense that multiple paths are available between each input-output pai r: The proposed switch has properties such as very simple routing algo rithms (self-routing) and that they can be recursively constructed in a modular way. The sufficient multiple paths are used to route cells u nder the condition that internal conflicts occur in switching elements . Analysis results show that the switch achieves good loss-delay perfo rmance even when a very heavy traffic load is offered.