Multicast to unicast conversion technique

• US 9,729,463 B2
• Filed: 12/16/2016
• Issued: 08/08/2017
• Est. Priority Date: 06/14/2012
• Status: Active Grant

• Current Assignee: Extreme Networks, Inc.
• Original Assignee: Aerohive Networks Incorporated (Extreme Networks, Inc.)
• Inventors: Zeng, Jianlin, Liu, Liwu
• Primary Examiner(s): LO, DIANE LEE
• Application Number:
  US15/381,727
• Publication Number:
  US 20170149680A1
• Time in Patent Office: 235 Days
• Field of Search: None
• CPC Class Codes: H04L 12/18 for broadcast or conference , e.g. multicast
• CPC Class Codes: H04L 12/1881 with schedule organisation, e.g. priority, sequence management
• CPC Class Codes: H04L 12/1886 with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
• 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/215 using token-bucket
• CPC Class Codes: H04L 47/30 in combination with information about buffer occupancy at either end or at transit nodes
• CPC Class Codes: H04L 47/32 by discarding or delaying data units, e.g. packets or frames
• CPC Class Codes: H04L 47/527 Quantum based scheduling, e.g. credit or deficit based scheduling or token bank
• CPC Class Codes: H04L 47/621 Individual queue per connection or flow, e.g. per VC
• CPC Class Codes: H04L 47/6215 Individual queue per QOS, rate or priority
• CPC Class Codes: H04L 47/629 Ensuring fair share of resources, e.g. weighted fair queuing [WFQ]
• CPC Class Codes: H04L 47/6295 using multiple queues, one for each individual QoS, connection, flow or priority
• CPC Class Codes: H04L 49/201 Multicast operation; Broadcast operation
• CPC Class Codes: H04L 65/611 for multicast or broadcast systems for broadcast or conference H04L12/18; arrangements for broadcast or distribution combined with broadcast H04H20/00; arrangements for broadcast applications with a direct linkage to broadcast information or to broadcast space-time H04H60/00; selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS], H04W4/06
• CPC Class Codes: H04L 65/80 Responding to QoS
• CPC Class Codes: H04L 69/08 Protocols for interworking; Protocol conversion
• CPC Class Codes: H04W 28/0268 using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR] negotiating SLA or negotiating QoS H04W28/24
• CPC Class Codes: H04W 28/14 using intermediate storage
• CPC Class Codes: H04W 4/06 Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services

Abstract

A technique allows stations to utilize an equal share of resources (e.g., airtime or throughput). This prevents slow stations from consuming too many resources (e.g., using up too much air time). Fairness is ensured by selective dropping after a multicast packet is converted to unicast. This prevents slow stations from using more than their share of buffer resources. Multicast conversion aware back-pressure into the network layer can be used to prevent unnecessary dropping of packets after multicast to unicast (1:n) conversion by considering duplicated transmit buffers. This technique helps achieve airtime/resource fairness among stations.

Claims

1. A method comprising:

receiving, through a network, downlink traffic of a multicast packet stream with a plurality of stations addressed as recipients of the multicast packet stream;

allocating to stations of the plurality of stations a share of network resources for use by the plurality of stations in accessing network services of the network;

enqueuing a multicast packet in the multicast packet stream into a backpressure-controlled multicast queue;

converting the multicast packet into a plurality of unicast packets for transmission to the stations of the plurality of stations;

selectively dropping at least one unicast packet of the plurality of unicast packets according to an amount of the share of network resources consumed by the stations of the plurality of stations to maintain buffer fairness.

2. The method of claim 1, further comprising:

enqueuing unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues in a backpressure-aware manner by considering duplicated transmit buffers to avoid dropping the unicast packets.

3. The method of claim 1, further comprising:

enqueuing unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

4. The method of claim 1, further comprising:

enqueuing unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

determining corresponding token costs in delivering the unicast packets;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued according to the corresponding token costs in delivering the unicast packets.

5. The method of claim 1, further comprising:

enqueuing unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

determining corresponding token costs in delivering the unicast packets based on estimated airtimes of delivering the unicast packets;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued according to the corresponding token costs in delivering the unicast packets.

6. The method of claim 1, further comprising:

enqueuing unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues associated with traffic flows for the stations on a per-station basis;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

7. The method of claim 1, further comprising:

determining corresponding QoS profiles to associate with unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations;

associating the unicast packets with the corresponding QoS profiles;

