{"title":"Bounds and performance of reuse partitioning in cellular networks","authors":"Dario Lucatti, A. Pattavina, V. Trecordi","doi":"10.1109/INFCOM.1996.497878","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497878","url":null,"abstract":"We study a scheme that allows a smooth increase of the capacity of a cellular system for circuit-switching by applying cell-partitioning and dynamic channel allocation techniques. A bound is computed for this reuse partitioning scheme that gives the maximum theoretical gain accomplished in the system bandwidth. The performance of the proposed scheme, in terms of blocking probability, is evaluated both when the position of the mobiles remains unchanged and when mobility is taken into account. The numerical results show that the capacity of the proposed scheme is higher than that of a fixed allocation scheme.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115899650","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 MPEG-1 transmission through B-ISDN ATM networks","authors":"Olen L. Stokes, A. Nilsson","doi":"10.1109/INFCOM.1996.493347","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493347","url":null,"abstract":"To understand the performance of MPEG-1 videos when transmitted through B-ISDN ATM networks, this paper analyzes an equivalent simulated network. Allocation of network bandwidth is based on equivalent capacity with MMBP inputs providing background traffic. Cell losses are examined and found to be near target. Also, an analysis of cell delay indicates that delay distributions can be approximated by gamma distributions and that frame-to-frame cell delay is uncorrelated for the test network. Finally, a method to predict MPEG-1 decode buffer underruns is developed and validated.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131241766","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":"Near-optimal bandwidth allocation for multimedia virtual circuit switched networks","authors":"W. Chan, E. Geraniotis","doi":"10.1109/INFCOM.1996.493372","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493372","url":null,"abstract":"We analyse the performance of multimedia virtual circuit switched networks. Voice, video and data traffic are considered. Although closed-form expressions for the end-to-end performance measures (probabilities of voice and video blocking, normalized voice processing loads, probabilities of video rate dropping and data queueing) are available, they cannot be applied directly because of the prohibitive computation required. As a result, fast and accurate approximation schemes based on the reduced load method are developed. The bandwidth allocated to a video call is varied; together with the step size of the virtual paths, the performance of the network can be controlled and optimized. Extensive numerical results are given to validate the approximation schemes developed.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124424054","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 integration-oriented approach for designing communication protocols from component-based service specifications","authors":"Masahide Nakamura, Y. Kakuda, T. Kikuno","doi":"10.1109/INFCOM.1996.493060","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493060","url":null,"abstract":"The trend toward the enrichment of communication services in ISDN and IN has greatly increased the size and complexity of communication protocols which realize the services. A large and complex protocol is constructed by integrating components, each of which corresponds to a subfunction specified in a service specification. The conventional approach to this construction is to integrate components on the protocol level using the existing protocol integration methods. In this approach, the reachability analysis of protocol components is required in the integration stage. So if the size of components becomes large, the integration stage would be a bottleneck because of the state explosion problem of the reachability analysis. Therefore, we propose a new approach to construct the target protocol which, at first integrates components on the service specification level and then transforms an integrated service specification into the target protocol by the protocol synthesis technique. As a result, the construction of the target protocol from the component service specifications can be efficiently effected in a small state space without paying special attention to the timing of protocol messages.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121628829","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":"Queue management for shared buffer and shared multi-buffer ATM switches","authors":"Yu-sheng Lin, C. Shung","doi":"10.1109/INFCOM.1996.493365","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493365","url":null,"abstract":"The design of the queue manager is of key importance for the shared buffer ATM switch architectures. We propose the recycling queue manager (RQM) with reduced hardware complexity by eliminating the external FIFO for the avail queue. By separating the shared buffer into cell and address memories, the power consumption of idle accesses in the RQM can be reduced, and the linked list bubbles can be removed. The required storage for the proposed RQM and other queue managers of existing shared buffer ATM switches are compared, considering delay/loss priorities and partial sharing. It is found that the RQM requires the least storage size for most cases, and the reduction is more significant as the switch dimension grows. A two-level RQM-based scheme, with reduced storage, is also proposed for the shared multi-buffer switch architecture. An RQM prototype chip supporting a 16/spl times/16 switch with two priority classes and back pressure capability was implemented and successfully tested to verify the proposed architecture.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121891646","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":"Flow labelled IP: a connectionless approach to ATM","authors":"P. Newman, T. Lyon, Greg Minshall","doi":"10.1109/INFCOM.1996.493071","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493071","url":null,"abstract":"A number of proposals for supporting the Internet protocol (IP) over ATM are under discussion in the networking community including: LAN emulation, classical IP over ATM, routing over large clouds, and multiprotocol over ATM. Each of these proposals hides the real network topology from the IP layer by treating the data link layer as a large, opaque, network cloud. We argue that this leads to complexity, inefficiency and duplication of functionality in the resulting network. We propose an alternative in which we discard the connection oriented nature of ATM and integrate fast ATM hardware directly with the IP, presenting the connectionless nature of the IP. We use a \"soft\" state in the ATM hardware to cache the IP forwarding decision. This enables further traffic on the same IP flow to be switched by the ATM hardware rather than forwarded by the IP software. We claim that this approach combines the simplicity, scalability, and robustness of the IP with the speed, capacity, and multiservice traffic capabilities of ATM.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115252164","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 a P/sub i/ persistent protocol subject to correlated Gaussian traffic","authors":"R. Addie, D. Platt, M. Zukerman","doi":"10.1109/INFCOM.1996.497902","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497902","url":null,"abstract":"We consider the P/sub i/-persistent protocol and we derive approximate analytical results for the unfinished work distribution at each node on the bus under the assumption that the arrival process at each node follows a discrete time Gaussian process. A deterministic version of the protocol, which reduces the variance of the service process and therefore improves queueing performance, is also considered. The solution is simple and fast to compute and is not overly sensitive to the number of nodes. Simulation results indicate that the results are accurate so long as the performance can be accurately approximated based on the dominant effect of an exponential tail in the distribution of queued load. The results are also applicable to a single server Gaussian queue with priorities.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115270163","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}
Hongqing Li, Kai-Yeung Siu, H. Tzeng, C. Ikeda, H. Suzuki
{"title":"A simulation study of TCP performance in ATM networks with ABR and UBR services","authors":"Hongqing Li, Kai-Yeung Siu, H. Tzeng, C. Ikeda, H. Suzuki","doi":"10.1109/INFCOM.1996.493073","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493073","url":null,"abstract":"We present a simulation study of the TCP performance in ATM networks with available bit rate (ABR) service and unspecified bit rate (UBR) service with early packet discard (EPD) schemes. We focus our study in a LAN environment using some benchmark network configurations proposed in the ATM Forum. Our simulation results show the following: (1) with UBR service and EPD schemes, TCP suffers significant performance degradation in terms of fairness and requires relatively large switch buffer even with a small number of active virtual connections over a LAN configuration, and (2) for the same set of network configurations and with ABR service using explicit rate feedback schemes, TCP achieves a good performance in terms of fairness and link utilization, and requires a relatively small switch buffer.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115300460","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":"Distributed network control for wavelength routed optical networks","authors":"R. Ramaswami, A. Segall","doi":"10.1109/INFCOM.1996.497887","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497887","url":null,"abstract":"This paper describes an architecture for adding an underlying wavelength-routed optical layer to a standard ATM network. The optical layer provides reconfigurable lightpaths that serve as links between electronic ATM switches. A lightpath is carried on a particular wavelength and path in the underlying optical wavelength-routed network. This work focuses on the mechanisms for controlling the optical layer. Distributed control protocols are provided for setting up and taking down lightpaths reliably and for updating the topology of the network, including the lightpaths. These protocols allow lightpath originators to obtain resources with high probability by minimizing reservation conflicts, allow lightpaths to stay up even if controllers along the path in the network fail, ensure that controllers in the network have a consistent view of the state of each lightpath, and ensure that all resources taken up by a lightpath are released once the lightpath is taken down.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124915398","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 reversible hierarchical scheme for microcellular systems with overlaying macrocells","authors":"R. Beraldi, S. Marano, C. Mastroianni","doi":"10.1109/INFCOM.1996.497877","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497877","url":null,"abstract":"Future cellular systems are expected to use multilayered, multisized cells to cover non-homogeneous populated areas. An example in literature is given by a 2 level hierarchical architecture in which an overlaying macrocell provides a group of overflow channels utilized when a microcell, which covers a densely populated area, is not able to accommodate a new call, or a handover from another microcell. The macrocell has the higher hierarchical position, meaning that it can receive handover requests from microcells, lower in the hierarchy, as well as from other macrocells. On the contrary, a call served by the macrocell cannot handover to a microcell. This paper proposes a reversible hierarchical scheme characterized by the presence of handover attempts from macrocells to microcells. The scheme is conceived so that the microcells are given the majority of the traffic load as they are able to operate with very high capacity, while the macrocells, having lower channel utilization, can better carry out their support task. An analytical study is carried out showing that the system performance can be improved, at the expense of relatively little increase of network control overhead, when compared with the classical, i.e. nonreversible hierarchical scheme.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129026469","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}