NSF award 2551532 · Carnegie Mellon University

Collaborative Research: NeTS: A periodic table of congestion control: A formal taxonomy of algorithms and scenarios

Final report due

28 January 2031

in 1,563 days · The award ends on 30 September 2030.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Jun 2030in 1323 days
award ending 2030-09-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 Aug 2030in 1398 days
award ending 2030-09-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Sep 2030in 1433 days
award ending 2030-09-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Jan 2031in 1563 days
award ending 2030-09-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Jan 2031in 1563 days
award ending 2030-09-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Jan 2031in 1563 days
award ending 2030-09-30 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 30 September 2030.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 January 2031.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2551532
Period of support: 1 Oct 2026 – 30 Sep 2030
Amount: $430,000
Awardee: Carnegie Mellon University, Pittsburgh, PA
Program: Networking Technology and Syst
Directorate: CSE

Abstract

Congestion control algorithms (CCAs) play a critical role in allocating resources in computer networks today, with the ideal goal of ensuring both efficient use of the network and fair access to all endpoints. As a result, CCA design is a well-studied topic in networking research due to its central role in network performance. The diversity in modern CCA designs arises from the wide range of networks and application…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.