D. Remondo, R. Srinivasan, V. Nicola, W. van Etten, H. Tattje
{"title":"Performance evaluation and parameter optimization of wavelength division multiplexing networks with adaptive importance sampling techniques","authors":"D. Remondo, R. Srinivasan, V. Nicola, W. van Etten, H. Tattje","doi":"10.1109/GLOCOM.1998.775948","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775948","url":null,"abstract":"In this paper new adaptive importance sampling techniques are applied to the performance evaluation and parameter optimization of wavelength division multiplexing (WDM) network impaired by crosstalk in an optical cross-connect. Worst-case analysis is carried out including all the beat noise terms originated by in-band crosstalk. Both input signal hypotheses are considered. The accurate bit-error-rate estimates, which are obtained in short run-times, indicate that the influence of crosstalk is much lower than that predicted by previous analyses. This finding has a strong impact on the design of WDM networks. Besides, a method is used to optimize the detection threshold, which turns out to improve the system performance significantly. The presented techniques also allow us to determine the power penalty due to the introduction of additional WDM channels.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568539","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":"Feedback rate control with congestion prediction by edge nodes in ATM-WAN","authors":"H. Hasegawa, N. Yamanaka, K. Shiomoto","doi":"10.1109/GLOCOM.1998.776650","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776650","url":null,"abstract":"This paper proposes a new adaptive remote rate control based on extrapolation called AREX. AREX does not require a high-speed switching node to have high calculation load. Consequently, transit switches with high-speed interface do not always need to have high calculation power. As a result rate control can be implemented easily in a WAN. AREX reduces the major problems of feedback rate control, inaccuracy of feedback information and large necessary buffer space caused by long propagation delay. In AREX, a high-speed transit switching node only observes the link utilization ratio of the output VP and notifies it to upstream nodes. Local switching nodes with spare calculation power calculate and control the output rate of each VC. Because the admissible cell rate of each VC is calculated by local switches, ABR service can be emulated there. This paper describes the mechanisms of AREX and discusses the function form that determines its characteristics. AREX tries to converge utilization to the target value. The relationship between target value and overload probability is clarified for network management. The performance of ABR emulated by APEX is evaluated by computer simulation. The results show that AREX provides high throughput and requires less buffer capacity even in a network with long propagation delay.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"27 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":"123743743","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 ATM-based optical code division multiplexing transport network using coherent ultrashort pulses","authors":"K. Kamakura, T. Ohtsuki, I. Sasase","doi":"10.1109/GLOCOM.1998.775695","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775695","url":null,"abstract":"We investigate the feasibility of introducing optical code division multiplexing (OCDM) technique in the path layer and propose an ATM-based OCDM network architecture using ultrashort light pulses. In the proposed network, all the processes of cells in the path layer operate in the optical domain prior to reaching the final destination node. Since each bit can be addressed individually with this technique, the realization of ATM protocols can be easily ensured. Optical technology can be reliably introduced in the path layer and an optical cross-connect (OXC) becomes an important component because it emulates the code conversion as the switching function. The OXC not only provides asynchronous access to each optical code path (OCP) but also has a dynamic bandwidth allocation capability. A lookup table is used in the switching and updated through network management functions. We examine the performance considering different parameters and discuss methods to improve the performance.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"35 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":"131478969","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 knockout packet switch with batcher network for multiple classes","authors":"Y. Nishino, I. Sasase","doi":"10.1109/GLOCOM.1998.775763","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775763","url":null,"abstract":"A knockout packet switch with batcher network for multiple classes is proposed in order to satisfy different requirements for loss probability of packets with multiple classes. The proposed model sorts packets according to the small identification number of a priority class by batcher network. Hence, it is possible to handle packets with multiple classes. The proposed switch consists of N modules structured with filters, batcher network and output buffers. As a result, we show that the proposed model is useful to satisfy different requirements for packet loss probability with multiple classes.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"18 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":"134052493","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":"Delay analysis for CBR traffic in static-priority scheduling: single-node and heterogeneous CBR traffic case","authors":"K. Iida, T. Takine, H. Sunahara, Y. Oie","doi":"10.1109/GLOCOM.1998.776922","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776922","url":null,"abstract":"In the integrated service networks, the real-time traffic and the non-real-time traffic share the network resources so that one can affect the quality of another and vice versa. In this context, it is very crucial to develop some mechanism to guarantee the quality-of-service (QoS) required by the real-time traffic. In this paper, we analyze the delay time of CBR packets from real-time sources when CBR packets have the priority over UBR packets in a manner that UBR packets are serviced only if no CBR packets are waiting in the buffer. There are two types of CBR packets; i.e., they are different in their transmission rate and/or packet length. In this sense, the case treated is called the heterogeneous case. We obtain various numerical results on the statistical bound on delay time such as the 99.9-percentile delay and compare it with the deterministic bound. By the comparison, we show that call admission control (CAC) based upon the statistical bound is very effective in using the network resources efficiently when CBR packets can tolerate some loss due to late arrival. We also examine whether the delay time distribution in the heterogeneous case can be approximated by that of some homogeneous cases.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"72 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":"123046797","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":"TCP over end-to-end ABR: a study of TCP performance with end-to-end rate control and stochastic available capacity","authors":"S. Shakkottai, A. Kumar","doi":"10.1109/GLOCOM.1998.775784","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775784","url":null,"abstract":"We develop an analysis in which we compare the performance of TCP, with and without end-to-end ATM/ABR transport, when the network bandwidth is shared with time-varying CBR/VBR traffic. We show that, over ABR, the performance of TCP improves by more than 20% if the network bottleneck bandwidth variations are slow. Further, we find that TCP over ABR is relatively insensitive to the bottleneck buffer size. We then validate the analytical results with results from a hybrid simulation on a TCP testbed that we have developed. We use this simulation to study two mechanisms for bottleneck rate feedback at the ABR level. We find that an effective capacity based feedback is adaptive to the rate of bandwidth variations at the bottleneck link, and thus yields good performance over a wide range of rates of bottleneck bandwidth variation.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"1 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":"122545497","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":"Direct-detection optical asynchronous CDMA systems with double optical hard-limiters: APD noise and thermal noise","authors":"T. Ohtsuki","doi":"10.1109/GLOCOM.1998.775737","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775737","url":null,"abstract":"Performance of optical asynchronous code-division multiple-access (CDMA) systems with double optical hard-limiters is analyzed in the presence of avalanche photodiode (APD) noise and thermal noise. The following effects on the optimal thresholds of double optical hard-limiters and on-off keying (OOK) decoder are clarified: sequence codes, the number of users, the received laser power, and the modulation extinction ratio. The results show that the optical asynchronous CDMA systems with double optical hard-limiters have good performance in the presence of the APD noise and the thermal noise even when the number of simultaneous users is large. Moreover the optical asynchronous CDMA systems with double optical hard-limiters are shown to be practical in the respect of setting optimal thresholds.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"66 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":"125995208","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":"DTM: new dynamic transfer mode using dynamically assigned short-hold time-slot relay","authors":"N. Yamanaka, K. Shiomoto","doi":"10.1109/GLOCOM.1998.775759","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775759","url":null,"abstract":"This paper proposes a new high-speed network architecture called dynamic transfer mode, DTM. At the entrance of the DTM network, destination addresses such as IP addresses are converted into DTM routing information and attached to the packet header. In a DTM network, a connection is set up on-the-fly by sending a series of routing link identifiers to the destination, so burst data transfers like WWW traffic are efficiently carried. A connection between adjacent nodes is created and released dynamically within the burst transfer period. This yields higher statistical multiplexing gain and improved bandwidth efficiency compared to with conventional STM. Time division multiplexing is utilized so there is no delay jitter or cell loss, which are major drawbacks of asynchronous transfer mode. This paper analyzes the performance of a DTM network and describes an implemented switching system. Because a DTM network uses source-routing and passive STM switching, it simplifies the core transit switch while localizing intelligence to edge nodes. A simplified core transit switch is well suited for future high-speed backbone networks.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"18 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":"126650808","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":"Proposal of secure remote access using encryption","authors":"T. Kawase, A. Watanabe, I. Sasase","doi":"10.1109/GLOCOM.1998.776856","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.776856","url":null,"abstract":"On a remote access environment, strong authentication of the remote user is required since the danger of stealing of authentication devices is very high. We propose a secure remote access system appropriate for the remote access environment. Two authentication schemes are used to reduce the danger of stealing of authentication devices. One is the authentication using the public key cryptography. The public key cryptography is stored in the IC card of the remote user and the IC card is locked by the PIN. The other scheme is the one-time pattern authentication which is a sort of challenge and response. Simultaneously, simple key delivery is performed with these authentication protocol. An evaluation of our proposed scheme proves the feasibility and the efficiency as compared with the conventional system using the on-time password and Diffie-Hellman (1976) key agreement protocol.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"6 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":"130347306","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 of multicode direct-detection optical CDMA systems","authors":"T. Ohtsuki","doi":"10.1109/GLOCOM.1998.775734","DOIUrl":"https://doi.org/10.1109/GLOCOM.1998.775734","url":null,"abstract":"We analyze the performance of multicode direct-detection optical code-division multiple-access (CDMA) systems supporting several kinds of data with different bit rates: each user is assigned a set of sequence codes generated from time-shifted versions of optical orthogonal codes (OOCs). We analyze the performance of multicode direct-detection optical CDMA systems by using the mean value of the maximum cross-correlation between a sequence code and a set of sequence codes. We evaluate the performance of the systems under a fixed bit rate for each sequence code. Our results show that the multicode direct-detection optical CDMA system can support several kinds of data with different bit rates in optical fiber networks. Moreover, we show that the multicode direct-detection optical CDMA system has a better performance than a system using one sequence code for each user at the same bit and chip rates.","PeriodicalId":414137,"journal":{"name":"IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)","volume":"12 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":"126016032","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}