Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024519
P. Vansteenwegen, Corrinne Luteyn
In this research, we look for the possible reduction in vehicle kilometers that can be obtained when a cooperation of delivery companies has the ability to suggest network improvements to the local government. Different network changes are considered in our research: re-opening existing roads for the vehicles of the cooperation, widening roads in the network or converting existing roads into a one-way road with a higher speed. To find the best set of improvements given a fixed budget in a realistic road network, an Adaptive Large Neighborhood Search (ALNS) is proposed. Both the destroy and repair methods in this ALNS are unique for this problem. In order to get an indication of the possible reduction in vehicle kilometers and to test the performance of the heuristic, experiments on a set of 16 benchmark instances are executed. These benchmark instances are generated from a realistic city road network. Based on these experimental results, we can conclude that a set of 1 up to 4 network improvements can lead to a reduction in vehicle kilometers of on average around 2.4% over these 16 benchmark instances, while implementing a set of 2 up to 9 improvements can lead to a reduction of on average around 3.3% over this set of benchmark instances.
{"title":"Reducing logistic vehicle kilometers in a city area based on network changes","authors":"P. Vansteenwegen, Corrinne Luteyn","doi":"10.1109/ISCC.2017.8024519","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024519","url":null,"abstract":"In this research, we look for the possible reduction in vehicle kilometers that can be obtained when a cooperation of delivery companies has the ability to suggest network improvements to the local government. Different network changes are considered in our research: re-opening existing roads for the vehicles of the cooperation, widening roads in the network or converting existing roads into a one-way road with a higher speed. To find the best set of improvements given a fixed budget in a realistic road network, an Adaptive Large Neighborhood Search (ALNS) is proposed. Both the destroy and repair methods in this ALNS are unique for this problem. In order to get an indication of the possible reduction in vehicle kilometers and to test the performance of the heuristic, experiments on a set of 16 benchmark instances are executed. These benchmark instances are generated from a realistic city road network. Based on these experimental results, we can conclude that a set of 1 up to 4 network improvements can lead to a reduction in vehicle kilometers of on average around 2.4% over these 16 benchmark instances, while implementing a set of 2 up to 9 improvements can lead to a reduction of on average around 3.3% over this set of benchmark instances.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129770479","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024610
G. Swetha, G. R. Murthy
Fifth generation (5G) cellular networks would include millimeter wave (mmWave) for communication which gains the advantage of extensive frequency reuse and directive propagation. The recent trends in device-to-device (D2D) communication have escalated the importance of proximity based services for next generation cellular systems. The integration of mmWave and D2D technology will improve the performance and spectral efficiency greatly. In areas with high call traffic density, D2D communication can operate in overlay mode giving the advantage of low complexity interference avoidance technique. The complexity is decreased as the resources to overlay mode are dedicated resulting in no interference from cellular user unlike in underlay mode. Such a scenario is considered in this paper where interference management between D2D devices sharing same radio resources plays a key role in system performance. Thus, the inband resources for D2D operation selectively switch to overlay mode in based on the call traffic. Two problems are addressed in this paper. Firstly, assigning the resources for overlay mode which is solved using quadratic programming. Next, the problem is formulated to maximize system capacity in overlay mode which is solved using a heuristic algorithm which is simulated. The proposed scheme has optimal performance for dense network in controlled overlay operation for 5G networks. The scheme also overcomes the problem of spectrum wastage in overlay mode by its selective operation.
{"title":"Selective overlay mode operation for D2D communication in dense 5G cellular networks","authors":"G. Swetha, G. R. Murthy","doi":"10.1109/ISCC.2017.8024610","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024610","url":null,"abstract":"Fifth generation (5G) cellular networks would include millimeter wave (mmWave) for communication which gains the advantage of extensive frequency reuse and directive propagation. The recent trends in device-to-device (D2D) communication have escalated the importance of proximity based services for next generation cellular systems. The integration of mmWave and D2D technology will improve the performance and spectral efficiency greatly. In areas with high call traffic density, D2D communication can operate in overlay mode giving the advantage of low complexity interference avoidance technique. The complexity is decreased as the resources to overlay mode are dedicated resulting in no interference from cellular user unlike in underlay mode. Such a scenario is considered in this paper where interference management between D2D devices sharing same radio resources plays a key role in system performance. Thus, the inband resources for D2D operation selectively switch to overlay mode in based on the call traffic. Two problems are addressed in this paper. Firstly, assigning the resources for overlay mode which is solved using quadratic programming. Next, the problem is formulated to maximize system capacity in overlay mode which is solved using a heuristic algorithm which is simulated. The proposed scheme has optimal performance for dense network in controlled overlay operation for 5G networks. The scheme also overcomes the problem of spectrum wastage in overlay mode by its selective operation.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129214499","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024689
J. M. Silva, K. Bispo, P. Carvalho, S. R. Lima
Adaptability and energy-efficient sensing are essential properties to sustain the easy deployment and lifetime of WSNs. These properties assume a stronger role in autonomous sensing environments where the application objectives or the parameters under measurement vary, and human intervention is not viable. In this context, this paper proposes LiteSense, a self-adaptive sampling scheme for WSNs, which aims at capturing accurately the behavior of the physical parameters of interest in each WSN context yet reducing the overhead in terms of sensing events and, consequently, the energy consumption. For this purpose, a set of low-complexity rules auto-regulates the sensing frequency depending on the observed parameter variation. Resorting to real environmental datasets, we provide statistical results showing the ability of LiteSense in reducing sensing activity and power consumption, while keeping the estimation accuracy of sensing events.
{"title":"LiteSense: An adaptive sensing scheme for WSNs","authors":"J. M. Silva, K. Bispo, P. Carvalho, S. R. Lima","doi":"10.1109/ISCC.2017.8024689","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024689","url":null,"abstract":"Adaptability and energy-efficient sensing are essential properties to sustain the easy deployment and lifetime of WSNs. These properties assume a stronger role in autonomous sensing environments where the application objectives or the parameters under measurement vary, and human intervention is not viable. In this context, this paper proposes LiteSense, a self-adaptive sampling scheme for WSNs, which aims at capturing accurately the behavior of the physical parameters of interest in each WSN context yet reducing the overhead in terms of sensing events and, consequently, the energy consumption. For this purpose, a set of low-complexity rules auto-regulates the sensing frequency depending on the observed parameter variation. Resorting to real environmental datasets, we provide statistical results showing the ability of LiteSense in reducing sensing activity and power consumption, while keeping the estimation accuracy of sensing events.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129682530","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024628
Nils Schmidt, Lars Baumgärtner, Patrick Lampe, K. Geihs, Bernd Freisleben
In this paper, we present MiniWorld, a novel distributed network emulator. It is based on full virtualization using QEMU/KVM, offers three network backends for emulating both wired and wireless communication, and provides several mobility patterns as well as distance-based link quality models. A snapshot boot mode is offered for accelerated booting of identical environments and repeating emulation runs. To decrease runtimes, MiniWorld supports distributed emulation across multiple computers, based on a resource-aware virtual machine (VM) scheduler. Experimental results demonstrate the performance of MiniWorld with respect to VM boot times, network bandwidth, round trip times, and topology switching times.
{"title":"MiniWorld: Resource-aware distributed network emulation via full virtualization","authors":"Nils Schmidt, Lars Baumgärtner, Patrick Lampe, K. Geihs, Bernd Freisleben","doi":"10.1109/ISCC.2017.8024628","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024628","url":null,"abstract":"In this paper, we present MiniWorld, a novel distributed network emulator. It is based on full virtualization using QEMU/KVM, offers three network backends for emulating both wired and wireless communication, and provides several mobility patterns as well as distance-based link quality models. A snapshot boot mode is offered for accelerated booting of identical environments and repeating emulation runs. To decrease runtimes, MiniWorld supports distributed emulation across multiple computers, based on a resource-aware virtual machine (VM) scheduler. Experimental results demonstrate the performance of MiniWorld with respect to VM boot times, network bandwidth, round trip times, and topology switching times.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125014829","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024631
Youshi Wang, Fa Zhang, Rui Wang, Yangguang Shi, Hua Guo, Zhiyong Liu
The high energy consumption has become one bottleneck in the development of the data centers (DCs), where the main energy consumers are the cooling system and the servers. Therefore, the joint optimization for the energy efficiency of the cooling system and the servers is a crucial problem, while most of previous works on energy saving only studies one of these two components in an isolated manner. In this paper, we propose a real-time strategy, rTCS (real-time Task Classification and Scheduling strategy), to jointly optimize the energy efficiency of these two components in the scenario where the tasks arrive dynamically. Strategy rTCS first labels the tasks to classify them according to their run time and end time with a time complexity of O(1) and a bounded space complexity. Then, rTCS schedules the tasks in real time based on their labels and the energy consumption model of the DC. Simulation results show that rTCS can effectively improve the energy efficiency of DCs.
{"title":"Real-time Task Scheduling for joint energy efficiency optimization in data centers","authors":"Youshi Wang, Fa Zhang, Rui Wang, Yangguang Shi, Hua Guo, Zhiyong Liu","doi":"10.1109/ISCC.2017.8024631","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024631","url":null,"abstract":"The high energy consumption has become one bottleneck in the development of the data centers (DCs), where the main energy consumers are the cooling system and the servers. Therefore, the joint optimization for the energy efficiency of the cooling system and the servers is a crucial problem, while most of previous works on energy saving only studies one of these two components in an isolated manner. In this paper, we propose a real-time strategy, rTCS (real-time Task Classification and Scheduling strategy), to jointly optimize the energy efficiency of these two components in the scenario where the tasks arrive dynamically. Strategy rTCS first labels the tasks to classify them according to their run time and end time with a time complexity of O(1) and a bounded space complexity. Then, rTCS schedules the tasks in real time based on their labels and the energy consumption model of the DC. Simulation results show that rTCS can effectively improve the energy efficiency of DCs.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127678027","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024698
M. Kounavis, Sergej Deutsch, David M. Durham, Saeedeh Komijani
We address a well known problem of computer science, the problem of computing the probability that a given number of people m > 1 have the same birthday from among the members of a larger set of cardinality n ≥ m. The solution to this problem for m = 2 is well known and is usually referred to as the ‘birthday surprise probability’. A solution for m = 3 is also known and appears in the 2004 paper by DasGupta [The matching, birthday and the strong birthday problem: a contemporary review, Journal of Statistical Planning and Inference]. Further approximations to the solution of the related problem of computing the minimum number of people to interview until m people with the same birthday are found are presented in the seminal work by Klamkin and Newman [Extensions on the birthday surprise, Journal of Combinatorial Theory, 1967]. In this paper we present a new non-recursive approximation for the birthday probability applicable to any value of m > 1, which yields results that are experimentally proven accurate under the assumption that the number of birthdays is significantly larger than the number of people. Our expression is easy to compute, non-recursive, and applicable to values of m that can be arbitrarily larger than 2 or 3. We verify the validity of our result computing the birthday probability for different values of m, over billions of sets of random values generated using the Intel ® RDRAND hardware random number generation instruction. Our solution is based on a novel tree-based description of the event space which, if used, allows for the computation of the birthday probability efficiently and without involving recursions or multinomial distributions.
{"title":"Non-recursive computation of the probability of more than two people having the same birthday","authors":"M. Kounavis, Sergej Deutsch, David M. Durham, Saeedeh Komijani","doi":"10.1109/ISCC.2017.8024698","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024698","url":null,"abstract":"We address a well known problem of computer science, the problem of computing the probability that a given number of people m > 1 have the same birthday from among the members of a larger set of cardinality n ≥ m. The solution to this problem for m = 2 is well known and is usually referred to as the ‘birthday surprise probability’. A solution for m = 3 is also known and appears in the 2004 paper by DasGupta [The matching, birthday and the strong birthday problem: a contemporary review, Journal of Statistical Planning and Inference]. Further approximations to the solution of the related problem of computing the minimum number of people to interview until m people with the same birthday are found are presented in the seminal work by Klamkin and Newman [Extensions on the birthday surprise, Journal of Combinatorial Theory, 1967]. In this paper we present a new non-recursive approximation for the birthday probability applicable to any value of m > 1, which yields results that are experimentally proven accurate under the assumption that the number of birthdays is significantly larger than the number of people. Our expression is easy to compute, non-recursive, and applicable to values of m that can be arbitrarily larger than 2 or 3. We verify the validity of our result computing the birthday probability for different values of m, over billions of sets of random values generated using the Intel ® RDRAND hardware random number generation instruction. Our solution is based on a novel tree-based description of the event space which, if used, allows for the computation of the birthday probability efficiently and without involving recursions or multinomial distributions.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127697234","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024571
Antonia Nisioti, Alexios Mylonas, Vasilios Katos, Paul Yoo, A. Chryssanthou
Smartphones have become a vital part of our business and everyday life, as they constitute the primary communication vector. Android dominates the smartphone market (86.2%) and has become pervasive, running in ‘smart’ devices such as tablets, TV, watches, etc. Nowadays, instant messaging applications have become popular amongst smartphone users and since 2016 are the main way of messaging communication. Consequently, their inclusion in any forensics analysis is necessary as they constitute a source of valuable data, which might be used as (admissible) evidence. Often, their examination involves the extraction and analysis of the applications' databases that reside in the device's internal or external memory. The downfall of this method is the fact that databases can be tampered or erased, therefore the evidence might be accidentally or maliciously modified. In this paper, a methodology for retrieving instant messaging data from the volatile memory of Android smartphones is proposed, instead of the traditional database retrieval. The methodology is demonstrated with the use of a case study of four experiments, which provide insights regarding the behavior of such data in memory. Our experimental results show that a large amount of data can be retrieved from the memory, even if the device's battery is removed for a short time. In addition, the retrieved data are not only recent messages, but also messages sent a few months before data acquisition.
{"title":"You can run but you cannot hide from memory: Extracting IM evidence of Android apps","authors":"Antonia Nisioti, Alexios Mylonas, Vasilios Katos, Paul Yoo, A. Chryssanthou","doi":"10.1109/ISCC.2017.8024571","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024571","url":null,"abstract":"Smartphones have become a vital part of our business and everyday life, as they constitute the primary communication vector. Android dominates the smartphone market (86.2%) and has become pervasive, running in ‘smart’ devices such as tablets, TV, watches, etc. Nowadays, instant messaging applications have become popular amongst smartphone users and since 2016 are the main way of messaging communication. Consequently, their inclusion in any forensics analysis is necessary as they constitute a source of valuable data, which might be used as (admissible) evidence. Often, their examination involves the extraction and analysis of the applications' databases that reside in the device's internal or external memory. The downfall of this method is the fact that databases can be tampered or erased, therefore the evidence might be accidentally or maliciously modified. In this paper, a methodology for retrieving instant messaging data from the volatile memory of Android smartphones is proposed, instead of the traditional database retrieval. The methodology is demonstrated with the use of a case study of four experiments, which provide insights regarding the behavior of such data in memory. Our experimental results show that a large amount of data can be retrieved from the memory, even if the device's battery is removed for a short time. In addition, the retrieved data are not only recent messages, but also messages sent a few months before data acquisition.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121151740","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024522
Walid Serrai, A. Abdelli, L. Mokdad, Ashref Serrai
Nowadays, web service selection has become a very challenging issue. As the number of web services is increasing drastically, different QoS parameters are added in their description in addition to their functional parameters (Inputs and outputs) to distinguish them and ease their selection. Hence, web service selection consists to find out among services having the same functionalities the optimal elements that satisfy user QoS requirements. When the user request deals with value constrains on the QoS parameters, the mainstream approach operates by removing from the search space web services that do not satisfy the user constraints. However, such an approach is not always appropriate especially when the resulting search space is empty or very small. In this case, the discarded services may be of interest in the selection process. To tackle this issue, we propose to use a combination of two MCDM (Multi Criteria Decision Making) methods, that are AHP (Analytical Hierarchy Process) and RIM (Reference Ideal Method). AHP is used to encode an normalize weights constraints assigned to QoS criteria at the first stage. Then to deal with user value constraints, we consider RIM to rank discarded web services relatively to their proximity to the required value constraints. We compare our method with existing approaches by performing tests on a real dataset.
{"title":"Dealing with user constraints in MCDM based web service selection","authors":"Walid Serrai, A. Abdelli, L. Mokdad, Ashref Serrai","doi":"10.1109/ISCC.2017.8024522","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024522","url":null,"abstract":"Nowadays, web service selection has become a very challenging issue. As the number of web services is increasing drastically, different QoS parameters are added in their description in addition to their functional parameters (Inputs and outputs) to distinguish them and ease their selection. Hence, web service selection consists to find out among services having the same functionalities the optimal elements that satisfy user QoS requirements. When the user request deals with value constrains on the QoS parameters, the mainstream approach operates by removing from the search space web services that do not satisfy the user constraints. However, such an approach is not always appropriate especially when the resulting search space is empty or very small. In this case, the discarded services may be of interest in the selection process. To tackle this issue, we propose to use a combination of two MCDM (Multi Criteria Decision Making) methods, that are AHP (Analytical Hierarchy Process) and RIM (Reference Ideal Method). AHP is used to encode an normalize weights constraints assigned to QoS criteria at the first stage. Then to deal with user value constraints, we consider RIM to rank discarded web services relatively to their proximity to the required value constraints. We compare our method with existing approaches by performing tests on a real dataset.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127112145","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024703
S. Souravlas, Angelo Sifaleras
Data replication is used to track the most popular files (i.e., the ones with most requests) and replicate them in selected nodes. In this way, more requests for such popular files can be completed over a period of time and bandwidth consumption is reduced, since these files do not need to be transferred from remote nodes. In this article, we extend our previous work [1] to make it more efficient in terms of memory and total computation cost, so that it becomes more efficient and suitable for larger grids. To reduce the memory costs, we present a centralized strategy which estimates the potential for selected batches of files. The computations required for these estimations are executed in a pipelined way, so their cost is also reduced.
{"title":"On minimizing memory and computation overheads for binary-tree based data replication","authors":"S. Souravlas, Angelo Sifaleras","doi":"10.1109/ISCC.2017.8024703","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024703","url":null,"abstract":"Data replication is used to track the most popular files (i.e., the ones with most requests) and replicate them in selected nodes. In this way, more requests for such popular files can be completed over a period of time and bandwidth consumption is reduced, since these files do not need to be transferred from remote nodes. In this article, we extend our previous work [1] to make it more efficient in terms of memory and total computation cost, so that it becomes more efficient and suitable for larger grids. To reduce the memory costs, we present a centralized strategy which estimates the potential for selected batches of files. The computations required for these estimations are executed in a pipelined way, so their cost is also reduced.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126087685","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024696
Konrad-Felix Krentz, C. Meinel, Hendrik Graupner
Generating seeds on Internet of things (IoT) devices is challenging because these devices typically lack common entropy sources, such as user interaction or hard disks. A promising replacement is to use power-up static random-access memory (SRAM) states, which are partly random due to manufacturing deviations. Thus far, there, however, seems to be no method for extracting close-to-uniformly distributed seeds from power-up SRAM states in an information-theoretically secure and practical manner. Moreover, the min-entropy of power-up SRAM states reduces with temperature, thereby rendering this entropy source vulnerable to so-called freezing attacks. In this paper, we mainly make three contributions. First, we propose a new method for extracting uniformly distributed seeds from power-up SRAM states. Unlike current methods, ours is information-theoretically secure, practical, and freezing attack-resistant rolled into one. Second, we point out a trick that enables using power-up SRAM states not only for self-seeding at boot time, but also for reseeding at runtime. Third, we compare the energy consumption of seeding an IoT device either with radio noise or power-up SRAM states. While seeding with power-up SRAM states turned out to be more energy efficient, we argue for mixing both these entropy sources.
{"title":"Secure self-seeding with power-up SRAM states","authors":"Konrad-Felix Krentz, C. Meinel, Hendrik Graupner","doi":"10.1109/ISCC.2017.8024696","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024696","url":null,"abstract":"Generating seeds on Internet of things (IoT) devices is challenging because these devices typically lack common entropy sources, such as user interaction or hard disks. A promising replacement is to use power-up static random-access memory (SRAM) states, which are partly random due to manufacturing deviations. Thus far, there, however, seems to be no method for extracting close-to-uniformly distributed seeds from power-up SRAM states in an information-theoretically secure and practical manner. Moreover, the min-entropy of power-up SRAM states reduces with temperature, thereby rendering this entropy source vulnerable to so-called freezing attacks. In this paper, we mainly make three contributions. First, we propose a new method for extracting uniformly distributed seeds from power-up SRAM states. Unlike current methods, ours is information-theoretically secure, practical, and freezing attack-resistant rolled into one. Second, we point out a trick that enables using power-up SRAM states not only for self-seeding at boot time, but also for reseeding at runtime. Third, we compare the energy consumption of seeding an IoT device either with radio noise or power-up SRAM states. While seeding with power-up SRAM states turned out to be more energy efficient, we argue for mixing both these entropy sources.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126113002","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
扫码关注我们
求助内容：
应助结果提醒方式：