Skip to feedback

Award Abstract # 0721484
FIND: Collaborative Research: Towards An Analytic Foundation for Network Architectures

NSF Org: CNS
Division Of Computer and Network Systems
Recipient: PURDUE UNIVERSITY
Initial Amendment Date: September 13, 2007
Latest Amendment Date: June 22, 2009
Award Number: 0721484
Award Instrument: Continuing Grant
Program Manager: Darleen Fisher
CNS
 Division Of Computer and Network Systems
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: September 1, 2007
End Date: August 31, 2011 (Estimated)
Total Intended Award Amount: $200,000.00
Total Awarded Amount to Date: $200,000.00
Funds Obligated to Date: FY 2007 = $104,000.00
FY 2008 = $50,000.00

FY 2009 = $46,000.00
History of Investigator:
  • Xiaojun Lin (Principal Investigator)
Recipient Sponsored Research Office: Purdue University
2550 NORTHWESTERN AVE # 1100
WEST LAFAYETTE
IN  US  47906-1332
(765)494-1055
Sponsor Congressional District: 04
Primary Place of Performance: Purdue University
2550 NORTHWESTERN AVE # 1100
WEST LAFAYETTE
IN  US  47906-1332
Primary Place of Performance
Congressional District:
04
Unique Entity Identifier (UEI): YRXVL4JYCEF5
Parent UEI: YRXVL4JYCEF5
NSF Program(s): Networking Technology and Syst
Primary Program Source: app-0107 
01000809DB NSF RESEARCH & RELATED ACTIVIT

01000910DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 7363, 9218, HPCC
Program Element Code(s): 736300
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.070

ABSTRACT

In large and complex communication networks, architectural decisions regarding functionality allocation are often more important than the details of resource allocation algorithms themselves. This NSF-funded project aims to develop a scientific foundation for designing network architectures by building upon recent successes in understanding protocols as optimizers and layering as mathematical decompositions. In particular, the PIs at five institutions collaborate to conduct a wide range of closely-connected research activities that substantially improve upon the state-of-the-art. Starting from a convex optimization formulation of the architecture design problem, the project investigates a wide range of alternative decompositions that provide different scalability, convergence, and complexity tradeoffs. The PIs then determine whether the properties of these alternative architectures continue to hold under stochastic network dynamics and non-convex objectives and constraints, and develop new architectural designs from a careful study of such dynamics. Mathematically, this project leads to a long-overdue union between network optimization and stochastic networks theory, and enables a systematic approach to leverage advances in general non-convex optimization.

Broader Impact: This project has clear synergy with the NSF's GENI initiative. The research provides a strong, analytic foundation for the design of future network architectures, including clean-slate solutions that deviate from todays Internet. The exploration of new ways to decompose functionality, with the influence of network dynamics and non-convexity in mind, will result in new protocols and mechanisms that can be evaluated in the GENI infrastructure.

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 12)
C.-C. Wang and X. Lin "Fast Resource Allocation for Network-Coded Traffic: A Coded- Feedback Approach" Mini-Conference of IEEE INFOCOM , 2009
C. Joo, X. Lin, and N. B. Shroff "Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-exclusive Interference Model" IEEE Transactions on Automatic Control , v.54 , 2009 , p.2734
C. Joo, X. Lin, and N. B. Shroff "Performance Limits of Greedy Maximal Matching in Multi-hop Wireless Networks" IEEE Conference on Decision and Control (CDC) , 2007
C. Joo, X. Lin, and N. B. Shroff "Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks" IEEE/ACM Trans. on Networking , v.17 , 2009 , p.1132
C. Joo, X. Lin, and N. B. Shroff "Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-hop Wireless Networks" IEEE INFOCOM 2008 , 2008
C. Zhao and X. Lin "On the Queue-Overflow Probabilities of Distributed Scheduling Algorithms" IEEE Conference on Decision and Control , 2009
C. Zhao, X. Lin and C. Wu "The Streaming Capacity of Sparsely-Connected P2P Systems with Distributed Control" IEEE INFOCOM, Shanghai, China , 2011
M. Sharma and X. Lin "OFDM Downlink Scheduling for Delay-Optimality: Many-Channel Many-Source Asymptotics with General Arrival Processes" Information Theory and Applications Workshop, UC San Diego, , 2011
Tian Lan, Xiaojun Lin, Mung Chiang and Ruby Lee "How Bad Is Suboptimal Rate Allocation?" Proceedings of IEEE INFOCOM , 2008
V. J. Venkataramanan and and Xiaojun Lin "On the Queue-Overflow Probability of Wireless Systems: A New Approach Combining Large Deviations with Lyapunov Functions" IEEE Transactions on Information Theory , v.18 , 2010 , p.788
V. J. Venkataramanan, X. Lin, L. Ying and S. Shakkottai, "On Scheduling for Minimizing End- to-end Buffer Usage Over Multihop Wireless Networks" IEEE INFOCOM , 2010
(Showing: 1 - 10 of 12)

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

Print this page

Back to Top of page