High speed serial bus architecture employing network layer quality of service (QoS) management

• US 20060268699A1
• Filed: 05/27/2005
• Published: 11/30/2006
• Est. Priority Date: 05/27/2005
• Status: Abandoned Application

• Current Assignee: Nokia Corporation
• Original Assignee: Nokia Corporation
• Inventors: Balandin, Sergey, Gillet, Michel
• Application Number:
  US11/140,424
• Publication Number:
  US 20060268699A1
• Time in Patent Office: Days
• US Class Current: 370/230
• CPC Class Codes: H04L 12/40071 Packet processing; Packet format adaptation of digital video signals for transport over a specific network H04N21/2381, H04N21/4363, H04N21/4381; packet switches H04L49/00; intermediate storage or scheduling H04L49/90
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/215 using token-bucket
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/50 Queue scheduling
• CPC Class Codes: H04L 47/527 Quantum based scheduling, e.g. credit or deficit based scheduling or token bank
• CPC Class Codes: H04L 47/6215 Individual queue per QOS, rate or priority

Abstract

In accordance with the non-limiting and exemplary embodiments of this invention a functional unit includes a protocol stack that includes a physical layer for coupling to a communication link, a datalink layer coupled to the physical layer, and a network layer coupled to the datalink layer. The datalink layer includes a common data queue for storing traffic passing through the communication link and the network layer includes a first queue for storing data associated with first traffic having a requested quality of service QoS and a logically separate second queue for storing data associated with second traffic not having a requested quality of service.

Claims

1. A functional unit comprising a protocol stack comprised of a physical layer for coupling to a communication link, a datalink layer coupled to the physical layer, and a network layer coupled to the datalink layer, said datalink layer comprising a common data queue for storing all traffic passing through said communication link and said network layer comprising a first queue for storing data associated with first traffic having a requested quality of service QoS and a logically separate second queue for storing data associated with second traffic not having a requested quality of service.

2. A functional unit as in claim 1, further comprising an access manager coupled to at least said first queue and responsive to receipt of a QoS Request/Acknowledgment packet to allocate at least one resource for first traffic to be received from a sender of the QoS Request/Acknowledgment packet.

3. A functional unit as in claim 2, where the QoS Request/Acknowledgment packet comprises fields SOP, type, DST, SRC, flowID, request_forward_quota, accept_forward _quota, request_back_quota, accept_back_quota, EOP, where SOP and EOP are Start of Packet and End of Packet, type specifies that the packet is the QoS Request/Acknowledgment packet, DST and SRC contain addresses of a destination and a source, flowID is an identification of a data flow that comprises the first traffic, request_forward_quota and accept_forward _quota identify a requested resource quota and a minimum acceptable quota on a path from the source to the destination, and request_back_quota and accept_back_quota identify requested and minimum acceptable quotas on a path back from the destination to the source.

4. A functional unit as in claim 1, operable with a flow control procedure that uses Flow Control Tokens FCTs for permitting the transfer of a certain amount of data from an outbound common queue in a first functional unit to an inbound common queue in a second functional unit.

5. A functional unit as in claim 4, further comprising an access logic coupled to at least said common queue, said access logic when embodied in the second functional unit advertising a total length of the inbound common queue in conjunction with a threshold value that specifies a number of FCTs advertised to the first functional unit sender, where if the first functional unit receives more advertisements than the threshold value, both the first traffic and second traffic are allowed to enter the communication link else only first traffic is allowed to enter the communication link, where the access logic of the second functional unit sends more than the threshold number of advertisements only if a corresponding incoming network layer first queue in not full.

6. A functional unit as in claim 5, said access logic being responsive to an outbound portion of the common queue having free space to accept data from the network layer first queue unless the network layer first queue is empty, and only if the network layer first queue is empty, and a number of received advertisements exceeds the defined threshold, to accept data from the network layer second queue.

7. A functional unit as in claim 1, further comprising an access manager coupled to at least said first queue and responsive to per-flow QoS reservations and to per-packet QoS reservations.

8. A functional unit as in claim 7, where a per-flow QoS reservation is made by an originator of a flow prior to the start of the flow that on a path to the flow destination verifies whether a requested resource can be allocated and sets at least one inactive reservation, and on the path back way to the flow originator performs resource allocation by activating the corresponding previously set at least one inactive reservation.

9. A functional unit as in claim 1, where the communication link comprises a serial communication link.

