{"title":"Contention resolution in the loop-augmented ShuffleNet multihop lightwave network","authors":"Lin Wang, Kwok-Wah Hung","doi":"10.1109/GLOCOM.1994.513404","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513404","url":null,"abstract":"In ShuffleNet multihop lightwave networks with hot-potato routing, when two or more packets simultaneously arrive at a given node and contend for the same outgoing link to achieve minimum distance routing, then all but one will be misrouted to links which produce longer paths to the destination. In this paper, we propose a new topology for multihop lightwave networks, called loop-augmented ShuffleNet, which can shorten the alternate path traveled by misrouted packets. The loop-augmented ShuffleNet is constructed with slight change in the ShuffleNet connectivity while retaining the simple addressing and self-routing properties. Compared with ShuffleNet, the network performance is greatly improved by reducing the expected number of hops using this new network design.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130381248","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":"Estimate the loss and tail probabilities for multimedia communication systems","authors":"S.S. Wang, J. Silvester","doi":"10.1109/GLOCOM.1994.512791","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512791","url":null,"abstract":"In this paper, we study the performance of integrated services ATM multiplexers in terms of their loss performance. We model voice sources as ON-OFF processes, video sources with uniform activity level as a birth-death process and the arrival process from the aggregation of data sources as a Poisson process with a general bulk size distribution. We show that the integration of these processes belongs to the family of batch Markovian arrival processes (BMAP). We investigate an approximation which matches the original model to a two-state batch arrival Markov modulated Poisson process (BMMPP). We investigate the queue length distribution with particular emphasis on tail probabilities. We develop a fast solution for the asymptotic tail based on the Z-transform which is a very good approximation. The work also provides a simple way to calculate the loss probability for correlated arrivals. The results show that the proposed model has greatly reduced complexity while retaining reasonably accurate performance prediction.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115185819","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":"Optimal dynamic virtual path bandwidth allocation and restoration in ATM networks","authors":"A. Gersht, A. Shulman","doi":"10.1109/GLOCOM.1994.512700","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512700","url":null,"abstract":"This paper presents an optimal dynamic virtual path (VP) bandwidth allocation and restoration scheme for mesh ATM networks (in the context of the layered traffic control architecture). The scheme integrates the dynamics of demand admission, VP bandwidth allocation, and logical spare capacity assignment for maximizing network throughput while ensuring full traffic restorability. We present an optimal parallel algorithm that minimizes the total rejected bandwidth demand and cell loss while satisfying the maximal cell loss, delay, and 100% restorability requirements for a given set of failure scenarios. The optimal spare capacity assignment in the presented approach follows directly from the network admission and bandwidth allocation decisions. The algorithm also equalizes cell losses on the VPs thus providing cell-level fairness.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115561956","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":"Network evolution to support personal communications services","authors":"J.G. Hemmady, J.R. Maymir, D.J. Meyers","doi":"10.1109/GLOCOM.1994.512689","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512689","url":null,"abstract":"Personal communications services (PCS) are a set of capabilities that allow terminal mobility, personal mobility, and service mobility. The PCS concept is part of such initiatives as universal personal telecommunications (UPT) promoted by standards bodes. PCS is generally segmented into low tier and high tier services, significantly lower in cost than today's cellular service, providing significantly more mobility than today's landline service, and having voice quality and feature sets similar to today's landline service. The paper addresses how communications networks may evolve in supporting the vision of personal communications networks (PCN) which is to create a single seamless network to provide services associated with a mobile individual or a personal identifier, and not simply a terminal. Specifically addressed are the evolution of two of the most common networks in the United States-the cellular and landline networks. Discussed are several new technologies that facilitate the creation of a PCN, among the most important are: SS7 signaling, intelligent network, digital switching, digital radio, portable terminal and operations support technologies. Also addressed is an evolution of wireless communications to broadband networks.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114241522","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":"Optimum structures and growability of shared-buffer fabrics","authors":"A. Jajszczyk, M. Roszkiewicz","doi":"10.1109/GLOCOM.1994.513488","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513488","url":null,"abstract":"Large ATM switching fabrics are frequently obtained by arranging more elementary switches in various ways. This paper presents results of our investigations on how these elements should be arranged to minimize the cost expressed by the number of elementary switches. The problem is not trivial if we consider fabrics that allow smooth growth from small to large number of ports. In this paper we consider a two-sided growable ATM fabric architecture using shared-buffer-based switching elements. The fabric is expanded by connecting additional basic fabrics to the existing structure by some interconnecting modules. In our investigations we have used the dynamic programming method, which is based on Bellman's optimality principle. As the result, the comparison of the cost of various ATM switching fabrics is given.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116725307","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":"On the superposition of discrete-time Markov renewal processes and application to statistical multiplexing of bursty traffic sources","authors":"K. Elsayed","doi":"10.1109/GLOCOM.1994.512830","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512830","url":null,"abstract":"We introduce a methodology for approximately characterizing the superposition process of multiple arbitrary discrete-time Markov renewal processes (MRP) in terms of a discrete-time MRP. We model an arbitrary on/off traffic source as a MRP and then obtain the superposition process of multiple sources as a special case. We present a queueing analysis of a finite-buffer statistical multiplexer whose input process is the superposition of multiple arbitrary on/off traffic sources.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116148919","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":"Efficient implementation of a Viterbi decoder for geometrically uniform TCM codes","authors":"F. Daneshgaran, M. Mondin","doi":"10.1109/GLOCOM.1994.513026","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513026","url":null,"abstract":"Presents a procedure to design maximum likelihood decoders for the new class of geometrically uniform (GU) TCM codes, with an efficient VLSI implementation. The design of the decoders for the GUTCM codes is different and more complicated in comparison to the standard convolutional code decoders because between any pair of states in the trellis diagram of a GUTCM code, there is usually a large number of parallel transitions, and the trellis diagram of the code has a much higher degree of connectivity in comparison to binary convolutional codes, making routing a more critical problem. The authors present a novel technique for solving the parallel transitions using the algebraic structure of the GUTCM codes, which represents a significant reduction in complexity with respect to the direct approach. The proposed technique is applied to the design of an efficient Viterbi decoder (VD) for a 64-state nonbinary GUTCM code defined over (Z/sub 8/)/sup 4/ with 5.46 dB of asymptotic coding gain with respect to uncoded QPSK and 2 information bits per two dimensions. For this example, they obtain a 50 fold reduction in complexity in comparison to the direct implementation.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123093556","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 new distributor structure based on CSEs with application to virtual FIFO queue","authors":"Jeong Gyu Lee, B. Lee","doi":"10.1109/GLOCOM.1994.513489","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513489","url":null,"abstract":"Discusses the properties of a new distributor structure which is built based on the CSEs (controlled switching elements), and applies the distributor for realization of the virtual FIFO queue. The CSE is a variation of the 2/spl times/2 switching element which is controlled by the external control inputs (ECIs), and the CSE-based distributor takes the reverse banyan network (RBN) structure consisting of the CSE elements. The authors present four basic properties of the proposed CSE-based RBN and, in addition, they provide a detailed description on applying the CSE-based distributor for an efficient realization of the virtual FIFO queue.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123368782","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":"Toward formal methods in network management","authors":"P. Johnson","doi":"10.1109/GLOCOM.1994.513405","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513405","url":null,"abstract":"The purpose of developing formal methods for network management is to construct a methodology so that implementations of network management can be studied. Such studies lead to increased productivity in generating software for network management applications and toward increased efficiencies in running network management applications in the field. A process leading to an approach of developing formal methods for network management is proposed. This process introduces C.A.E Hoare's (1983) thoughts on the syntax of sequential computing processes along with Dijkstra's (1975) idea of \"Guarded Variables\". The result is a syntax which allows one to model execution of a sequential set of program statements and, in addition, has a nondeterministic property within the syntax to explicitly model decision points within the execution of statements where only one of multiple scenarios is followed in the sequence. From this base, network management can be modelled as a set of behaviors, whose semantics can be embedded within the above syntax. This representation is analogous to the idea of \"reverse engineering\" in cloning computer chips. Here, the external interactions of the target chip, like the observed behaviors of a network management system, are defined and then simulated through fundamentally different processes, while still producing identical interactions under like conditions. For the network management application, (taking access control as an example) control can be modeled as an interchange of functional commands across an interface by embedding the access control semantics within predicates and noting the decisions within the predicates through the nondeterministic syntax.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124783676","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":"Highly reliable on-line partial file modification for office data provisioning in \"NOSES\"","authors":"H. Matsumura, H. Sunaga, K. Koyanagi, S. Kasuga","doi":"10.1109/GLOCOM.1994.512854","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512854","url":null,"abstract":"The paper presents an on-line software modification technique for use in office data provisioning in the Non-stop Service Enhancible Software (NOSES) system. High reliability and high software-maintainability needed for coping quickly and effectively with diverse customer demands related to system extension. The principal technique is the generation, modification, addition or deletion of office data related to the provision of physical components or logical resources in the executing system file. As an on-line partial program updating technique within the framework of the object oriented paradigm, mechanisms and operation procedure based on TMN are addressed in detail. These technologies are expected to be a basis for quick service provisioning in intelligent networks as well as in transport networks.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124913478","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}