{"title":"The Tail Distribution of the Sum of Kappa Random Variables with Unequal Weight and Correlation","authors":"Hung-Yi Lo, J. Lehnert, Phuong T. Tran","doi":"10.1109/SARNOF.2018.8720441","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720441","url":null,"abstract":"Applications of the Kappa distribution, which is used to describe the particle velocity distribution when a system is in thermal anti-equilibrium, to statistical mechanics and high frequency (HF) communication are considered. In particular, the tail distribution of the sum of Kappa random variables (RVs) is studied. First, an approximation for the sum of unequally weighted, uncorrelated Kappa RVs is found that provides results for the tail distribution of that sum. Correlated Kappa RVs are then examined by using the Cholesky decomposition to obtain similar results. Simulation results are shown to agree with this development.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115818546","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":"Scalable Computing in a Blockchain","authors":"Mahalinagam Ramkumar","doi":"10.1109/SARNOF.2018.8720499","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720499","url":null,"abstract":"The main utility of blockchain networks stem from their ability to offer a trusted platform for execution of processes. The default blockchain implementation, where an immutable log of all transactions is maintained by every participant, is i) inefficient, and ii) does not scale well. This paper outlines several strategies to improve the scope and scale of processes that can be executed in a blockchain.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133947381","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}
Nikolai A. Snow, Venkateswara Dasari, Billy E. Geerhart
{"title":"OpenFlow Experimenter Labels for Encoding Adaptive Network Functions","authors":"Nikolai A. Snow, Venkateswara Dasari, Billy E. Geerhart","doi":"10.1109/SARNOF.2018.8720450","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720450","url":null,"abstract":"OpenFlow is the single most important widely used protocol created for the development of software defined programmable adaptive network architectures. The protocol is based on standardization which allows for a highly extendable protocol that allows the introduction of new network functions and abstractions. This architecture brings computation and communication close together in order to bring network awareness into applications. However, lack of proper documentation and complex interaction between several software modules makes development a bit cumbersome in certain cases. The current method for introducing new OpenFlow functionality is to use Experimenter functions intended for extending OpenFlow functionality. In this paper we detail the process of introducing Experimenter Labels into both Open vSwitch and the Ryu controller in order to introduce new OpenFlow functionality.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134285876","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}
Priti G. Pachpande, Monette H. Khadr, A. F. Hussein, H. Elgala
{"title":"Visible Light Communication Using Deep Learning Techniques","authors":"Priti G. Pachpande, Monette H. Khadr, A. F. Hussein, H. Elgala","doi":"10.1109/SARNOF.2018.8720493","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720493","url":null,"abstract":"Deep learning (DL) techniques have the potential of making communication systems more efficient and solving many problems in the physical layer. In this paper, an optical wireless communications (OWC) system based on visible light communications (VLC) technology is implemented using an autoencoder (AE). The proposed system is tested in different scenarios using various AE parameters and applied on an indoor VLC model. Bit error rate (BER) is evaluated with respect to the signal-to-noise-ratio (SNR) values at different locations within the room. To validate the proposed system, theoretical results are compared to the simulated values. The bit-error performance demonstrates the viability of DL techniques in VLC systems.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124746059","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":"Resolving Routing and Spectrum Allocation with Optimal Revenue Problem in Spectrum-Sliced Elastic Optical Path Networks","authors":"Yang Wang, Hung Nguyen, Chaoyang Li","doi":"10.1109/SARNOF.2018.8720469","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720469","url":null,"abstract":"Routing and Spectrum Allocation (RSA) is the key problem in Spectrum-Sliced Elastic Optical Path (SLICE) networks. The difficulty of RSA problem lies on three factors: first, the allocated sub-carriers have to be continuously available along each established spectrum path; second, the allocated sub-carriers have to be consecutive in the spectrum domain as implied by the OFDM technology of SLICE networks; and third, sub-carriers of spectrum paths sharing the same fiber have to be separated by the guard-band that is determined at run-time. As a decision problem, the RSA has been proven to be NP-Complete. In this work, we study an optimization version of the RSA problem with the goal of maximizing the revenue from the accommodated requests. We present Integer Liner Programming (ILP) formulations for the problem, namely Routing and Spectrum Allocation with Optimal Revenue (ROR). Also, we present detailed design of a framework that utilizes techniques of relaxation, decomposition and auxiliary graphs, which can be employed to obtain a near optimal solution that has a per-instance guarantee on the closeness to the optimal solution.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121376323","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":"Immutability Measure for Different Blockchain Structures","authors":"Hyong S. Kim, Ke Wang","doi":"10.1109/SARNOF.2018.8720496","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720496","url":null,"abstract":"The main advantage of Blockchain technology is the immutability of data maintained by decentralized systems. Earlier studies introduce the probability of attackers succeeding in modifying legitimate data in the blocks. We propose “immutability measure”, a metric that indicates the degree of difficulty in modifying existing data in Blockchain. We propose different blockchain structures that can be more appropriate for different applications. There are several parameters that determine the difficulty of modifying data in Blockchain. We analyze the impact of each of these parameters on the immutability measure of various blockchain structures. We also study the required computational and electrical power as well as the time for a successful attack in various blockchain structures. We demonstrate that our proposed blockchain structures can exponentially improve the immutability measure with a nominal increase in computing resources.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124531008","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":"Shannon - Entropy - Based Artificial Intelligence Applied to Identify Social Anomalies in Large Latin American Cities","authors":"H. Nieto-Chaupis","doi":"10.1109/SARNOF.2018.8720426","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720426","url":null,"abstract":"The emergence of social anomalies in developing countries have demanded to use alternative methodologies that allows us to identify concrete problems that to some extent constitute a negative factor that substantially delays both social and economical progress of a country either in the middle or long term. Because most of the social factors that would stop such progress falls entirely in the territory of the social dynamics particularly in that large cities, concretely in this paper we apply the Log to the Shannon's entropy as a kind of tool to identify in parallel the level of risk for street criminality as well as the presence of traffic chaos in a large city. For this end we use an acceptance-rejection-based algorithm that selects one geographical square of a certain zone belonging to Lima city in Peru. While all squares have same probability to be selected we introduce a memory-based factor that accounts previous criminality-traffic events in some specific areas. Our results have indicated that those dual points criminality-traffic are strongly correlated with social, urbanity, and economic development factors. Simulations from stochastic algorithms have yielded a matching between model and official data of a 85±5%. Therefore the results of this paper are along the direction of the recovery of the main social-economic parameters of Latin American countries by which are the main cause of the apparition of these social anomalies.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116278457","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 Sliding Window Based Monitoring Scheme to Detect and Prevent DDoS Attack in Data Center Networks in a Dynamic Traffic Environment","authors":"M. Maswood, M. Mamun, Dijiang Huang, D. Medhi","doi":"10.1109/SARNOF.2018.8720399","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720399","url":null,"abstract":"Distributed Denial of Service (DDoS) attack is the most common type of attack faced by today's data centers (DC). Such attacks can have a devastating impact on the system as it consumes resources like network bandwidth, hard disk storage, and CPU processing resources. As a consequence, the legitimate customers face more service blocking due to a major portion of the resources being occupied by the illegitimate traffic generated by the attackers. In this paper, we proposed a novel monitoring scheme based on the sliding window to detect and prevent the DDoS attack in DCs that serve enterprise customers that has low computational complexity. Compared to a benchmark scheme (without attack monitoring and preventing), our scheme ensures service provisioning for the legitimate customers with no false alarm. We also measure the robustness of our scheme in terms of the time taken to detect and prevent attack traffic by varying the traffic intensities of illegitimate traffic. Simulation results show that our scheme can successfully detect the attack even if the attack traffic intensity is not too much higher than the projected legitimate traffic intensity.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129367725","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":"Utilizing Spectral Level Crossings: An Example Signal-to-Noise Ratio Estimator","authors":"W. Clark, Joseph M. Ernst, R. McGwier","doi":"10.1109/SARNOF.2018.8720506","DOIUrl":"https://doi.org/10.1109/SARNOF.2018.8720506","url":null,"abstract":"Statistical level crossings in a communications paradigm, are typically used in conjunction with estimating a signal's probability of outage over a given channel model. Here the level crossing is examined in the frequency domain of a signal within the context of estimating the Signal-to-Noise Ratio (SNR) for linear digital signals. It is shown within that when compared to the Mean-Squared-Error estimator, which uses the same information to calculate the estimate, the Level Crossing approach performs better in reasonable to high SNR and can be cheaper in terms of computation expense to calculate.","PeriodicalId":430928,"journal":{"name":"2018 IEEE 39th Sarnoff Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122205188","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}