An integrated call admission and buffer management scheme for LAN interconnection over a shared-memory ATM switch
We consider the problem of interconnecting low speed LANs over a high-speed shared-memory ATM switch. A bottleneck is formed when more than one source originate traffic to the same destination LAN. In this case, a congestion may be created at the output gateway (destination LAN interface) and the re...
Saved in:
Published in: | Computer communications Vol. 21; no. 8; pp. 697 - 714 |
---|---|
Main Authors: | , , |
Format: | Journal Article |
Language: | English |
Published: |
Elsevier B.V
25-06-1998
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | We consider the problem of interconnecting low speed LANs over a high-speed shared-memory ATM switch. A bottleneck is formed when more than one source originate traffic to the same destination LAN. In this case, a congestion may be created at the output gateway (destination LAN interface) and the required services are interrupted. In this paper we propose a new integrated scheme for call admission (CAC) and buffer management. The objective of the scheme is to prevent the congestion at the destination LANs, as well as within the ATM switch, while minimizing connection rejection rates (maximizing the utilization of the ATM switch). The scheme uses two types of parameters: first, the connection parameters which are estimated at the network interface unit and specified during connection set-up, and second, the actual traffic characteristics and buffer requirements. Therefore, the proposed scheme combines both parameter-based and measurement-based approaches to the problems of call admission and congestion control. The proposed scheme is shown not to require intensive computations and can be implemented in real time in a high-speed ATM switch. A simulation model for the system is developed from which the performance of our integrated CAC and buffer management scheme is evaluated. It is shown that the application of our CAC criteria maintains cell/packet dropping to within the same order of magnitude. It is also shown that using virtual buffer allocation, in conjunction with our CAC criteria, results in almost no cell/packet dropping. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 0140-3664 1873-703X |
DOI: | 10.1016/S0140-3664(98)00151-0 |