IP Library Granted Patent US 9,106,593
Granted Patent B2
US 9,106,593 · App. 13/915,698 · Granted Aug 11, 2015

Multicast flow reordering scheme

Inventors: Amit Singh (Fremont, CA); Deepak S. Mayya (Fremont, CA); Narendra J. Gathoo (San Jose, CA); Ranga Rajagopalan (Fremont, CA)
Assignee: CISCO TECHNOLOGY, INC.
H04L49/9057H04L12/18H04L49/552H04L49/201
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,106,593
App. No.
13/915,698
Granted
Aug 11, 2015
Kind
B2
Abstract

An example system and method for multicast flow reordering in a network is provided and includes receiving a data packet at an egress of a node, the data packet associated with a descriptor including at least one parameter; determining the at least one parameter of the descriptor; and processing the data packet for reordering based on the determining of the at least on parameter of the descriptor.

Claims (66)

1. A method for multicast data traffic flow reordering, comprising:

receiving a data packet at an egress of a node, the data packet associated with a descriptor including at least one parameter;

determining the at least one parameter of the descriptor; and

processing the data packet for the multicast data traffic flow reordering based on the determining of the at least one parameter of the descriptor.

2. The method of claim 1 , wherein the descriptor includes a status indicating that the data packet comprises a last data packet of a data traffic flow sent on a first sublink, wherein the data traffic flow is reassigned to a second sublink.

3. The method of claim 1 , wherein the descriptor includes a status indicating that the data packet comprises a new data packet of a data flow sent on a second sublink, wherein the data traffic flow is reassigned from a first sublink.

4. The method of claim 1 , further comprising:

reassigning the data flow from a first sublink to a second sublink of a plurality of sublinks;

determining that the first data packet is a last data packet of the data flow sent on the first sublink; and

sending the first data packet on the first sublink to the egress.

5. The method of claim 4 , wherein marking a last data packet of the data traffic flow sent on the first sublink comprises starting an ingress reorder timer, and wherein predetermined criteria is met if the egress reorder timer has not expired.

6. The method of claim 1 , further comprising:

determining if there is at least one second data packet marked new and stored in a reorder queue;

queuing the first data packet to an egress output queue;

dequeuing the at least one second data packet marked new from the reorder queue; and

resetting the reorder queue.

7. The method of claim 1 , further comprising:

determining that a particular data packet associated with a descriptor including a status of new is stored in a reorder queue;

determining if a first sublink ID is a sublink ID of a sublink to which a particular data flow for the particular data packet has been newly reassigned;

dequeuing a certain data packet from the reorder queue to an egress output queue; and

inserting the certain data packet at an end of the egress output queue.

8. The method of claim 1 , further comprising:

storing the data packet in a reorder queue associated with a context;

determining that the data packet is a first packet marked new in the reorder queue associated with the context; and

starting a timer associated with the context to run for a predetermined time.

9. The method of claim 8 , further comprising:

receiving a second data packet at an egress of a node, the second data packet associated with a second descriptor;

determining that the second descriptor includes a second status marked in-order;

determining if a second sublink ID is the same as a first sublink ID; and

resetting a reorder timer for the context.

10. The method of claim 8 , further comprising:

monitoring the timer associated with the context;

dequeuing data packets stored in the reorder queue to an egress output queue; and

clearing the reorder queue associated with the context.

11. An apparatus for multicast data traffic flow reordering, comprising:

an interface configured to receive network traffic;

one or more processors, wherein the apparatus is configured for:

receiving a data packet at an egress of the apparatus, the data packet associated with a descriptor including at least one parameter;

determining the at least one parameter of the descriptor; and

processing the data packet for the multicast data traffic flow reordering based on the determining of the at least one parameter of the descriptor.

12. The apparatus of claim 11 , wherein the descriptor includes a status indicating that the data packet comprises a last data packet of a data traffic flow sent on a first sublink, wherein the data traffic flow is reassigned to a second sublink.

13. The apparatus of claim 11 , wherein the descriptor includes a status indicating that the data packet comprises a new data packet of a data flow sent on a second sublink, wherein the data traffic flow is reassigned from a first sublink.

14. The apparatus of claim 11 , wherein the apparatus is further configured for:

reassigning the data flow from a first sublink to a second sublink of a plurality of sublinks;

determining that the first data packet is a last data packet of the data flow sent on the first sublink; and

sending the first data packet on the first sublink to the egress.

15. The apparatus of claim 14 , wherein marking a last data packet of the data traffic flow sent on the first sublink comprises starting an ingress reorder timer, and wherein predetermined criteria is met if the egress reorder timer has not expired.

16. The apparatus of claim 11 , wherein the apparatus is further configured for:

determining if there is at least one second data packet marked new and stored in a reorder queue;

queuing the first data packet to an egress output queue;

dequeuing the at least one second data packet marked new from the reorder queue; and

resetting the reorder queue.

17. The apparatus of claim 11 , wherein the apparatus is further configured for:

determining that a particular data packet associated with a descriptor including a status of new is stored in a reorder queue;

determining if a first sublink ID is a sublink ID of a sublink to which a particular data flow for the particular data packet has been newly reassigned;

dequeuing a certain data packet from the reorder queue to an egress output queue; and

inserting the certain data packet at an end of the egress output queue.

18. The apparatus of claim 11 , wherein the apparatus is further configured for:

storing the data packet in a reorder queue associated with a context;

determining that the data packet is a first packet marked new in the reorder queue associated with the context; and

starting a timer associated with the context to run for a predetermined time.

19. A non-transitory computer readable medium comprising instructions that, when executed, cause an apparatus to:

receive a data packet at an egress of a node, the data packet associated with a descriptor including at least one parameter;

determine the at least one parameter of the descriptor; and

process the data packet for the multicast data traffic flow reordering based on the determining of the at least one parameter of the descriptor.

20. The medium of claim 19 , wherein the descriptor includes a status indicating that the data packet comprises a last data packet of a data traffic flow sent on a first sublink, wherein the data traffic flow is reassigned to a second sublink.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 12, 2013
From: SINGH, AMIT; MAYYA, DEEPAK S.; GATHOO, NARENDRA J.; RAJAGOPALAN, RANGA
To: CISCO TECHNOLOGY, INC.
Reel/Frame 030593/0075 →
Continuity (1)
Related Publication 20140369351A1 · Dec 18, 2014