Award Abstract # 1524317
NeTS: Small: A Migration Approach to Optimal Control of Wireless Networks

NSF Org: CNS
Division Of Computer and Network Systems
Recipient: MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Initial Amendment Date: September 14, 2015
Latest Amendment Date: September 14, 2015
Award Number: 1524317
Award Instrument: Standard Grant
Program Manager: Alhussein Abouzeid
aabouzei@nsf.gov
 (703)292-7855
CNS
 Division Of Computer and Network Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: October 1, 2015
End Date: September 30, 2020 (Estimated)
Total Intended Award Amount: $460,000.00
Total Awarded Amount to Date: $460,000.00
Funds Obligated to Date: FY 2015 = $460,000.00
History of Investigator:
  • Eytan Modiano (Principal Investigator)
    modiano@mit.edu
Recipient Sponsored Research Office: Massachusetts Institute of Technology
77 MASSACHUSETTS AVE
CAMBRIDGE
MA  US  02139-4301
(617)253-1000
Sponsor Congressional District: 07
Primary Place of Performance: Massachusetts Institute of Technology
77 Massachusetts Avenue
Cambridge
MA  US  02139-4307
Primary Place of Performance
Congressional District:
07
Unique Entity Identifier (UEI): E2NYLCDML6V1
Parent UEI: E2NYLCDML6V1
NSF Program(s): Networking Technology and Syst
Primary Program Source: 01001516DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7923
Program Element Code(s): 736300
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

Recent growth in mobile and media-rich applications has greatly increased the demand for wireless capacity, straining wireless networks. This dramatic increase in demand poses a challenge for current wireless networks, and calls for new algorithms that make better use of scarce wireless resources. Recently developed algorithms for optimally managing wireless resources hold the promise of significant performance improvement, but require all of the nodes in the network to be upgraded with new functionality which is both costly and impractical. This project introduces a novel architectural paradigm for wireless networks, whereby optimal algorithms are designed to operate in networks with both new and legacy nodes. This new paradigm allows optimal algorithms to be incrementally deployed alongside existing schemes, thus providing a migration path for new control algorithms, and the promise of dramatic improvement in network performance at incremental cost.

This project develops a novel overlay architecture for implementing optimal network control algorithms over legacy networks. New nodes, capable of implementing sophisticated network control algorithms, will be connected in a virtual network overlay that operates on top of the legacy network. The research will answer fundamental questions about which nodes must be upgraded with new functionality and the tradeoff between the number of new upgraded nodes and network performance. The project will develop new routing algorithms that send packets from their sources to their destinations in the overlay network, and transmission scheduling algorithms for mitigating the effect of wireless interference. These new algorithms will be designed to operate efficiently in a network with a mix of new and legacy nodes, by taking interoperability into account. Thus, this project will answer fundamental questions about the introduction of new control techniques into legacy networks, and provide a promising approach to bridging the gap between new techniques developed for universal deployment and the reality of the networks in operation today.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 11)
Abhishek Sinha and Eytan Modiano "Optimal Control for Generalized Network-Flow Problems" IEEE/ACM Transactions on Networking , 2018
Abhishek Sinha, Eytan Modiano "Optimal Control for Generalized Network-FlowProblems" IEEE Infocom , 2017
Anurag Rai, Rahul Singh and Eytan Modiano "A Distributed Algorithm for Throughput Optimal Routing in Overlay Networks" IFIP Networking , 2019
Georgios Paschos and Eytan Modiano "Throughput optimal routing in overlay networks" Allerton conference on Communication, Control, and Computing , 2014
Nathaniel M. Jones, Georgios S. Paschos, Brooke Shrader, and Eytan Modiano "An Overlay Architecture for Throughput OptimalMultipath Routing" IEEE/ACM Transactions on Networking , 2018
Nathan Jones, George Paschos, Brooke Shrader, Eytan Modiano "An overlay architecture for Throughput Optimal Multipath Routing" IEEE/ACM Transactions on Networking. , 2017
Qingkai Liang and Eytan Modiano "Minimizing Queue Length Regret Under Adversarial Network Models" ACM Sigmetrics , 2018
Qingkai Liang and Eytan Modiano "Network Utility Maximization in AdversarialEnvironments" IEEE Infocom 2018 , 2018
Thomas Stahlbuhk, Brooke Shrader and Eytan Modiano "Learning Algorithms for Minimizing Queue Length Regret" International Symposium on Information Theory , 2018
Thomas Stahlbuhk, Brooke Shrader, Eytan Modiano "Throughput Maximization in Uncooperative Spectrum sharing networks,? IEEE International Symposium on Information Theory" IEEE International Symposium on Information Theory , 2016
Xinzhe Fu and Eytan Modiano "Fundamental Limits of Volume-based Network DoS Attacks" ACM Sigmetrics , 2020
(Showing: 1 - 10 of 11)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

Recent growth in mobile and media-rich applications has greatly increased the demand for wireless capacity, straining wireless networks. This dramatic increase in demand poses a challenge for current wireless networks, and calls for new network control mechanisms that make better use of scarce wireless resources.

This project developed a novel architectural paradigm for wireless network control, whereby novel network algorithms are designed to operate in networks with both new and legacy nodes. This new paradigm allows optimal control algorithms, such as new routing schemes, to be incrementally deployed alongside existing schemes, providing a migration path for new algorithms that promise dramatic improvements in network performance.

This project developed a nove overlay architecture for enabling the deployment of new network algrothms, as well as novel network control schemes that can operate along side existing schemes and legacy technologies.  Our main accomplishements include:

1) we developed an overlay architecture for implementing optimal network control algorithms over a legacy network.

2) We develop new routing algorithms that operate over an overlay network, where overlay nodes are connected via “tunnels” consisting of uncontrollable legacy nodes.

3) We  developed optimal link scheduling algorithms for a wireless network with a mix of controllable and uncontrollable nodes. 

4) We  developed optimal flow control schemes to maximize network utility in the overlay network.

 

 


Last Modified: 12/07/2020
Modified by: Eytan Modiano

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page