AFOSR

Complex Networks
Dr. Robert J. Bonneau
Program Manager
AFOSR/RSL
Air Force Research Laboratory
Distribution A: Approved for public release; distribution is unlimited. 88ABW-2011-0774 1
 2011 AFOSR SPRING REVIEW
2311NX PORTFOLIO OVERVIEW
NAME: Robert Bonneau

Program: Complex Networks/Complex Networked Systems (DCT)

Goals:

• Preserve critical information structure and minimize latency over a

heterogeneous mobile network
• Ensure network robustness and stability under a diverse set of network
resource constraints
• Find invariant properties for a given network from a distributed set of
observations and predict network behavior
• Develop unifying mathematical approach to discovering fundamental
principles of networks and use them in network design

Payoffs:

• Preserve information structures in a network rather than just delivering

packets
• Quantify likelihood of a given network management policy to support critical
mission functions
• Predict and manage network failure comprehensively 2
 Complex Networks
Roadmap
Complex networks uses the results of the mathematical quantification of critical
information delivery to assure, manage, predict, and design Air Force networks
Local Network Research: Coding that assures information delivery and security
Network Management Research: Network protocol to maximize information flow
Global Network Research: Predict network performance and design robustness
Unified Mission Assured
Dynamic, Heterogeneous,
Design
Air Force Network
Raw Network Network Local Network
Data Management Research Research
Manage Assure Critical
Information Flow
Information Delivery
Critical
Information

Guaranteed Delivery
Of Time Critical Mathematical
Information
Characterization of
Network
Communications
Networks Global Network
Research
Predict Network
Diverse Types of Performance
Networks

3
 Complex Networks Trends

• Local Network Theory

– Geometric and non-binary information coding
– Coding information with network performance objectives
– Integration with verification and quantum methods

• Network Management
– Nonparametric strategies for assessing network performance
– Distributed strategies for measuring and assessing network information
transfer
– Sparse network management

• Global Network Theory

– Invariant metrics for analysis of network performance
– Geometric flow analysis for prediction and management of network
performance
– Global state space taxonomy and categorization

4
 Local Network Research: Preserving
Information Structure
• Statistical geometric coding structures are used to transport diverse sets of information in a network
and preserve its critical structure
- Communication networks can often degrade or destroy information relationships
- Geometric structures can preserve critical information in the process of coding and
packetization so that protocol requirements can be relaxed
Coding Coding
Information Code Information Information Loss Information Less Information Loss With
Timescale t Distribution With Interference Recovery Interference
Random Code
More Latency/Computation/
Information
t  packets (ex: Rateless Code) Recover Using Storage
Loss Distributed Coding

Recovered
Information
Information
Source Recover With
Hybrid Code Information Loss
Code and Retransmit
(ex: Network Code) Measurable

Deterministic/Minimal Information Loss Recover With

Coding Significant Retransmission
(ex: Trellis Code)
Less Latency/Computation/
Storage
More Information Loss
With Interference

5
 Index Coding in Networks
PI: Bobby Kleinberg Institution: Cornell University

Approach: Index coding sets bits to indicate to receiver what statistical class
information to be decoded belongs to
- This allows different statistical classes to be prioritized differently in
in coding mechanism
Payoff: Different classes of information can be prioritized according to content as
it is packetized and transmitted between two points on a network without having
to specify complete destination address – reduces overhead
Network Content Prioritized
Coding Network Coding

Message structure can give different

probability of decoding message for
different users Statistical Algebraic
Decoded Output

Decoded Output
Error Bounds

6
 Geometric Adaptive
Subspace Coding
Olgiza Milenkovic, UIUC

Approach: Standard coding theory relies on fixed geometric statistical

assumptions for the encoder and decoder. This assumption can be changed by
using an adaptive decoding mechanism.
Payoff: Allows dynamic adaptation to large amounts of dropped packets and lost
information when specific classes of information must be recovered.

Adaptive Decoding Strategy for Different Dynamic Information Sources

Classes of Information

Bounds on Recovery for Different

Subspaces

7
 Managing on Degrees of Freedom –
A Network Coding Approach
Muriel Medard, MIT

Approach: Sparse approximation can be used to decode different streams of

information
- Source coder can create different probability distributions of coded
information
Payoff: Different classes of content can be prioritized according to content and
packets prioritized accordingly
Sparse Approximation Coding and Recovery

