{"title":"TCP/IP services over ATM satellite link-integration with DVB-S services using the multiresolution modulation","authors":"G. Reali, F. Frescura, G. Baruffa, S. Cacopardi","doi":"10.1109/GLOCOM.1998.775988","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775988","url":null,"abstract":"We propose to exploit the energy margin that can exist in satellite links to deliver multimedia traffic using multiresolution modulation techniques over the DVB-S. We propose an asymmetrical architecture, formed by a satellite forward link and a narrowband terrestrial reverse link, based on the N-ISDN. The ATM cell transport technique is adopted to support different QoS for different fluxes. In order to deliver the TCP/IP traffic, the additional delay on message delivery time suggests to modify the slow start and the congestion avoidance of the TCP. Our approach is based on the combination of a fixed window flow control at the transport layer with the ATM congestion control. The analysis shows that the system performance is satisfactory if some bounds on the transmit buffer size are respected and the spacing of the resource management cells is within a given range of values.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122928194","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}
Y. Ezaki, T. Kawasaki, N. Watanabe, K. Takashima, M. Katoh, A. Hakata, H. Kuniyoshi, M. Inami
{"title":"Viewing approaches to a large scale Internet backbone with ATM technology","authors":"Y. Ezaki, T. Kawasaki, N. Watanabe, K. Takashima, M. Katoh, A. Hakata, H. Kuniyoshi, M. Inami","doi":"10.1109/GLOCOM.1998.775800","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775800","url":null,"abstract":"The explosion of the Internet is still continuing due to the expansion of the number of users and multimedia services. To replace the conventional router network, a new paradigm of some multi-layer switching techniques are proposed in the standardization sectors and forums. We estimate the best solution for a very large scale Internet backbone, i.e. a nationwide scale. After estimating the size of the Internet in the future, we study the high speed internetworking solutions. We especially compare the multiprotocol label switching (MPLS) and CL (connectionless)-network from the view point of scalability and the size of the buffers of each node.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122493838","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":"Pro-active network management using data mining","authors":"K. Burn-Thornton, J. Garibaldi, A. Mahdi","doi":"10.1109/GLOCOM.1998.776914","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776914","url":null,"abstract":"Network providers are continually looking towards the future, perhaps the year 2002, when network management systems will possess the capability of proactively changing network configurations and traffic routing, in real-time, in order to optimise traffic throughput in the network, and hence maximise their profit margin. However, the major barrier to the production of truly real-time pro-active network management systems appears to be the technology, or technique, which will enable the vast amount of network performance data, which is routinely collected, to be analysed, and for pro-active system changes to be made, in real-time. The rapidly emerging field of data mining appears to offer a solution to this problem. We discuss the potential suitability of the four main data mining categories of data mining algorithms, to the task of analysing network performance data in true real-time. Hence we provide a discussion regarding the classes of data mining algorithm which will provide the basis for the provision of a real-time pro-active network management system by virtue of their ability to rapidly mine vast amounts of data.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122970310","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 efficient communication scheme for multicasting on ATM networks","authors":"T. Sheu, W. Peng","doi":"10.1109/GLOCOM.1998.775954","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775954","url":null,"abstract":"A novel multicast communication scheme (MCS) on ATM networks is presented is this paper. While the core of the MCS is a constrained Bellman-Ford algorithm, an innovative design, referred to as a logical local central node, or LLCN, is embedded into the algorithm to effectively select a link path with the lowest cost from a source node to each multicast group member. An end-to-end delay bound is used to prevent any selected link path from exceeding this constraint. We evaluate the performance of the MCS by deriving a blocking probability as a function of multicast group members. From the blocking probability, we calculate the percentage of successful established sessions (PSES) on an ATM network. For the purpose of verification, a simulator is built. From the simulation, we have shown that the MCS can significantly reduce the connection setup time, the end-to-end delay variations, the total link cost consumed, and the average number of nodes required for multicasting over an ATM network.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114607288","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":"Non-stop processor field upgrading with layered software architecture","authors":"H. Nakamura, S. Futagami","doi":"10.1109/GLOCOM.1998.776659","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776659","url":null,"abstract":"Switching systems making up a telecommunications network are faced with a rising performance curve of requirements for coping with a growing diversity of advanced service needs. One effective performance-boosting measure is to upgrade the processor, taking advantage of continual advances in general-purpose microprocessor technology. In the case of a switching node, techniques must be established for upgrading the processor without interrupting normal service. This paper proposes a technique for performing processor upgrades in a system that adopts a layered software architecture aimed at multivendor environment. The effectiveness of this technique is confirmed through application to an actual switching node.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121968318","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":"Understanding end-to-end Internet traffic dynamics","authors":"J. Andrén, M. Hilding, D. Veitch","doi":"10.1109/GLOCOM.1998.776899","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776899","url":null,"abstract":"An investigative tool for the direct study of end-to-end Internet traffic is presented, featuring a hybrid timing mechanism allowing high resolution time-stamping of packet departures in a UNIX environment. A method for the elimination of timing artifacts due to variations in clock rates, essential for the study of delay, is also presented. A preliminary report is gives on the detailed structure of end-to-end delay and loss processes using the tool. A number of consistent properties of interest are found including long range dependence in delay and a very simple structure for loss.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116607721","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":"Minimising channel interference in real cellular radio networks","authors":"K. A. Smith, B. Kim, G. Sargent","doi":"10.1109/GLOCOM.1998.775923","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775923","url":null,"abstract":"This paper considers the channel assignment problem in a real cellular radio network in Jakarta, Indonesia. Differences between the channel assignment problem considered in the literature and the requirements of the real system are discussed. A heuristic method for determining. An unknown set of interference rules is proposed and simulated annealing is used to obtain a channel assignment which satisfies these rules. Results are presented which demonstrate the potential of the technique in terms of reduced interference levels and a vast reduction in computation time.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753847","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 growable shared-memory based multicast ATM switch","authors":"J. D. Ho, N. K. Sharma","doi":"10.1109/GLOCOM.1998.775951","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775951","url":null,"abstract":"This paper presents an ATM switch that fulfils the architectural and service requirements of large-scale ATM switches. The proposed network is based on a 3-stage Clos network, with shared-memory ATM switches at the input and output stages to provide optimal cell loss and delay performance. The modularity of the Clos architecture means that the network is inherently growable and has a high level of fault-tolerance. The network uses small sized shared-memory switches, so that the network can be scaled to large sizes without any technological constraints. The proposed network can support multicast traffic because of the multicasting functionality within shared-memory switches. Unlike other Clos based networks, this paper proposes a simple distributive routing algorithm for any sized network. Distributive multicasting allows multiple multicast cells to be routed simultaneously through the network. Various network configurations are simulated for their cell loss and cell delay performance. The resulting cell loss rate in the proposed network is well below that of the completely-shared ATM switch and the multicast cell delays are drastically improved.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128427598","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 role model for telecommunication networks","authors":"J. Apfelbeck","doi":"10.1109/GLOCOM.1998.776915","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776915","url":null,"abstract":"This paper introduces a role model that maps tasks in a telecommunication network onto roles. These roles are grouped under the headlines of access, transport, service and mediation. Each role is defined by tasks, requirements and relations to other roles. For any role several instances may exist that are filled by competing players. This yields consequences for the interaction and cooperation of players. First, one needs to define how to select one out of a group of alternative players. Second, the multilateral access to resources and services must be flexibly controlled. Third, an agreement about the means for the mutual billing of players must be reached. A sketch of alternative concepts for these assignments is given.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128467170","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":"Digital I/Q imbalance compensation in a low-IF receiver","authors":"J. Glas","doi":"10.1109/GLOCOM.1998.776582","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776582","url":null,"abstract":"Double low-IF receiver architectures avoid the need for expensive image-reject and channel selection filters and so reduce cost. This approach however introduces the need for an accurate in-phase and quadrature version of the first local oscillator. We present a way to digitally measure amplitude and phase imbalances and compensate for them. Simulations show image-reject values round 50 dB with amplitude imbalances of more than 10% and phase imbalances of more than 10 degrees. Although we focus on GSM-like applications, the algorithms are suitable for other low-IF systems as well.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128257593","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}