Sign In to Follow Application
View All Documents & Correspondence

A Method For Efficient Scheduling Of Downlink Data Traffic At A Base Station

Abstract: The present disclosure relates to systems, methods, and non-transitory computer-readable media for efficient scheduling of downlink data traffic at a base station. The method may comprise: receiving one or more downlink data packets from a second protocol layer. Thereafter, the one or more downlink packets may be classified into one or more categories of packets based on transmission type and radio transmission state of the one or more downlink packets. Further, one or more first packets from each of the one or more categories of packets may be scheduled based on a pre-determined priority order of the one or more categories of packets and a predetermined packet transmission share associated with each of the one or more categories of packets. Finally, the one or more first packets are transmitted from the one or more categories of packets in a transmission time interval. FIG. 3

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
19 December 2014
Publication Number
02/2015
Publication Type
INA
Invention Field
COMMUNICATION
Status
Email
Parent Application
Patent Number
Legal Status
Grant Date
2023-01-23
Renewal Date

Applicants

WIPRO LIMITED
Doddakannelli, Sarjapur Road, Bangalore 560035, Karnataka, India.

Inventors

1. SAPTARSHI CHAUDHURI
LAA GLORY, APT-201, 244/263, 34TH MAIN, BTM 2ND STAGE, BANGALORE – 560068, KARNATAKA, INDIA
2. IRFAN BAIG
NO. 23, 1ST CROSS PAMPANAGAR, YESHWANTHPUR, BANGALORE - 560022, KARNATAKA, INDIA

Specification

CLIAMS:We claim
1. A method for efficient scheduling of downlink data traffic at a base station, the method comprising:
receiving, at a first protocol layer, one or more downlink data packets from a second protocol layer;
classifying the one or more downlink packets into one or more categories of packets based on transmission type and radio transmission state of the one or more downlink packets;
scheduling one or more first packets from each of the one or more categories of packets based on a pre-determined priority order of the one or more categories of packets and a predetermined packet transmission share associated with each of the one or more categories of packets;
transmitting the one or more first packets from the one or more categories of packets in a transmission time interval; and
updating a pre-determined priority order of the one or more categories of packets and a pre-determined packet transmission share associated with each of the one or more categories of packets after a predetermined time interval; and
scheduling one or more second packets from the one or more categories of packets based on the updated pre-determined priority order of the one or more categories of packets and a predetermined packet transmission share associated with each of the one or more categories of packets in the transmission time interval subsequent to the updating.
2. The method of claim 1, wherein classifying the one or more downlink packets into one or more categories of packets based on the one or more parameters comprises:
classifying the one or more downlink packets into categories of control-new transmission packets, control retransmission packets, guaranteed bit rate (GBR)- new transmission packets, GBR- retransmission packets, non GBR- new transmission packets, and on GBR- retransmission packets.
3. The method of claim 1, wherein scheduling the one or more first packets from each of the one or categories of packets comprises:
calculating scheduling metric for each of the guaranteed bit rate (GBR)- new transmission packets, non GBR- new transmission packets based on one or more performance parameters associated with the guaranteed bit rate (GBR)- new transmission packets, non GBR- new transmission packets transmitted in previous transmission time interval;
sorting each of the guaranteed bit rate (GBR)- new transmission packets, GBR- retransmission packets in decreasing/increasing order based on the scheduling metric; and
fetching guaranteed bit rate (GBR)- new transmission packets, non GBR- new transmission packets based on maximum number of guaranteed bit rate (GBR)- new transmission packets, non GBR- new transmission packets set to be transmitted in the transmission time interval.
4. The method of claim 3, wherein the one or more performance parameters comprise at least one of an average bit rate, available bit rate, queuing delay, or interval scheduling interval associated with the guaranteed bit rate (GBR)- new transmission packets, the non GBR- new transmission packets.
5. The method of claim 1, wherein scheduling the one or more first packets from each of the one or more categories of packets comprises:
fetching the control-new transmission packets, control retransmission packets based on maximum number of control-new transmission packets, control retransmission packets set to be transmitted in the transmission time interval.
6. The method of claim 5, wherein scheduling the one or more first packets from each of the one or more categories of packets comprises:
fetching the GBR- retransmission packets, non GBR- retransmission packets set to be transmitted in the transmission time interval if predetermined onset time for triggering transmission of GBR- retransmission packets, non GBR- retransmission packets is greater than maximum hold off time of GBR- retransmission packets, non GBR- retransmission packets.
7. The method of claim 6, wherein scheduling the one or more first packets from each of the one or more categories of packets comprises:
discarding the GBR- retransmission packets, non GBR- retransmission packets set to be transmitted in the transmission time interval if transmission count of the GBR- retransmission packets, non GBR- retransmission packets is greater than maximum retransmission count.
8. The method of claim 1, wherein updating the pre-determined priority order of the one or more categories of packets comprises:
determining, for each of the one or more categories of packets, whether number of packets queued per category of packets is greater than number of packets queued threshold per category of packets; and
altering the pre-determined priority order of the one or more categories of packets based on the determining.
9. The method of claim 1, wherein updating the pre-determined packet transmission share associated with each of the one or more categories of packets comprises:
determining, for each of the one or more categories of packets, whether average inter scheduling delay for one or more categories of packets is greater than or equal to average inter scheduling delay threshold per category of packets;
checking , for each of the one or more categories of packets, whether number of packets queued per category of packets is greater than number of packets queued threshold per category of packets;
altering the pre-determined packet transmission share associated with each of the one or more categories of packets based on the determining and the checking.
10. A system for efficient scheduling of downlink data traffic at a base station, the system comprising:
one or more hardware processors; and
a memory storing instructions that, when executed by the one or more hardware processors, cause the one or more hardware processors to perform operations comprising:

