Broadband system with transmission scheduling and flow control

• US 20020075875A1
• Filed: 09/13/2001
• Published: 06/20/2002
• Est. Priority Date: 09/22/2000
• Status: Abandoned Application

• Current Assignee: PhyFlex Networks, Inc. (Ciena Corporation)
• Original Assignee: PhyFlex Networks, Inc. (Ciena Corporation)
• Inventors: Narayan, Sriram, Shah, Vyomesh, Dravida, Subrahmanyam, Rege, Kiran, Peralta, Frederick, Tandon, Manas
• Application Number:
  US09/952,381
• Publication Number:
  US 20020075875A1
• Time in Patent Office: Days
• US Class Current: 370/395.21
• CPC Class Codes: H04L 12/2801 Broadband local area networks
• CPC Class Codes: H04L 12/2856 Access arrangements, e.g. Internet access asynchronous transfer mode networks H04L12/5601; broadband local area networks H04L12/2801; optical access or distribution networks H04Q11/0067; access to open networks H04L12/5691; digital subscriber line end-user equipment and bit-level processing of data on a PSTN-based network H04M11/00; home network gateways H04L12/2834; wireless access networks H04W
• CPC Class Codes: H04L 12/2859 Point-to-point connection between the data network and the subscribers encapsulation H04L12/4633; virtual LANs H04L12/4641; routing of packets H04L45/00
• CPC Class Codes: H04L 12/2876 Handling of subscriber policies group policies management H04L41/0893
• CPC Class Codes: H04L 12/4641 Virtual LANs, VLANs, e.g. virtual private networks [VPN] LAN interconnection over a bridge based backbone H04L12/462; encapsulation techniques H04L12/4633; routing of packets H04L45/00; packet switches H04L49/00; virtual private networks for security H04L63/0272
• CPC Class Codes: H04L 2012/5605 Fibre
• CPC Class Codes: H04L 2012/5606 Metallic
• CPC Class Codes: H04L 2012/561 Star, e.g. cross-connect, concentrator, subscriber group equipment, remote electronics
• CPC Class Codes: H04L 2012/5651 Priority, marking, classes
• CPC Class Codes: H04L 2012/5679 Arbitration or scheduling
• CPC Class Codes: H04L 41/0806 for initial configuration or provisioning, e.g. plug-and-play
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/20 Traffic policing
• CPC Class Codes: H04L 47/24 Traffic characterised by specific attributes, e.g. priority or QoS
• CPC Class Codes: H04L 47/2416 Real-time traffic
• CPC Class Codes: H04L 47/2425 for supporting services specification, e.g. SLA
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 47/2491 : Mapping quality of service [QoS] requirements between different networks
• CPC Class Codes: H04L 47/32 : by discarding or delaying data units, e.g. packets or frames
• CPC Class Codes: H04L 47/70 : Admission control; Resource allocation
• CPC Class Codes: H04L 47/724 : at intermediate nodes, e.g. resource reservation protocol [RSVP]
• CPC Class Codes: H04L 47/788 : Autonomous allocation of resources
• CPC Class Codes: H04L 47/801 : Real time traffic
• CPC Class Codes: H04L 47/805 : QOS or priority aware
• CPC Class Codes: H04L 47/822 : Collecting or measuring resource availability data
• CPC Class Codes: H04L 47/829 : Topology based
• CPC Class Codes: H04L 61/5007 : Internet protocol [IP] addresses
• CPC Class Codes: H04L 61/5014 : using dynamic host configuration protocol [DHCP] or bootstrap protocol [BOOTP]
• CPC Class Codes: H04N 21/6118 : involving cable transmission, e.g. using a cable modem
• CPC Class Codes: H04N 21/6168 : involving cable transmission, e.g. using a cable modem
• CPC Class Codes: H04N 7/10 : Adaptations for transmission by electrical cable H04N7/12 takes precedence
• CPC Class Codes: H04N 7/17309 : Transmission or handling of upstream communications
• CPC Class Codes: H04Q 3/0045 : involving hybrid, i.e. a mixture of public and private, or multi-vendor systems

Abstract

Hybrid fiber/coax networks employ the existing cable plant used for cable TV and transmit data signals in a frequency bandwidth above that which is used for cable TV. As this cable plant was deployed in a tree and branch topology, data transmissions may be susceptible to noise, variable transmission loss and frequency dispersion, particularly in the upstream direction. Further, due to the tree and branch topology, homes at the far end of the network experience much greater loss than do the homes that are near to the headend/ONU. The present system, which uses point-to-point data links between intelligent network elements located in the feeder/distribution network to provide reliable, secure, bi-directional broadband access. Digital signals are terminated at the intelligent network elements, switched and regenerated for transmission across additional upstream or downstream data links as needed to connect a home to a headend or router. The intelligent network elements can be co-located with or replace the standard network elements to take advantage of existing network configurations. The standard network elements can be selectively replaced by the intelligent network elements in an incremental approach. Packet handling at a network element includes receiving packets on input links coupled to the network element, each packet having a quality of service (QoS) class indicating a service priority ranging from highest (1) to lowest (N). Received packets for each of the QoS classes from 1 to N−1 are stored in a common queue per QoS class while packets received for the lowest (N) QoS class are stored in link queues corresponding to the input links. The packets are transmitted from the common queues and the plural link queues to an output link according to a scheduling discipline. In this manner, the data links are made over relatively short runs of coax cable, which can provide greater bandwidth than the typical end-to-end feeder/distribution connection between a home and the headend or optical network unit.

