Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Patent
1996-04-18
1998-07-21
Kizou, Hassan
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
370412, 359139, H04L 1256
Patent
active
057843724
ABSTRACT:
A switching matrix has a plurality of inputs and outputs which may be connected to each other. Pairs of inputs and outputs are examined sequentially to determine whether a connection can be made across the matrix. If the evaluated input and output are busy a connection cannot be made, and the input remains idle. When a connection can be made a connection is scheduled, taking into account the time for which that connection has been available. Inputs and outputs have controllers which continuously monitor, e.g. by using counters, the time for which connections have been available. Idle time at inputs is reduced, thereby increasing switching capacity. The switching matrix may be one which handles ATM traffic.
REFERENCES:
patent: 5091905 (1992-02-01), Amada
patent: 5124978 (1992-06-01), Chao
patent: 5126999 (1992-06-01), Munter
patent: 5301055 (1994-04-01), Bagchi
patent: 5475679 (1995-12-01), Munter
patent: 5539559 (1996-07-01), Cisneros et al.
patent: 5631908 (1997-05-01), Saxe
patent: 5633961 (1997-05-01), Kirkby et al.
Yang, "Fast Path Routing Techniques for Nonblocking Broadcast Networks", 1994 IEEE 13th Annual International Phoenix Conference, Apr. 12-15, 1994, pp. 358-364.
Kizou Hassan
Northern Telecom Limited
LandOfFree
Scheduling connections across a switching matrix does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Scheduling connections across a switching matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling connections across a switching matrix will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1654101