8
 Network Management Research:
Guaranteeing Information Transfer
The state of information transfer on a network changes with network management policy and protocol
– Particularly important to the Air Force given its unique mobile infrastructure

The state of the network and its ability to transfer information in a network can be described at different
timescales and managed through coding and protocol design
Protocol Less: Information Loss With
Protocol Disruption
Information Protocol Information Information Loss
Distribution With Interference Information More: Latency, Difficult to
Timescale t
Information Recovery Control
Sources
Random Protocol Information
Recover With
t  groups of (ex: Flooding) Loss Distributed
Redundancy
Source 1
packets Message 1

Information Loss Recover With

Hybrid Routing Message 2
Source 2 Redundancy
(ex: OLSR) Measurable
and Retransmit
Recovered
Information

Message 3
Source 3
Deterministic
Recover With
Routing Information Loss
Retransmission
(ex: OSPF) Significant

Less: Latency
More: Information Loss With
Disruption, Controllable

9
 Reinforcement Learning of
Complex Networks
PI: Prashant Metha, Sean Meyn Institution: UIUC

Approach: Use dynamic programming as an approach to estimate network state and manage
adaptively rather than having a fixed model for network behavior
Payoff: Will adapt to dynamic conditions of topology and structural information change
- Can handle non-Gaussian distributions of state variables more efficiently than
learning methods

Dynamic Stochastic Programming Mean Field Statistical Approaches Allow

Much Less Resource Utilization

10
 Complex Network Information Exchange In
Random Wireless Environments
PIs: A. Goldsmith, Yonina Eldar, S. Boyd Stanford, V. Poor Princeton

Approach: Wireless propagation channels can be sparsely sampled and the

information recovery can still approximate the throughput with full sampling
- Allows low dimensional network traffic flow management
Payoff: Throughput in wireless channels can be increased in extremely low signal
to noise scenarios and correlated interference
Sparse Sampling Architecture

Throughput Slightly Less Than Full Sampling

Wireless Statistical Channel
Covariance Structure

11
 Network Coding and Verification
With Sheaves
Rob Ghrist, Michael Robinson UPenn

Approach: Network coding can be formalized through a sheaf theoretic framework to

represent maximum information flow regimes
- Sheaf theory enables detailed algebraic specification of different information classes
Payoff: Verification of information flows on the network can be accomplished over different
classes of information

Sheaf Formulation of Network Coding Information Flow

Class

Algebraic Information
Class

Verification of Information Flow

In Logical State Diagram

12
 Global Network Research: Network
Performance Invariants and Prediction

• We wish to develop information invariants that can be used to assess network performance
- Describe statistical geometric invariant properties to characterize performance
of network in transporting information through algebraic and topological methods
- Use geometric flow analysis to predict and manage future network state
Network Network
Information Network Information Information Loss Information
Timescale t Distribution With Interference Less: Information Loss Under
Recovery
Information Disruption
Sources Random Network Information
Change Information
More: Latency, Resource
Loss Distributed Intensive
Source 1 t  blocks of (ex: Mobile Ad Hoc) Distribution
information Message 1

Source 2 Information Loss Reroute and Change

Hybrid Network
(Mesh) Measurable Distribution
Message 2
Recovered
Information

Source 3
Message 3
Deterministic
Information Loss Reroute Information
Routing
(ex: Core/Backbone) Significant

Less: Latency/Disruption
Tolerant
More: Controllable
13
 Geometric Network
Parameterization
Narayan, Saniee, Barishnikov, Korotky, UC Santa Cruz/Lucent

Approach: Different classes of networks have different behavioral

properties according to their geometry
Payoff: Properties such as stability under resource constraints, security
properties and latency can be measured and characterized

Geometric and Statistical Network Network Taxonomy

Characterization

Space of Networks

14
 Multi-scale Network Measures
and Covers
Jones, Rokhlin, Yale, Ness, Bassu Telcordia

Approach: Measure theory can be applied to geometric properties of statistical

distributions learned from networks
Payoff: Affine multi-scale operator theoretic metric properties can characterize
geometric and statistical characteristics of the network such as likelihood for
information loss, security compromise, or failure due to resource constraints

Geometric and Statistical Operator Theoretic Network Transactional

Network Properties Network Representation Behavior According to Each
Operator Class

15
 Sparse Approximation and Persistent