12. A method as in claim 11, where the QoS Request/Acknowledgment packet comprises fields SOP, type, DST, SRC, flowID, request_forward_quota, accept_forward_quota, request_back_quota, accept_back_quota, EOP, where SOP and EOP are Start of Packet and End of Packet, type specifies that the packet is the QoS Request/Acknowledgment packet, DST and SRC contain addresses of a destination and a source, flowID is an identification of a data flow that comprises the first traffic, request_forward_quota and accept_forward _quota identify a requested resource quota and a minimum acceptable quota on a path from the source to the destination, and request_back_quota and accept_back _quota identify requested and minimum acceptable quotas on a path back from the destination to the source.

10. A method to communicate data over a communication link, comprising:

in a functional unit, providing a protocol stack comprised of a physical layer for coupling to the communication link, a datalink layer coupled to the physical layer, and a network layer coupled to the datalink layer;

in the datalink layer, operating a common data queue for storing all traffic passing through the communication link; and

in the network layer, operating a first queue for storing data associated with first traffic having a requested quality of service QoS and operating a logically separate second queue for storing data associated with second traffic comprised of best effort traffic.

11. A method as in claim 10, further comprising providing an access manager coupled to at least the first queue and, responsive to receipt of a QoS Request/Acknowledgment packet, allocating at least one resource for first traffic to be received from a sender of the QoS Request/Acknowledgment packet.

13. A method as in claim 10, further comprising operating a flow control procedure that uses Flow Control Tokens FCTs to permit the transfer of a certain amount of data from an outbound common queue in a first functional unit to an inbound common queue in a second functional unit.

14. A method as in claim 13, further comprising providing an access logic coupled to at least the common queue, the access logic when embodied in the second functional unit performing advertising a total length of the inbound common queue in conjunction with a threshold value that specifies a number of FCTs advertised to the first functional unit sender, where if the first functional unit receives more advertisements than the threshold value, both the first traffic and second traffic are allowed to enter the communication link else only first traffic is allowed to enter the communication link, where the access logic of the second functional unit sends more than the threshold number of advertisements only if a corresponding incoming network layer first queue in not full.

15. A method as in claim 14, where the access logic is responsive to an outbound portion of the common queue having free space to accept data from the network layer first queue unless the network layer first queue is empty, and only if the network layer first queue is empty, and a number of received advertisements exceeds the defined threshold, to accept data from the network layer second queue.

16. A method as in claim 10, further comprising providing an access manager coupled to at least the first queue that responds to per-flow QoS reservations and to per-packet QoS reservations.

17. A method as in claim 16, making a per-flow QoS reservation by an originator of a flow prior to the start of the flow that on a path to the flow destination verifies whether a requested resource can be allocated and sets at least one inactive reservation, and on the path back way to the flow originator performs resource allocation by activating the corresponding previously set at least one inactive reservation.

18. A method as in claim 10, where the communication link comprises a serial communication link.

19. A computer program product embodied on a computer readable medium for directing at least one data processor to communicate data over a communication link by operations that comprise providing a protocol stack comprised of a physical layer for coupling to the communication link, a datalink layer coupled to the physical layer, and a network layer coupled to the datalink layer;

in the datalink layer, operating a common data queue for storing all traffic passing through the communication link; and

in the network layer, operating a first queue for storing data associated with first traffic having a requested quality of service QoS and operating a logically separate second queue for storing data associated with second traffic comprised of best effort traffic.

20. A computer program product as in claim 19, further comprising providing an access manager coupled to at least the first queue and, responsive to receipt of a QoS Request/Acknowledgment packet, allocating at least one resource for first traffic to be received from a sender of the QoS Request/Acknowledgment packet.

21. A computer program product as in claim 20, where the QoS Request/Acknowledgment packet comprises fields SOP, type, DST, SRC, flowID, request_forward_quota, accept_forward _quota, request_back_quota, accept_back _quota, EOP, where SOP and EOP are Start of Packet and End of Packet, type specifies that the packet is the QoS Request/Acknowledgment packet, DST and SRC contain addresses of a destination and a source, flowID is an identification of a data flow that comprises the first traffic, request_forward_quota and accept_forward _quota identify a requested resource quota and a minimum acceptable quota on a path from the source to the destination, and request_back_quota and accept_back _quota identify requested and minimum acceptable quotas on a path back from the destination to the source.

22. A computer program product as in claim 19, further comprising operating a flow control procedure that uses Flow Control Tokens FCTs to permit the transfer of a certain amount of data from an outbound common queue in a first functional unit to an inbound common queue in a second functional unit.

