{"title":"Dynamic K-Shortest Path (DKSP) facility restoration algorithm","authors":"M. Busche, C. Lockhart, C. Olszewski","doi":"10.1109/GLOCOM.1994.513577","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513577","url":null,"abstract":"This paper describes the dynamic K-shortest path (DKSP) algorithm for distributed facility restoration and its performance in a simulation of AT&T's high-capacity digital facilities network. The guiding paradigm of this algorithm is that of a switched network. At each facility node in the network, a local controller (LC) directs the activities of a digital cross-connect system (DCS) to route high-capacity digital connections around failures. The LCs communicate with each other via a connectionless network using routers and signaling links embedded in the transmission systems between nodes. After a failure, the LCs disseminate information about failed transmission links to the whole network. High-capacity digital connections are then restored by a call-control protocol. The simulation shows that the algorithm's efficiency is close to that of a centralized algorithm, and that its rate of finding alternate routes in this large network is approximately 50 ms per restoration path.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"96 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":"127253397","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":"Relation between call control and resource control in B-ISDN","authors":"X. Hou, I. Niemegeers","doi":"10.1109/GLOCOM.1994.513596","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513596","url":null,"abstract":"The functional separation of call control and the control of network resources brings about the flexibility in provision of telecommunication services. This paper addresses the relation between call control and resource control in the B-ISDN signalling. The merits and drawbacks of two complementary interaction strategies, i.e., simultaneous and sequential set-up are discussed. Principles of how to make a choice between the two are proposed.","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":"130764475","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":"Asymptotic performance of a buffered shufflenet with deflection routing","authors":"S. Chan, H. Kobayashi","doi":"10.1109/GLOCOM.1994.513207","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513207","url":null,"abstract":"Throughput of a shufflenet with deflection routing under high load and low load is obtained as a function of the network and buffer sizes. The authors give general routing conditions which achieve high performance in a shufflenet. Using a routing algorithm similar to the algorithm considered, the throughput of a shufflenet with only one buffer can be increased by more than 45% compared with the shufflenet without any buffer, the so-called hot-potato case. The increase is general for a shufflenet of size ranging from as few as 24 nodes to more than 10,000 nodes. The increase is more significant when the network becomes larger. The authors note that a large number of routing algorithms proposed to be used in the shufflenet satisfy the general routing conditions mentioned. Using the routing algorithm the authors mention, a shufflenet with only two buffers can achieve performance comparable to the store-and-forward case. In previous studies of the shufflenet, the derivation of the important parameter-the probability of deflection of a packet in the network-is usually complicated. The authors have obtained a simple approximation of this parameter, which greatly simplifies the analysis of a shufflenet of any size and with any number of buffers. This enables to conclude that the performance of a shufflenet scales well with different network and buffer sizes if the routing algorithm is chosen properly. They finally verify the results with the simulations that have been done.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"43 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":"132397800","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}
Chih-Yuan Chang, Jen-Wei Liang, A. Paulraj, T. Kailath
{"title":"A multiple access technique for cellular packet networks with admission control","authors":"Chih-Yuan Chang, Jen-Wei Liang, A. Paulraj, T. Kailath","doi":"10.1109/GLOCOM.1994.512995","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512995","url":null,"abstract":"We propose a code division multiple access technique for cellular packet data networks. In this technique, each user is assigned a distinct quasi-orthogonal pseudonoise (PN) sequence code for accessing the spread spectrum channel. Packet transmission is admitted to the network with explicit acknowledgement from the base station. To prevent the bistable behavior of ALOHA-type systems, the base station controls access attempts by broadcasting a busy tone when there are too many simultaneously arriving packets. We analyze the throughput, blocking probability, and average delay of the proposed system and evaluate system performance using ATM format packets. The results show the proposed approach leads to a good performance. With 33 percent of error control bits and open-loop power control, a 40 percent improvement in effective throughput over TDMA systems is possible even in the presence of Rayleigh fading.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"6 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":"131301145","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":"The role of assessments in a switching supplier's TQM system","authors":"W.A. Hoberg, M. Rudnick","doi":"10.1109/GLOCOM.1994.513043","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513043","url":null,"abstract":"Many companies and organizations have realized great success from effective implementation of total quality management (TQM). TQM has evolved into a means of managing entire companies, business units, or projects. Effective TQM enables an organization to differentiate itself on the basis of products and services that meet and exceed market and customer demands. In principle, all TQM systems are aimed at common goals. Specific TQM approaches aimed at achieving these goals are numerous. An element common to most TQM systems is assessments. In the narrow definition of quality, assessments are viewed as quality checks. Assessments are an integral element of an organization's quality system. Their role supports continuous learning. Assessment findings are regarded as valuable knowledge that represents an opportunity for process and organizational improvement. The paper provides an overview of how assessments play a key role in the TQM system of AT&T's United States Customer Business Unit (U.S. CBU). The paper also describes in greater detail how Baldrige-based and ISO 90001/TickIT assessments have contributed to the unit's successes.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"3 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":"129286142","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":"Throughput multiplication of wireless LANs for multimedia services: SDMA protocol design","authors":"Guanghan Xu, San-qi Li","doi":"10.1109/GLOCOM.1994.512996","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512996","url":null,"abstract":"Since the radio-frequency (RF) bandwidth allocated for wireless communications is a diminishing resource, wireless access to local area networks (LANs) has fundamental limitation on throughput and communication delays. With exponentially growing demand for multimedia services, this limitation becomes a bottleneck for expanding the wireless network capabilities. We exploit another resource, i.e., space, and design a new space division multiple access (SDMA) protocol to achieve throughput multiplication. The basic idea behind the SDMA protocol is that it exploits spatial diversity among different terminals to selectively transmit and receive signals in the same time slot and same frequency band. The only new requirements of this new protocol are an array of multiple antennas installed at a base station and advanced signal processing software to process the received data. The feasibility of the SDMA protocol is demonstrated by preliminary experimental studies.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"4 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":"125404664","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 set theory approach to the channel assignment problem","authors":"Xi-Ren Cao, J. Chuang","doi":"10.1109/GLOCOM.1994.513155","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513155","url":null,"abstract":"A set-theory framework on the channel assignment problem is presented in this paper. This framework provides a uniform interpretation for the two classes of channel assignment approaches: (1) the centralized assignment based on a predetermined \"channel separation matrix\", being employed in cellular frequency planning, and (2) the distributed assignment based on actual interference measurements, typically used in cordless telephony. Based on the insights gained, we further propose several algorithms that can be applied to both approaches. A set of simulations is presented to compare our algorithms with some existing centralized assignment algorithms. It is found that our method performs well with a simple procedure that can be easily applied in a distributed fashion for dynamic channel assignment which is an important subject in radio resource management for the emerging personal communications.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"62 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":"126637215","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":"Designing multi-hop optical networks using fixed wavelength transceivers","authors":"Sheau-Ru Tong, Darren Du","doi":"10.1109/GLOCOM.1994.513033","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513033","url":null,"abstract":"It has been recognized that the wavelength division multiplexing (WDM) scheme is one of the most promising ways to exploit the enormous bandwidth in a single mode optical fiber. We focus on using fixed wavelength transmitters and fixed wavelength receivers (which are considered to be more economically and technically feasible) to construct wavelength and time division multiplexed (WTDM) networks based on passive star couplers. We present some general principles used to construct such networks based on regular graphs. In particular, we discuss how to apply the principles to the following well-known regular graphs: perfect shuffle, generalized perfect shuffle and hypercube. The proposed algorithm supports a wider range of design alternatives than most of the previously proposed schemes.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"11 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":"123285148","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":"StarCore: a high-speed ATM switching system","authors":"N. Oba, K. Suzuki, H. Kobayashi, T. Nakamura","doi":"10.1109/GLOCOM.1994.513396","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513396","url":null,"abstract":"This paper presents a cell scheduling algorithm and its hardware implementation used in an ATM switching system, StarCore. Output contention is resolved by the hardware arbiters in a weighted round-robin fashion, which takes account of the bandwidths allocated to the virtual circuits as well as the priority classes. The arbiter consists of primitive logic gates, which are beneficial for CMOS VLSI implementation, and therefore it gives high-speed arbitration. The circuit simulations indicate that the time for the arbitration of a 64-input switch is 4.2 nsec using 0.7-/spl mu/m CMOS VLSI technology. The simulations show that StarCore provides lower cell loss probabilities than the conventional round-robin method.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"67 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":"121506309","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 analysis of a large-scale switching system for high-speed ATM networks","authors":"N. Mirfakhraei","doi":"10.1109/GLOCOM.1994.513397","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513397","url":null,"abstract":"This paper evaluates the performance of a proposed large-scale ATM multipoint switching system designed from a new technological perspective. The use of wafer-scale integration (WSI) technology is proposed which allows the entire system to be implemented on a single silicon wafer. Wafer-scale technology offers significant potential advantages such as higher reliability and performance with reduced power and cost, and is well-suited to switching systems. WSI permits us to consider this new design which would not be practical in a system using conventional technologies.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"30 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":"122214831","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}