H. Takanashi, H. Kayama, Masataka Iizuka, M. Morikura
{"title":"Enhanced capture effect for slotted ALOHA employing transmission power control corresponding to offered traffic","authors":"H. Takanashi, H. Kayama, Masataka Iizuka, M. Morikura","doi":"10.1109/ICC.1998.683103","DOIUrl":"https://doi.org/10.1109/ICC.1998.683103","url":null,"abstract":"This paper presents a novel slotted ALOHA that has an enhanced capture effect even if heavy traffic is offered. Capture event success probability is improved by controlling the probability of high power transmission permission. This makes it possible to capture the other packets if only one station increases its transmission power. This control method is the key issue of this paper since the capture effect is one of the most promising ways to achieve high throughput without interference (collision) detection/carrier sense. We modified the conventional slotted ALOHA to yield a practical and useful packet transmission scheme. This modified slotted ALOHA has a finite buffer that stores backlog packets. Heavy traffic may cause buffer overflow which implies packet loss. When a station of a wireless LAN or another data terminal intends to send a packet, its transmission power is controlled by the number of stations in an area that covers the same cell shaped by an access point. As a result, only one of the packets can be successfully sent by capturing the other packets. This capture effect is improved significantly by the proposed scheme. This modified and enhanced slotted ALOHA achieves the maximum throughput of 0.74, which is higher than the 0.47 achieved by transmission power control in a previous paper. This is double the throughput of the original slotted ALOHA.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133636959","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":"Fault management for adjustable pre-allocation wavelength division multi-access systems","authors":"Chen-Ken Ko, L. Huang, S. Kuo","doi":"10.1109/ICC.1998.682925","DOIUrl":"https://doi.org/10.1109/ICC.1998.682925","url":null,"abstract":"Fault management is an essential function of the network management to secure continuous and efficient operations of a network system. We initiate the fault management study for the adjustable pre-allocation wavelength division multi-access system (AP-WDMA). The subjects investigated include fault detection, fault location, and fault tolerant design. Based on the fault probability consideration for each station, two models are presented. One treats each station as a whole unit and the other further divides each station into 5 parts. For both models, the fault detection and fault location are performed in a two-pass operation. Finally, a fault-tolerant design for the AP-WDMA is proposed. A 2-stage reconfiguration algorithm is also provided in this study.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134609035","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":"Robust adaptive array for wireless communications","authors":"Xiaodong Wang, H. Poor","doi":"10.1109/ICC.1998.683082","DOIUrl":"https://doi.org/10.1109/ICC.1998.683082","url":null,"abstract":"A robust technique is developed for array response estimation and array combining in the presence of impulsive noise. These techniques are nonlinear in nature and are based on the M-estimation method. It is seen that the proposed robust method offers substantial performance gain over linear techniques in non-Gaussian noise, with little attendant increase in computational complexity. Extension of the proposed technique to dispersive channels with intersymbol interference is also addressed.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131690152","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":"Call admission control policy for capacity-varying networks with increasing failure rate holding time distributions","authors":"J. Siwko, I. Rubin","doi":"10.1109/ICC.1998.685126","DOIUrl":"https://doi.org/10.1109/ICC.1998.685126","url":null,"abstract":"LEO satellite systems and many other connection-oriented networks have capacities which vary over time. Call admission control (CAC) policies which only use current capacity information may lead to intolerable dropping of admitted calls whenever network capacity decreases. We introduce a CAC policy for capacity-varying networks with call holding times that have increasing failure rate distributions. This policy uses knowledge about future capacity changes to admit only calls which can be adequately serviced not just at admission time, but throughout the call's lifetime. Using this policy, it is possible to trade off some additional call request blocking in order to greatly reduce call dropping. This new policy is optimal in the sense of blocking the fewest calls and thus achieving the highest throughput of any policy that meets, on an individual call basis, a given dropping probability threshold under any fixed order dropping policy.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127428662","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":"Analysis of self noise in a clock recovery systems with a high-order nonlinearity","authors":"E. Panayirci","doi":"10.1109/ICC.1998.683023","DOIUrl":"https://doi.org/10.1109/ICC.1998.683023","url":null,"abstract":"This paper presents a new technique to compute efficiently the I and Q spectra, and the I-Q cross-spectrum of the self noise appearing at the output of the zero-memory, high order nonlinear device employed in a clock recovery system. It is known that these spectra play an important role in the phase jitter performance of the clock regenerator. The results are very general and applicable to many cases of practical interest. The numerical example provided shows that the new approach yields very accurate results and is much faster that the usual computer simulation method.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115679723","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":"Two level access control strategy for multimedia CDMA","authors":"P. R. Larijani, R. Hafez, I. Lambadaris","doi":"10.1109/ICC.1998.682906","DOIUrl":"https://doi.org/10.1109/ICC.1998.682906","url":null,"abstract":"In this paper we propose a new technique for access control in an outdoor CDMA cell supporting multimedia traffic. The proposed scheme controls the flow of the traffic at both packet and call level. Delay scheduling at packet level is employed to minimize the variance of intra-cell interference while a call admission control based on a modified equivalent bandwidth technique exploits the minimized interference and reduces the call blocking probability. It is shown that the proposed scheme allows efficient integration of voice and low bit rate video in a CDMA cell with imperfect power control.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124230857","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 scene-based generalized Markov chain model for VBR video traffic","authors":"G. Chiruvolu, T. Das, R. Sankar, N. Ranganathan","doi":"10.1109/ICC.1998.682940","DOIUrl":"https://doi.org/10.1109/ICC.1998.682940","url":null,"abstract":"The efficient transportation of real-time variable bit rate (VBR) video traffic in high-speed networks has been an area of active research. The VBR video traffic characteristics having heavy tail distribution, high variance and correlation properties are quite complex. These characteristics of VBR video (MPEG) traces are studied and a new traffic model for VBR video is proposed. A modulating Markov chain model is employed in which each state represents the I, B, P frames (pictures) of a group of pictures (GOP). From the video traces, we classify the scenes (collection of GOPs) into high- and low-activity scenes, based on the average number of bits generated during the scenes. The scene activity is modeled by an auxiliary Markov chain wherein each state represents the degree of activity (high/low). The transitions of the auxiliary Markov chain represent scene changes of a video sequence. The bit generation during a low-activity scene is modeled by independent AR processes for I, P, B frames. The cross-correlation with the I frames is taken into account by the AR(1) processes for the P and B frames during the high-activity scenes. The traffic thus generated by the model is analyzed and its characteristics are found to be in close agreement with those exhibited by the real traces. The proposed model is quite flexible in order to model scene changes and the autocorrelation characteristics that are common to all packetized broadcast video sequences. The parameters of the scene changes in the proposed traffic model can be appropriately tuned, so that, even the teleconferencing video traffic that involves few scene changes, can be modeled.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124578609","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":"Multicast automatic protection switching in arbitrary redundant graphs","authors":"R. Gallager, M. Médard, R. Barry, S. Finn","doi":"10.1109/ICC.1998.682964","DOIUrl":"https://doi.org/10.1109/ICC.1998.682964","url":null,"abstract":"We present a new algorithm for automatic protection switching (APS) which creates node (edge) redundant trees on any node (edge)-redundant network. These trees are desirable for performing multicasting with APS. Our algorithm is based on constructing trees with appropriate associated directions. The algorithm gives great flexibility in the choice of trees.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116487863","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 and node architecture of WDM multiple fiber ring networks","authors":"N. Nagatsu, A. Watanabe, S. Okamoto, K.-i. Sato","doi":"10.1109/ICC.1998.685148","DOIUrl":"https://doi.org/10.1109/ICC.1998.685148","url":null,"abstract":"Multiple fiber ring (MFR) networks employing the optical path (OP) concept are discussed to realize robust networks. The architecture is superior to that discussed in several testbeds, with respect to fault recoverability. Both the OP based and non-OP based MFRs can develop several architectures, each of which provides different performance regarding network resource utilization. The required node system scale can be a good measure in determining the network performance. Network design simulations, varying path distribution patterns, have been performed and they elucidated the criteria for selecting the most suitable architecture in terms of resource utilization.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123529714","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":"Fixed local anchor scheme for supporting UPT services in wired networks","authors":"E. Bae, M. Chung, D. Sung","doi":"10.1109/ICC.1998.685122","DOIUrl":"https://doi.org/10.1109/ICC.1998.685122","url":null,"abstract":"An intelligent network architecture with fixed local anchor (FLA) is proposed to support Universal Personal Telecommunication (UPT) services. The performance of the proposed IN architecture is compared with the architecture based on IS-41 considering UPT user's personal mobility in terms of call delivery cost and location update cost.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123720514","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}