{"title":"A discrete time analysis of TCP in presence of cross traffic","authors":"P. Brown, D. Collange, C. Fenzy","doi":"10.1109/ICCCN.1995.540101","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540101","url":null,"abstract":"The object of this paper is to explore the behaviour of a TCP connection in presence of exogenous non-controlled traffic and to study the impact of TCP operation on the performance as seen by this traffic. General equations for the queue state evolution are derived and an explicit solution is given for constant rate traffic. Such a model applies to video or sound exogenous traffic and may give an insight on the phenomena for random traffic for certain network configurations (large buffers, low traffic variance). The performance criteria evaluated are TCP throughput, buffer occupancy distribution and evolution in time, packet loss rates and frequency of loss periods.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114925927","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":"Personalized broadcasting in banyan-hypercube networks","authors":"A. Bellaachia, A. Youssef","doi":"10.1109/ICCCN.1995.540161","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540161","url":null,"abstract":"The banyan-hypercube (BH) is one of the recently introduced hypercube-based interconnection networks. Due to the importance of communication in the overall system performance in a multiprocessing environment, this paper presents a near-optimal personalized broadcasting algorithm on the BHs. The analysis of this algorithm for both BHs and hypercubes is conducted for both single-port communication and multiple-port communication. We show that personalized broadcasting for both networks have the same communication time in the single-port mode. In multiple-port mode, the performance of the BH depends on its number of levels. When the number of levels is less than 4, the BHs outperform the hypercubes. However, the hypercubes have better performance than the BHs with large number of levels (>4). When the number of levels is equal to 4, both networks have the same performance.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116425225","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":"Petri nets analysis of transaction and submitter management protocols in mobile distributed computing environment","authors":"A. Zaslavsky, L. H. Yeo, S. J. Lai, B. Mitelman","doi":"10.1109/ICCCN.1995.540132","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540132","url":null,"abstract":"This paper proposes and discusses a simulation model of a message and transaction queuing protocol which supports submission of transactions from mobile workstations in a distributed multidatabase environment. The model is based on coloured Petri nets formalism. A hierarchical coloured Petri nets model describing the two key components of the protocol, namely message queuing facility and transaction queuing facility, is constructed and analyzed using the software tool Design/CPN. Simulation of message and transaction processing algorithms has been carried out to verify and refine the design of the proposed protocol. The tool has also enabled us to assess the practicality of the developed approach and study the impact of the protocol implementation. Finally, the results of simulation are analysed and discussed.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114398088","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":"Design of a large ATM switch with trunk grouping","authors":"Sushil Aryal, J. Meditch","doi":"10.1109/ICCCN.1995.540152","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540152","url":null,"abstract":"We describe a large self routing ATM switch with moderate circuit complexity which delivers packets in sequence with a small constant delay. The switch takes advantage of trunk grouping to increase throughput and has same topology as that of a banyan network. By using modules that look at k inputs (k>16) at a time and recursively dividing the packets into two groups, the proposed switch achieved a load throughput value that is relatively independent of switch size. Cell loss on the order of 10/sup -10/ can be obtained using the switch. The switch has O(nlog/sub 2/n) complexity in the number of modules where n is the number of inputs. The modules of the switch have very regular interconnections, and hence are suitable for dense VLSI implementation.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129891072","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":"ATM test traffic generation algorithms","authors":"G. Keiser, David Freeman, Carrie Carter","doi":"10.1109/ICCCN.1995.540160","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540160","url":null,"abstract":"Although many theoretical studies have been carried out to evaluate the performance of asynchronous transfer mode (ATM) networks, measurement equipment and techniques are required to analyze real ATM traffic and to compare the data with theoretical models. This paper describes the theory and application of test traffic-generation methodologies that are being implemented with an ATM traffic analyzer. This traffic analyzer generates ATM test cells based on a user-selectable statistical distribution. At the receiving end, the traffic analyzer produces performance metrics to validate ATM switch and network performance. The traffic analyzer measures and computes performance parameters such as cell loss, cell delay, cell delay variation, and cell error. Here we describe mathematical algorithms that can be used to generate various constant-bit-rate and variable-bit-rate traffic patterns, and give examples for data, voice, and video sources.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128038598","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":"Circular window control schemes in fast packet switches","authors":"Yann-Hang Lee, R. Chow, S. Cheung","doi":"10.1109/ICCCN.1995.540109","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540109","url":null,"abstract":"In this paper, we investigate a scheduling algorithm, called circular window control (CWC) scheme, for packet switch fabrics. The scheme is simple and efficient. It uses a fixed length window with circular transmission sequences to minimize possible switch and output contentions. The scheme can attain a maximal throughput of 100%; in nonblocking switches as well as banyan-based blocking switches. The performance analyses and simulation results of the CWC scheme an also presented.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130899011","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":"Transient analysis of cell loss control mechanisms in ATM networks","authors":"Kelvin K. Lee, S. Chanson","doi":"10.1109/ICCCN.1995.540125","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540125","url":null,"abstract":"A new technique is developed to analyze the cell loss behavior of individual connections in finite intervals for ATM networks. The technique is applied to partial buffer sharing (PBS) in deriving formulae for calculating cell loss rate and queue length distributions for each cell class in a single connection in finite intervals. To maximize network utilization, a new and more flexible cell loss control mechanism called threshold-based loss balancing (TLB) is proposed which restricts the violation probability of each cell class. Comparisons of TLB and PBS on selected operating conditions reveal that TLB can accept more connections under the same workload conditions. PBS is shown to be a special case of TLB.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132718342","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 multilayer-architecture for SNMP-based, distributed and hierarchical management of local area networks","authors":"Robert Konopka, Markus Trommer","doi":"10.1109/ICCCN.1995.540129","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540129","url":null,"abstract":"In 'traditional' SNMP-management, the management task is divided into two layers: agents and managers. The agents provide management data that is read out and processed by the manager. In this paper this architecture is expanded by an intermediate layer. Preprocessors an introduced which behave like a manager in the view of an agent and behave like an agent in the view of a manager. They read out the information in the MIBs of the agents, process it and make it available to the manager in another MIB. The preprocessors offer frequently used network management functions with a standardized interface to ease the workload of management applications. Traffic on the network caused by the management is reduced as well. The realization of such preprocessors is shown in an example for a MIB providing statistics, limit surveillance, history and prognosis functionality.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115562021","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 scalable virtual circuit routing scheme for ATM networks","authors":"C. Alaettinoglu, I. Matta, A. Shankar","doi":"10.1109/ICCCN.1995.540183","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540183","url":null,"abstract":"We present a scalable VC routing protocol based on the viewserver hierarchy. Each viewserver maintains a partial view of the network. By querying these viewservers, a source obtains a merged view that contains a path to the destination. The source then sends a setup request packet over this path to reserve resources. We use simulation to compare our protocol to a simple approach that maintains a full view of the network. In addition to the savings in storage, our protocol performs as well or better in terms of the VC carried load and blocking probability over a wide range of real-time workload.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116868843","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":"CMIP to SNMP translation technique based on rule description","authors":"N. Nakamura, N. Kashimura, K. Motomura","doi":"10.1109/ICCCN.1995.540128","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540128","url":null,"abstract":"The simple network management protocol (SNMP) and the common management information protocol (CMIP) are popular for network management. The integration of these protocols is important because networks are continually expanding and becoming more and more complex. The management information carried by various management protocols is as different as the management protocol. As a consequence of all this, management information translation is required. This paper proposes a method for translating SNMP into CMIP using a rule description. The method is applicable to both the Network Management Forum translation method and the method for associating an SNMP object with an existing CMIP object. In order to evaluate this method, we constructed the management information translation for an integrated system (MITIS) and showed the validity of this method from the view point of performance.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116441260","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}