|
|
|
| Performance Analysis of Softswitch Based on Non-preemptive Priority Message Queuing System |
| Shuang Kai; Yang Fang-chun |
| State Key Laboratory of Networking & Switching Technology Beijing University of Posts and Telecommunications, Beijing 100876, China |
|
|
|
|
Abstract One M/G/1/n queuing network model based on non-preemptive multi-priority messages is proposed for the performance analysis of softswitch entity, which contained multiple processes sharing the same CPU resources. In this model, processing time of messages is drawn from uniform distribution but not exponential distribution and messages exceeding the queue length threshold are discarded orderly according to their priorities. A formula for the mean time of message processing is derived. Academic analysis and simulation results validate that M/G/1/n model with multi-priority messages has larger throughput and higher effective CPU payload than M/G/1/n model with non-priority messages, but has a little longer message processing procedure. Simulation results also indicate that message buffer has a considerable influence on the performance of queuing system.
|
|
Received: 16 January 2006
|
|
|
|
|
|
|
|
|
2007, Vol. 29 
