Baras Comin Labs Keynote

Copyright John S. Baras 2010 Copyright John S.
Baras 2010
1
Challenges and Opportunities for
Future Broadband Networks:
From Physical to Services to Social
John S. Baras
Institute for Systems Research
Electrical and Computer Engineering Department
Fischell Bioengineering Department
Applied Mathematics, Statistics and Scientific Computation Program
University of Maryland, USA
LABEX COMIN Kick-off Meeting
June 8, 2011
INRIA Rennes Bretagne Atlantic
Maryland Hybrid Networks
Center (HyNet)
Copyright John S. Baras 2010 Copyright John S. Baras 2010
2
Outline
Broadband Communication Infrastructures and
their Significance
Component-Based Wireless Network Protocol
Design
Dynamic Network Trust
Trusted Routing
Cross Layer and Compositional Security
Constrained Coalitional Games
An Integrated Model and Foundational
Problems
3
AT&T; Cisco Visual Networking Index:
Approaching the ZettaByte Era
Copyright John S. Baras 2010
Shaping Society and Civilization
Social significance of broadband access impact
on civilized societies:
Digital divide
Information - knowledge society
Health care
Education
Economic development
Environment and habitats
4
5
Next Generation Data Centers
1000x gain in performance
Exascale: Dramatically more
efficient data centers designed
across components,
interconnects, power & cooling,
virtualization, management, and
software delivery
Photonics: Replace copper
with light to transmit data
Sustainable Data Center
Reduce data center costs on the bottom line and the environment
Reduce total cost of operation
of a data center by 50% and
carbon footprint by 75%, while
meeting Quality of Service goals
Real-time management of
data center environment
Real-time management of
service application instances
Data center modeling, synthesis
and optimization
6
OpenFlow OpenNet
Programmable networks
Open, flexible, wired and wireless
network platform to enable rapid
introduction of new functionality
End-to-end quality of service,
reliability, security, mobility
and management
Scalable and energy-efficient
data center networks
7
Green Communications:
Some Statistics & Facts
2 % of global energy consumption
To rise to 10 % by 2020
Energy was never an issue in design & operation
Green: source & expenditure
Modes of consumption: transmission, processing,
on-status
Hot spots: data centers, base stations
Our focus
Internet Wireless
8
Saving Margins
Elementary computation task: C-bit
Current technology: ~ 10
-8
10
-9
Joules/C-bit
Potential bound: 10
-21
10
-23
Joules/C-bit
(from thermodynamics)
Quantum-limit: zero!
(Reversible computation) (At infinite delay cost)
Can run networks worldwide 10,000 more energy efficiently--set target at 1,000
Means: run them for three years with the same energy it takes today for a day!
9
Broadband Wireless :
A glimpse into the future
LTE, WiMax technologies and beyond: multiple MBps
to the mobile user
Increasing to pervasive appearance of
infrastructureless networks
Self-configurable networks
Self-monitoring
Distributed dynamic content depositories
Distributed security
New technologies and materials for miniaturization
10
Broadband Wireless:
Shaping Societies and Civilization
11
While the last 50 years have been dominated by a march to ever
more complex computers, the next few decades will see the rise
of simple sensors -- by the billions. Business Week
Wireless Sensor Networks (WSN)
Sensor and Sensor networks are becoming ubiquitous
Embed numerous distributed devices to monitor and
interact with physical world
Exploit spatially and temporally dense, in situ, sensing
and actuation
Network these devices so that they coordinate to
perform higher-level identification and tasks.
Distributed & large-scale like the Internet - but, physical
instead of virtual, resource constrained, and with real-
time constraints
12
13
Energy Efficient
and Intelligent Buildings
Digital
Video surveillance Access control
Intrusion
detection
Fire alarm
Alarms management
Energy /
Inventory .
Management
The Global Health Care Crisis
The current system is unsustainable
Many economic, social, medical reports support this
conclusion
NAE-NIM Report (2005): Engineering and
technology can help
IVA workshop (2007): Technology, Economics and
Healthcare
IT can play a role towards the desired goal:
High quality healthcare for all at low cost
Patient participation a must
Preventive medicine a must
14
Health IT and Wireless Networks
and Devices
HEALTH IT Components
Broadband Hybrid Communication Networks
with widely available access
Universal patient records and dissemination
Universal logistics support (insurance,
databases, accounting, case management)
Web-based services
Mini-clinics and inexpensive tests and consultations
Social, behavioral aspects
Hospital information and management systems
Multimedia systems, robotics, tele-surgery, new operating rooms
Health care management systems
Security, trust, authentication and privacy
15
I would like more Systems Engineering principles for Health Care
Harvey V. Fineberg, President of the Institute of Medicine
Innovation in Medical Technology, Whiting-Turner Lecture 04/21/09
Forthcoming
16
Forthcoming
Cell-phone Microscopy
17
Convergence = New Home
Health Platform
Digital home entertainment infrastructure can be used
for health
Everyday health through everyday devices
Personalized, proactive health info/reminders/agents
INTEL
18
Broadband Wireless
Benefits to Society
Health Care
Much higher quality health care at lower cost and
much wider availability
Essential for preventive maintenance based
healthcare
Essential for health care in rural and underdeveloped
areas (almost 95% of the current earths population
and locations)
Patient education and awareness
Physician, nurse and hospital training
19
20
Outline
their Significance
Design
Trusted Routing
Problems
Most Promising Technologies
Cross-layer optimization
Key challenge: automated ways to dynamically coordinate layers for best
QoS
Dynamic network topologies, exploiting radio capabilities and environment
information
Multiple networks optimized for different loads (stream, data, broadcast,
unicast, etc.)
Adaptive MAC (spectrum, MIMO, beamforming)
New physical layer concepts and designs interference mitigation
Each node has multiple networks available
Key challenge: automated ways to dynamically connect to networks for
best QoS
Multiple routes (robustness and availability)
Dynamic spectrum based on probing feedback
Diversity in frequency
21
DYNAMIC INTERCONNECTION AND
INTEROPERABILITY
Broadband wireless networks capable for
multiple dynamic interface points
Any node can serve as
interface/gateway
Fixed or
hybrid
broadband
Key challenge:
component - based
networking
22
COMPONENT- BASED NETWORKING
- How to synthesize resilient, robust, adaptive network protocols?
Component-Based Networking (CBN)
- Components: modularity, cost reduction, re - usability,
adaptability to goals, new technology insertion, validation and
verification
- Interfaces: richer functionality intelligent/cognitive networks
- Theory and Practice of Component-Based Networking
Heterogeneous components and compositionality
Performance of components and of their compositions
Back and forth from performance - optimization domain to correctness
and timing analysis domain and have composition theory preserving
component properties as you try to satisfy specs in both domains
23
COMPONENT-BASED NETWORKING
Executable
Models
Performance
Models
Formal
Models
Each Block has
Components
24
MODEL-BASED DESIGN TOOL
Inputs, components, design parameters, sensitivity analysis, optimization
.
25
6/8/2011
MAC AND ROUTING COMPONENTS
Routing Components routing protocols like OLSR [Baras08]
Neighbor Discovery Component (NDC)
Selector of Topology Information to Disseminate Component (STIDC)
Topology dissemination Component (TDC)
Route Selection Component (RSC)
MAC Components based on CSMA-CA MAC protocols like IEEE
802.11 [Baras08], and on schedules based MAC (USAP) [Baras09]
Scheduler
MAC
Objective
Design MANET adaptable to missions with predictable performance
Approach
Break traditional layers to components! Develop component-based
models MANET that considers cross-layer dependency to improve the
performance
Study the effect of each component on the overall MANET performance
26
STIDC Benefits and Approach
STIDC selects a subset of links to be broadcasted
STIDC is a local pruning method for link selection
STIDC reduces the broadcast stormproblem of TDC
OLSR uses set cover methods for MPR selection
There are metrics that capture the stability of the MANET links
Stable Path Topology Control (SPTC) that accounts for stability
metrics in link selection
27
h
Traditional Link-State Routing
Neighbor Discovery
Component (NDC)
Topology Dissemination
Component (TDC)
h
28
h
h
Compressed Link-State Routing
Topology Control
Neighbor Discovery
Component (NDC)
Topology Dissemination
Component (TDC)
Selector of Topology
Information to
Disseminate (STIDC)
h
29
Local View and Global View
- local view is a subgraph of G
induced by the k-hop neighbors of k,
excluding the arcs of the strict k-hop
neighbors.
G
h
local
G
h
global
= G
h
local
G
broadcast
Every host vertex h broadcasts
a selective subset of the out-
arcs. This forms a broadcast
graph
.
G
broadcast
j
3
j
2
j
6
j
4
j
5
j
10
j
9
j
12
j
11
j
8
j
7
j
13
j
14
j
15
j
16
j
17
j
18
j
19
j
20
j
21
j
23
j
24
j
22
j
1
h
30
Global view
Topology Control for QoS
Rule-Based Routing
Does preserve the QoS optimal
paths for routing from h to every
destination?
G
h
global
31
- local view is a subgraph of G
induced by the k-hop neighbors of k,
excluding the arcs of the strict k-hop
neighbors.
G
h
local
G
h
global
= G
h
local
G
broadcast
Every host vertex h broadcasts
a selective subset of the out-
arcs. This forms a broadcast
graph
.
G
broadcast
j
3
j
2
j
6
j
4
j
5
j
10
j
9
j
12
j
11
j
8
j
7
j
13
j
14
j
15
j
16
j
17
j
18
j
19
j
20
j
21
j
23
j
24
j
22
j
1
h
Global view
ETX Link Stability Metric
df forward delivery ratio
dr reverse delivery ratio
32
u v
df
dr
ETX(u, v) =
1
df dr
OLSR-ETX
OLSR-ETX uses the ETX metric to select the
pruned edge set, .
33
O
h
pruned
The best ETX metric for a two hop neighbor j
min
i ecN
h
1
ETX(h,i) + ETX(i, j)
OLSR-ETX
o chooses a minimal subset of one-hop neighbors
o such that all two-hop neighbors are reachable by their
best ETX metric path
Note: best ETX path is of the form (h,i,j), i is a one-hop neighbor!
QoS (Path Stability) Preserving
Topology Control
x
ij
G
= min
peP
ij
G
w
p
o The optimal path stability is
o Path stability metric of a path p in G is the additive
composition of its link stability metrics, :
a
uv
= ETX(u, v)
w
p
= a
uv
(u, v)ep
34
o Does OLSR-ETX pruning preserve the optimally stable
path?
3 Platoon Mobility Scenario
35
OLSR-ETX SPTC-ETX
Saturation
CL
~ 2 Mbps ~ 2 Mbps
TC message
rate
923 kbps 890 kbps
Long connection from 20 to 0 (platoon
heads)
Type Connection Offered-load
Intra-
platoon
(1,3),(2,9),(4,6),(7,5),(20,
29),
(14,17),(16,11),(17,18),(1
9,12),
(21,22),(23,27),(23,28)
12 kpbs
Inter-
platoon
(1,18)
(20,11),(20,0)
(10,1),(21,10)
2.4 kbps
6 kbps
12 kbps
36
Outline
their Significance
Design
Trusted Routing
Problems
Distributed Trust Management in Wireless
Autonomic Networks
Distributed trust in autonomic networks
Trust document distribution
Trust (and Mistrust) spreading and dynamics
Effects of topology on convergence (small world graphs)
Trust as incentive for collaboration link with economic,
social and biological network analysis
Trust evaluation: direct and indirect ways; reputations,
profiles
Trust, reputation, recommender systems in web-based
social networks and services
37
Trust Credential Distribution
No centralized trusted party
Trust credentials are scattered in the network
Problems:
Where and how to find all needed credentials?
Where and how to store credentials so that the searching is efficient?
A
B
38
Related Work
The problem of trust credential distribution shares many
characteristics with P2P file sharing systems
Freenet based credential distribution scheme [Eschenauer,
Gligor and Baras, 2002]
Network coding based file sharing has been shown to be
efficient and based on local information only [Gkantsidis and
Rodriguez, 2005]
A B
G
F
E
D C
A sends out
request for
certificates of R
G has certificate
G --> R
E has certificate
H --> R
1
7
2
4
3
5
6
Request
Reply w ith certif icate
Reply f or no certif cate
Uses hashed keyword
routing, instead of flooding
Replication of credential
where needed via caching
39
Network Coding Based Scheme
Main idea:
Each user only communicates with a small subset of users
(neighbors)
A user frequently checks with its neighbors for new credentials
Whenever a user forwards trust credentials, it produces a linear
combination of all the credentials it currently stores and the
combined documents it has received from its neighbors
For m distinct documents, a user can recover them after receiving
m combined documents for which the coefficient vectors are
linearly independent
Advantage:
Only local interactions -- all operations are decentralized
No request-response procedure
40
Operation Diagram
Coefficient vector
transmitted to user D
combDoc2
User C
Cred4
Cred
1
Cred2
User A
User B
combDoc1
a
1
a
2
combDoc3
User D
b
1
b
2
a
1
a
2
= - + -
1 2 3 1 1 2 2
[ , , ] [ ' , ' ,0] [0,0,1] c c c b a a b
41
Effectiveness
Key question: how effective the credential distribution
scheme is?
50 credentials in the
network
Results: 60 combined
documents are
enough to recover all
50 credentials
42
Simulation
Compare network coding based scheme and Freenet-based
scheme
Time to finish document distribution
Number of users who obtained documents
needed vs simulation time
Network coding based
scheme is more efficient in
distributing credentials,
i.e., smaller finish time
43
Trust evaluation, trust and mistrust dynamics
Spin glasses (from statistical physics), phase transitions
Indirect trust; reputations, profiles; Trust computation via linear
iterations in ordered semirings
Direct trust: Iterated pairwise games on graphs with players of many
types
( )
( 1) , ( ) |
i ji j i
s k f J s k j N + = e
2 3 1
a b
b
a
2007 IEEE Leonard Abraham Prize
New Book , 2010, Path Problems
in Networks
44
45
Outline
their Significance
Design
Trusted Routing
Problems
Two objectives for routing Two classical
problems
Delay shortest path problem (min,+)
Dual Trust spanning tree problem (min,max)
min
peP
ij
f
1
( p) = min
peP
ij
d(u, v)
(u,v)ep
min
peP
ij
f
2
( p) = min
peP
ij
max
(u,v)ep
t(u, v)
Pareto Optimal
Trusted Routing
46
min
Pareto
peP
ij
d(u, v)
(u, v)ep
max
(u, v)ep
t(u, v)
(
(
(
?
min
peP
ij
d(u, v)
(u, v)ep
subject to max
(u, v)ep
t(u, v) s c
min
peP
ij
max
(u, v)ep
t(u, v)
subject to d(u, v)
(u, v)ep
s c
Haimes Method for
Trusted Routing (cont.)
47
Constraint
min
peP
ij
d(u, v)
(u, v)ep
subject to max
(u, v)ep
t(u, v) s c
max
(u, v)ep
t(u, v) s c
(u, v) ep, t(u, v) s c
Edge
Exclusion
Haimes Method for
Trusted Routing (cont.)
48
Haimes Method
Two Stage Recipe
G (V,E)
Source
1. G reduced graph
O(|E|)
2. G
SP
SP on reduced
graph
O(|V|.|E|)
49
Semiring Algebraic Path Problem
Max likelihood
Shortest Path
Widest Path
Most Reliable Path
Shared link attributes
Shared path attributes
Examples of Idempotent
Semirings
( , min, )
.
+
_
( , max, min)
([0,1], max, )
(2
W
, U, I )
(2
W
, I , U)
([0,1], max, )
50
51
Outline
their Significance
Design
Trusted Routing
Problems
Security, Authentication, Trust
Universally Composable Security when possible?
Software components and interfaces -- Design interfaces carefully
and robustly major doors of attacks
Utilize to advantage the physical layer (vastly ignored todate)
Wave form, RF and hardware peculiarities lead to unshakeable
fingerprints
Authenticate the device to the network and then the user to the
device reduces attack risk (fewer times through the net)
Distribute assurance function across software and hardware (increases
difficulty to attacker immensely)
Trusted platform module (TPM) architecture modifications to allow
multiple sources input (including biometrics) open
TPM chip add on to portable devices (TCG, TCN)
Chip authentication
Distributed communal trust monitoring : Know thy neighbors well, but
watch them maintain assured neighborhood information
52
Security, Authentication, Trust (cont.)
Cross-layer trust computation across the network
Distributed, self-checking, trust dynamics, topology effects
Include trust in routing via path metrics
Distributed control around compromised neighborhoods
containment
New distributed hybrid systems methods for IA and trust
evaluation, combine logic and statistics
Combining distributed model checking and theorem proving techniques
Use natural randomness and other signatures for ID-based keying
Design of distributed dynamic recommender and reputation
systems
Using TPM, TCN, to implement specification-based policies and
testing of policies
Trusted platforms in social networks
53
Instead of multiplexing
the authentication
We superimpose it
And write
s the message and t the authentication tag
Current research: Extensions to Multicarrier LTE and WiMAX
Physical Layer Security:
Perturbed Modulation
t
s
54
Experimental Validation
Demonstrated Very Low Power Authentication is Feasible
55
Experimental Results
56
Extension to Multicarrier
LTE and WiMAX
Physical Layer Security:
Trusted Computing
Trusted Platform Module (TPM)
Protects the integrity and confidentiality of data
with hardware support
Performs integrity measurements and reports them,
thus attesting for the software running in the device
Source: TCG Architecture Overview, http://www.trustedcomputinggroup.org
57
58
Outline
their Significance
Design
Trusted Routing
Problems
A Network is
A collection of nodes, agents,
that collaborate to accomplish actions, gains,
that cannot be accomplished with out such

collaboration
Most significant concept for autonomic
networks
59
The Fundamental Trade-off
The nodes gain from collaborating
But collaboration has costs (e.g. communications)
Trade-off: gain from collaboration vs cost of
collaboration
Vector metrics involved typically
60
- Example 1: Network Formation -- Effects on Topology
- Example 2: Collaborative robotics, communications
- Example 3: Web-based social networks and services

- Example 4: Groups of cancer tumor or virus cells
Gain
Each node potentially offers benefits V per time unit to
other nodes: e.g. V is the number of bits per time unit.
Potential benefit V is reduced during transmissions due to
transmission failures and delay
Jackson-Wolingsky connections model, gain of node i
r
ij
is # of hops in the shortest path between i and j
is the communication depreciation rate
o

e
=
1
( )
ij
r
i
j g
w G V
o s s 0 1
= if there is no path between and
ij
r i j
61
Cost
Activating links is costly
Example cost is the energy consumption for sending data
Like wireless propagation model, cost c
ij
of link ij as a
function of link length d
ij
:
P is a parameter depending on the transmission/receiver antenna
gain and the system loss not related to propagation
is path loss exponent -- depends on specific propagation
environment.
o
=
ij ij
c Pd
o
62
Pairwise Game and Convergence
Payoff of node i from the network is defined as
Iterated process
Node pair ij is selected with probability p
ij
If link ij is already in the network, the decision is whether to sever it,
and otherwise the decision is whether to activate the link
The nodes act myopically, activating the link if it makes each at least as
well off and one strictly better off, and deleting the link if it makes
either player better off
End: if after some time, no additional links are formed or severed
With random mutations , the game converges to a unique Pareto
equilibrium (underlying Markov chain states )
= = ( ) gain cost ( ) ( )
i i i
v G w G c G
63
G
Coalition Formation at the
Stable State
The cost depends on the physical locations of nodes
Random network where nodes are placed according to a uniform
Poisson point process on the [0,1] x [0,1] square.
Theorem: The coalition formation at the stable state for n
Given is a
sharp threshold for establishing the
grand coalition ( number of
coalitions = 1).
For , the threshold is
less than
2
0
o
o
| |
= =
|
\ .
ln
,
n
V P
n
0 1 o < s
2
o
| |
|
\ .
ln
.
n
P
n
n = 20
64
Topologies Formed
65
66
Outline
their Significance
Design
Trusted Routing
Problems
Dynamic Integrated Networks:
Humans, Machines, ICT,
Multiple Interacting Multigraphs
Nodes: agents, individuals, groups,
organizations
Directed graphs
Links: ties, relationships
Weights on links : value (strength,
significance) of tie
Weights on nodes : importance of
node (agent)
Value directed graphs with
weighted nodes
Real-life problems: Dynamic,
time varying graphs,
relations, weights
67
Social/Cognitive
Information
Comms
S
ij
w
:
S
i
i w
:
S
j
j w
I
kl
w
:
I
k
k w
:
I
l
l w
C
mn
w
:
C
m
m w
:
C
n
n w
Organizational needs
Network architecture
and operation
68
Network Complexity:
Four Fundamental Challenges
Multiple interacting dynamic multigraphs involved
Collaboration multigraph: who collaborates with whom / when
Communication multigraph: who communicates with whom / when
Effects of connectivity topologies:
Find graph topologies with favorable tradeoff between
performance (benefit) vs cost of collaborative behaviors
Small word graphs achieve such tradeoff; Expander graphs;
Components, Interfaces, Compositional Synthesis
Network protocols component based networking
Compositional Universal Security
Need for different probability models the classical Kolmogorov
model is not correct
Probability models over logics and timed structures
Logic of projections in Hilbert spaces not the Boolean of subsets of a set
baras@umd.edu
301-405-6606
http://www.isr.umd.edu/~baras
69

Baras Comin Labs Keynote

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Baras Comin Labs Keynote

Uploaded by

Copyright:

Available Formats

Copyright John S. Baras 2010 Copyright John S.

that cannot be accomplished with out such

You might also like