enqueuing the unicast packets into traffic identifier queues based on the corresponding QoS profiles associated with the unicast packets;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

8. The method of claim 1, further comprising:

determining corresponding QoS profiles to associate with unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations, the QoS profiles to be associated with the unicast packets determined based on data flows associated with the unicast packets;

associating the unicast packets with the corresponding QoS profiles;

enqueuing the unicast packets into traffic identifier queues based on the corresponding QoS profiles associated with the unicast packets;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

9. The method of claim 1, further comprising:

enqueuing unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

scheduling delivery of the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued based on the amount of the share of network resources consumed by the stations;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued according to the scheduled delivery.

10. The method of claim 1, further comprising:

enqueuing unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

scheduling delivery of the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued based on an estimated airtime to deliver the unicast packets to the stations;

providing the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued according to the scheduled delivery.

11. A system comprising:

a point of presence interface configured to receive, through a network, downlink traffic of a multicast packet stream with a plurality of stations addressed as recipients of the multicast packet stream;

a multicast-to-unicast conversion high session performance system configured to allocate to stations of the plurality of stations a share of network resources for use by the plurality of stations in accessing network services of the network;

a queuing engine configured to enqueue a multicast packet in the multicast packet stream into a backpressure-controlled multicast queue;

a scheduling engine configured to;

convert the multicast packet into a plurality of unicast packets for transmission to the stations of the plurality of stations;

selectively drop at least one unicast packet of the plurality of unicast packets according to an amount of the share of network resources consumed by the stations of the plurality of stations to maintain buffer fairness.

12. The system of claim 11, wherein the scheduling engine is further configured to enqueue unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues in a backpressure-aware manner by considering duplicated transmit buffers to avoid dropping the unicast packets.

13. The system of claim 11, further comprising:

the scheduling engine further configured to enqueue unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

an access category scheduling engine configured to provide the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

14. The system of claim 11, further comprising:

the scheduling engine further configured to enqueue unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

an access category scheduling engine configured to;

determine corresponding token costs in delivering the unicast packets;

provide the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued according to the corresponding token costs in delivering the unicast packets.

15. The system of claim 11, further comprising:

the scheduling engine further configured to enqueue unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

an access category scheduling engine configured to;

determine corresponding token costs in delivering the unicast packets based on estimated airtimes of delivering the unicast packets;

provide the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued according to the corresponding token costs in delivering the unicast packets.

16. The system of claim 11, further comprising:

the scheduling engine further configured to enqueue unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues associated with traffic flows for the stations on a per-station basis;

an access category scheduling engine configured to provide the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

17. The system of claim 11, further comprising:

the scheduling engine further configured to;

determine corresponding QoS profiles to associate with unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations;

associate the unicast packets with the corresponding QoS profiles;

enqueue the unicast packets into traffic identifier queues based on the corresponding QoS profiles associated with the unicast packets;

an access category scheduling engine configured to provide the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

18. The system of claim 11, further comprising:

the scheduling engine further configured to;

determine corresponding QoS profiles to associate with unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations, the QoS profiles to be associated with the unicast packets determined based on data flows associated with the unicast packets;

associate the unicast packets with the corresponding QoS profiles;

enqueue the unicast packets into traffic identifier queues based on the corresponding QoS profiles associated with the unicast packets;

an access category scheduling engine configured to provide the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued.

19. The system of claim 11, further comprising:

the scheduling engine further configured to enqueue unicast packets of the plurality of unicast packets which remain without being dropped according to the amount of the share of network resources consumed by the stations into traffic identifier queues;

an access category scheduling engine configured to;

schedule delivery of the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued based on the amount of the share of network resources consumed by the stations;

provide the unicast packets to the stations corresponding to the traffic identifier queues in which the unicast packets are enqueued according to the scheduled delivery.

20. A system comprising:

means for receiving, through a network, downlink traffic of a multicast packet stream with a plurality of stations addressed as recipients of the multicast packet stream;

means for allocating to stations of the plurality of stations a share of network resources for use by the plurality of stations in accessing network services of the network;

means for enqueuing a multicast packet in the multicast packet stream into a backpressure-controlled multicast queue;

means for converting the multicast packet into a plurality of unicast packets for transmission to the stations of the plurality of stations;

means for selectively dropping at least one unicast packet of the plurality of unicast packets according to an amount of the share of network resources consumed by the stations of the plurality of stations to maintain buffer fairness.