Claims

1. A method of packet handling at a network element, the method comprising:

receiving packets on plural input links coupled to the network element, each packet having a quality of service (QoS) class indicating a service priority ranging from highest (1) to lowest (N) where N>

1;

storing received packets for each of the QoS classes from 1 to N−

1 in a common queue per QoS class;

storing received packets for the lowest (N) QoS class in one of plural link queues corresponding to the plural input links;

transmitting the packets from the common queues and the plural link queues to an output link according to a scheduling discipline.

2. The method of claim 1 wherein transmitting includes serving the queues according to strict non-preemptive priorities across the QoS classes.

3. The method of claim 2 wherein serving includes serving the link queues according to a weighted round-robin discipline.

4. The method of claim 3 wherein weights of the round-robin discipline are proportional to a share of available capacity on the output link allocated to each link queue.

5. The method of claim 4 wherein the allocated share of available capacity is proportional to subscriber populations attached to the corresponding input links.

6. The method of claim 1 wherein transmitting includes serving the queues according to first-in, first-out order among packets belonging to the same QoS class.

7. The method of claim 1 further comprising:

for each queue, associating a flag, a high threshold and a low threshold;

turning the flag OFF when the queue level exceeds the corresponding high threshold;

turning the flag ON when the queue level falls below the corresponding low threshold;

sending at an interval the current value of at least one flag to each downstream device connected to the network element on corresponding links;

transmitting packets from a downstream device to the network element on a corresponding link only if the current value of the corresponding flag is ON.

8. The method of claim 7 wherein sending the current value of the at least one flag includes sending the flag values in flow control bits of a frame header.

9. A network element comprising:

a receiver for receiving packets on plural input links coupled to the network element, each packet having a quality of service (QoS) class indicating a service priority ranging from highest (1) to lowest (N) where N>

1;

a common queue per QoS class for storing received packets for each of the QoS classes from 1 to N−

1;

plural link queues for storing received packets for the lowest (N) QoS class corresponding to the plural input links;

a transmitter for transmitting the packets from the common queues and the plural link queues to an output link according to a scheduling discipline.

10. The network element of claim 9 wherein the transmitter serves the queues according to strict non-preemptive priorities across the QoS classes.

11. The network element of claim 10 wherein the transmitter serves the link queues according to a weighted round-robin discipline.

12. The apparatus of claim 11 wherein weights of the round-robin discipline are proportional to a share of available capacity on the output link allocated to each link queue.

13. The apparatus of claim 12 wherein the allocated share of available capacity is proportional to subscriber populations attached to the corresponding input links.

14. The apparatus of claim 9 wherein the transmitter serves the queues according to first-in, first-out order among packets belonging to the same QoS class.

15. A network element comprising:

means for receiving packets on plural input links coupled to the network element, each packet having a quality of service (QoS) class indicating a service priority ranging from highest (1) to lowest (N) where N>

1;

means for storing received packets for each of the QoS classes from 1 to N−

1 in a common queue per QoS class;

means for storing received packets for the lowest (N) QoS class in one of plural link queues corresponding to the plural input links;

means for transmitting the packets from the common queues and the plural link queues to an output link according to a scheduling discipline.

16. A computer program product including computer program code for packet handling comprising:

computer program code for receiving packets on plural input links coupled to the network element, each packet having a quality of service (QoS) class indicating a service priority ranging from highest (1) to lowest (N) where N>

1;

computer program code for storing received packets for each of the QoS classes from 1 to N−

1 in a common queue per QoS class;

computer program code for storing received packets for the lowest (N) QoS class in one of plural link queues corresponding to the plural input links;

computer program code for transmitting the packets from the common queues and the plural link queues to an output link according to a scheduling discipline.

17. A computer data signal having program code for packet handling comprising:

program code for receiving packets on plural input links coupled to the network element, each packet having a quality of service (QoS) class indicating a service priority ranging from highest (1) to lowest (N) where N>

1;

program code for storing received packets for each of the QoS classes from 1 to N−

1 in a common queue per QoS class;

program code for storing received packets for the lowest (N) QoS class in one of plural link queues corresponding to the plural input links;

program code for transmitting the packets from the common queues and the plural link queues to an output link according to a scheduling discipline.