{"title":"Call admission control with resource reservation for multi-service OFDM networks","authors":"M. Khabazian, O. Kubbar, H. Hassanein","doi":"10.1109/ICCNC.2012.6167530","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167530","url":null,"abstract":"In OFDM wireless networks, the radio resources are assigned to the users based on their quality of service needs and depending on their channel quality. Thus, during a call session, the bandwidth requirements and needed radio resources may increase from negotiated call setup resources. In this study, we propose a call admission control reservation algorithm that takes such resource fluctuations into consideration. We consider two types of applications denoted by wide-band and narrow band. The performance of the algorithm is modeled through a queuing theory approach and its main performance measures are compared with a conventional algorithm through simulation. The results show that such a reservation scheme improves the call admission performance significantly in terms of QoS maintenance, especially when the network is highly congested.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130576496","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}
Eitan Yaakobi, Laura M. Grupp, P. Siegel, S. Swanson, J. Wolf
{"title":"Characterization and error-correcting codes for TLC flash memories","authors":"Eitan Yaakobi, Laura M. Grupp, P. Siegel, S. Swanson, J. Wolf","doi":"10.1109/ICCNC.2012.6167470","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167470","url":null,"abstract":"Flash memory has become the storage medium of choice in portable consumer electronic applications, and high performance solid state drives (SSDs) are also being introduced into mobile computing, enterprise storage, data warehousing, and data-intensive computing systems. On the other hand, flash memory technologies present major challenges in the areas of device reliability, endurance, and energy efficiency. In this work, the error behavior of TLC flash is studied through an empirical database of errors which were induced by write, read, and erase operations. Based on this database, error characterization at the block and page level is given. To address the observed error behavior, a new error-correcting scheme for TLC flash is given and is compared with BCH and LDPC codes.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122143433","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":"New alternative series representations for the generalized Nuttall Q-function with applications","authors":"O. Olabiyi, A. Annamalai","doi":"10.1109/ICCNC.2012.6167369","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167369","url":null,"abstract":"In this article, we present six recently derived distinct series representations of the generalized Nuttall Q-function with their corresponding Marcum Q-function. We investigate different application areas where these series expressions might be of interest. Using these representations, we address some of the outstanding problems that have until now resisted simple solutions. First, we show that the new series representation can be used in the performance evaluation of the periodogram using the Neyman-Pearson criterion. We show that, for the particular case of periodogram with zero padded fast Fourier transform, our series are the only existing analytical formulas capable of producing the desired numerical results. This is because of the need to compute and/or average the generalized Marcum Q-function of real orders which is not supported by commercial mathematical software such as MAPLE and MATLAB. Second, we present different expressions that can be used to evaluate the average area under the receiver operating characteristics (ROC) curve over generalized fading channels. In this case, many existing result are limited to specific fading channel and/or integer time-bandwidth product whereas, our expressions place no such restrictions. Lastly, we present the only existing closed-form solution for the evaluation of the partial area under the ROC curve which is of practical interest but has been shown to be difficult to evaluate with closed-form formulas. Numerical results have been presented for representative case and the obtained result agrees with analytical expectations. To the best of our knowledge, all the problems solved using these series representations are still open problems in the literature.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121788211","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 and optimal access strategy in multichannel dynamic spectrum access system","authors":"Xiao Li, J. Wang, Husheng Li, Shaoqian Li","doi":"10.1109/ICCNC.2012.6167447","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167447","url":null,"abstract":"In this paper, we consider a hierarchical cognitive radio scenario where the secondary users (SUs) may access the licensed spectrum opportunistically, whenever it is not occupied by the primary users (PUs). Our work focuses on the delay performance analysis of the SU system and the optimal access strategy for the case of sharing multiple licensed channels among SUs. By merging the PU traffic with SU traffic, we propose the model of priority virtual queue on licensed channels. Based on this model, we obtain the expected system delay expression of SU traffic through M/G/1 preemptive repeat priority queuing analysis. For the case of multiple licensed channel access, the access strategy is further investigated to minimize the expected transmission delay of SU traffic. The optimal access strategy is modeled as a nonlinear programming problem, which can be resolved by means of classic Genetic Algorithm (GA). Numerical results validate our analysis and optimal access strategy design.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130093469","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":"Wireless security and monitoring system using array antenna: Array sensor","authors":"T. Ohtsuki","doi":"10.1109/ICCNC.2012.6167483","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167483","url":null,"abstract":"This paper explains our proposed wireless security and monitoring system using array antenna, referred to as array sensor. The proposed system exploits an antenna array on the receiver side and decomposes received signals into eigenvectors and eigenvalues. The proposed system uses these components depending on its applications, such as intrusion detection, monitoring, and passive localization. When an event (e.g. intrusion) occurs, the propagation environment changes, and thus the eigenvector changes. Based on the change of eigenvector, we can detect an event accurately. Using machine learning based on these components, the proposed system can classify several more complex states and activities. This paper introduces the fundamental principle of the proposed system and its various applications.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130223528","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":"Cycle time distribution and control for the Deficit Round Robin packet scheduler","authors":"Gary Chang, Chung-Chieh Lee","doi":"10.1109/ICCNC.2012.6167459","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167459","url":null,"abstract":"Deficit Round Robin (DRR) is a widely implemented packet scheduling algorithm for providing throughput fairness among competing traffic flows in a router. However, its original form may yield poor response times for short-lived flows when the load is heavy. In this paper, we derive the probability distribution of the DRR cycle time, which is key to response times experienced by short-lived flows, with the aids of Renewal Theory and Central Limit Theorem. To utilize the analytical results on DRR cycle time, we then present a mechanism that adjusts the DRR service quanta offered to active traffic flows such that the DRR cycle time is contained. As a result, the response times for short-lived flows can be protected at a desired statistical level. Simulation results demonstrate the accuracy of the Gaussian DRR cycle time distribution as well as the significant improvements achieved by adjusting the quanta.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130256059","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":"Intrusion detection in IT networks with limited observations","authors":"Praveen Bommannavar, N. Bambos","doi":"10.1109/ICCNC.2012.6167419","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167419","url":null,"abstract":"In this paper we consider the problem of quickest alarm intrusion detection for a computer network in a probabilistic setting where the number of opportunities to make observations on the status of a potential intruder is budgeted. Specifically, we model the activity of an intruder with a Markov chain of finite state space, corresponding to logical or physical states in a network, and suppose there is a state b which we would not like the intruder to enter. The intruder, on the other hand, would like to enter this sensitive part of the network and wants to spend as much time there as possible. The state of the intruder evolves in discrete time; also there are a limited number of opportunities for the security system to make state observations over the finite horizon of the problem. This model can be used to capture the essence of intrusion detection in a variety of situations such as hackers in a network or physical intruders in a spatial area where there is a constraint on the number of observations one may make due to power limitations. We develop an optimal policy for dynamically scheduling observations to minimize the amount of time that the intruder spends in b without being discovered.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129869267","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}
Jiayuan Wang, S. Ruepp, A. Manolova, L. Dittmann, S. Ricciardi, D. Careglio
{"title":"Green-aware routing in GMPLS networks","authors":"Jiayuan Wang, S. Ruepp, A. Manolova, L. Dittmann, S. Ricciardi, D. Careglio","doi":"10.1109/ICCNC.2012.6167416","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167416","url":null,"abstract":"The increasing amount of traffic in the Internet has been accommodated by the exponential growth of bandwidth provided by the optical networks technologies. However, such a growth has been also accompanied by an increase in the energy consumption and the concomitant green house gases (GHG) emissions. Despite the efforts for improving energy efficiency in silicon technologies and network designs, the large energy consumption still poses challenges for the future development of Internet. In this paper, we propose an extension of the Open Shortest Path First - Traffic Engineering (OSPF-TE) protocol and a green-aware routing and wavelength assignment (RWA) algorithm for minimizing the GHG emissions by routing connection requests through green network elements (NE). The network behavior and the performance of the algorithm are analyzed through simulations under different scenarios, and results show that it is possible to reduce GHGs emissions at the expense of an increase in the path length, and, in some cases, in the blocking probability. The trade-off between emissions and performance is studied. To the authors knowledge, this is the first work that provides a detailed study of a green-aware OSPF protocol.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129063856","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 mobility patterns for urban taxi cabs","authors":"M. A. Hoque, X. Hong, B. Dixon","doi":"10.1109/ICCNC.2012.6167524","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167524","url":null,"abstract":"This paper analyzes urban taxi mobility traces obtained from San Francisco Yellow cabs. The paper presents a rigorous analysis of taxi mobility pattern with the instantaneous velocity profile, spatio-temporal distribution, connectivity of vehicle communications, clustering, hotspots and other characteristics like trip duration and empty cruise interval. The empirical data analyses presented here can be a helpful resource for wireless researchers, government organizations, taxi companies and even for the drivers or passengers. While wireless researchers can estimate the capabilities and constraints of vehicular communication from connectivity and mobility patterns, government can plan and work on issues related to implementing proper DSRC infrastructure. Finally, taxi companies and drivers can benefit from maximizing the trip revenue and minimize empty cruise time though balanced load distribution and awareness of the hotspots.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121477400","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":"Connectivity abstractions and “service-oriented network” architecture","authors":"D. Hoang, C. Pham","doi":"10.1109/ICCNC.2012.6167439","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167439","url":null,"abstract":"Current generation networks have been designed only for network connectivity; they have been stretched to the limit with many afterthought add-on features including quality of service, mobility, programmability, and security so that they can be deployed for business applications and processes. As such, service deployment on current networks are difficult, time consuming and with limited successes. This paper suggests a service architecture based on network connectivity abstraction, user connectivity abstraction and application/service connectivity abstraction. The paper also proposes a service-oriented network (SON) architecture that facilitates the development of services and applications regardless of the underlying network access technologies. The architecture is conceived through the consideration of the essential requirements of generic Internet applications from the service and network providers' perspective that addresses the Service-Oriented Architecture (SOA) application deployment pattern, user location and device mobility, and the structure of IP-converged networks.","PeriodicalId":125988,"journal":{"name":"2012 International Conference on Computing, Networking and Communications (ICNC)","volume":"456 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124325800","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}