receiving, at a first protocol layer, one or more downlink data packets from a second protocol layer;
classifying the one or more downlink packets into one or more categories of packets based on transmission type and radio transmission state of the one or more downlink packets;
scheduling one or more first packets from each of the one or more categories of packets based on a pre-determined priority order of the one or more categories of packets and a predetermined packet transmission share associated with each of the one or more categories of packets;
transmitting the one or more first packets from the one or more categories of packets in a transmission time interval;
updating a pre-determined priority order of the one or more categories of packets and a pre-determined packet transmission share associated with each of the one or more categories of packets after a predetermined time interval; and
scheduling one or more second packets from the one or more categories of packets based on the updated pre-determined priority order of the one or more categories of packets and a predetermined packet transmission share associated with each of the one or more categories of packets in the transmission time interval subsequent to the updating.
11. The system of claim 10, wherein classifying the one or more downlink packets into one or more categories of packets based on the one or more first parameters comprises:
classifying the one or more downlink packets into categories of control-new transmission packets, control retransmission packets, guaranteed bit rate (GBR)- new transmission packets, GBR- retransmission packets, non GBR- new transmission packets, and on GBR- retransmission packets.
12. The system of claim 10, wherein scheduling the one or more first packets from each of the one or categories of packets comprises:
calculating scheduling metric for each of the guaranteed bit rate (GBR)- new transmission packets, non GBR- new transmission packets based on one or more performance parameters associated with the guaranteed bit rate (GBR)- new transmission packets and the non GBR- new transmission packets transmitted in previous transmission time interval;
sorting each of the guaranteed bit rate (GBR)- new transmission packets, GBR- retransmission packets in decreasing/increasing order based on the scheduling metric; and
fetching guaranteed bit rate (GBR)- new transmission packets, non GBR- new transmission packets based on maximum number of guaranteed bit rate (GBR)- new transmission packets, non GBR- new transmission packets set to be transmitted in the transmission time interval.
13. The system of claim 12, wherein the one or more performance parameters comprise at least one of an average bit rate, an available bit rate, queuing delay, or an interval scheduling interval associated with the guaranteed bit rate (GBR)- new transmission packets, the non GBR- new transmission packets.
14. The system of claim 11, wherein scheduling the one or more first packets from each of the one or more categories of packets comprises:
fetching the control-new transmission packets, control retransmission packets based on maximum number of control-new transmission packets, control retransmission packets set to be transmitted in the transmission time interval.
15. The system of claim 14, wherein scheduling the one or more first packets from each of the one or more categories of packets comprises:
fetching the GBR- retransmission packets, non GBR- retransmission packets set to be transmitted in the transmission time interval if predetermined onset time for triggering transmission of GBR- retransmission packets, non GBR- retransmission packets is greater than maximum hold off time of GBR- retransmission packets, non GBR- retransmission packets.
16. The system of claim 15, wherein scheduling the one or more first packets from each of the one or more categories of packets comprises:
discarding the GBR- retransmission packets, non GBR- retransmission packets set to be transmitted in the transmission time interval if transmission count of the GBR- retransmission packets, non GBR- retransmission packets is greater than maximum retransmission count.
17. The system of claim 10, wherein updating the pre-determined priority order of the one or more categories of packets comprises:
determining, for each of the one or more categories of packets, whether number of packets queued per category of packets is greater than number of packets queued threshold per category of packets; and
altering the pre-determined priority order of the one or more categories of packets based on the determining.
18. The system of claim 10, wherein updating the pre-determined packet transmission share associated with each of the one or more categories of packets comprises:
determining, for each of the one or more categories of packets, whether average inter scheduling delay for one or more categories of packets is greater than or equal to average inter scheduling delay threshold per category of packets;
checking , for each of the one or more categories of packets, whether number of packets queued per category of packets is greater than number of packets queued threshold per category of packets; and
altering the pre-determined packet transmission share associated with each of the one or more categories of packets based on the determining and the checking.
19. A non-transitory computer readable medium storing instructions for efficient scheduling of downlink data traffic at a base station that, when executed by a processor cause the processor to perform operations comprising:
receiving, at a first protocol layer, one or more downlink data packets from a second protocol layer;
classifying the one or more downlink packets into one or more categories of packets based on transmission type and radio transmission state of the one or more downlink packets;
scheduling one or more first packets from each of the one or more categories of packets based on a pre-determined priority order of the one or more categories of packets and a predetermined packet transmission share associated with each of the one or more categories of packets;
transmitting the one or more first packets from the one or more categories of packets in a transmission time interval;
updating a pre-determined priority order of the one or more categories of packets and a pre-determined packet transmission share associated with each of the one or more categories of packets after a predetermined time interval; and
scheduling one or more second packets from the one or more categories of packets based on the updated pre-determined priority order of the one or more categories of packets and a predetermined packet transmission share associated with each of the one or more categories of packets in the transmission time interval subsequent to the updating.

