(Downloads - 0)
For more info about our services contact : help@bestpfe.com
Table of contents
Introduction
Structure and Overview
I NETWORKING FUNDAMENTALS
1 Computer Networks
1.1 Outline
1.2 Networking and Routing Concepts
1.2.1 Networks and Links
1.2.2 Graph and Hypergraph Representation
1.3 Addresses, Direct and Indirect Communication
1.4 Connecting Networks
1.4.1 IP Addressing and IP Links
1.4.2 Network Reference Models
1.4.3 Routing in the Internet
1.5 Conclusion
2 Wireless Computer Networking
2.1 Outline
2.2 Wireless Communication
2.2.1 Frequency of Wireless Signals
2.2.2 Coverage and Interference in Wireless Interfaces
2.2.3 Wireless Links
2.2.4 Semibroadcast Properties of Wireless Communication
2.3 Wireless Networks under the IP Model
2.3.1 IEEE 802.11
2.4 Conclusion
3 Communication in Ad hoc Networks and Compound ASes
3.1 Outline
3.2 Ad hoc Networks and Compound ASes
3.2.1 Ad hoc Networks and Applications
3.2.2 Compound Autonomous Systems
3.3 Nodes, Links and Addresses in Ad hoc Networks
3.4 Single and Multi-Hop Communication
3.4.1 Neighbor Sensing
3.4.2 Routing in Ad hoc Networks and Compound ASes
3.5 Conclusion
II LINK-STATE ROUTING IN AD HOC NETWORKS
4 Elements of Link State Routing
4.1 Outline
4.2 The Link State Database
4.3 Topology Acquisition
4.3.1 Flooding
4.3.2 LSDB Synchronization
4.4 Issues in Ad hoc Networks and Compound ASes
4.4.1 General Bandwidth Constraints
4.4.2 Flooding over Wireless Interfaces
4.4.3 LSDB Synchronization in Compound ASes
4.5 Conclusion
5 Packet Jittering for Wireless Dissemination
5.1 Outline
5.1.1 Terminology
5.2 The Jitter Mechanism
5.2.1 Common Input and Common Configuration
5.2.2 Wireless Collisions and Jitter in Link-State Routing
5.2.3 Forwarding Flooding Packets with Jitter
5.3 Analytical Model
5.3.1 Traffic Model and Assumptions
5.3.2 Message and Packet Rates
5.3.3 Statistical Description of Traffic to be Forwarded
5.3.4 Time to Transmission for a Received Message
5.3.5 Discussion of Results and Model Limitations
5.4 Simulations
5.5 Conclusion
6 Overlays in Link State Routing
6.1 Outline
6.2 LS Routing in terms of Overlays
6.2.1 Topology Update Flooding
6.2.2 Point-to-point Synchronization
6.2.3 Topology Selection
6.3 Full Network Overlay
6.3.1 Full Network Topology Flooding
6.3.2 Full Network Synchronization
6.3.3 Overall Control Traffic
6.4 Conclusion
7 The Synchronized Link Overlay Triangular – SLOT
7.1 Outline
7.2 Definition, Related Overlays and Variations
7.2.1 Gabriel Graphs and Relative Neighborhood Graphs
7.2.2 The Synchronized Link Overlay and SLOT
7.2.3 SLOT-U and SLOT-D
7.3 Performance Analysis for 2-Dimensional Networks
7.3.1 Overlay Density
7.3.2 Link Stability
7.3.3 Validation
7.4 Performance Analysis for Other Dimensions
7.4.1 1-Dimensional Networks
7.4.2 3-Dimensional Networks
7.5 Selection of Links depending on Distance
7.6 Conclusion
8 Multi-Point Relays – MPR
8.1 Outline
8.2 Definitions and Heuristics
8.2.1 Heuristics
8.2.2 Implications
8.3 MPR as a Flooding Overlay
8.4 MPR as a Synchronized Overlay
8.4.1 Asymptotic Connection and Density
8.4.2 Link Change Rate and Persistency
8.5 MPR as a Topology Selection Rule
8.5.1 Path MPR
8.5.2 Enhanced Path MPR
8.6 Conclusion
9 The Smart Peering Technique – SP
9.1 Outline
9.2 Definition and Specification
9.3 Asymptotic Properties
9.4 Reaction to Mobility
9.5 Conclusion
III APPLICATION TO OSPF
10 LS Routing Protocols within an AS
10.1 Outline
10.2 Open Shortest Path First – OSPF
10.2.1 Architecture and Terminology
10.2.2 Areas, Interfaces and Neighbors
10.2.3 Packet and Message Types
10.2.4 Single-Area OSPF for Non-Broadcast Networks
10.3 Intermediate System to Intermediate System – IS-IS
10.3.1 Architecture and Network Partitioning
10.3.2 Interface Types
10.4 Conclusion
11 OSPF MANET Extensions
11.1 Outline
11.2 IETF Standard Extensions
11.2.1 Multipoint Relays – MPR-OSPF
11.2.2 Overlapping Relays & Smart Peering – OR/SP
11.2.3 MANET Designated Routers – OSPF-MDR
11.3 Improved MPR-based Extensions
11.3.1 Persistency Variations of MPR-OSPF
11.3.2 SLOT over MPR-OSPF – SLOT-OSPF
11.3.3 Multipoint Relays + Smart Peering – MPR+SP
11.4 Conclusion
12 Performance Evaluation of OSPF via MANET Simulations
12.1 Outline
12.2 Synchronization & Optimal Routes in OSPF and MANET Extensions
12.2.1 User Data over Shortest Paths
12.2.2 User Data & Control Traffic over Synchronized Links
12.3 Neighbor Sensing Optimization
12.3.1 Proactive and Reactive Synchronism Recovery
12.3.2 Overhead Impact
12.4 Main Link-State Operations
12.4.1 Flooding
12.4.2 Topology Selection
12.4.3 LSDB Synchronization
12.4.4 Control & Total Traffic
12.5 Persistency Impact on MPR-OSPF
12.5.1 Persistent Adjacencies and Data Routing Quality
12.5.2 Control Traffic Structure
12.6 Conclusion
13 Experiments with OSPF on a Compound Internetwork Testbed
13.1 Outline
13.2 Testbed Description
13.2.1 Interfaces Configuration and Network Topology
13.2.2 OSPF Routing Configuration
13.3 Experiments and Results
13.3.1 Wireless Multi-hop Communication
13.3.2 OSPF Control Traffic Pattern
13.4 Conclusion
Conclusions
Summary of Contributions
Perspectives and Future Work
Final Remarks
Bibliography