Homology of Networks
Robert Calderbank, Duke, Rob Nowak, Laura Balzano, UWisc

Approach: Persistent Homology can be used to characterize statistical class of

network traffic data
Payoff: Different classes of network behavior can be statistical parameterized by
homology and the risk of information loss and system failure can be defined

Network Data vs. Models

Network Risk as a Function
Of Homology
Outlier Characterizing Normal Network
Information Loss Behavior

16
 Geometric Classical and Quantum
Network Analysis
Alsing,Ypez, AFRL/RI/VS, Warner Miller, Florida Atlantic University, ST Yau, Harvard University

Approach: Use distance preserving high to low dimensional transformations to reduce

network data dimensionality, characterize with homology, classify according to statistical
region with quantum statistical analog
Payoff: Comprehensive statistical characterization of network data at multiple scales that is
invariant to dimensionality reduction – characterized on real Rome Emulab data
High to Low Dimensional Homology Determines Statistical Quantum Network
Distance Preserving Statistical Class on Analog
Transformation Rome Emulab
Deterministic Hybrid Random

# (1D) “loops” (S1)

b1 in network (2-D holes)

# (2D) “cavities” (S2)

b2 in network (3-D holes)

# (3D) “voids” (S3)

b3 in network (4-D holes) 17
 Fundamental Network Principles
Units of information transfer do not have to be packets – generalizing this approach to other
scientific areas allows generalized network design and analysis within constraints
- Taking this approach allows network design principles in terms of multiple network functions

Basic Information Unit Scales

Network Design Principles
Frequency
Data Wireless Hardware/
Social Biological
Network Network Software (1/information
timescale)

Packet Modulation Register/ Words DNA Content Deterministic Heterogeneous Random

Variable (local) Content Content Content
Unit

Network Policy/
Packet Waveform
Ram/ Phrases Protein Protocol Deterministic Heterogeneous Random
Groups Subroutine (management)
Synth. Protocol Protocol Protocol

Network
Packet Virtual News
Signal
Mem./ Reports/ Cell Structure Deterministic Heterogeneous
Blocks Array (global) Random
Program Blogs Function Network Network Network Distribution
Deterministic Heterogeneous Random
Communications General
Networks Networks

Design Design
Excluded Properties Included Properties

Time Evolution Not Resourced, Resourced,

(Global Not Stable, Stable,
Properties) Not Secure Secure 18
 Program Impact &
Collaboration with Agencies
• DARPA Collaboration/joint program reviews
– InPho – Information in a photon/quantum network
– KECOM – Knowledge aided compressed measurement
– ITMANET – Joint program review
– TDA/Stomp – topological data analysis/sensor topology for minimal
planning
• NITRD – Large Scale Networks Working Group, Interagency Working Group
on Spectrum, High Confidence Software Systems
– complex systems initiative (with NIST/DOE/NSF)
• OSD – Complex Engineering Systems, Assured Software Systems,
Systems 20/20, Command and Control Working Group
• ARL/ARO Board of Advisors – Collaborative Network Science & Biology
Technology Alliance
• NSF Future Internet, Net-Sci, BECS (Building and Engineering Complex
Systems) 19
 Other Program Interactions

Cyber Operations: New Joint University Center of Excellence:

“Secure Cloud Computing” with university and AFRL/RI

Physics and Materials: New Joint MURI Topic: “Large Scale Integrated
Hybrid Nanophotonics”

Socio-Cultural Analysis: Social Networks – Joint MURI Topic: “Stable

Metrics for Inference in Social Networks ” – UCLA/USC/ASU

Quantum: Interaction with quantum network and quantum estimation

processes through lab tasks

Information Fusion: Critical feature selection in sensor networks

Optimization: Competing optimization requirements.
Decision: Networks of neurons.
Biology: Systems biological processes as networks.
20
 Academia/Commercial Outreach

• Keynote Speaker: IEEE Mobile and Ad-Hoc Sensor Systems

November 2010
• Keynote Speaker: IDGA Military Radar Symposium, February 2011
• Invited Speaker: IEEE Information Theory and Applications, UCSD
February 2010, 2011
• Invited Speaker: IEEE Infocom, SanDiego, March 2010
• Invited Speaker: IEEE GlobeCom Dec 2010
• Panel Organizer: IEEE Milcom, Dec 2011
• Invited Speaker: IDGA RPA Payloads Conference
• Invited Speaker: Workshop on Algebraic and Random Topology,
University of Chicago, April 2010
• Organizer: Cambridge University, Newton Institute Workshop on
Network Mathematics, Cambridge England, June 2010
• Organizer: Workshop on Mathematics of Distributed Systems,
Duke University 2010
21
 Transition Activities
