
NSF Org: |
CNS Division Of Computer and Network Systems |
Recipient: |
|
Initial Amendment Date: | August 26, 2010 |
Latest Amendment Date: | August 14, 2013 |
Award Number: | 1039646 |
Award Instrument: | Standard 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, 2010 |
End Date: | August 31, 2014 (Estimated) |
Total Intended Award Amount: | $550,001.00 |
Total Awarded Amount to Date: | $753,604.00 |
Funds Obligated to Date: |
FY 2013 = $203,603.00 |
History of Investigator: |
|
Recipient Sponsored Research Office: |
9500 GILMAN DR LA JOLLA CA US 92093-0021 (858)534-4896 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
9500 GILMAN DR LA JOLLA CA US 92093-0021 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): | Special Projects - CNS |
Primary Program Source: |
01001314DB NSF RESEARCH & RELATED ACTIVIT |
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.070 |
ABSTRACT
While the Internet has far exceeded expectations, it has also stretched initial assumptions, often creating tussles that challenge its underlying communication model. Users and applications operate in terms of content, making it increasingly limiting and difficult to conform to IP's requirement to communicate by discovering and specifying location. To carry the Internet into the future, a conceptually simple yet transformational architectural shift is required, from today's focus on where ? addresses and hosts ? to what ? the content that users and applications care about.
This project investigates a potential new Internet architecture called Named Data Networking (NDN). NDN capitalizes on strengths ? and addresses weaknesses ? of the Internet's current host-based, point-to-point communication architecture in order to naturally accommodate emerging patterns of communication. By naming data instead of their location, NDN transforms data into a first-class entity. The current Internet secures the data container. NDN secures the contents, a design choice that decouples trust in data from trust in hosts, enabling several radically scalable communication mechanisms such as automatic caching to optimize bandwidth. The project studies the technical challenges that must be addressed to validate NDN as a future Internet architecture: routing scalability, fast forwarding, trust models, network security, content protection and privacy, and fundamental communication theory. The project uses end-to-end testbed deployments, simulation, and theoretical analysis to evaluate the proposed architecture, and is developing specifications and prototype implementations of NDN protocols and applications.
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.
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.
As one of the four projects under NSF's Future Internet Architecture Program, the Named Data Networking (NDN) project set out to address many of the major shortcomings of the current Internet by starting with a fundamentally different premise. Rather than the host-based, point-to-point communication model employed today, NDN names data instead of locations, and organizes its architectural decisions around models of communication driven primarily by data distribution and the interests of end users.
In Routing and Forwarding, our primary research contribution focused on exploring the most ambitious routing research idea that emerged from NSF's FIND program: greedy routing based on underlying metric spaces.
We developed HyperMap, a simple method to map a given real network to its hyperbolic space by replaying the network's geometric growth. The implemented algorithm estimates the hyperbolic coordinates of new nodes at each time step by maximizing the likelihood of the network snapshot in the model. HyperMap outperforms our previous embedding methods in terms of mapping accuracy, method simplicity, and computational complexitiy. We applied HyperMap to embed the AS-level Internet topology derived from CAIDA's Ark measurements into its hyperbolic space and thus obtained hyperbolic coordinates of the ASes participating in the NDN testbed.
We conducted routing experiments on the NDN Testbed investigating the performance metrics for the modified greedy forwarding (MGF) algorithm that excludes the current node from any distance comparisons and finds the neighbor closest to the destination. We measured the success ratio (the percentage of the successful paths that reach their destinations) and the average stretch (the ratio of the hop lengths of greedy paths to the corresponding shortest paths in the graph). We simulated forwarding on the full graph of participating sites as well as on all the graphs obtained from the full graph by removing one link without disconnecting the full graph. Our experiments demonstrated high efficiency and robustness of greedy forwarding when using the underlying hyperbolic metric space to calculate the distance between participating nodes.
We developed hggraphs, a C++ library that provides a collection of functions and data structures for generating synthetic graphs embedded in hyperbolic metric spaces, and computing properties of those graphs. This library supports research and development of hyperbolic routing in the NDN environment as it enables the implementation of tools to assess the effectiveness of the greedy routing approach in synthetic networks of variable size. It also allows the researchers to create new ndnSIM scenarios extending the default forwarding strategy to simulate hyperbolic routing.
Two postdocs participated in NDN project activities in Routing and Forwarding area and developed software for routing research and simulations.
As part of Testing and Evaluation activities, we maintained a local node on the national NDN testbed using the CCNX hub software. We also parrticipated in team experiments testing NDN-based video and audio software, participatory sensing, and media distribution via the NDN infrastructure.
Finally, during the last two years of the project, we provided consistent and efficient management support for the whole NDN team, overseeing and coordinating the activities of all participating inst...
Please report errors in award information by writing to: awardsearch@nsf.gov.