{"title":"Performance evaluation of packet discard schemes in ATM switches in heterogeneous traffic environment","authors":"Zhigang Jing, Hairong Sun, LI Lemin","doi":"10.1109/ICATM.1999.786841","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786841","url":null,"abstract":"In this paper, we study the performance of different packet discard schemes in ATM switches in a heterogeneous traffic environment. The throughput, fairness and delay characteristics of different packet discard schemes are studied in the environment of heterogeneous traffic and in the environment of fixed and time-varying available bandwidth. Through performance comparison, we show that the queuing system with EPD (early packet discard) algorithm gives higher goodput to the sources near it, and the sources far away from the system have lower goodput. It is necessary to integrate the RED (random early detection) algorithm with the EPD algorithm and the RED+EPD algorithm can provide relatively fair goodput to heterogeneous traffic. An ATM switch with the RED+EPD algorithm can provide higher throughput, better fairness and smaller delay than the EPD algorithm, so it can support the traffic with delay requirement.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121883768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Digital neural cell scheduler for ATM switching","authors":"S.-M. Lee, Y.-C. Kim, M. Lee","doi":"10.1109/ICATM.1999.786816","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786816","url":null,"abstract":"An input buffer-type ATM switch with a window-based contention algorithm is proposed, modeled in VHDL, for a high-speed cell scheduler for ATM switching. A digital Hopfield neural cell scheduler which has the ability of real-time processing is used to solve loss of throughput due to head-of-line (HOL) and internal blocking when FIFO queueing is employed at the banyan network. In this scheduler, consequently, a tag value which has a destination-cell address is changed into a corresponding binary pattern, modified into a non-internal blocking pattern by preprocessing and optimization, which results in the reduction of the work load of the cell scheduler and smoothing of the priority control of the scheduler. By skipping random input operations and reducing the demand on arithmetic operations by operating on a minimized number of bits in this scheduler, it is found that we can minimize the delay for scheduling and maximise the selection of non-blocking cells leading to high performance. We use a performance metrix, evaluating its performance in an average number of clock cycles needed for scheduling a cell from the queue to the banyan network.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129486835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A hybrid data/header interleaving strategy for wireless ATM networks","authors":"Shiann-Tsong Sheu, Tzu-Fang Sheu","doi":"10.1109/ICATM.1999.786764","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786764","url":null,"abstract":"A header interleaving strategy was proposed to reduce the cell loss probability for wireless ATM networks. Such a strategy spreads each header bit over the entire data field. Lots of burst errors on cells will be transformed into a single-bit error on the header which can be easily corrected by the HEC (header error correction) field. Since each corrected cell may also contain incorrect payload, a data/header interleaving strategy (DIS) was proposed to recognize potentially dirty cells. When congestion occurs, the cell discarding strategy will drop them first to decrease the number of dirty cells received. In this paper, we propose a new hyper-cell interleaving strategy (HIS) which has a lower payload error ratio than that of DIS. The cell error probability of a corrected cell of HIS is analyzed. Simulation results show that the proposed strategy substantially increases the received clean cell ratio.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122437403","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A feasible scheduling algorithm for per-VC queueing ATM switches","authors":"P. Zhou, O. Yang","doi":"10.1109/ICATM.1999.786815","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786815","url":null,"abstract":"This paper introduces a scheduling algorithm for per-VC queueing ATM switches. Our proposed per-VC queueing scheduler (PVQS) achieves a low maximum delay, provides bandwidth guarantee, and fairly allocates excess capacity. The computation in PVQS is carried out on a per-connection basis, not on a per-cell basis which is mandatory in the virtual time-stamp type of approach. This leads to a significant reduction in computational effort and makes PVQS a feasible candidate for practical implementation in per-VC queueing ATM switches.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120947779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Networks performance based connection admission control model in ATM networks: immediate and future reservation approaches","authors":"M. Nour, A. Hafid, M. Gendreau","doi":"10.1109/ICATM.1999.786802","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786802","url":null,"abstract":"Connection admission control (CAC) is defined as the set of actions taken by the network during the call set-up in order to determine whether a virtual channel/virtual path connection request can be accepted or should be rejected (or whether a request for re-allocation can be accommodated). Connection admission control for ATM networks should be based on information that is available locally, or that can be gathered easily from neighbours. We propose a method for implementing CAC for ATM networks, which is based on a distributed dynamic routing procedure, and which uses the network performance parameters that have been gathered at different nodes of the network. These network performance parameters define what different nodes are capable of offering to the connections. The method will find a \"best\" route, if it exists, that is able to meet the quality of service (QoS) constraints imposed by the user. To increase the acceptance calls, a future reservation model is added to the CAC procedure, which will rather than reject a connection, will specify a future time where enough available resources will be available and thus the connection will be accepted.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121119307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A.M. Grilo, P. M. Carvalho, L. M. Medeiros, M. Nunes
{"title":"VTOA/VoIP/ISDN telephony gateway","authors":"A.M. Grilo, P. M. Carvalho, L. M. Medeiros, M. Nunes","doi":"10.1109/ICATM.1999.786807","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786807","url":null,"abstract":"This paper presents the architecture and implementation of a telephony gateway for interworking between ISDN, ATM and IP telephony. In this way, interworking is achieved both within private networks and with the PSTN, address translation being performed according to both the VTOA (ATM interface) and H.323 (IP interface) specifications. The gateway implementation is based on a PC, presenting a cost-effective alternative to the equipment currently available on the market. Moreover, its highly modular software architecture allows new telephony interfaces to be easily added.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129205392","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A comparison between multi-service MAC protocols employing Q-ary contention resolution algorithms including msSTART under a disaster scenario","authors":"F. Cameron, M. Zukerman","doi":"10.1109/ICATM.1999.786767","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786767","url":null,"abstract":"Many modern multi-service medium access protocols (MAC) use a collision-based capacity request signaling channel as part of a hybrid TDMA frame structure. This paper together with Cameron et al. (1999), develops a comparison of simple candidate contention resolution algorithms (CRA) against the performance of more sophisticated algorithms under a disaster scenario. We aim to compare the performance of the multi-slot stack random access algorithm (msSTART) against other more basic examples of Q-ary tree contention resolution algorithms in the wireless environment using the novel basic deadlock model. msSTART is proposed for use in the IEEE 802.14 hybrid fiber/coaxial network and will be highly relevant for the supervisory medium access control (S-MAC) development of evolving wireless asynchronous transfer mode (WATM) and other multi-service wireless MAC specifications. In the paper, approximate results for msSTART performance are obtained by simulation under extreme inter-station correlation to compare with analytical results for the simpler Q-ary blocked tree CRA. Using three signaling channel schemes designed to provide support for increased system stability, implementation of priority in the wireless MAC, or maximize efficiency, we provide comparative results for evaluation of msSTART and the blocked tree under what the IEEE 802.14 working group has termed the 'disaster scenario'. We demonstrate that msSTART is well-suited to the wireless multi-access environment providing equal if not better performance than basic Q-ary algorithms under the disaster scenario as well as standard traffic loads.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125687034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Model-based diagnosis for fault management in ATM networks","authors":"A. Osmani, F. Krief","doi":"10.1109/ICATM.1999.786788","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786788","url":null,"abstract":"ATM networks require powerful management capabilities for configuration, performance, security and particularly fault management. International standard organizations and particularly the ATM Forum and ITU-T organization have proposed several recommendations to manage faults. However, the large size and the high level of complexity of such networks requires new intelligent approaches. This article gives some examples of the existing formalisms and proposes an intelligent approach to build rule-based systems used to detect and to localize faults in ATM networks.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122261505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of a TCP connection over ABR, in presence of exogenous flow","authors":"Jean-Laurent Costeux","doi":"10.1109/ICATM.1999.786772","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786772","url":null,"abstract":"This paper reports on an analytical study of the performances of the ATM-ABR transfer capacity in transporting TCP/IP flows over an ATM network. We explore the behavior of a TCP connection over an ATM-ABR VC, in the presence of exogenous non-controlled traffic. This fluid analysis of the system allows the study of the interaction between the window-based end-to-end flow control TCP protocol and the rate-based flow control ABR mechanism, which is restricted to the ATM part of the network. The main aim of this study is to give performance evaluation formulae to model the behavior of such a TCP over ABR connection.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133673724","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Minimum equivalent subspanner algorithms for topology aggregation in ATM networks","authors":"W. C. Lee","doi":"10.1109/ICATM.1999.786823","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786823","url":null,"abstract":"In a hierarchical network, the process of summarizing and compressing topology information at each hierarchical level to determine the topology information to be advertised at the level above is referred to as topology aggregation. Specifically, a problem of topology aggregation is to encode a full mesh representation of a given topology with a compact auxiliary graph, such that it could be used to reconstruct the full mesh representation with little or no distortion. This paper presents some algorithms that can be used to determine, for a given topology, a minimum representation with no compromise on accuracy. The minimum representation can be used to characterize the amount of redundancy in the topology. The application of these algorithms to generate complex node representations for topology aggregation in ATM networks is discussed.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128981617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}