The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Sep. 06, 1994
Filed:
Oct. 20, 1992
Marianne F Paker, West Chicago, IL (US);
Robert L Pawelski, Lisle, IL (US);
William A Payne, III, Glen Ellyn, IL (US);
Gaylord W Richards, Lisle, IL (US);
AT&T Bell Laboratories, Murray Hill, NJ (US);
Abstract
In a time-space-time switching network that provides connections at a hierarchy of data rates, a path-hunt arrangement effects establishment of a switched connection of a given bandwidth as a collection of a plurality of connections of smaller bandwidths of different sizes. Connections are first found at the highest rate of the hierarchy to satisfy as much of the given bandwidth as possible. Then, connections are found at the lower rates to satisfy any remaining unsatisfied bandwidth. The path-hunt uses a hierarchy of status tables, corresponding to the hierarchy of rates, for each time-switching element of the network. The tables have entries that define availability of time slots--representing bandwidth of the tables' corresponding rates--between that time-switching element and a space-switching stage of the network. Connections are provided at the highest rate by finding matching idle time-slot entries in the high rate status tables for the two time-switching elements involved in the connection. Connections are provided at a lower rate by finding matching partially-full time-slot entries in the highest rate status tables for the two time-switching elements and then finding matching idle time-slot entries in the corresponding lower-rate status tables. To maximize path-hunt efficiency while maintaining non-blocking performance, the path-hunt follows a search hierarchy for lower-rate connections that first searches for matching partially-full time-slot entries in higher-rate status tables, and uses idle time-slot entries in higher-rate status tables only as a last resort.