{"title":"Performance evaluation of multipoint communication on HIPPI over ATM networks","authors":"K. Kawahara, H. Gotoh, H. Sunahara, Y. Oie","doi":"10.1109/GLOCOM.1998.776921","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776921","url":null,"abstract":"The high performance parallel interface (HIPPI) is primarily a channel technique and provides a simplex point-to-point interface for transferring data at a peak rate of 800 or 1600 Mbps over distances of up to 25 meters. In order to extend the use of HIPPI from a channel solution to a networking solution, the physical limitation of HIPPI must be solved. The HIPPI-ATM mapping can be one of the possible solutions and allow communication over a relatively long distance by using HIPPI-ATM converters. We first suggest that the multipoint-to-multipoint communication of HIPPI over ATM networks does not perform well although an unique flow control between source-site and destination-site HIPPI-ATM converters is applied on each connection. In order to effectively establish multipoint-to-multipoint communication, we thus propose additional flow control schemes on HIPPI over ATM networks, that is, a peak-rate control scheme and a connection control scheme. We further formulate both throughput and packet transmission delay performance under these schemes and compare the performance and the complexity of the implementation of both schemes.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131137143","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":"Load characterization of a time-and volume-sensitive accounting meter","authors":"K.C. Budka, Hong Jiang","doi":"10.1109/GLOCOM.1998.776632","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776632","url":null,"abstract":"We analyze the performance of a usage metering scheme for transaction-oriented network services. Exact and approximate analytical solutions are presented characterizing the processing, storage, and transmission bandwidth required by accounting meters as a function of the number of users in the system, usage characteristics, and the meters' tunable parameters. The results can be used to help network operators and architects property dimension network resources needed to collect and process accounting data.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"43 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":"114998837","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 receiver-oriented message scheduling algorithm for WDM lightwave networks","authors":"M. Maode, B. Hamidzadeh, M. Hamdi","doi":"10.1109/GLOCOM.1998.775946","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775946","url":null,"abstract":"In scheduling the transmission of messages in a WDM network, we are facing not only the channel assignment problem but also message sequencing problem. We propose and evaluate a new reservation-based message scheduling algorithm for single-hop, WDM passive star lightwave network which addresses both the assignment aspect and the sequencing aspect of the problem. We compare the performance of the algorithm which only addresses the channel assignment issue with the performance of our new algorithm theoretically and experimentally and demonstrate that our new algorithm has significant improvement over the performance of a WDM network with a scheduling algorithm that does not consider the message sequencing problem. As a result, we anticipate that this research can open new directions into the problem of message scheduling on WDM networks.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"32 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":"115597491","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 packet routing strategy for ultra-fast photonic networks","authors":"F. Chevalier, D. Cotter, D. Harle","doi":"10.1109/GLOCOM.1998.775944","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775944","url":null,"abstract":"The authors present and analyse a new approach to packet routing in ultra-fast networks, based on global-synchronised packet switching in the optical domain. This approach combines several key advantages: very simple processing at the routing nodes (single header-word recognition); packet transmission time dominated by the speed of light delay; contention resolution at the fringes of the network with no need for buffering or deflection strategies within the optical layer; freedom from deadlock and livelock; zero delay variation; packets delivered in the correct sequence. In this paper, the technique is fully described and a performance evaluation for a Manhattan street network (MSN) are presented.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"136 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":"116716351","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":"Investigation of IMBE parameters' sensitivity to noise","authors":"Z. Jinjie, C. Zhigang","doi":"10.1109/GLOCOM.1998.776007","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776007","url":null,"abstract":"In modern digital communication systems, more and more vocoders are used. At the same time improving their resistance to noise also becomes an important issue since their input speech is often unavoidably corrupted by noise when they work in real world. This paper investigates the improved multi-band excitation (IMBE) parameters' sensitivity to white noise and the parameter error's effect on the quality of synthesised speech. As a result a key parameter is found which contributes most to the heavy distortion of the synthesised speech in a noisy environment. Then the possibility of using speech enhancement to reduce such distortion is examined. Finally the results are presented when MMSE-based speech enhancement is applied to the IMBE vocoder.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"33 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":"116794652","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 single-chip FPGA implementation of the data encryption standard (DES) algorithm","authors":"K. Wong, M. Wark, E. Dawson","doi":"10.1109/GLOCOM.1998.776849","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776849","url":null,"abstract":"This paper describes a single-chip implementation of the data encryption standard (DES) using Xilinx XC4000 series field programmable gate array technology under the XACTstep design flow integration system. The implementation details for key scheduling, S-boxes, permutations and the round-function are described. The design process included schematic design, functional and timing simulation and design verification. The final design used 224 combinational logic blocks (CLBs) and 54 input/output blocks (IOBs) and has an encryption speed of 26.7 Mbps.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"2 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":"117342863","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":"Service scheduling and CAC for QoS guarantee in future PCS","authors":"J. X. Qiu, J. Mark","doi":"10.1109/GLOCOM.1998.775897","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775897","url":null,"abstract":"A distributed polling and channel reservation scheduling algorithm and a call admission control (CAC) algorithm, which make uses of the scheduling algorithm, for intra-cell resource allocation, and a novel virtual cluster allocation with scheduled retry (VCA/SR) algorithm for inter-cell resource reservation are proposed. The interworking of the algorithms ensures optimal channel utilization and reduces forced connection dropping probability for multimedia applications in a wireless communication environment. The major strength of combining service scheduling and CAC to form a complete system is to guarantee a predefined quality of service to all classes of traffic without making conflicting assumptions about each other.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"168 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120891267","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":"Decomposition of network of queues with self-similar traffic","authors":"Tat-Keung Chan, V. Li","doi":"10.1109/GLOCOM.1998.776623","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776623","url":null,"abstract":"Jackson's (1957) network of queues model greatly simplifies the performance analysis of telecommunication networks with Poisson traffic arrivals and exponential service times. It reduces the analysis of a network into the analysis of individual communication links, each of which may be modeled as an M/M/m queue. Motivation by the growing significance of self-similar traffic in modeling broadband network traffic, we propose a new network of queued model for telecommunication networks. Our model resembles Jackson's model except that the arrival is self-similar and the service time is deterministic. it captures the characteristics of modern high speed cell-based networks. We hypothesize a result analogous to Jackson's theorem, that each node of this network model behaves as a G/D/1 queue with self-similar arrival. Based on this hypothesis, many network-wide performance measures , such as the end-to-end delay, can be evaluated in a simple fashion. Our hypothesis is strongly supported by three facts, namely the sum of independent self-similar processes, the random splitting of self-similar processes, and the output process of a deterministic service time queue with self-similar input are all self-similar.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"49 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":"120997972","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}
R. Sánchez, F. Wahhab, J.B. Evans, V. Frost, G. Minden
{"title":"Design and evaluation of an adaptive data link control protocol for wireless ATM networks","authors":"R. Sánchez, F. Wahhab, J.B. Evans, V. Frost, G. Minden","doi":"10.1109/GLOCOM.1998.775931","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775931","url":null,"abstract":"This paper describes the design of an adaptive data link control (DLC) protocol for wireless ATM networks and measures its performance in a locally deployed testbed implemented by the RDRN (Rapidly Deployable Radio Network) project. Our DLC protocol provides quality of service (QoS) support for ATM-based virtual connections by distinguishing between delay-sensitive and loss-sensitive traffic over the wireless portion of the network. Delay sensitive traffic that is received with errors is dropped while loss-sensitive traffic that is lost or received with errors is selectively retransmitted using a go-back-N ARQ scheme. To overcome the unreliability of a wireless link, the DLC protocol exploits adaptation techniques that utilize channel state information to maximize the performance of individual connections. Our experiments shows that the adaptive data link control protocol under consideration is more robust at dealing with lossy wireless links than its non-adaptive counterpart version; we have achieved TCP/IP throughput speedups of up to 4 times in our adaptive protocol implementation for virtual connections established over both delay-sensitive and loss-sensitive channels across impaired wireless links.","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":"121121944","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":"Block truncation coding using neural network-based vector quantization for image compression","authors":"C. Angelakis, G.A. Maragakis, P. Stavroulakis","doi":"10.1109/GLOCOM.1998.776853","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776853","url":null,"abstract":"A new method is introduced by which a block truncation coder (BTC) is cascaded with a neural network-based vector quantizer (VQ). The proposed coder is very attractive for real time image transmission due to its simplicity and performance. It preserves important characteristics of the image, while cascading the BTC coder with a VQ results in high compression ratios of about 0.5 bpp without significantly increasing the coding time, due to fast coding look-up tables of the VQs. Additional advantages are fast codebook design and reduction of the codebook size required for a given reconstructed image quality.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"40 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":"127138996","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}