SERICA _ω. an extension of the SERICA algorithm

  • Authors:
  • G. I. Mousadis;T. A. Tsiligirides;M. P. Bekakos

  • Affiliations:
  • Informatics Laboratory, General Sciences Department, Agricultural University of Athens, Athens 11855, Greece;Informatics Laboratory, General Sciences Department, Agricultural University of Athens, Athens 11855, Greece;Laboratory of Digital Systems, Department of Electrical and Computer Engineering, School of Engineering, Democritus University of Thrace, Xanthi 67100, Greece

  • Venue:
  • Neural, Parallel & Scientific Computations
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work extends a recently developed scheme, namely the Simple Explicit Rate Identification with Congestion Avoidance (SERICA) algorithm, which regulates the ABR traffic flow in an ATM network. The new scheme (SERICA_ω), like SERICA, takes into account the load and the queue length per VC, calculates the first approximation of the ER field of the BRM cell and then it informs the switch accordingly. Because of the low buffer availability, the network administrator may not be able to initialize a new session and hence to add a new user. A solution to this problem is given by means of deriving a new control function family for the SERICA_ω algorithm. This function has the property to decrease the available queue length of the switch at about O(q1/ω), where q is the average queue length of the SERICA_1, i.e., the basic SERICA. The above model is simulated using different values of ω, in order to provide a guaranteed ABR service with limited buffer availability (queue length). Finally, a mathematical analysis is provided to demonstrate that the solution path approaches an asymptotically stable equilibrium point. Using different values of ω, different equilibria are obtained and therefore the one with the lowest queue length is selected.