IP Library › Granted Patent US 9,215,181
Granted Patent B2
US 9,215,181 · App. 13/669,742 · Granted Dec 15, 2015

Systems and methods for managing a network

Inventor: Mehmet Toy (Allendale, NJ)
Assignee: Comcast Cable Communications, LLC
H04L47/26H04L43/0882
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 9,215,181
App. No.
13/669,742
Granted
Dec 15, 2015
Kind
B2
Abstract

Systems and methods for managing congestion in a network are disclosed. One method can comprise receiving a service tag at a first node, the service tag representing congestion information of at least a portion of the network. If the first node is a boundary node, the method comprises modifying a downstream data rate based upon the congestion information, and if the first node is not a boundary node, the method comprises transmitting the congestion information to a second node.

Claims (44)

1. A method comprising:

receiving a message at a first node, wherein the message comprises an upstream communication comprising one or more frames from a downstream device, and at least one of the one or more frames in the message comprises a service tag,

wherein the service tag represents congestion information of at least a portion of a network, and

wherein the message has traversed the portion of the network;

if the first node is a boundary node, modifying a downstream data rate based upon the congestion information; and

if the first node is not a boundary node, transmitting the congestion information to a second node, wherein the second node is upstream of the first node.

2. The method of claim 1 , wherein the service tag comprises discard eligibility data representing the congestion information.

3. The method of claim 2 , wherein the discard eligibility data representing the congestion information comprises a binary bit.

4. The method of claim 3 , wherein the binary bit having a value of one indicates a congested state of the at least a portion of the network.

5. The method of claim 3 , wherein the binary bit having a value of zero indicates a non-congested state of the at least a portion of the network.

6. The method of claim 1 , wherein the congestion information represents port level capacity.

7. The method of claim 1 , wherein modifying a downstream data rate comprises reducing a downstream data rate based upon a congestion control algorithm.

8. The method of claim 1 , wherein the second node is upstream of the first node.

9. The method of claim 1 , further comprising receiving the congestion information at the second node; if the second node is a boundary node, modifying a downstream data rate based upon the congestion information; and if the second node is not a boundary node, transmitting the congestion information to a third node, wherein the third node is upstream of the second node.

10. A method comprising:

determining congestion information of at least a portion of a network;

receiving a message, wherein the message comprises an upstream communication comprising one or more frames from a downstream device;

setting a service tag in at least one of the one or more frames in the message to represent the congestion information; and

transmitting the service tag to a first upstream device of the network in the message.

11. The method of claim 10 , wherein determining the congestion information comprises comparing a network parameter to a threshold value.

12. The method of claim 11 , wherein the network parameter comprises effective bandwidth.

13. The method of claim 10 , wherein the service tag comprises discard eligibility data representing the congestion information.

14. The method of claim 13 , wherein the discard eligibility data representing the congestion information comprises a binary bit.

15. The method of claim 14 , wherein the binary bit having a value of one indicates a congested state of the at least a portion of the network.

16. The method of claim 14 , wherein the binary bit having a value of zero indicates a non-congested state of the at least a portion of the network.

17. The method of claim 10 , further comprising receiving the congestion information at the first upstream device; if the first upstream device is a boundary node, modifying a downstream data rate based upon the congestion information; and if the first upstream device is not a boundary node, transmitting the congestion information to a second upstream device.

18. A method comprising:

receiving a first indication of network congestion in a service flow via a message in the service flow, wherein the message comprises a communication comprising one or more frames comprising a service tag that represents the service flow and the network congestion relating to the service flow;

determining an effective bandwidth for the service flow; and

modifying a data rate associated with the service flow based upon the effective bandwidth.

19. The method of claim 18 , wherein the service tag comprises discard eligibility data representing the indication of network congestion.

20. The method of claim 19 , wherein the discard eligibility data comprises a binary bit.

21. The method of claim 20 , wherein the binary bit having a value of one indicates a congested state of at least a portion of a network.

22. The method of claim 20 , wherein the binary bit having a value of zero indicates a non-congested state of at least a portion of a network.

23. The method of claim 18 , wherein the indication of network congestion represents connection level capacity.

24. The method of claim 18 , further comprising receiving a second indication of network congestion, the second indication relating to the service flow; determining a committed information rate for the service flow; and modifying the data rate associated with the service flow based upon the committed information rate.

25. The method of claim 1 , wherein the boundary node comprises a node that initiates congestion control.

26. The method of claim 1 , wherein the boundary node comprises a node that terminates congestion control.

27. The method of claim 1 , wherein the boundary node comprises a node that supports Ethernet virtual connection termination points.

28. The method of claim 1 , wherein the boundary node comprises a provider edge router.

29. The method of claim 1 , wherein the congestion information represents connection level capacity.

30. The method of claim 1 , wherein the congestion information represents class of service level capacity.

31. The method of claim 17 , wherein the boundary node comprises a node that supports Ethernet virtual connection termination points.

32. The method of claim 17 , wherein the boundary node comprises a provider edge router.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 6, 2012
From: TOY, MEHMET
To: COMCAST CABLE COMMUNICATIONS, LLC
Reel/Frame 029248/0234 →
Continuity (1)
Related Publication 20140126368A1 · May 8, 2014