When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LA... more When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LANs, a congestion control scheme is required to protect destination LANs from the risk of congestion that might be created when multiple users attempt to simultaneously communicate with the same LAN. In this paper, we present a novel congestion-control scheme in which the rate-based and bandwidth advertisement approaches inter-operate to efficiently manage and protect destination resources. In this scheme, each destination LAN is connected to source LANs through a tree-based virtual path (VP) layout that is rooted at the destination and has the source LANs as leaves. Under the rate-based framework, fractions (quotas) of the destination bandwidth are periodically computed on a hop-by-hop basis for each VP. Quotas are based on the estimated average load on each VP link. At source LANs, these quotas are used to regulate the instantaneous transmission rate into the ATM network. The bandwidth advertisement framework on the other hand works end-to-end. It uses the destination LAN buffer to regulate quota migration from low activity LANs to the high activity ones depending on the total buffer occupancy, as well as the individual buffer occupancy per source LAN at the destination. The scheme uses simple calculations, which makes it suitable for real time implementation. The performance of the scheme is evaluated through computer simulation under several network parameters and traffic patterns. Results show that a near zero packet loss probability at the destination is achieved while attaining high resource utilization. The results also demonstrate the fairness of the proposed scheme.
We consider the problem of interconnecting low speed LANs over a high-speed shared-memory ATM swi... more 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. ᭧ 1998 Elsevier Science B.V.
On the use of call admission control and buffer management for congestion control in LAN interconnection over ATM switches
We consider the problem of interconnecting low speed LANs over a high-speed ATM switch. A bottlen... more We consider the problem of interconnecting low speed LANs over a high-speed ATM switch. A bottleneck is formed when more than one source originate traffic to the same destination LAN. In this case, 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 control (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. The proposed scheme is shown not 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 a 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
In this paper, we propose an available bit rate (ABR) algorithm which can work with multipoint-to... more In this paper, we propose an available bit rate (ABR) algorithm which can work with multipoint-to-point (mpt-to-pt) as well as with point-to-point (pt-to-pt) connections. The algorithm is an extension to the MCR-weighted max±min algorithm [Y. Hou, H. Tzeng, S. Panwar, IEEE GLOBCOM, 1997, pp. 492±497], which allocates rates to users in proportion to their MCR requirements. This paper shows how source-level information can be compensated for in order to achieve a performance comparable to that of the pt-to-pt algorithm. This is achieved by combining the current cell rate (CCR) and minimum cell rate (MCR) values of all merged connections hierarchically at each merging point and inserting the aggregate values in the outgoing FRM cells. However, we propose to combine the bottlenecked information only in order to avoid mixing the rates of bottlenecked and non-bottlenecked sources. The same switch algorithm used for the pt-to-pt case can therefore still run on the VC level. A simulation study is conducted under dierent network con®gurations. Results show that the algorithm produces an oscillation-free allocation vector with almost the same convergence time of the pt-to-pt algorithm. The results also indicate that the additional buer requirements due to packet level service is minimal. Ó
We consider the problem of interconnecting low speed LANs over a high-speed shared-memory ATM swi... more 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.
When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LA... more When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LANs, a congestion control scheme is required to protect destination LANs from the risk of congestion that might be created when multiple users attempt to simultaneously communicate with the same LAN. In this paper, we present a novel congestion-control scheme in which the rate-based and bandwidth advertisement approaches inter-operate to efficiently manage and protect destination resources. In this scheme, each destination LAN is connected to source LANs through a tree-based virtual path (VP) layout that is rooted at the destination and has the source LANs as leaves. Under the rate-based framework, fractions (quotas) of the destination bandwidth are periodically computed on a hop-by-hop basis for each VP. Quotas are based on the estimated average load on each VP link. At source LANs, these quotas are used to regulate the instantaneous transmission rate into the ATM network. The bandwidth advertisement framework on the other hand works end-to-end. It uses the destination LAN buffer to regulate quota migration from low activity LANs to the high activity ones depending on the total buffer occupancy, as well as the individual buffer occupancy per source LAN at the destination. The scheme uses simple calculations, which makes it suitable for real time implementation. The performance of the scheme is evaluated through computer simulation under several network parameters and traffic patterns. Results show that a near zero packet loss probability at the destination is achieved while attaining high resource utilization. The results also demonstrate the fairness of the proposed scheme.
When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LA... more When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LANs, a congestion control scheme is required to protect destination LANs from the risk of congestion that might be created when multiple users attempt to simultaneously communicate with the same LAN. In this paper, we present a novel congestion-control scheme in which the rate-based and bandwidth advertisement approaches inter-operate to efficiently manage and protect destination resources. In this scheme, each destination LAN is connected to source LANs through a tree-based virtual path (VP) layout that is rooted at the destination and has the source LANs as leaves. Under the rate-based framework, fractions (quotas) of the destination bandwidth are periodically computed on a hop-by-hop basis for each VP. Quotas are based on the estimated average load on each VP link. At source LANs, these quotas are used to regulate the instantaneous transmission rate into the ATM network. The bandwidth advertisement framework on the other hand works end-to-end. It uses the destination LAN buffer to regulate quota migration from low activity LANs to the high activity ones depending on the total buffer occupancy, as well as the individual buffer occupancy per source LAN at the destination. The scheme uses simple calculations, which makes it suitable for real time implementation. The performance of the scheme is evaluated through computer simulation under several network parameters and traffic patterns. Results show that a near zero packet loss probability at the destination is achieved while attaining high resource utilization. The results also demonstrate the fairness of the proposed scheme.
We consider the problem of interconnecting low speed LANs over a high-speed shared-memory ATM swi... more 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. ᭧ 1998 Elsevier Science B.V.
On the use of call admission control and buffer management for congestion control in LAN interconnection over ATM switches
We consider the problem of interconnecting low speed LANs over a high-speed ATM switch. A bottlen... more We consider the problem of interconnecting low speed LANs over a high-speed ATM switch. A bottleneck is formed when more than one source originate traffic to the same destination LAN. In this case, 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 control (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. The proposed scheme is shown not 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 a 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
In this paper, we propose an available bit rate (ABR) algorithm which can work with multipoint-to... more In this paper, we propose an available bit rate (ABR) algorithm which can work with multipoint-to-point (mpt-to-pt) as well as with point-to-point (pt-to-pt) connections. The algorithm is an extension to the MCR-weighted max±min algorithm [Y. Hou, H. Tzeng, S. Panwar, IEEE GLOBCOM, 1997, pp. 492±497], which allocates rates to users in proportion to their MCR requirements. This paper shows how source-level information can be compensated for in order to achieve a performance comparable to that of the pt-to-pt algorithm. This is achieved by combining the current cell rate (CCR) and minimum cell rate (MCR) values of all merged connections hierarchically at each merging point and inserting the aggregate values in the outgoing FRM cells. However, we propose to combine the bottlenecked information only in order to avoid mixing the rates of bottlenecked and non-bottlenecked sources. The same switch algorithm used for the pt-to-pt case can therefore still run on the VC level. A simulation study is conducted under dierent network con®gurations. Results show that the algorithm produces an oscillation-free allocation vector with almost the same convergence time of the pt-to-pt algorithm. The results also indicate that the additional buer requirements due to packet level service is minimal. Ó
We consider the problem of interconnecting low speed LANs over a high-speed shared-memory ATM swi... more 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.
When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LA... more When an ATM network is used as a backbone interconnection medium for a set of legacy low-speed LANs, a congestion control scheme is required to protect destination LANs from the risk of congestion that might be created when multiple users attempt to simultaneously communicate with the same LAN. In this paper, we present a novel congestion-control scheme in which the rate-based and bandwidth advertisement approaches inter-operate to efficiently manage and protect destination resources. In this scheme, each destination LAN is connected to source LANs through a tree-based virtual path (VP) layout that is rooted at the destination and has the source LANs as leaves. Under the rate-based framework, fractions (quotas) of the destination bandwidth are periodically computed on a hop-by-hop basis for each VP. Quotas are based on the estimated average load on each VP link. At source LANs, these quotas are used to regulate the instantaneous transmission rate into the ATM network. The bandwidth advertisement framework on the other hand works end-to-end. It uses the destination LAN buffer to regulate quota migration from low activity LANs to the high activity ones depending on the total buffer occupancy, as well as the individual buffer occupancy per source LAN at the destination. The scheme uses simple calculations, which makes it suitable for real time implementation. The performance of the scheme is evaluated through computer simulation under several network parameters and traffic patterns. Results show that a near zero packet loss probability at the destination is achieved while attaining high resource utilization. The results also demonstrate the fairness of the proposed scheme.
Uploads
Papers by shatha habra