Research Initiation Award: Compact Schemes for Message      Routing in Dynamic Networks
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Bruce H. Barnes', 'PO_EMAI': None, 'PO_PHON': None}
This research focuses on the problem of succinctly storing shortest, or         near-shortest, path routing information in a distributed network which          experiences changes in topology and edge costs. The emphasis is on both         identifying such routing schemes and efficient algorithms for                   constructing them.                                                                                                                                              Three interrelated problems are investigated:                                   1.  Design of compact routing schemes that incrementally adapt to               changes by computing a small amount of additional information, which is         then used to restore good routings.                                                                                                                             2.  Design of compact schemes that route messages along two or more             node-disjoint paths of low total cost, thus making the routings                 resilient to faults.                                                                                                                                            3.  Investigation of an interval property of graphs that allows very            succinct encoding of shortest paths.  This finds application in the             updating of routing information when edge costs change.                                                                                                         The techniques used will be based, in part, on naming nodes                     appropriately and on interesting properties of distances in graphs.             Thus, in addition to yielding space-efficient routing schemes, this             research will also provide new insights into the succinct encoding of           information within  node names and on the structure of shortest paths.
{'FirstName': 'Ravi', 'LastName': 'Janardan', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Ravi Janardan', 'EmailAddress': 'janardan@cs.umn.edu', 'NSF_ID': '000290751', 'StartDate': '08/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Minnesota-Twin Cities', 'CityName': 'MINNEAPOLIS', 'ZipCode': '554552009', 'PhoneNumber': '6126245599', 'StreetAddress': '200 OAK ST SE', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Minnesota', 'StateCode': 'MN', 'CONGRESSDISTRICT': '05', 'CONGRESS_DISTRICT_ORG': 'MN05', 'ORG_UEI_NUM': 'KABJZBBJ4B54', 'ORG_LGL_BUS_NAME': 'REGENTS OF THE UNIVERSITY OF MINNESOTA', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8808574.xml'}