• DCT
– AFRL/RI – Lab tasks/Joint Emulab research center AFRL/RI online January
2010
• Integration of MURI – “Information Dynamics in Networks” with AFRL
Emulab through Princeton/UC Irvine
• Transition of Yale diffusion map to AFRL/RI for network analysis
• Network management and coding interaction with ACC – Jim Lehnert
Purdue/Len Cimini Delaware/Andrea Goldsmith-Stanford
– AFRL/RW – weapons tactical data links interaction – Chad Jenkins/Brown
– AFRL/RH – social network analysis interaction – Michael Mahoney/Stanford
– AFRL/RY - collaboration for transitions in network/software policy and
management - Larry Carin - Duke
• STTR
– Transitions between STTR/AFRL/ESC/Boeing under STTR IAI activity –
interactions with AFRL/RI
– STTR ANDRO Computational Research interaction with OSD/NII/NTIA/ARL
CERDEC for spectrum planning research – interaction with AFRL/RI
– Interaction with Princeton/ASU with IAI for integration of STTR work
22
 Transition Activities

• Customer/Industry
– Collaboration with ACC/GCIC, Air Force Spectrum Management Agency on
JALIN ICD
– Collaboration with Boeing, ESC, IAI for transition of coding and routing
management protocols baseline CORE tools to Rome Lab for possible
integration in CABLE JCTD
– Briefing to Space Command/Peterson for potential collaboration
– Interaction with Northrup Grumman/BACN airborne networking program for
potential collaboration
• OSD
– Complex Systems Engineering and Systems 20/20 initiative
– Software Assurance and Security Initiative
– Robust Command and Control Intiative
• Commercial
– Interaction with ATT/Stanford on real time network information recovery
– New initiatives with Akamai for content distribution analysis
– Interaction with USFA/DHS/CISCO on router algorithm design

23
 Complex Networks Transition
Organization
• Complex Networks has an integrated transition strategy
AFRL In House/ Customer Interaction
Complex Networks AFRL/RI – Network Emulation ACC/ASC/ESC/AMC
/Joint
AFOSR AFRL Focused Long
Discovery Network Emulation Centers
Term Challenges
Challenges

SBIR
STTR

OSD
MURI
Activitie
Distribution s
DARPA
DARPA

Integrated Networking
Approach/Stable Under - OSD/COI Working Groups
Heterogeneous - Industry Partnerships
Conditions - Commercial Interaction

Network Science OSD

Airborne Networks
Working Group Cross Federal Collaboration
Requirements and
NITRD/NSF/DHS Capabilities Documents
Partnerships

24
Backup

25
 Other Agencies

• Basic research in networks:

– ARMY/ARL/ARO – Network Science/ITA/CTA/MURI – applying analytic
models to network problems and using to assess protocols on the basis of
similarity to model – some network statistical analysis
– Navy/ONR/NRL – MURI/6.1/6.2 - Statistical analysis of network
phenomenon – some protocol analysis
– DARPA – COGNETS/ITMANET – heavy emphasis on system
development – some work on information theory for cross layer design –
sensor planning
– NSF – Future Internet/NetSci/CDI/Portfolios – developmental work in
information theory – casting broad net to larger research community for
networking concepts
– DOE/NIST/NASA – Focused on large scale backbone network systems
and physics-based phenomenology

26
 Complex Networked System
Design Principles
Units of information transfer do not have to be packets – generalizing this approach to
other scientific areas allows generalized network analyses
- Examples: Social Networks, Wireless Propagation, Software Performance, Biological
Frequency Architecture Design Principles

(1/information
timescale)
Deterministic Heterogeneous Random
Content Content Content Content
(local)

System Policy/
Protocol Deterministic Heterogeneous Random
(management) Protocol Protocol Protocol

System
Structure Deterministic Heterogeneous Random
(global) Network Network Network Distribution

Time Evolution Deterministic Heterogeneous Random

(Global
Properties)

Design Design
Excluded Properties Included Properties
Not Resourced, Resourced,
Not Stable, Stable,
Not Secure Secure 27
 Complex Networks Approach

