M. Grammatikakis, J. Jwo, M. Kraetzl, Suh-Hui Wang
{"title":"Dynamic and static packet routing on symmetric communication networks","authors":"M. Grammatikakis, J. Jwo, M. Kraetzl, Suh-Hui Wang","doi":"10.1109/GLOCOM.1994.513039","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513039","url":null,"abstract":"For dynamic routing on any vertex and edge symmetric topology we relate network contention to the packet generation rate, and the degree and average distance of the underlying topology. As a direct consequence we show that the star graph becomes saturated as the packet generating rate approaches one. Also, for graphs of approximately the same order, the average delay of a packet routed on an alternating-group graph is smaller than the corresponding delays on the hypercube and the star graph. Similar conclusions are drawn from comparisons based on various static permutation routing problems. Our theoretical results compare favorably with simulations of considerably large systems.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"26 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":"124996776","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":"Application of Kalman filter in high-speed networks","authors":"A. Kolarov, A. Atai, J. Hui","doi":"10.1109/GLOCOM.1994.513593","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513593","url":null,"abstract":"The problems of traffic management and control in multiple-service networks are subjects of considerable interest. We investigate traffic observation and prediction techniques in high speed heterogeneous services networks, which carry large traffic volumes and have large delay-bandwidth products. Such techniques are necessary for feedback flow control. The state dynamics and network perturbations are modeled for the feedback flow control application. Models are linear and derived from assumptions of classical queueing theory. Kalman filtering is used for traffic estimation. Estimation errors are obtained through computation and simulation.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"134 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":"115252034","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 management system over distributed reactive model","authors":"Tamiya Ochiai, S.U. Honig","doi":"10.1109/GLOCOM.1994.513407","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513407","url":null,"abstract":"This paper proposes a distributed reactive system model as the basis for building a network management system. To confirm the effectiveness of the proposal, the authors have utilized an existing distributed reactive system toolkit called Meta to implement an experimental network management system. The experimental system provides high-level interfaces for monitoring and controlling network components. It also supports reliable communication over distributed nodes. Preliminary evaluation of the system shows that critical network management functions are provided within an appropriate response time, with small development cost and easy system modification.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"129 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":"122909659","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 merging network scheme that builds large sorting networks","authors":"K. Law, A. Leon-Garcia","doi":"10.1109/GLOCOM.1994.513317","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513317","url":null,"abstract":"We present a new scheme for building large sorting networks. The scheme is recursive in the sense of indicating how to build a large sorting network from modules of smaller sorting and merging networks. The scheme involves a regular wiring pattern between modules. When the scheme is applied to 2/spl times/2 comparison elements, we obtain a new sorting network with a wiring pattern that has fewer cross-over points than Batcher's (1968) networks. When the scheme is applied to modules of a given size, for example 32/spl times/32 single-chip sorters, then we obtain a multi-chip implementation of larger sorting networks. Thus the scheme presented allows us to circumvent technology limitations that currently limit the size of sorters that are implementable.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"85 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":"122944546","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":"Computing architecture and technologies to support integrated management","authors":"J. Tsay","doi":"10.1109/GLOCOM.1994.513406","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513406","url":null,"abstract":"A telecommunications company, usually a network as well as a service provider, must have a cost-effective, service-ready OS (operations system) infrastructure to support network and services operations and management. The TMN (Telecommunications Management Network) defines OSF (operations system function block) for business, service, and network management in a hierarchy structure. However, these management functions need to access the same network/services databases and OS applications. This report presents a client-server architecture, consisting of the client integration layer and the OS/database server layer, to implement the concept of functional TMN hierarchy. The architecture, enabled by proven computing technologies, can effectively and efficiently support both the management and network infrastructures. Furthermore, it can support a service creation environment for improving new services' time-to-market, without developing new OS systems.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"93 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":"121905843","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":"Hopfield neural networks for dynamic channel allocation in mobile communication systems","authors":"E. D. Re, R. Fantacci, L. Ronga, G. Giambene","doi":"10.1109/GLOCOM.1994.513158","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513158","url":null,"abstract":"The increasing demand of new services in the field of radio-mobile communications is in contrast with the capacity constraints imposed by the present communications medias. For this reason the use of techniques capable of ensuring that the spectrum assigned to mobile communications will be better exploited, is gaining an ever increasing importance. The search for an effective channel allocation technique along with the attempt to lower the computational costs of the algorithm which performs such a technique, was the aim to be achieved in our research.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"31 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":"122136759","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":"Voice waveform vector quantization using a competitive algorithm","authors":"R.M.V. Franca, B. Neto","doi":"10.1109/GLOCOM.1994.512719","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512719","url":null,"abstract":"A competitive algorithm is used to train dictionaries for voice waveform vector quantization with a phonetically balanced group of sentences as training sequence. The algorithm follows the standard unsupervised competitive rule used in training neural networks and it is suited to most distortion measures and to any practical dimension. An investigation is carried out to find the best range for the algorithm's parameters and its performance is compared to the results obtained when using the LBG algorithm with the same input data. The testing sequence is another phonetically balanced group of sentences uttered by different speakers.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"52 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":"117021487","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 joint virtual path assignment and virtual circuit routing problem in ATM networks","authors":"K. Cheng, F. Lin","doi":"10.1109/GLOCOM.1994.512701","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.512701","url":null,"abstract":"Among different transport techniques proposed to implement B-ISDN, asynchronous transfer mode (ATM) is considered to be the most promising one and has been standardized by the CClTT due to its efficiency and flexibility. The use of virtual paths in ATM networks reduces the call set-up delays, simplifies the hardware in the transit nodes and provides simple virtual circuit admission control. However, it also reduces the degree of capacity sharing and, thus, increases the call blocking rate for most cases. In this paper, we consider the following problem: given a network topology, link capacity of each physical link, cell-level performance objectives and traffic requirement of each origin-destination pair, we want to jointly determine the following four design variables: (1) the node pairs that should have virtual paths, (2) the route of each virtual path, (3) the bandwidth assigned to each virtual path and (4) the routing assignment for each virtual circuit (call), to minimize the expected call blocking rate subject to call set-up time constraints. The problem is formulated as a nonlinear nondifferentiable combinatorial optimization problem and an efficient two-phase solution procedure is proposed. Experimental results are presented to show the trade-offs between throughput and call set-up time thresholds.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"2 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":"129589585","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":"Connectionless switching by asynchronous Banyan networks","authors":"A. Pattavina, C. Bison","doi":"10.1109/GLOCOM.1994.513560","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513560","url":null,"abstract":"Multistage networks built out of small switching elements with internal buffers, called asynchronous Banyan networks, are proposed in this paper to perform the switching function of variable-size packets in a connectionless network environment. These structures are suitable to be adopted both as the connectionless server of ATM switching nodes and as a switching node of a fully connectionless broadband network, such as a typical LAN/MAN environment. Asynchronous Banyan networks, which are provided with internal buffers in each switching element, exploit the packet self-routing technique by means of a self-routing tag attached to each packet. Thus, owing to such distributed processing capability, these networks are able to carry the loads typical of a broadband environment. Internal handshaking protocols are defined and different types of internal queueing strategies are studied for the Banyan networks.","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":"129715185","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 impact of differential \"phase\" measurement on the characteristics of waiting time jitter","authors":"S. S. Abeysekera, A. Cantoni","doi":"10.1109/GLOCOM.1994.513600","DOIUrl":"https://doi.org/10.1109/GLOCOM.1994.513600","url":null,"abstract":"The operation of clock rate adaptation circuits of network synchronizers is based on measuring the \"phase\" difference between the input and output data streams. In the literature on the analysis of synchronizer performance, it has been assumed that this \"phase\" difference is a continuous time function. In practice, this is not the case since the data are written and read from a buffer at discrete times. In the paper a model is presented to characterize the synchronizer under discrete time \"phase\" measurements. Via the simulation of waiting time jitter arising from this model, it can be demonstrated that a discrete time \"phase\" measurement degrades the performance of jitter reduction techniques that have been proposed in the literature. The performance of a technique which employs a fast clock to overcome this degradation, is discussed in the paper.","PeriodicalId":323626,"journal":{"name":"1994 IEEE GLOBECOM. Communications: The Global Bridge","volume":"56 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":"124785883","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}