{"title":"Simple schemes for traffic integration at call set-up level in ATM networks","authors":"R. Bolla, F. Davoli, M. Marchese","doi":"10.1109/ICCCN.1995.540178","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540178","url":null,"abstract":"The paper presents a scheme for admission control at the call set-up in an ATM node, aimed at minimising the probability of blocking a call and at balancing this probability between traffic classes. The traffic is considered to be divided into traffic classes, characterised by statistical parameters like peak and average bandwidth and by quality of service (QoS) requirements that allow to define a feasibility region: where requirements are guaranteed A model to describe the 'call admission' is proposed: two different cost functions, based on the blocking probability, are defined and minimised, taking into account the 'feasibility region' constraint: the first function is intended to obtain the minimum overall blocking probability, whereas the second is aimed to balance the blocking probability among classes. The maximum number of acceptable calls yielded by each cost function is obtained for each class, by minimising it under stationary traffic conditions. The efficiency of the proposed strategy is tested by simulations and verified by comparing it with other admission schemes.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"23 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":"125929192","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":"FDDI-ATM internetworking simulation","authors":"Tan Kok Keong Tony, K. R. Subramanian, T. Cheng","doi":"10.1109/ICCCN.1995.540165","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540165","url":null,"abstract":"This paper focuses on the use of discrete event simulation techniques for the performance evaluation of FDDI networks interconnected via the ATM WAN. The simulation enables us to obtain relevant data on such performance evaluators as the end-to-end delay and throughput for the traditional TCP/IP traffic over the internetwork. The qualitative analysis provides a basis to formulate the delay and throughput approximations and reveals the intrinsic behaviour of these networks. The detailed network model has been developed in the C language. OPNET, a Unix-based communication systems simulation tool which supports the hierarchical object-oriented model is used in this simulation. The FDDI-ATM internetwork performance results are presented.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"104 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":"127991948","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":"CHANNELS: a run-time system for multimedia protocols","authors":"Stefan Böcking, Vera Seidel, P. Vindeby","doi":"10.1109/ICCCN.1995.540117","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540117","url":null,"abstract":"This paper presents CHANNELS, a run-time system for network protocol processing. CHANNELS is especially intended and optimized for transport systems supporting multimedia applications on high-speed networks. Additionally to the traditional features of a run-time system like the scheduling of the processing of different protocols, the provision of dedicated facilities such as timer, buffer and mapping table libraries for protocol implementation and the support of communication to adjacent protocol entities, network devices and user processes, CHANNELS enables the implementation of sophisticated protocols which require real-time and parallel processing capabilities, or dynamic protocol configuration support. CHANNELS is implemented in the C++ programming language and one prototype is embedded in the SUN/UNIX kernel.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"14 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":"128873656","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":"An algorithm for determining the feasibility of SONET/ATM rings in broadband networks","authors":"Jay J. Lee, Kwi-yung Jung","doi":"10.1109/ICCCN.1995.540141","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540141","url":null,"abstract":"Synchronous optical network (SONET) self-healing ring architecture is used for designing more survivable and economical broadband networks. Virtual path (VP)-based asynchronous transfer mode (ATM) technology is being introduced into SONET rings as a means of reducing costs by using its non-hierarchical path multiplexing and flexible demand arrangement. This paper describes an algorithm for determining the feasibility of SONET/ATM rings over a diverse protection (DP) architecture when deploying the rings in the network. It is assumed that the ATM/add-drop multiplexer (ADM) for the VP-based ATM rings can be built from SONET ADM by installing the ATM STS-3c line cards in place of the STS-3 termination cards. Hence, the algorithm is applicable to both SONET ring and VP-based ATM ring architectures. By using reference network databases the simulation results are also provided. The cost depends on amount of traffic, demand routing, size of network and network connectivity. In our simulation results, we found that the cost savings over DPs ranged from 2.6% to 19.9%. It is recommended that network planners and network analysts carefully evaluate where to deploy SONET/ATM rings for more survivable and economical broadband networks.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"661 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":"123357558","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 \"persistent connection\" model for mobile and distributed systems","authors":"Yongguang Zhang, S. Dao","doi":"10.1109/ICCCN.1995.540133","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540133","url":null,"abstract":"This paper describes a mechanism, called \"persistent connection\" to preserve stream connections after the communicating peer exits and till it restarts. Such connections have many applications: to survive failures that crash one party, network partitions that cut off the two parties, and temporary disconnection in a mobile computing environment. They can also facilitate suspension of process execution in a limited resource environment and maintain connectivity when one party migrates from one machine to another. Persistent connection uses logical endpoints to hide disconnection from applications and to achieve location independence. It can be constructed from the normal \"transient\" connection that goes down with processes. Prototypes have been developed on Unix to provide persistent connections in both the TCP-socket level and the DCE RPC level. Many existing programs can benefit from this software to achieve transparence to disconnection and relocation. We conclude that persistent connection is a convenient communication abstraction for reliable, adaptable, and reconfigurable applications.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"158 4 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":"125926827","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":"Specification of video-on-demand service using object oriented technique","authors":"Hoon-gyu Choi, Kidong Nam, Sun You Kim","doi":"10.1109/ICCCN.1995.540174","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540174","url":null,"abstract":"We propose a specification of a video-on-demand (VOD) service using an object oriented technique on the ITU-T's service modeling frame. The specification consists of the prose description, the static description using service attributes and the dynamic description using an event trace diagram. The purpose of the specification is to derive capabilities of a network on which the service will be provided. This specification will be also used to outline VOD service protocols.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"263 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":"122543897","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":"Core selection methods for multicast routing","authors":"K. Calvert, E. Zegura, M. Donahoo","doi":"10.1109/ICCCN.1995.540184","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540184","url":null,"abstract":"Multicast routing is an important topic of both theoretical and practical interest. Several proposed multicast routing algorithms involve the designation of one or more network nodes as the \"center\" of the routing tree for each multicast group. The choice of this designated router (which we refer to as the \"core\") influences the shape of the multicast routing tree, and thus influences the performance of the routing scheme. We investigate the relationship between the choice of core and three performance measures. Specifically, we compare various methods of selecting a core with respect to their effect on the bandwidth, delay, and traffic concentration. We conclude that simple methods are adequate for widely distributed groups, but that the addition of group information can be leveraged to improve performance especially when the group is small or exhibits a high degree of locality. We also conclude that core choice can be used to control traffic concentration, in fact traffic concentration effects can be ameliorated by appropriate core choice policies.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"17 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":"122945290","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 simulation study of schemes for block loss reduction in ATM networks using FEC and buffer management","authors":"V. Srinivasan, A. Ghanwani, E. Gelenbe","doi":"10.1109/ICCCN.1995.540110","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540110","url":null,"abstract":"Traditional approaches to guaranteeing quality-of-service (QoS) in ATM networks have focused on performance metrics such as cell loss probability, end-to-end cell delay and delay jitter. However, the block loss rate is a more meaningful metric for applications such as medical imaging and real-time video, and for high-level protocols such as IP which will use ATM as the transport mechanism. A block is defined as a group of consecutive ATM cells. A block loss occurs when a single cell from a block is lost. We propose and evaluate, via extensive simulation, a technique for reducing block loss in ATM networks. Our method combines two well-studied approaches for minimizing the impact of information loss during transport over ATM networks which have been considered independently of each other in the past: priority-based cell discarding and forward error correction (FEC). We also study an enhanced buffer management algorithm which we call adaptive pushout (ADP) that accounts for correlations between cell losses. The ADP algorithm reduces block loss rates to near-optimal levels. We consider further performance enhancements to the ADP policy that deliver excellent performance even under very heavy load.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"32 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":"127694498","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":"Sharing buffer in an input-output buffered ATM switch without scaling up memory bandwidth requirement","authors":"D. Pao, S. Leung","doi":"10.1109/ICCCN.1995.540138","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540138","url":null,"abstract":"In order to provide reliable communication services, the cell loss probability of an ATM network is required to be less than some acceptable value, say 10/sup -5/ or smaller. In light of the infrequent cell losses, and overloading of individual output ports is likely to occur at different time instances, an external buffer can be \"time-multiplexed\" to serve the overloaded output ports on demand. To achieve this, the switch will provide an additional feedback path for derouting cells destined for an overloaded output port to the shared buffer. When the traffic load at the corresponding output port drops and buffer space becomes available in the output queue, the derouted cells will be removed from the shared buffer and routed via the switching fabric to their destinations. Simulation results reveal that under bursty traffic conditions the acceptable load can be more than doubled by incorporating a shared buffer of 128 cells.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"547 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":"133517556","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":"Limiting the access bandwidth of a video source: model and performance analysis","authors":"W. Chan, E. Geraniotis","doi":"10.1109/ICCCN.1995.540172","DOIUrl":"https://doi.org/10.1109/ICCCN.1995.540172","url":null,"abstract":"We investigate the effect of limiting the access bandwidth of a video source. In some applications, the access bandwidth is less than the peak rate of the source and so dropping of packets occurs. A model is needed for this truncated source. The model suggested in the paper is based on the discrete-state continuous time Markov model proposed by Maglaris et al. (1988). We derive the mean and the autocorrelation function of the rate of this new model and show that these statistical properties agree with the experimental values.","PeriodicalId":106587,"journal":{"name":"Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95","volume":"98 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":"117323038","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}