Traffic management for frame relay switched data service

• US 6,847,611 B1
• Filed: 09/01/2000
• Issued: 01/25/2005
• Est. Priority Date: 12/10/1990
• Status: Expired due to Fees

• Current Assignee: AT&T Corporation (AT&T, Inc.)
• Original Assignee: AT&T Corporation (AT&T, Inc.)
• Inventors: Medamana, John Babu, Saksena, Vikram R., Holmgren, Stephen L., Chase, Christopher J.
• Primary Examiner(s): Chin, Wellington
• Assistant Examiner(s): PHAM, BRENDA H
• Application Number:
  US09/654,616
• Time in Patent Office: 1,607 Days
• Field of Search: 370/232, 370/234, 370/235, 370/236, 370/237, 370/254, 370/412, 370/414, 370/416, 370/448, 370/468, 370/395, 370/429
• US Class Current: 370/232
• CPC Class Codes: H04L 12/4608 LAN interconnection over ATM networks
• CPC Class Codes: H04L 12/5602 Bandwidth control in ATM Networks, e.g. leaky bucket
• CPC Class Codes: H04L 2012/5636 Monitoring or policing, e.g. compliance with allocated rate, corrective actions
• CPC Class Codes: H04L 2012/5645 Connectionless
• CPC Class Codes: H04L 2012/567 Frame Relay over ATM
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/17 Shortcut routing, e.g. using next hop resolution protocol [NHRP]
• CPC Class Codes: H04L 49/105 ATM switching elements
• CPC Class Codes: H04Q 11/0478 Provisions for broadband connections

Abstract

A new type of data transport service which uses a frame relay layer 2 data link connection identifier (DLCI) to select among various service types, feature sets, and/or closed user groups (CUGs). A layer 3 address may be extracted from a layer 2 frame, and the layer 3 address information may be used to route a data packet over a packet-switched network according to the service classes, feature sets, and/or CUGs selected. At the destination, the layer 3 data packet may again be enclosed in a layer 2 frame with a DLCI indicating the service classes, features sets, and/or CUGs. Because the use of conventional permanent virtual circuits (PVCs) is not required in aspects of the invention, new methods of measuring and managing network traffic are presented.

Claims

1. In a fast-packet network, a method comprising the step of

managing according to a committed delivery rate at least one of a plurality of actual network transmission rates for at least one of a plurality of active sources, the committed delivery rate being associated with a destination, wherein the committed delivery rate comprises an average delivery rate based on a variable length time window, said average deliver rate committed to deliver to the destination.

2. The method of claim 1 further including the step of averaging at least one of a plurality of offering rates of at least one of the active sources over a time window.

3. The method of claim 2 further including the step of defining a length of the time window.

4. The method of claim 1 further including the step of assigning a destination rate share to each of a first group of the active sources, the first group of active sources offering to send a plurality of data packets to the destination.

5. The method of claim 4 wherein the step of assigning includes the step of assigning the destination rate share according to an identity of the destination.

6. The method of claim 4 wherein the step of managing includes the step of managing according to the destination rate shares of the first group of active sources an actual network transmission rate for at least one of the active sources in the first group of active sources.

7. The method of claim 1 further including the step of determining the first reference rate according to a total number of inactive sources.

8. The method of claim 1 further including the step of determining the first reference rate according to a first priority classification of the first inactive source.

9. The method of claim 1 wherein the step of managing includes the step of notifying at least one of the active sources of network congestion by providing a backward congestion notification to the at least one active source when an offering rate of the at least one active source exceeds the actual network transmission rate for the at least one active source.

10. The method of claim 1 wherein the step of managing includes the step of notifying the destination of network congestion by providing a forward congestion notification to the destination when an offering rate of at least one of the active sources exceeds the actual network transmission rate for the at least one active source, the at least one active source offering to send a plurality of data packets to the destination.

11. In a fast-packet network, a method comprising the step of

managing according to a plurality of destination rate shares, at least one of the destination rate shares assignable according to an identity of a destination, at least one of a plurality of actual network transmission rates for at least one of a plurality of active sources, each destination rate share being associated with one of the active sources.

12. The method of claim 11 further including the step of assigning at least one of the destination rate shares according to an identity of a destination.

13. The method of claim 11 further including the step of averaging at least one of a plurality of offering rates of at least one of the active sources over a time window.

14. The method of claim 13 further including the step of defining a length of the time window to be variable.

15. The method of claim 11 further including the step of reserving a first portion of network bandwidth for a first inactive source sufficient to allow the first inactive source to begin to send data packets through the network at a rate at least equal to a first reference rate.

16. The method of claim 15 further including the step of determining the first reference rate according to a total number of inactive sources.

17. The method of claim 15 further including the step of determining the first reference rate according to a first priority classification of the first inactive source.

18. The method of claim 11 wherein the step of managing includes the step of notifying at least one of the active sources of network congestion by providing a backward congestion notification to the at least one active source when an offering rate of the at least one active source exceeds the actual network transmission rate for the at least one active source.

19. The method of claim 18 further including the step of reducing the offering rate of the at least one active source responsive to the backward congestion notification.

20. The method of claim 11 wherein the step of managing includes the step of notifying a destination of network congestion by providing a forward congestion notification to the destination when an offering rate of at least one of the active sources exceeds the actual network transmission rate for the at least one active source, the at least one active source offering to send a plurality of data packets to the destination.

21. In a fast packet network, a method comprising the step of

managing according to a committed delivery rate a plurality of actual network transmission rates for a plurality of active sources, the committed delivery rate being associated with a destination, wherein the committed delivery rate comprises an average delivery rate based on a variable length time window, said average delivery rate committed to deliver to the destination.

22. In a fast packet network, a method comprising the steps of:

managing according to a plurality of destination rate shares at least one of a plurality of actual network transmission rates for at least one of a plurality of active sources, each destination rate share being associated with one of the active sources;

averaging at least one of a plurality of offering rates of at least one of the active sources over a time window;

offering to send a plurality of data packets to a destination at a rate no greater than a committed delivery rate associated with the destination.