Link level retry scheme

• US 20070130353A1
• Filed: 01/06/2006
• Published: 06/07/2007
• Est. Priority Date: 05/18/2001
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: Sen, Sujoy, Kumar, Akhilesh, Khan, Andalib, Padwekar, Kiran, Chou, Ching-Tsun, Venkatesan, Srinand, Chittor, Suresh, Mannava, Phanindra, Ram, Rajee
• Granted Patent: US 7,991,875 B2
• Time in Patent Office: Days
• US Class Current: 709/230
• CPC Class Codes: H04L 1/1614 using bitmaps
• CPC Class Codes: H04L 1/1671 the supervisory signal being transmitted together with control information
• CPC Class Codes: H04L 1/1874 Buffer management
• CPC Class Codes: H04L 1/188 Time-out mechanisms
• CPC Class Codes: H04L 2001/125 Arrangements for preventing errors in the return channel
• CPC Class Codes: H04L 69/324 in the data link layer [OSI layer 2], e.g. HDLC
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A link layer system is provided. The link layer system a first link layer control module and a retry queue for storing a transmitted data packet. The retry control module is coupled to the first link layer control module, which directs the retry queue to discard the transmitted data packet when an acknowledgment bit is received by the first link layer control module.

Claims

1. A link layer system, comprising:

a first link layer control module;

a retry queue for storing a transmitted data packet; and

a retry control module coupled to said first link layer control module and said retry queue, wherein said retry control module directs said retry queue to discard said transmitted data packet when an acknowledgment bit piggybacked on an info flit is received by said first link layer control module.

2. A link layer system as recited by claim 1, further comprising a second link layer control module for receiving the transmitted data packet and transmitting the acknowledgment bit to the first link layer control module if an error is not detected in the transmitted data packet.

3. A link layer system as recited by claim 2, further comprising a first control flit module coupled to the first link layer control module and a second control flit module coupled to the second link layer control module.

4. A link layer system as recited by claim 3, wherein the second control flit module sends a retry request to the first link layer control module if an error is detected in the transmitted data packet.

5. A link layer system as recited by claim 4, wherein the first link layer control module receives the retry request and directs the retry control module to send the transmitted data packet from the retry queue.

6. A link layer system as recited by claim 5, wherein the retry queue includes a head pointer indicating a location of the transmitted data packet, wherein the transmitted data packet is the oldest transmitted data packet in the retry queue.

7. A link layer system as recited by claim 6, wherein the retry queue the head pointer is incremented and the transmitted data packet is dequeued from the retry queue when the acknowledgment bit for the transmitted data packet is received.

8. A link layer system as recited by claim 5, wherein the retry queue includes a tail pointer indicating a location of an unoccupied entry to store a next transmitted data packet.

9. A link layer system as recited by claim 8, wherein said tail pointer is incremented each time a new data packet is stored into the retry queue.

10-22. -22. (canceled)

23. A method, comprising:

storing a transmitted data packet in a retry queue;

receiving an acknowledgment bit piggybacked on an info flit; and

discarding the transmitted data packet from the retry queue when the acknowledgment bit piggybacked on the info flit is received.

24. The method as recited in claim 23, further comprising:

providing the acknowledgment bit piggybacked on the info flit if an error is not detected in the transmitted data packet.

25. The method as recited in claim 24, further comprising:

sending a retry request if an error is detected in the transmitted data packet.

26. The method as recited in claim 25, further comprising:

receiving the retry request; and

sending the transmitted data packet from the retry queue.

27. The method as recited in claim 26, further comprising:

indicating a location of the transmitted data packet in the retry queue with a head pointer, wherein the transmitted data packet is the oldest transmitted data packet in the retry queue.

28. The method as recited in claim 27, further comprising:

incrementing the head pointer and dequeuing the transmitted data packet from the retry queue when the acknowledgment bit for the transmitted data packet is received.

29. The method as recited in claim 26, further comprising:

indicating a location of an unoccupied entry to store a next transmitted data packet in the retry queue with a tail pointer.

30. The method as recited in claim 29, further comprising:

incrementing the tail pointer each time a new data packet is stored into the retry queue.

31. A set of instructions residing in a storage medium, the set of instructions capable of being executed by a processor for recovering from transmission errors in data communication channels, comprising:

storing a transmitted data packet in a retry queue;

receiving an acknowledgment bit piggybacked on an info flit; and

discarding the transmitted data packet from the retry queue when the acknowledgment bit piggybacked on the info flit is received.

32. The set of instructions as recited in claim 31, further comprising:

providing the acknowledgment bit piggybacked on the info flit if an error is not detected in the transmitted data packet.

33. The set of instructions as recited in claim 32, further comprising:

sending a retry request if an error is detected in the transmitted data packet.

34. The set of instructions as recited in claim 33, further comprising:

receiving the retry request; and

sending the transmitted data packet from the retry queue.

35. The set of instructions as recited in claim 34, further comprising:

indicating a location of the transmitted data packet in the retry queue with a head pointer, wherein the transmitted data packet is the oldest transmitted data packet in the retry queue.

36. The set of instructions as recited in claim 35, further comprising:

incrementing the head pointer and dequeuing the transmitted data packet from the retry queue when the acknowledgment bit for the transmitted data packet is received.

37. The set of instructions as recited in claim 34, further comprising:

indicating a location of an unoccupied entry to store a next transmitted data packet in the retry queue with a tail pointer.

38. The set of instructions as recited in claim 37, further comprising:

incrementing the tail pointer each time a new data packet is stored into the retry queue.