Methods for flexibly allocating bandwidth for a point-to-point serial, bidirectional communication path

• US 5,051,984 A
• Filed: 07/30/1990
• Issued: 09/24/1991
• Est. Priority Date: 02/09/1989
• Status: Expired due to Term

• Current Assignee: Data General Corp. (Dell Technologies Inc.)
• Original Assignee: Data General Corp. (Dell Technologies Inc.)
• Inventors: Mostafa, Asghar D., Berry, Kirk H.
• Primary Examiner(s): Olms, Douglas W.
• Assistant Examiner(s): Marcelo, Melvin
• Application Number:
  US07/561,817
• Time in Patent Office: 421 Days
• Field of Search: 370/17, 370/79, 370/80, 370/84, 370/85.7, 370/95.1, 370/110.1
• US Class Current: 370/468
• CPC Class Codes: H04J 3/1682 Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers

Abstract

Methods are set forth which provide for the allocation of bandwidth for point-to-point, serial, bidirectional communication paths in a digital switching system. Bandwidth allocation is performed at both ends of a path (e.g. T1 line, IML, etc.) and may take place in either direction. Furthermore, according to the preferred embodiment of the invention, the Bandwidth Allocation Facility (BAF) at each end of a given path allocates bandwidth in integer multiples of maximum switching system granularity. The BAF also supports the implementation of user requests for any one of a plurality of allocation and boundary rules. To minimize the probability of contention and out of band signalling between the BAF pair associated with a given path, a front-to-back search mechanism is assigned for one BAF of the pair, while the other BAF utilizes a back-to-front search mechanism. In this way contention occurs only when a path'"'"'s capacity nears exhaustion while uneven loading (one side of the path versus the other) is accommodated. Further yet, methods are set forth which support rapid deallocation of bandwidth and status reporting.

Claims

1. A method of allocating bandwidth on each of a plurality of data paths in a digital communication switching system that has a switching granularity of "x" bits per second, wherein each of said data paths has a bandwidth divided into "m" slots, the slots each being subdivided into "n" fragments, each x bits per second wide, comprising the steps of:

(a) inputting a bandwidth allocation parameter, to bandwidth allocation control means, to specify a particular fragment allocation rule predefined to correspond to said bandwidth allocation parameter; and

(b) allocating bandwidth, via said bandwidth allocation control means, in integer multiples of x bits per second in accordance with the predefined allocation rule specified by said bandwidth allocation parameter.

2. A method as set forth in claim 1 wherein said step of allocating bandwidth is performed at both ends of a given data path.

3. A method as set forth in claim 1 further comprising the step of maintaining a bit map for each end of a given data path wherein each map has at least m×

n bit locations, each of said m×

n bits corresponding to a different fragment on the path for which the bit maps are being maintained and further wherein the state of each bit indicates whether a particular fragment is available.

4. A method as set forth in claim 3, further comprising the steps of allocating bandwidth from a given end of said given data path by identifying an available fragment on said line utilizing the bit map being maintained for the given end of the data path.

5. A method as set forth in claim 3 further comprising the step of changing the state of the bit associated with the available fragment being allocated to thereby record that the fragment has been placed into use.

6. A method as set forth in claim 5 further comprising the step of deallocating previously allocated bandwidth on a given data path by changing the state of the bit corresponding to the fragment being deallocated.

7. A method as set forth in claim 3 wherein each bit map is linearly organized, having a first end and a second end opposite to said first end, and further wherein the step of allocating bandwidth is performed by first and second bandwidth allocation control means pairs, the first control means of said pair being used to allocate bandwidth from a first end of a given data path and the second control means of said pair being used to allocate bandwidth from a second, opposite end, of said given data path, wherein the first control means allocates bandwidth by identifying an available fragment starting at the first end of the bit map maintained for the first end of said given data path.

8. A method as set forth in claim 7 wherein said step of allocating bandwidth is further performed by said second control means allocating bandwidth by identifying an available fragment starting at the second end of the bit map maintained for the second end of said given data path.

9. A method as set forth in claim 1 further comprising the step of performing nonrestrictive bandwidth allocation in response to said bandwidth allocation parameter being input to said allocation control means.

10. A method as set forth in claim 1 further comprising the step of performing slot restrictive bandwidth allocation in response to said bandwidth allocation parameter being input to said allocation control means.

11. A method as set forth in claim 1 further comprising the step of performing contiguous bandwidth allocation in response to said bandwidth allocation parameter being input to said allocation control means.

12. A method as set forth in claim 1 further comprising the step of performing contiguous slot restrictive bandwidth allocation in response to said bandwidth allocation parameter being input to said allocation control means.

13. A method of allocating bandwidth on each of a plurality of data paths in a digital communication switching system that has a switching granularity of "x" bits per second, wherein each of said data paths has a bandwidth divided into "m" slots, the slots each being subdivided into "n" fragments, each x bits per second wide, comprising the steps of:

(a) inputting at least one bandwidth allocation parameter to bandwidth allocation control means to specify a particular fragment allocation rule predefined to correspond to each bandwidth allocation parameter; and

(b) allocating bandwidth, via said bandwidth control means, in integer multiples of said granularity for each and every bandwidth request.

14. A method as set forth in claim 13 further comprising the step of determining, via said bandwidth allocation control means based on the bandwidth allocation parameter input thereto, whether any combination of the n×

m fragments may be used to fulfill a particular bandwidth request.

15. A method as set forth in claim 13 further comprising the step of determining, via said bandwidth allocation control means based on the bandwidth allocation parameter input thereto, whether contiguous fragments must be assigned to a particular bandwidth request.

16. A method as set forth in claim 13 further comprising the step of determining, via said bandwidth allocation control means based on the bandwidth allocation parameter input thereto, whether fragments to fulfill a particular bandwidth request must come form one of said m slots.

17. A method as set forth in claim 13 further comprising the step of determining, via said bandwidth allocation control means based on the bandwidth allocation parameter input thereto, whether fragments to fulfill a particular bandwidth request must be contiguous and come from one of said m slots.

18. A method as set forth in claim 13 further comprising the step of maintaining a bit map for each end of at least one data path, wherein each map has at least m×

n bit locations, each of said m×

n bits corresponding to a different fragment on the path for which the bit maps are being maintained and further wherein the state of each bit indicates whether a particular fragment is available.

19. A method of allocating bandwidth on each of a plurality of data paths in a digital communication switching system that has a switching granularity of "x" bits per second, wherein each of said data paths has a bandwidth divided into "m" slots, the slots each being subdivided into "n" fragments, each x bits per second wide, comprising the steps of:

(a) inputting at least one bandwidth allocation parameter to bandwidth allocation control means to specify a particular fragment allocation rule predefined to correspond to each bandwidth allocation parameter;

(b) allocating bandwidth, via said bandwidth control means, in integer multiples of said granularity for each and every bandwidth request;

(c) determining, via said bandwidth allocation control means based on the bandwidth allocation parameter input thereto, whether any combination of the n×

m fragments may be used to fulfill a particular bandwidth request, whether contiguous fragments must be assigned to a particular bandwidth request, whether fragments to fulfill a particular bandwidth request must come from one of said m slots, and whether fragments to fulfill a particular bandwidth request must be contiguous and come from one of said m slots.