{"title":"Degradation degree based fair rate adaptation algorithm for wireless networks with mobile nodes","authors":"F. Rango, G. Aloi, S. Marano","doi":"10.1109/LANMAN.2004.1338418","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338418","url":null,"abstract":"This paper focuses its attention on the rate adaptation problem in wireless network with mobile hosts. We define two new quality of service (QoS) indexes. They express the degradation degree of bandwidth and the frequency of bandwidth degradation suffered by data packet flows. These indexes are used to define and propose a new rate adaptation algorithm named degradation degree based fair algorithm (DDFA). The aim of the proposed algorithm is to fairly distribute the effects of QoS degradation among the cell visited by the mobile hosts. The DDFA algorithm has been compared with a fair adaptation algorithm proposed in the literature. The performance evaluation shows that proposed algorithm reduces the QoS degradation of flows without adding control overhead compared to the reference fair algorithm.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123290800","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":"Cooperation and accounting strategy for multi-hop cellular networks","authors":"A. Weyland, T. Braun","doi":"10.1109/LANMAN.2004.1338430","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338430","url":null,"abstract":"Multi-hop cellular networks (also called hybrid networks) appears to be a promising combination of the dynamics of mobile ad hoc networks and the reliability of infrastructured wireless networks. However, several known weaknesses of mobile ad hoc networks still persist. Besides the security and routing issues, the cooperation among nodes is of great importance. We propose a highly decentralized accounting and security architecture that provides a solid foundation for a cooperation scheme based on rewards and is applicable to multi-hop cellular networks. This scheme incorporates a security architecture which is based on public key cryptography and uses digital-signatures and certificates.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122931263","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 analytical model for the IEEE 802.11e EDCF","authors":"Zhifeng Tao, S. Panwar","doi":"10.1109/LANMAN.2004.1338397","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338397","url":null,"abstract":"The IEEE 802.11e protocol is designed to enhance the QoS capability of wireless local area networks (WLAN). In this paper, we propose a multidimensional Markov model for the 802.11e enhanced distributed coordination function (EDCF) mode and compute the maximum sustainable throughput and service delay distribution for each priority class when under heavy load. Since the QoS mechanisms and their associated parameters in IEEE 802.11e interact with each other in a complex way, it is important to model the aggregate effect of all the mechanisms. The approach we present does so and therefore provides an analytical approach to pick the parameter values associated with EDCF to meet the QoS requirements of each priority.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121693068","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":"Transmission characteristics of optical CDMA for local area networks","authors":"Jae‐Ho Han","doi":"10.1109/LANMAN.2004.1338438","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338438","url":null,"abstract":"Optical code division multiple access (OCDMA) has been extensively studied for the evaluation of system performance. In the phase modulated OCDMA system, the coherent balance detector receiver was used with the phase-locked loop (PLL) for code and carrier phase synchronization. Due to the implementation limitations of phase coded OCDMA and the inefficiencies for noncoherent detection, this paper considers the homodyne correlation receiver using dual balance detector for the estimation of transmission performance. A general model applicable to any number of users is set up, including noises such as shot noise and equivalent receiver circuit noise in the receiver model as well as multiuser interference. Moreover, the code correlation properties are observed for the chosen prime code. The influence of the code phase alignment condition in its synchronizing process on system performance is also analyzed. Rather than concentrating the study on the strategy for the code synchronization procedure followed by the computation of the average acquisition time as the performance of interest, the probabilities of false alarm and bit error depending on the state of code phase alignment are on focus.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127834261","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 evaluation of wavelength reservation protocol with delayed link state information","authors":"T. Toku, S. Arakawa, M. Murata","doi":"10.1109/LANMAN.2004.1338408","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338408","url":null,"abstract":"Previous studies on routing and wavelength assignment algorithms assumed that the global link state information is obtained without delays. However, in distributed lightpath establishment, the probability of request blocking strongly depends on both the accuracy of the global link state information and the distributed protocol for wavelength reservation. In this paper, we evaluate how the frequency of link state information exchange affects the blocking probability in lightpath establishment. The evaluation is performed based on forward and backward reservation protocols in three network topologies. Simulation results show that while the forward reservation protocol is greatly affected by the frequency of link state information exchange and the amount of this information, the backward reservation protocol does not need as detailed information about the link state and as frequent link state exchange for routing as does the forward protocol.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127377014","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 queuing theoretic model for IEEE 802.11 DCF using RTS/CTS","authors":"Mustafa Özdemir, A. B. McDonald","doi":"10.1109/LANMAN.2004.1338396","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338396","url":null,"abstract":"An M/MMG1/1/K queuing model is developed for the analysis of IEEE 802.11 DCF using RTS/CTS. Results are based on arbitrary contention conditions, namely, collision probabilities, transmission probabilities and contention window sizes that vary arbitrarily among nodes contending for channel access. This is fundamentally different from the earlier works. Results are presented for the fully-connected case and validated via simulation with statistical analysis. The main contributions are the analysis of DCF and the foundation for the analysis of multi-hop scenarios. A key element of the model is the effective reduction of the normally encountered complexity by effectively restoring the independence between service times and packet inter-arrivals.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368157","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":"Measurement-assisted model-based call admission control for IEEE 802.11e WLAN contention-based channel access","authors":"Z. Kong, D. Tsang, B. Bensaou","doi":"10.1109/LANMAN.2004.1338400","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338400","url":null,"abstract":"We first present our recent work on the non-saturation modelling and performance analysis for IEEE 802.11 distributed coordination function. We extended the previous work and developed a model capable of reflecting the non-saturation condition. Employing the model, by introducing a concept of equivalent competing entity, we designed a measurement-aided model-based call admission control scheme for IEEE 802.11e WLANs contention-based channel access - enhanced distributed coordination function (EDCF) to provide guaranteed throughput quality of service (QoS) in a statistical sense. Extensive numerical and simulation results are provided.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"139 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115890737","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 label stacking capable MPLS reconfigurable networks","authors":"M. Ghizzi, I. Cerutti, P. Castoldi, A. Fumagalli","doi":"10.1109/LANMAN.2004.1338417","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338417","url":null,"abstract":"The label stacking mechanism of MPLS is studied in this paper. LSP encapsulation is shown to be able to reduce the MPLS control plane workload, while maintaining the data network blocking probability at acceptable levels.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115995702","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 novel approach for protecting multicast sessions in metropolitan WDM ring networks","authors":"C. Murthy","doi":"10.1109/LANMAN.2004.1338406","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338406","url":null,"abstract":"The introduction of the wavelength division multiplexing (WDM) into the metro environment and the rapid growth of multicast (single source and multiple destinations) applications such as video conferencing, distance learning, and online-auction initiated the need to realise multicasting in WDM metropolitan area networks (MANs) in a cost effective way. Because of their simplicity in maintenance, operation, and control, rings became dominant topologies in metropolitan networks. But, like in any other communication network, the optical network is also prone to link (fiber) failures. Because of the large amount of traffic a fiber carries, fiber failures in a WDM system would cause severe service loss or disruption. Hence, protecting such multicast sessions against link failures is an important cause of concern. This paper assumes a single link failure model and addresses the problem of multicast protection in the scenario of WDM metropolitan ring networks. The paper discussed the SONET like self-healing schemes based on unidirectional fibers and has proposed novel approaches which are based on bidirectional fibers.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126103292","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":"Link-layer support for fast mobile IPv6 handover in wireless LAN based networks","authors":"N. Jordan, Alexander Poropatich, R. Fleck","doi":"10.1109/LANMAN.2004.1338419","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338419","url":null,"abstract":"Due to the assistance of the mobile IPv6 approach, a mobile node can effectively maintain its IP-layer connectivity to the Internet when it changes its point-of-attachment somewhere in the world. During the accomplishment of the handover, the mobile node is unable to send or even receive IPv6 packets, both due to its L2 and also L3 handover operations. In this paper, the author discussed the different types of handovers, given as fast handover for IEEE 802.11, enhanced WLAN handover, and fast mobile IPv6 approach. Each implementation is configured to access a point involved with a special SSID string that provides all the information about the prefix of the attached AR in the background. Whenever the mobile node anticipates some upcoming handoff, the handover-tool is automatically informed about the prefix of the new AP. In that way the mobile node performs \"anticipative\" configuration of the new IP address on the new subnet by using the router prefix information carried in the beacon message of the new AP.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126673443","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}