Manivasakan Rathinam

We address the problem of the performance analysis of the stochastic fair sharing (SFS) algorithm for fair link sharing. The SFS scheme has been proposed to carry out a fair link sharing and fair sharing among virtual private networks. Depending upon the current utilization and provisioned capacities of the classes, the SFS admission control algorithm decides which sessions to accept and which to reject. In this letter, we undertake the performance evaluation of the SFS scheme analytically. We explore the tradeoff between fairness and the blocking probability by varying the trunk reservation parameter. The results show that the analytical performance measure agrees well with the simulation results.

The design of the medium-access control (MAC) protocol is the most crucial aspect for high-speed and high-performance local and metropolitan area networks, since the decisions made at this level determine the major functional characteristics of these networks. Most of the MAC protocols proposed in the literature are not suitable for multimedia applications, since they have been designed with one generic traffic type in mind. As a result, they perform quite well for the traffic types they have been designed for, but poorly for other traffic streams with different characteristics. In this paper, we propose an integrated MAC protocol called the Multimedia-MAC (M-MAC), which integrates different MAC protocols into a hybrid protocol in a shared-medium network to efficiently accommodate various types of multimedia traffic streams with different characteristics and quality-of-service demands, namely, a constant-bit-rate traffic, bursty traffic (say, variable-bit-rate traffic), and emergency messages (say, control messages). We have developed a mathematical framework for the analysis and performance evaluation of our M-MAC protocol, which involves a queueing system with vacation. We have applied our M-MAC design approach to a wavelength-division multiplexing network, and evaluated its performance under various traffic conditions. © 2006 IEEE.

Parallel scheduling algorithms are used extensively in the high-speed switches today. In order to benchmark the performance of various scheduling algorithms, it is of paramount importance to evaluate the performance under a traffic model that is more realistic. It makes more sense to study the performance of various scheduling algorithms under the correlated traffic, in the special context to the discovery of the highly correlated or self-similar nature or Long Range Dependence (LRD) of the Ethernet traffic. In this paper, a simple, linear discrete time model for the arrival of packets at the input of the high-speed switch is assumed. In sequel, a comparative study of the performance of various parallel-scheduling algorithms is undertaken.