Adaptive Network Layer
Savo Glisic · 2016
Networks can be represented by graphs where mobile nodes are vertices and communication links are edges. Routing protocols often use shortest path algorithms. This chapter first reviews the routing algorithms and then discusses the basic relations in graph theory. The goal of quality of service (QoS) routing is to find a network path from a source node to a destination node. In order to achieve scalable routing, large networks are structured hierarchically by grouping nodes into different domains. Since the network after aggregation is represented by a simpler topology, most aggregation algorithms suffer from distortion, that is, the cost of going through the aggregated network deviates from the original value. The aggregated topology follows the ATM Private Network-Network Interface (PNNI) standard. Finally, the chapter provides a way of representing the aggregated state in delay bandwidth sensitive networks by using line segments.