Date this 19th day of December, 2014
Shwetha A Chimalgi
Of K&S Partners
Agent for the Applicant
,TagSPECI:TECHNICAL FIELD
The present disclosure relates generally to wireless communication networks, and more particularly but not limited to adaptive scheduling of heterogeneous packets across a downlink communication channel in the wireless communication networks.

Documents

Application Documents

# Name Date
1 6405-CHE-2014 FORM-9 19-12-2014.pdf 2014-12-19
1 6405-CHE-2014-IntimationOfGrant23-01-2023.pdf 2023-01-23
2 6405-CHE-2014 FORM-18 19-12-2014.pdf 2014-12-19
2 6405-CHE-2014-PatentCertificate23-01-2023.pdf 2023-01-23
3 IP29329-spec.pdf 2014-12-23
3 6405-CHE-2014-Written submissions and relevant documents [17-01-2023(online)].pdf 2023-01-17
4 IP29329-fig.pdf 2014-12-23
4 6405-CHE-2014-AMENDED DOCUMENTS [24-12-2022(online)].pdf 2022-12-24
5 FORM 5-IP29329.pdf 2014-12-23
5 6405-CHE-2014-Correspondence to notify the Controller [24-12-2022(online)].pdf 2022-12-24
6 FORM 3-IP29329.pdf 2014-12-23
6 6405-CHE-2014-FORM 13 [24-12-2022(online)].pdf 2022-12-24
7 6405-CHE-2014-Request For Certified Copy-Online(23-12-2014).pdf 2014-12-23
7 6405-CHE-2014-POA [24-12-2022(online)].pdf 2022-12-24
8 6405CHE2014_CertifiedCopyRequest.pdf 2014-12-26
8 6405-CHE-2014-US(14)-HearingNotice-(HearingDate-03-01-2023).pdf 2022-12-02
9 6405-CHE-2014-FER_SER_REPLY [26-06-2019(online)].pdf 2019-06-26
9 abstract 6405-CHE-2014.jpg 2015-01-02
10 6405-CHE-2014-FER.pdf 2018-12-26
10 6405-CHE-2014-Request For Certified Copy-Online(16-02-2015).pdf 2015-02-16
11 6405-CHE-2014 CORRESPONDENCE OTHERS 22-05-2015.pdf 2015-05-22
11 6405CHE2014_Certifiedcoyrequest.pdf ONLINE 2015-02-18
12 6405-CHE-2014 FORM-1 22-05-2015.pdf 2015-05-22
12 6405CHE2014_Certifiedcoyrequest.pdf 2015-03-13
13 6405-CHE-2014 POWER OFATTORNEY 22-05-2015.pdf 2015-05-22
14 6405-CHE-2014 FORM-1 22-05-2015.pdf 2015-05-22
14 6405CHE2014_Certifiedcoyrequest.pdf 2015-03-13
15 6405-CHE-2014 CORRESPONDENCE OTHERS 22-05-2015.pdf 2015-05-22
15 6405CHE2014_Certifiedcoyrequest.pdf ONLINE 2015-02-18
16 6405-CHE-2014-FER.pdf 2018-12-26
16 6405-CHE-2014-Request For Certified Copy-Online(16-02-2015).pdf 2015-02-16
17 abstract 6405-CHE-2014.jpg 2015-01-02
17 6405-CHE-2014-FER_SER_REPLY [26-06-2019(online)].pdf 2019-06-26
18 6405-CHE-2014-US(14)-HearingNotice-(HearingDate-03-01-2023).pdf 2022-12-02
18 6405CHE2014_CertifiedCopyRequest.pdf 2014-12-26
19 6405-CHE-2014-Request For Certified Copy-Online(23-12-2014).pdf 2014-12-23
19 6405-CHE-2014-POA [24-12-2022(online)].pdf 2022-12-24
20 FORM 3-IP29329.pdf 2014-12-23
20 6405-CHE-2014-FORM 13 [24-12-2022(online)].pdf 2022-12-24
21 FORM 5-IP29329.pdf 2014-12-23
21 6405-CHE-2014-Correspondence to notify the Controller [24-12-2022(online)].pdf 2022-12-24
22 IP29329-fig.pdf 2014-12-23
22 6405-CHE-2014-AMENDED DOCUMENTS [24-12-2022(online)].pdf 2022-12-24
23 IP29329-spec.pdf 2014-12-23
23 6405-CHE-2014-Written submissions and relevant documents [17-01-2023(online)].pdf 2023-01-17
24 6405-CHE-2014-PatentCertificate23-01-2023.pdf 2023-01-23
24 6405-CHE-2014 FORM-18 19-12-2014.pdf 2014-12-19
25 6405-CHE-2014 FORM-9 19-12-2014.pdf 2014-12-19
25 6405-CHE-2014-IntimationOfGrant23-01-2023.pdf 2023-01-23

Search Strategy

1 Searchstrategy_13-12-2018.pdf

ERegister / Renewals

3rd: 17 Apr 2023

From 19/12/2016 - To 19/12/2017

4th: 17 Apr 2023

From 19/12/2017 - To 19/12/2018

5th: 17 Apr 2023

From 19/12/2018 - To 19/12/2019

6th: 17 Apr 2023

From 19/12/2019 - To 19/12/2020

7th: 17 Apr 2023

From 19/12/2020 - To 19/12/2021

8th: 17 Apr 2023

From 19/12/2021 - To 19/12/2022

9th: 17 Apr 2023

From 19/12/2022 - To 19/12/2023

10th: 14 Dec 2023

From 19/12/2023 - To 19/12/2024

11th: 18 Dec 2024

From 19/12/2024 - To 19/12/2025