Goal: Develop unifying mathematical approach to discovering fundamental principles of networks rather than imposing
them
Network Local Network
Management Research Research
Guarantee Preserve
Information Information
Transfer Structure
Global Network
Research
Complex Networks
Theory
Predict
Network “Fundamental Principles”
Hard Theoretical of Networks
Problems Performance

Air Force Communication

Networks Diverse Types of
Networks

28
 Air Force Network Environment

The Air Force is unique among the DOD and civilian world in that it has a highly
heterogeneous set of users and must provide a mobile infrastructure

29
What’s a Complex Network?

30
 Coding for Interference Networks
Sriram Vishwanath, UT Austin

Approach: Use geometric lattice theory as a mechanism for code design such that
an information capacity of the code is increased as packets dropped & corrupted
Payoff: Coding can be performed to preserve information content in transmission
during severe network interference and may potentially take toward coding over
integers
Lattice structures enable robust preservation of information structure during
packetization through regular lattice a potential to code over non binary
number sequences

Probability of
information lost
rigorously
bounded

31
 Geometric Coding for Networks
Lizhong Zheng, MIT

Approach: Coding theory that exploits both network routing state and
information structure across packets to guarantee information transfer

Payoff: Ability to guarantee transfer of information at coding level

without significant packet retransmission

Geometric Coding Result Improved Performance With Routing

Information Embedded

32
 Managing on Degrees of Freedom –
A Network Coding Approach
Muriel Medard, MIT

Approach: Specific routing path configuration of networks can allow superior

throughput of information based on a geometrically structured code
Payoff: Information transfer becomes more independent of network protocol
performance

Configure code/packet structure using algebraic geometry do

induce maximum information transfer for a given network
architecture

• We would like to move away

from a depth one network and
from restrictive conditions on
the inputs/function
• We consider a somewhat
different version of graph
entropy
• We are able to remove the
restrictive conditions
• Our approach also allows us to
consider a more general
topology - trees

33
 Management of Complex Networks
John Doyle, Caltech

Approach: Analysis of geometric strategy to bound information loss and

instability due to conflicts between coding, packetization, and routing
Payoff: Define what part of network management approach destabilizes
networks and destroys information transfer
Network Protocol

Information
Coding/Routing
Structure
(with Geometric Bound) Destabilizing Behavior
Information vs. Routing
(Information Flow Disruption)
S
(1,1,1)
(1,0,1)
(1,1,1)
min
x
   kp    x   dt
2 2
px 
(1,1,0)
 x  kp
(1,1,0) (1,1,1) (1,0,1)
Geometric coding method can potentially
(1,1,0) (1,0,1) bound disruption.
d1 d2
( f i , j , g id,1j , g id, 2j )
34
 Thermodynamics of Large-Scale
Heterogeneous Wireless Networks
D. Tse, Berkeley, P. Gupta, Alcatel Lucent, D. Shah, MIT

Approach: Characterize information capacity of wireless network as thermo-

dynamic process and use to guide management of network protocol selection
Payoff: Reliable statistical and queuing methods to govern and predict network
behavior
Wireless multiple input/output protocol allow network to reach maximum information throughput.
Fully Connected
Fully Connected Network 1
Network
Information
Hierarchical MIMO
Capacity e*() Multihop
1
2

Throughput Capacity
In Phase Transition
Using MIMO 2 3
Multihop Network 
Multiple Input/Output (MIMO)

Information Throughput

35
 Learning, Inference, and Coding
in Complex Networks
Rob Nowak, University of Wisc. Madison

Approach: Use estimation theory to measure the state of information transfer on a

network from multiple distributed measurements (network tomography)
Payoff: Map the current state of any network from distributed measurements and
allow management of future network state based on coding and/or timing

Estimation of Local Information Throughput Estimation of Global Information Throughput

Current Estimated Network State

36
 Topological Features of
Network Geometry
Narayan, Saniee, Barishnikov, Korotky, UC Santa Cruz/Lucent

Approach: Develop techniques to measure curvature as parameter in real

networks to determine if there are quantifiable properties of topological
network invariance
Payoff: Curvature key indicator of stability of network performance after
mapping graph onto manifold
Network Graph Results from Communications Networks
Real Theoretical
Networks Network
Size Diameter - Radius Average
#node – #links d* geodesic

