{"title":"Desktop videoconferencing performance based on an ATM metropolitan area network","authors":"H. Tobiet, P. Lorenz","doi":"10.1109/ICATM.1999.786818","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786818","url":null,"abstract":"The DIVINE project enables the evaluation of a high quality desktop videoconferencing system on an ATM (asynchronous transfer mode) network. After the presentation of the used methodologies and performance measurement tools, we analyze the quality of service (QoS) of multimedia services implemented on the DIVINE system. Some performance evaluations have been achieved on the OASICE ATM metropolitan area 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-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122348116","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 method for accurate time synchronization through in-service monitoring in ATM networks","authors":"D. Vidal","doi":"10.1109/ICATM.1999.786796","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786796","url":null,"abstract":"In this paper, the ATM performance parameters cell transfer delay (CTD) and cell delay variation (CDV), being monitored for in-service measurement or estimation by the operation and maintenance (OAM) system, are proposed to be used to compute the time and frequency off-sets of the local clock relative to a differential-GPS based reference clock, in order to synchronize a local clock.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"27 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":"116636956","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":"Performance of the fair intelligent congestion control for TCP applications over ATM networks: a simulation analysis","authors":"D. Hoang, Q. Yu","doi":"10.1109/ICATM.1999.786828","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786828","url":null,"abstract":"This paper presents a simulation study of the performance of TCP traffic over ATM network ABR service under the fair intelligent congestion control (FICC) scheme recently proposed. The simulation experiments are conducted on various network configurations, and traffic patterns. The key metrics of TCP effective throughput, packet delay, delay variation, and fairness are measured. Simulation results show that FICC is superior to existing schemes in terms of well-guaranteed fairness, minimized and bounded buffer requirement, minimized packet variation delay, easy parameter settings, robustness to parameter mistuning, and simple implementation.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"18 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":"121129791","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":"Hierarchical vector clock: scalable plausible clock for detecting causality in large distributed systems","authors":"D. A. Khotimsky, I. A. Zhuklinets","doi":"10.1109/ICATM.1999.786798","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786798","url":null,"abstract":"Modern ATM networks possess a multilevel hierarchical structure, where certain sets of physical or logical nodes are grouped together according to physical, geographical, and/or administrative consideration. A distributed application running on top of such network may contain thousands of sites belonging to different logical nodes with the transport channels between them extending through multiple domain boundaries and crossing multiple hierarchical levels. While knowledge of causality between the events in such a system is essential for analyzing the system behavior and ensuring the correct operation through solving various problems related to mutual exclusion, consistency maintenance, fault tolerance and recovery, etc., the accurate tracking of the causality information may be infeasible due to the system's size and lifespan. For example, the communication and storage overhead involved in using the conventional vector clock, which allows causality to be completely characterized, is linear in the number of sites of a distributed system. In this paper we propose a new logical time system, called hierarchical vector clock or HVC, which allows causality to be detected between events in a large distributed system with a high degree of accuracy, while being ideally suited for the hierarchical structure of an underlying network and able to scale gracefully with the increasing number of distributed sites.","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":"128650022","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":"Dynamic management of routing tables and connection re-routing in ATM networks","authors":"S. Kumar, S. Raghavan","doi":"10.1109/ICATM.1999.786791","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786791","url":null,"abstract":"Virtual path and virtual channel management are very important to ATM networks. By using the VP concept the virtual layout of the network can be modified to improve the utilization of the network. With large bandwidths freely available the existing VP management strategies need to be modified. One of the problems that may arise as a result of this is that the number of connections supported by the link, does not scale proportionately with increase in bandwidth. The number of VCs is limited by the size of the VCI. The connection routing tables in a switch may overflow which would result in unused bandwidth. The existing VP layout algorithms can handle this problem but they suffer from the following deficiencies. They are, 1) Time-driven, 2) Their effect is global and, 3) They are generally centralized. In this paper we have discuss the issues regarding this problem. We first study the switch routing table design issues and how they can handle these problems to some extent. We then present a distributed algorithm to dynamically reduce the number of connection table entries in an ATM switch.","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":"130860544","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":"Delay jitter guarantee for real-time communications with ATM network","authors":"Z. Mammeri, P. Sabatier","doi":"10.1109/ICATM.1999.786797","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786797","url":null,"abstract":"Some real-time applications (such as video and audio applications) are sensitive to transfer delay variation and require that the communication system guarantees a bounded jitter. ATM provides capabilities to deal with cell transfer delay variation (CDV). However, it is worth noting that ATM networks have a finite ability to control peak-to-peak CDV. In this paper we show how ATM capabilities may be used to guarantee bounded jitter taking into account several types of hard real-time traffic. We investigate an approach for a systematic translation of jitter constraints of messages into traffic and QoS parameters of ATM connections.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"8 6 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":"114815377","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}
I. Mountzouris, G. Orphanos, A. Birbas, S. Koubias, G. Papadopoulos
{"title":"Evaluation of the TCP traffic over the ABR service targeted to support mass storage applications","authors":"I. Mountzouris, G. Orphanos, A. Birbas, S. Koubias, G. Papadopoulos","doi":"10.1109/ICATM.1999.786786","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786786","url":null,"abstract":"This paper discusses the performance of mass storage applications, that is, backup sessions, over ATM, being serviced by multiple available bit rate (ABR) connections. In particular, the undertaken work has assumed simultaneous ABR connections in the presence of competitive traffic in the network. More precisely, we have (a) evaluated the performance of multiple ABR connections end-to-end, using both the explicit forward congestion indication (EFCI) and explicit rate (ER) mechanisms, (b) studied the adaptation of the ABR sources under the presence of competitive traffic in the network by applying a dynamic fairness scheme and, (c) studied the dynamics and performance of the TCP/IP protocol over the ABR service specified for an ATM network. Moreover, the performance improvement of TCP over ABR, using an \"interworking\" function between the TCP end-to-end flow control and the ABR rate-based control as well as examine the effect of the \"use-it-or-lose-it\" function, is considered. Furthermore, the different levels of performance are compared so as to select the optimum values for mandatory ABR service parameters, being the maximum number of cells (Nrm) between two successive resource management (RM) cells and the factors controlling the increase/decrease of the cell transmission rate (RIF: rate increase factor, RDF: rate decrease factor). Finally, the concept of a dynamic UPC mechanism that monitors the ABR traffic contract is identified.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"36 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":"116283676","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":"Routing protocols for wireless ad hoc ATM networks","authors":"A. Hettich, A. Kadelka, H. Kukulies","doi":"10.1109/ICATM.1999.786774","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786774","url":null,"abstract":"One of the major problems in multihop ad hoc ATM networks is the establishment and maintenance of virtual connections. Therefore, PNNI, IP and ZRP are investigated as possible routing protocol candidates. All three are modelled and analysed in terms of signalling overhead. The analytical model shows that ZRP is the most promising candidate as it is able to be adapted to any kind of network topology. As ZRP has been developed for IP it has been changed for ATM routing. Computer simulations show that the analytical model is accurate and the delays due to topology changes are very limited.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"32 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":"117170333","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":"De-jittering in the transport of MPEG-4 and MPEG-2 video over ATM","authors":"K. Shuaib, T. Saadawi, M. Lee, B. Basch","doi":"10.1109/ICATM.1999.786845","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786845","url":null,"abstract":"In this paper a de-jittering scheme which can be used in the transport of MPEG-4 and MPEG-2 video to absorb any introduced network jitter is proposed. The essence of the de-jittering scheme is based on the statistical approximation of delay variation in the arrival times of video packets carrying encoded clock reference values and a filtering and re-stamping mechanism. In addition, a brief overview of the MPEG-4 system is presented.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"7 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":"124478323","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":"Advanced frame recovery in switched connection inverse multiplexing for ATM","authors":"F. Chiussi, D. A. Khotimsky, S. Krishnan","doi":"10.1109/ICATM.1999.786830","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786830","url":null,"abstract":"Switched connection inverse multiplexing for ATM (SCIMA) has been proposed as a low-overhead scheme for implementing an N/spl times/N switch with a port rate of kR using a kN/spl times/kN core switch (or k N/spl times/N switches) having a port rate of R. By splitting the traffic of a small number of virtual connections into subconnections over multiple low-capacity core switch ports, SCIMA achieves a performance level comparable with that of an equivalent high-capacity port switch. The scheme ensures that each split cell flow is re-assembled and delivered in the original order even in the presence of variable differential delays and highly non-uniform switching path usage. Furthermore, it can seamlessly recover from isolated cell losses within the core switch, as well as detect the loss of a certain number of consecutive cells belonging to the same subconnection. However, it is unable to restore, by itself, the re-assembly cell chain after two or more consecutive cell losses occur in a row on the same subconnection, and has to rely on other recovery means. In this paper, we describe a fault tolerance mechanism called advanced frame recovery, which applies the concept of framing in the asynchronous environment of SCIMA by inserting regular, albeit not necessarily periodic, checkpoints into the split cell flow. When the mechanism is invoked, it discards some of the successfully delivered cells and allows us to restart the chain at a subsequent checkpoint. The advanced frame recovery scheme is used when SCIMA detects consecutive cell losses within the same subconnection; it also serves as an additional measure of integrity checking during regular re-assembly to correct certain vulnerabilities of SCIMA. We present the motivation and implementation details of advanced frame recovery, together with a discussion of the trade-offs of such an open loop (as opposed to feedback driven) sequence control scheme.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"11 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":"128481485","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}