Intelligent agents for network management

C. Frei
1997 IEE Colloquium on AI for Network Management Systems   unpublished
Introduction In packet-switched networks, routing can be solved e ciently by local algorithms. This is not the case in circuit-switched networks such as ATM, where routing has been shown to be NP-complete ( 4], 6]). Many potential applications such as multimedia transmissions or videoconferences require a quality of service guarantee which can only be given in circuit-switched networks, so this problem is becoming important in practice. A communication network is a set of nodes that are
more » ... es that are interconnected by links to permit the exchange of information. We model it as a network graph (see Figure 1d) . A need to exchange information between two nodes is called a demand. Each demand requires a certain quality of service (QoS) when transferred through the network. The required QoS depends on the type of information to transmit and is constrained using several parameters, such as minimal bandwidth, maximal delay, maximal delay jitter, or maximal cell loss rate. In order to satisfy a demand, we must allocate a route between the two endpoints of the demand satisfying the demand's QoS constraints. A route is a path in the network. Assigning a route to a demand and reserving the resources needed is called establishing a circuit. Given a communication network, the problem is to allocate one route for each incomming demand in the network so that the QoS constraints of all demands are satis ed using the available resources of the network.
doi:10.1049/ic:19970536 fatcat:hart6asdw5dsvj5da6cunl6ytm