Service interface for QoS-driven HPNA networks

• US 8,532,130 B2
• Filed: 11/23/2011
• Issued: 09/10/2013
• Est. Priority Date: 02/20/2001
• Status: Expired due to Fees

• Current Assignee: AT&T Intellectual Property II LP (AT&T, Inc.)
• Original Assignee: AT&T Intellectual Property II LP (AT&T, Inc.)
• Inventors: Lin, Wei
• Primary Examiner(s): Pham, Chi
• Assistant Examiner(s): Boakye, Alexander O
• Application Number:
  US13/303,911
• Publication Number:
  US 20120127879A1
• Time in Patent Office: 657 Days
• Field of Search: 370/468, 370/470, 370/471, 370/412, 370/401, 370/466, 370/467, 370/506, 370/510, 370/512, 370/393, 370/392, 370/395.21, 370/395.5, 370/395.52, 370/395.41, 370/395.6, 709/246, 711/108
• US Class Current: 370/412
• CPC Class Codes: H04L 12/2803 Home automation networks
• CPC Class Codes: H04L 12/2838 Distribution of signals within a home automation network, e.g. involving splitting/multiplexing signals to/from different paths adaptations of television systems for transmission by electric cable for domestic distribution H04N7/106; hybrid transport H04L12/6418; home network arrangements specially adapted for distribution of digital video signals H04N7/24
• CPC Class Codes: H04L 2012/2845 Telephone line
• CPC Class Codes: H04L 45/38 Flow based routing
• CPC Class Codes: H04L 45/66 Layer 2 routing, e.g. in Ethernet based MAN's
• CPC Class Codes: H04L 45/74 Address processing for routing
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/18 End to end
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/6215 Individual queue per QOS, rate or priority
• CPC Class Codes: H04L 69/32 Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
• CPC Class Codes: H04L 69/321 Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers

Abstract

An in-band signaling model media control (MC) terminal for an HPNA network includes a frame classification entity (FCE) and a frame scheduling entity (FSE) and provides end-to-end Quality of Service (QoS) by passing the QoS requirements from higher layers to lower layers. The FCE, located at an LLC sublayer of the MC terminal, receives a data frame from a higher layer of the MC terminal that is part of a QoS stream. The FCE classifies the received data frame for a MAC sublayer of the MC terminal based on QoS information contained in the received data frame, and associates the classified data frame with a QoS stream queue corresponding to a classification of the data frame. The FSE, located at the MAC sublayer of the MC terminal, schedules transmission of the data frame to a destination for the data frame based on a QoS requirement associated with the QoS stream.

Claims

1. A method for use at a frame classification entity in a network, the frame classification entity located at a first layer of the network, the method comprising:

receiving a plurality of data frames from a higher layer of the network relative to the first layer, each data frame in the plurality of data frames associated with a respective value of a quality of service parameter;

classifying each of the plurality of data frames into one of a plurality of quality of service streams based on the respective value of the quality of service parameter; and

forwarding each of the plurality of data frames to one of a plurality of quality of service queues, each quality of service queue being associated with one or more of the plurality of quality of service streams.

2. The method of claim 1 wherein the quality of service parameter comprises a maximum allowed delay.

3. The method of claim 1 wherein the quality of service parameter comprises a minimum mean data rate.

4. The method of claim 1 wherein classifying each of the plurality of data frames comprises comparing the respective value of the quality of service parameter to a stored value.

5. The method of claim 1 further comprising:

receiving a second plurality of data frames, each of the second plurality of data frames comprising an unrecognized quality of service parameter;

classifying each of the second plurality of data frames as a best-effort quality of service stream; and

forwarding each of the second plurality of data frames to a best-effort quality of service queue, the best-effort quality of service queue being associated with the best-effort quality of service stream.

6. The method of claim 5, wherein the unrecognized quality of service-parameter does not comprise quality of service signaling.

7. A method for scheduling transmission of a plurality of data frames in a network, the method comprising:

receiving, at a first layer of the network, the plurality of data frames from a higher layer of the network relative to the first layer, each data frame associated with a respective value of a quality of service parameter;

storing each of the plurality of data frames in one of a plurality of queues based on the respective value of the quality of service parameter, each of the plurality of queues being associated with one or more quality of service streams; and

allocating bandwidth to each of the plurality of data frames based on the respective value of the quality of service parameter.

8. The method of claim 7 further comprising:

determining no queue exists for a particular respective value of the quality of service parameter;

creating a new queue associated with the particular respective value of the quality of service parameter; and

storing a data frame associated with the particular respective value of the quality of service parameter in the new queue.

9. The method of claim 7 further comprising, for the plurality of data frames, storing log data corresponding to the queue in which each data frame is stored.

10. The method of claim 9 wherein the log data comprises the value of the quality of service parameter associated with each data frame and an identifier associated with a respective one of the plurality of quality of service streams associated with the queue in which the data frame is stored.

11. The method of claim 10 further comprising:

setting a timer for the respective one of the plurality of quality of service streams.

12. The method of claim 11 further comprising:

incrementing the timer periodically when there are no data frames present in the respective one of the plurality of queues associated with the one of the plurality of quality of service streams.