Task-Graph Reductions based Performance Analysis of a 3-Way Handshake Connection Setup Protocol for Dynamic Optical Networks

摘要

Recently a 3-way handshake signalling (3WHS) protocol has been proposed in the literature for fast connection set up in dynamic optical networks. Upon arrival of a connection request, the protocol - unlike the generalized multiprotocol label switching (GMPLS) mechanisms for connection setup - simultaneously probes resources on different paths, and therefore, it provides the network with real-time information for fast resource allocation. This capability renders the 3WHS protocol faster than GMPLS. To further study the properties of this protocol, in this paper we use an analytical performance evaluation model which represents the protocol as a reducible task-graph. By using as input the probability density functions (PDF) of the individual task processing times of the protocol, the model calculates the PDF of the protocol latency. From this PDF, the statistical values of the performance evaluation metrics can be calculated, e.g. the mean connection setup delay. Simulation results show that the approach is suitable for the validation of the protocol performance.