Pub Date : 2016-06-20DOI: 10.1109/ATNAC.2016.7878822
Amaro Barreal, Alex Karrila, David A. Karpuk, C. Hollanti
In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which it is explicitly seen that both quantities are upper bounded by (increasing functions of) the expected flatness factor of the faded lattice related to the eavesdropper. By making use of a recently developed approximation of the theta series of a lattice, it is further shown how the average flatness factor can be approximated numerically. In particular, based on the numerical computations, the average flatness factor not only bounds but also orders correctly the performance of different lattices.
{"title":"Information bounds and flatness factor approximation for fading wiretap MIMO channels","authors":"Amaro Barreal, Alex Karrila, David A. Karpuk, C. Hollanti","doi":"10.1109/ATNAC.2016.7878822","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878822","url":null,"abstract":"In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which it is explicitly seen that both quantities are upper bounded by (increasing functions of) the expected flatness factor of the faded lattice related to the eavesdropper. By making use of a recently developed approximation of the theta series of a lattice, it is further shown how the average flatness factor can be approximated numerically. In particular, based on the numerical computations, the average flatness factor not only bounds but also orders correctly the performance of different lattices.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126531736","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}
Pub Date : 1900-01-01DOI: 10.1109/ATNAC.2016.7878800
Baker Al-Rubaiey, J. Abawajy
In virtual network, a substrate network and its software are prone to failure. This can lead to failure of all the virtual resources hosted by that substrate network. This will require the remap of the virtual network to different substrate network resources. This can be avoided if we can predict the failure early and take corrective actions. Thus, detecting a virtual network failure is an important issue to overcome the failure in a virtual network and to enhance the virtual network dependability. In this paper, we present a virtual network failure detection mechanism based on a conservative time-synchronization algorithm and message passing interface. We also present performance analysis to show the effectiveness of the proposed failure detection algorithm.
{"title":"Failure detection in virtual network environment","authors":"Baker Al-Rubaiey, J. Abawajy","doi":"10.1109/ATNAC.2016.7878800","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878800","url":null,"abstract":"In virtual network, a substrate network and its software are prone to failure. This can lead to failure of all the virtual resources hosted by that substrate network. This will require the remap of the virtual network to different substrate network resources. This can be avoided if we can predict the failure early and take corrective actions. Thus, detecting a virtual network failure is an important issue to overcome the failure in a virtual network and to enhance the virtual network dependability. In this paper, we present a virtual network failure detection mechanism based on a conservative time-synchronization algorithm and message passing interface. We also present performance analysis to show the effectiveness of the proposed failure detection algorithm.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116169419","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}
Pub Date : 1900-01-01DOI: 10.1109/ATNAC.2016.7878788
S. Layeghy, Farzaneh Pakzad, M. Portmann
In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new SDN Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high level abstraction, consisting of 9 basic constraint programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.
{"title":"SCOR: Constraint Programming-based Northbound Interface for SDN","authors":"S. Layeghy, Farzaneh Pakzad, M. Portmann","doi":"10.1109/ATNAC.2016.7878788","DOIUrl":"https://doi.org/10.1109/ATNAC.2016.7878788","url":null,"abstract":"In this paper, we introduce SCOR (Software-defined Constrained Optimal Routing), a new SDN Northbound Interface for QoS routing and traffic engineering. SCOR is based on constraint programming techniques and is implemented in the MiniZinc modelling language. It provides a powerful, high level abstraction, consisting of 9 basic constraint programming predicates. A key feature of SCOR is that it is declarative, where only the constraints and utility function of the routing problem need to be expressed, and the complexity of solving the problem is hidden from the user, and handled by a powerful generic solver. We show that the interface (set of predicates) of SCOR is sufficiently expressive to handle all the known and relevant QoS routing problems. We further demonstrate the practicality and scalability of the approach via a number of example scenarios, with varying network topologies, network sizes and number of flows.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131190810","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：