4,264-15,022 14 - 2 6.4 11.6

Curvature Topologically
Analysis Invariant?
Experimental
K>0 K<0 Wireless
Size Diameter - Radius Average
#node – #links d* geodesic
2998 - 7612 12 - 2 3.1 5.53

K=0 Experimental Fiber

Size Diameter- Radius Average
#node – #links d* geodesic
3447 - 18780 11 - 2 2.9 5.0
Curvature is a characteristic of a manifold
37
 Geometric Network Analysis
M. Mahoney, Stanford University

Approach: Combine several methods of topological analysis to determine and

filter network information so invariant properties emerge consistently
Payoff: We have a consistent realization of when networks are connected and what
resources need to be managed to preserve stability

Distributed Geometric
Network Measurements

Invariant Network
Measured Information Properties
Features

Points From Distributed

Measurements

38
 Databases for the Estimation Global State of
Multi-parameter Networks
Konstatin Mischaikow, Rutgers University

Approach: Apply Discrete Morse Theory to find probabilistic description

of the evolution of a global network into a particular state
Payoff: Global network state can have a precise probability of evolving to
a given condition
Estimate of Evolution
Directed Network Of Topological Evolution of Network
Graph With Noise Structure To Particular State?

Phase space
configuration

Multi-parameter
Database

39
 Network Information Models
PI: Edmund Yeh Institution: Yale

Approach: Characterize cascading network failure in terms of

percolation/thermodynamics model

Payoff: Transactions of information can be mapped to stability &

vulnerability of nodes

Mathematical
Physics
Percolation
(model)

40
 Topological & Geometric Tools for
Complex Networks
PIs: A. Jadbabaie, UPenn F. C. Graham, UCSD, STYau Harvard

Approach: Apply geometric flow analysis to topological network objects

to predict future global network behavior
Payoff: Global network structure can be rigorously analyzed and
predicted probabilistically
• Laplacian flows : a neutrally
stable
– Converges an element in the kernel
– If ker(L1)  {0}, then converges to a
non-zero element in the kernel for
almost all initial conditions.

• Algorithm:
• Run the local update for a random
initial condition.
• If non-zero, there exists at least one
coverage hole.

41
 Analysis and Geometry for Complex
Network Processing
PI: Ronald Coifman Institution: Yale University

Approach: Use Diffusion Map geometric learning algorithm to

detect various network parameters

Payoff: Direct mapping between input feature vectors and network

anomaly detection.

Step1 Training -> Step 2 Network Analysis

42
 Coding Through Packet Timing
PI: Todd Coleman Institution: University of Illinois

Approach: Understand dynamical behavior of codes on global

network performance

Payoff: Enables regulation of global behavior using local coding

method

43
 Analysis of Network Policy and
Its EffectPI: Lehnert
on Spectrum
Institution: Purdue
Utilization
Approach: Analyze global bounds of spectrum resource utilization as a
function of all network transaction cost

Payoff: Make wireless network exchange spectrum efficient and less

subject to instabilities introduced due to lack of available spectrum and
inefficient
2
10
Upper Bound
MWM
Lower Bound

Expected Delay
1
10

0
10
0 0.2 0.4 0.6 0.8 1
System Load
Upper bound of spectrum load vs. network latency

44
 Codes for Distributed
Storage Networks
PI: Kannan Ramchandran Institution: UC Berkeley

Approach: Deterministic codes (MDS) are bandwidth intensive – random codes (repetition
coding) are storage and computationally intensive
- Trade the advantages of each using minimum storage regenerating (MSR)
vs. minimum bandwidth regenerating codes (MBR) using geometric cut set
analysis

Payoff: Provides the most robust and stable coding strategy that enables predictable recovery
of large sets of networked information with minimum amount of available resources
Graph of Information Flow Criteria for Information Recovery
lemma: for any (potentially infinite) graph G(α,β,d),
any data collector has flow at least
k 1
MinCut( DC i )   Min{( d  i )  ,  }
i 0

Information Recovery Trade Space Minimum Bandwidth Regeneration

45
 Complex Network Information Exchange In
Random Wireless Environments
PIs: A. Goldsmith, D. O’Niel, S. Boyd Stanford, V. Poor Princeton