23. A computer program product as in claim 22, further comprising providing an access logic coupled to at least the common queue, the access logic when embodied in the second functional unit performing advertising a total length of the inbound common queue in conjunction with a threshold value that specifies a number of FCTs advertised to the first functional unit sender, where if the first functional unit receives more advertisements than the threshold value, both the first traffic and second traffic are allowed to enter the communication link else only first traffic is allowed to enter the communication link, where the access logic of the second functional unit sends more than the threshold number of advertisements only if a corresponding incoming network layer first queue in not full.

24. A computer program product as in claim 23, where the access logic is responsive to an outbound portion of the common queue having free space to accept data from the network layer first queue unless the network layer first queue is empty, and only if the network layer first queue is empty, and a number of received advertisements exceeds the defined threshold, to accept data from the network layer second queue.

25. A computer program product as in claim 19, further comprising providing an access manager coupled to at least the first queue that responds to per-flow QoS reservations and to per-packet QoS reservations.

26. A computer program product as in claim 25, making a per-flow QoS reservation by an originator of a flow prior to the start of the flow that on a path to the flow destination verifies whether a requested resource can be allocated and sets at least one inactive reservation, and on the path back way to the flow originator performs resource allocation by activating the corresponding previously set at least one inactive reservation.

27. A computer program product as in claim 19, where the communication link comprises a serial communication link.

28. A terminal comprising at least a first functional unit and a second functional unit that are communicatively coupled together through a link, each of the functional units comprising a protocol stack comprised of a physical layer for coupling to the link, a datalink layer coupled to the physical layer, and a network layer coupled to the datalink layer, said datalink layer comprising a common data queue for storing traffic passing through said link and said network layer comprising a first queue for storing data associated with first traffic having a requested quality of service QoS and a logically separate second queue for storing data associated with second traffic not having a requested quality of service.

29. A terminal as in claim 28, each of the functional units further comprising an access manager coupled to at least said first queue and responsive to receipt of a QoS Request/Acknowledgment packet to allocate at least one resource for first traffic to be received from a sender of the QoS Request/Acknowledgment packet.

30. A terminal as in claim 29, where the QoS Request/Acknowledgment packet comprises fields SOP, type, DST, SRC, flowID, request_forward_quota, accept_forward_quota, request_back_quota, accept_back _quota, EOP, where SOP and EOP are Start of Packet and End of Packet, type specifies that the packet is the QoS Request/Acknowledgment packet, DST and SRC contain addresses of a destination and a source, flowID is an identification of a data flow that comprises the first traffic, request_forward_quota and accept_forward _quota identify a requested resource quota and a minimum acceptable quota on a path from the source to the destination, and request_back_quota and accept_back quota identify requested and minimum acceptable quotas on a path back from the destination to the source.

31. A terminal as in claim 28, operable with a flow control procedure that uses Flow Control Tokens FCTs for permitting the transfer of a certain amount of data from an outbound common queue in the first functional unit to an inbound common queue in the second functional unit.

32. A terminal as in claim 31, further comprising an access logic coupled to at least said common queue, said access logic when embodied in the second functional unit advertising a total length of the inbound common queue in conjunction with a threshold value that specifies a number of FCTs advertised to the first functional unit sender, where if the first functional unit receives more advertisements than the threshold value, both the first traffic and second traffic are allowed to enter the link else only first traffic is allowed to enter the link, where the access logic of the second functional unit sends more than the threshold number of advertisements only if a corresponding incoming network layer first queue in not full.

33. A terminal as in claim 32, said access logic being responsive to an outbound portion of the common queue having free space to accept data from the network layer first queue unless the network layer first queue is empty, and only if the network layer first queue is empty, and a number of received advertisements exceeds the defined threshold, to accept data from the network layer second queue.

34. A terminal as in claim 28, each of the functional units further comprising an access manager coupled to at least said first queue and responsive to per-flow QoS reservations and to per-packet QoS reservations.

35. A terminal as in claim 34, where a per-flow QoS reservation is made by an originator of a flow prior to the start of the flow that on a path to the flow destination verifies whether a requested resource can be allocated and sets at least one inactive reservation, and on the path back way to the flow originator performs resource allocation by activating the corresponding previously set at least one inactive reservation.

36. A terminal as in claim 28, where the link comprises a serial link.

37. A terminal as in claim 28, comprising a wireless communications device.