A Cost Model Analysis of a Secure Key Distribution Centre

In this paper we evaluate a cost function of a secure key distribution centre. A queueing network model has been established for this protocol. Due to the complex calculation of original equations with large scale system, more efficient asymptotic bounds approach have been introduced to implement a hybrid solution which has the advantage of efficiency and accuracy. Based on the cost function, three questions have been proposed; how many clients can a given KDC configure support? how much service capacity must we provide at a KDC to satisfy a given number of clients? and what is the maximum rate at which keys can be refreshed before the KDC performance begins to degrade in a given demand on a given system? Answers of these three questions are illustrated through numerical examples.