System and method for allocating a shared resource among competing devices

• US 5,491,694 A
• Filed: 10/05/1994
• Issued: 02/13/1996
• Est. Priority Date: 01/28/1994
• Status: Expired due to Term

• Current Assignee: Enterasys Networks Incorporated (Extreme Networks, Inc.)
• Original Assignee: Cabletron Systems Incorporated (Extreme Networks, Inc.)
• Inventors: Oliver, Chris, Hullette, Dan
• Primary Examiner(s): Kizou, Hassan
• Application Number:
  US08/318,277
• Time in Patent Office: 496 Days
• Field of Search: 370/85.2, 370/85.4, 370/85.5, 370/85.6, 370/85.7, 370/95.1, 370/95.3, 370/94.1, 370/94.2, 370/94.3, 395/325, 395/725, 364/241.8, 364/242.6, 364/242.9, 364/242.92
• US Class Current: 370/455
• CPC Class Codes: H04L 12/5602 Bandwidth control in ATM Networks, e.g. leaky bucket
• CPC Class Codes: H04L 2012/5619 Network Node Interface, e.g. tandem connections, transit switching
• CPC Class Codes: H04L 2012/5626 Network management, e.g. Intelligent nets
• CPC Class Codes: H04L 2012/5631 Resource management and allocation
• CPC Class Codes: H04L 2012/564 Connection-oriented
• CPC Class Codes: H04L 2012/5645 Connectionless
• CPC Class Codes: H04L 2012/5665 Interaction of ATM with other protocols
• CPC Class Codes: H04L 45/10 Routing in connection-oriented networks, e.g. X.25 or ATM
• CPC Class Codes: H04L 45/36 Backward learning
• CPC Class Codes: H04L 49/203 ATM switching fabrics with multicast or broadcast capabilities
• CPC Class Codes: H04L 49/256 Routing or path finding in ATM switching fabrics
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

Apparatus and method for establishing "virtual connections" through a packet switched data communications network, the network including a plurality of end systems and switches connected by links. Each end system has a unique physical layer address and each switch has a connection database of valid connections between different ports on the switch and a switching mechanism for establishing temporary connections. Each switch is registered with a connection server such that, prior to transmission of a connectionsless datagram from a first end system to a second end system, a path of valid remains as a connectionless datagram. In other aspects, an improved method is provided for allocating bandwidth among competing devices requesting access to a bandwidth limited shared resource (e.g., the previously defined switch), and to a search method for making a best path determination through the network based on a number of constraints.

Claims

1. A method of allocating a bandwidth-limited, shared resource among a plurality of competing devices, comprising the steps of:

dividing an available time of the resource into a plurality of time segments;

allocating one or more of the time segments among the competing devices in a predetermined order to provide a first level of arbitration;

providing a list of competing devices;

allocating a token entitling one of the competing devices in the list of competing devices to a time segment;

allocating a time segment to the competing device having the token if the time segment is unallocated after the first level of arbitration to provide a second level of arbitration; and

allocating the time segment to the device having a predetermined rank in the list of competing devices if the time segment is unallocated after the second level of arbitration to provide a third level of arbitration.

2. The method of claim 1, wherein the shared resource is a data transfer device having a plurality of interfaces and the competing devices are connected to the interfaces, and wherein the allocation of time segments is performed to control data transfer to and from the interfaces.

3. The method of claim 2, wherein the competing devices have different bandwidth requirements and are allowed to participate in one or more of the first, second and third levels of arbitration based on their bandwidth requirements.

4. The method of claim 3, wherein a first competing device requiring a deterministic service is allocated all of its required bandwidth in the first level of arbitration.

5. The method of claim 4, wherein a second competing device requiring a nondeterministic service is allocated less than all of its required bandwidth in the first level of arbitration and is allowed to participate in at least one of the second and third levels of arbitration.

6. The method of claim 1, wherein the allocating steps are performed in a time segment prior to the time segment being allocated.

7. A system for allocating a bandwidth-limited, shared resource among a plurality of competing devices, comprising:

means for dividing an available time of the resource into a plurality of time segments;

means for allocating the time segments among the competing devices in a predetermined order to provide a first level of arbitration;

means for providing a list of competing devices;

means for allocating a token entitling one of the competing devices in the list of competing devices to a time segment;

means for allocating a time segment to the competing device having the token if the time segment is unallocated after the first level of arbitration to provide a second level of arbitration; and

means for allocating the time segment to the device having a predetermined rank in the list of competing devices if the time segment is unallocated after the second level of arbitration to provide a third level of arbitration.

9. The system of claim 7, wherein the means for allocating time segments in the first level of arbitration is a programmable time division multiplexing arbiter.

10. The system of claim 7, wherein the means for dividing an available time includes an allocation memory having a plurality of segments which correspond to the plurality of time segments.

11. The system of claim 7, wherein at least one of the allocating means includes means for allowing a competing device to participate in less than all of the first, second and third levels of arbitration.

12. The system of claim 11, wherein the allowing means enables a first competing device to participate in only the first level of arbitration.

13. The system of claim 12, wherein the allowing means enables a second competing device to participate in at least one of the second and third levels of arbitration.

8. The system of class 7, wherein the shared resource is a data transfer device having a plurality of interfaces and the competing devices are connected to the interfaces, and wherein the allocation of time segments controls data transfer to and from the interfaces.