Approach: Networks at the physical layer generate a lot of extra protocol traffic
particularly when they transmit highly correlated information
- Using network coding at the physical layer can reduce overhead in high
signal to noise environments maximizing geometric flow of information
Payoff: Can combine correlated information at the multiple access layer to cut
down on protocol overhead, particularly in multicast scenarios.
Dynamic Physical Network Rate/Capacity Through as a Function of Transmit Power

Rate Throughput as A Function of Power

Analog Network Coding (ANC) Strategy

user 1
Z1
dec W1
Y1
X
H1 n
H(W2|Y1 )
stochastic encoder
(W1, W2) p(x|w1,w2)

H2 dec W2
Y2
transmitter n
H(W1|Y2 )
Z2
user 2 46
 Coding for Complex Networks
PI: Olgica Milenkovic Institution: U. Illinois

Approach: Information in a network can be recovered by using sparse approximation theory for
specific classes of geometric information to recover large sets of structural information
- We can recover large sets of structural information with a specified probability even if large
numbers of packets are dropped

Payoff: Overhead in protocol significantly reduced and a specific probability of recovery can be
computed for large classes of information.
Sparse Approximation Criteria Geometric Functional Approximation

Recovery for Geometric Barriers

Information Recovery as a Function of Packets

47
 Robust Network Management
PI: Mehran Mesbahi Inst: University of Washington

Approach: Robust network management can be achieved using controllability,

observability criteria can be used to assess how networks can be managed and
subject to compromise
- Eigenvalues of correlations of groups of packets can be used to assess
which nodes have the most influence over network behavior
Payoff: Design criteria for more robust, disruption tolerant, and secure network
management
Networkcan be developed
Performance Using Eigen-spectra Eigen-spectra

Vulnerability Nodes to Disruption

Robust Network Management

48
 Reinforcement Learning of
Complex Networks
PI: Sean Meyn Institution: UIUC

Approach: Use reinforcement learning methods as an approach to estimate network state and
manage dynamically rather than having a fixed model for network behavior
Payoff: Will adapt to dynamic conditions of topology and structural information change

Feedback Process for Reinforcement Learning Convergence to Solution

Robust Solution Space

Stochastic Process Approximation of System

49
 MURI: Complex Network Management
PI: Robert Calderbank, Princeton, Emmanuel Candes, Stanford, Joel Tropp Caltech,
Athena Markopoulou, UC Irvine, Suhas Diggavi, UCLA, Robert Ghrist, UPenn (& more)

Approach: Integrate network information flow, network and structural information

estimation, and sparse approximation and information recovery
One computationally efficient strategy for integrated approach for network
management and information recovery of a dynamic network
Payoff: Predictable recovery of information in a dynamic network with many
resource constraints
Manage Network Information Flow Sparsely Approximate Lost Information

Integrate

Estimation Information/Network Structure

50
 Rigidity Theory in Networks
PIs: Amit Singer, Ingrid Daubechies: Princeton

Approach: Given local sampling of information in a network, use rigidity theory

to globally approximate information/network structure given some finite number of
local measurements in noise
Payoff: Assessment of global properties of information/network structure without
large amounts of overhead or accurate measurements in the network

H a set of sparse network measurements

Network Data Actual Network

Reconstruction from with Reconstruction from

10% Noise 20% Noise Network
Reconstruction

51
 Geometric Curvature and Flow in Networks
ST Yau, Harvard, Fan Chung Graham, UCSD, Ali Jadbabaie, UPenn

Approach: Use Ricci flow and Ricci curvature as a means to shape information
flow in networks using greedy routing
Payoff: Dynamically shape network traffic to maximize information flow, decrease
the dimensionality of the routing problem, and minimize the possibility of network
instability and information loss

3d-2d Deformation With

Discrete Ricci Flow
Target Curvature

Target curvature Current curvature

Deformation
Geometric Representation Maximizes Information Can Target Deformation
Using Discrete
Flow For Routing To Preserve Scaling Properties
Of Network Ricci Flow
Process Across Information Scales
(New Greedy Routing
Strategy)

Creates Possible
Instability/Poor
Arbitrary
Information Flow
Deformation

52
 Ergodic vs. Nonergodic Coding
PI: Aaron Wagner Institution: Cornell University

Approach: Advanced network coding method that uses estimation theory

together with ergodic/nonergodic model to determine best network
combination coding approach

Payoff: Significant in reducing network bandwidth of transferred data over

lossless Slepian Wolfe network coding

53