Diapositiva 1 - Polytechnique
Download
Report
Transcript Diapositiva 1 - Polytechnique
44th Hawaii International Conference on System Sciences
IEEE HICSS’44
Koloa – Kauai, HI (United States), January 4 – 7, 2011
MPR + SP
Towards a Unified MPR-based
MANET Extension for OSPF
Juan Antonio Cordero
Thomas Clausen
Emmanuel Baccelli
Équipe Hipercom, INRIA Saclay (France)
1
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
Agenda
Introduction
Background
MPR and SP Techniques
The MPR + SP Extension for OSPF MANET
Evaluation
2
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
Routing in heterogeneous networks
Introduction
Heterogeneous networks
(M)ANET components
Internet-infrastructure components
Extension of Internet routing protocols
Open Shortest Path First (OSPF)
Topology Selection
Link-state
Flooding
Adjacency
Link-state synchronization
Routing principles
Control Traffic
Adjacencies
Data Traffic
Adjacencies
Shortest paths
3
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
OSPF MANET
Background
IETF MANET Extensions
RFC 5449
RFC 5820
RFC 5614
MPR-OSPF
OR/SP
OSPF-MDR
(Multi-Point Relays)
(Overlapping Relays
& Smart Peering)
MANET Designated
Routers
MPR flooding
Multi-Point Relays
Smart Peering
Flat MPR-based approaches
4
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
MPR and SP Techniques
Multi-Point Relays – MPR
Rule: Every 2-hop neighbor must be reachable
through (at least) one multi-point relay
Use of local information
(2-hop neighborhood)
Efficient flooding
# MPRs # bidirectional neighbors
The set of MPR links is a quasi-connected*
subgraph
MPRs from every router network-wide
MPR flooding
shortest paths
multi-point relay
5
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
MPR and SP Techniques
Smart Peering – SP
Rule: Become adjacent to neighbors not
reachable through adjacent links
New 2-way
neighbor
Synchronization (adjacency) rule
Use of global information
Reachable
through Shortest
Path Tree?
Connected subgraph
Unstable links are less likely to be selected
as Smart Peering links
Significant reduction of the size of the
adjacent set
Adjacent
Non-Adjacent
Does not include shortest paths in general
6
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
MPR + SP
Our Proposal
Combine the use of Multi-Point Relays and Smart Peering
techniques in a new OSPF MANET routing extension
Shortest paths for data traffic
Efficient flooding
Reduce set of adjacencies
…revise the
concept of
adjacency
Minimize control traffic overhead
7
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
MPR + SP
Architecture and Traffic Model
Flooding Optimization
Multi-Point Relays
over bidirectional links
Adjacency Selection
Smart Peering
Topology Selection
MPR Topology Reduction &
Smart Peering links
Control Traffic
Data Traffic
MPRs (not necessarily adjacent)
Shortest paths (not necessarily adjacent)
8
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
Evaluation
Routing Quality and Control Traffic Overhead
9
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS 44
Conclusions
Heterogeneous networks
(ad hoc + infrastr. components)
Extended Internet routing protocols
OSPF
Combination of existing techniques from OSPF MANET MPR + SP
MPR enables shortest paths and efficient flooding
SP minimizes the adjacent set
OSPF notion of adjacency is not adapted to MANET operation
Consider separately each link-state operation
10
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Questions ?
E-mail: [email protected]
11
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Backup Slides
12
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Configuration of MPR – OSPF and OR / SP
RFC 5449
MPR-OSPF
RFC 5820
OR/SP
Flooding Optimization
MPR flooding
over bidirectional links
MPR flooding
over Smart Peering links
Adjacency Selection
Multi-Point Relays
Smart Peering
Topology Selection
MPR Topology
Reduction
Control Traffic
Adjacencies
Adjacencies
Adjacencies
Data Traffic
Adjacencies
Shortest paths
Adjacencies
Shortest paths
Adjacencies
Shortest paths
Smart
Peering
SP + other
bidirectional
13
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Routing Quality and Control Traffic
14
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Routing Quality (with 95% confidence intervals)
15
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Control Traffic (with 95% confidence intervals)
16
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Adjacencies (with 95% confidence intervals)
17
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Impact of Hello packet size in adjacency lifetime
Longer Hellos
More Hello loss probability
More neighbor breakups
Less adjacency lifetime
18
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Other References
Comparison between OSPF MANET Extensions
E. Baccelli, J. A. Cordero, P. Jacquet:
Multi-Hop Relaying Techniques with OSPF on Ad Hoc Networks.
4th IEEE International Conference on Sensor Networks and
Communications (ICSNC).
September 2009.
Properties of the MPR algorithm for Topology Selection
J. A. Cordero:
MPR-based Pruning Techniques for Shortest Path Tree Computation.
18th IEEE International Conference on Software Telecommunications and
Computer Networks (ICSNC).
September 2010.
19
MPR+SP: Towards a Unified MPR-based MANET Extension for OSPF
IEEE HICSS’44
Simulation Environment
General Simulation Parameters
20 samples/experiment
Data traffic pattern
Constant Bit Rate UDP flow
Packet size:
1472 bytes
Packet rate:
85 pkts/sec
Scenario
Square grid
Grid size:
Performed Experiments
OSPF Configuration
600x600 m
Node configuration
Radio range: 150 m
MAC protocol: IEEE 802.11b
Node mobility
Random waypoint model
Pause:
40 sec
Speed:
0, 5, 10, 15 m/s
(constant)
Fixed size grid
Standard Parameters
HelloInterval:
DeadInterval:
RxmtInterval:
MinLSInterval:
MinLSArrival:
2 sec
6 sec
5 sec
5 sec
1 sec
RFC 5449
AckInterval:
Adj. persistency:
1,8 sec
Disabled
SLOT-OSPF
AckInterval:
1,8 sec
20