Pub Date : 2018-05-07DOI: 10.23919/WIOPT.2018.8362856
Subrahmanya Swamy Peruru, A. Srinivasan, R. Ganti, K. Jagannathan
We propose distributed scheduling algorithms that guarantee a constant fraction of the maximum throughput for typical wireless topologies, and have O(1) delay and complexity in the network size. Our algorithms resolve collisions among pairs of conflicting nodes by assigning a master-slave hierarchy. When the master-slave hierarchy is chosen randomly, our algorithm matches the throughput performance of the maximal scheduling policies, with a complexity and delay that do not scale with network size. When the master-slave hierarchy is chosen based on the network topology, the throughput performance of our algorithm is characterized by a parameter of the conflict graph called the master-interference degree. For commonly used conflict graph topologies, our results lead to the best known throughput guarantees among the algorithms that have O(1) delay and complexity. Numerical results indicate that our algorithms out-perform the existing O(1) complexity algorithms like Q-CSMA.
{"title":"Hierarchical scheduling algorithms with throughput guarantees and low delay","authors":"Subrahmanya Swamy Peruru, A. Srinivasan, R. Ganti, K. Jagannathan","doi":"10.23919/WIOPT.2018.8362856","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362856","url":null,"abstract":"We propose distributed scheduling algorithms that guarantee a constant fraction of the maximum throughput for typical wireless topologies, and have O(1) delay and complexity in the network size. Our algorithms resolve collisions among pairs of conflicting nodes by assigning a master-slave hierarchy. When the master-slave hierarchy is chosen randomly, our algorithm matches the throughput performance of the maximal scheduling policies, with a complexity and delay that do not scale with network size. When the master-slave hierarchy is chosen based on the network topology, the throughput performance of our algorithm is characterized by a parameter of the conflict graph called the master-interference degree. For commonly used conflict graph topologies, our results lead to the best known throughput guarantees among the algorithms that have O(1) delay and complexity. Numerical results indicate that our algorithms out-perform the existing O(1) complexity algorithms like Q-CSMA.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121330194","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362875
Sumanth Timmadasari, K. P. Naveen, S. Bhashyam
We present results from an extensive simulation study, conducted to understand the properties of coverage and percolation in infrastructure-based wireless networks that comprise sink and relay nodes. Specifically, we compute vacancy (complement of coverage) and percolation probabilities as functions of sink and relay node densities. Further, we identify that the vacancy probability in an alternate model that is motivated from traditional coverage processes, referred to as independent-disc model, constitutes a lower bound for the vacancy in the original infrastructure-based model. For the case of percolation, we identify a threshold boundary (in the space of sink-relay densities pair) where the percolation probability transits rapidly from 0 to 1 (i.e., from no-percolation to full-percolation).
{"title":"Infrastructure-based wireless networks: Coverage and percolation properties","authors":"Sumanth Timmadasari, K. P. Naveen, S. Bhashyam","doi":"10.23919/WIOPT.2018.8362875","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362875","url":null,"abstract":"We present results from an extensive simulation study, conducted to understand the properties of coverage and percolation in infrastructure-based wireless networks that comprise sink and relay nodes. Specifically, we compute vacancy (complement of coverage) and percolation probabilities as functions of sink and relay node densities. Further, we identify that the vacancy probability in an alternate model that is motivated from traditional coverage processes, referred to as independent-disc model, constitutes a lower bound for the vacancy in the original infrastructure-based model. For the case of percolation, we identify a threshold boundary (in the space of sink-relay densities pair) where the percolation probability transits rapidly from 0 to 1 (i.e., from no-percolation to full-percolation).","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127979974","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362885
Bowen Yu, Lingjun Pu, Qinyi Xie, Jingdong Xu
In this paper, we propose MIU, a novel mobile edge computing framework for iot applications in ultra dense networks, via the control of the macro base station. We present a comprehensive framework model, and formulate a joint task offloading, user association and small base station sleeping problem, aiming at minimizing the energy consumptions of network-wide IoT devices and total SBSs while respecting a series of practical constraints. We design an efficient algorithm by invoking dual-decomposition and subgradient method to solve the formulated mixed-integer quadratic programming problem. Extensive simulation results show that our proposed algorithm achieves better performance in energy consumption than several benchmark schemes.
{"title":"Energy efficient scheduling for IoT applications with offloading, user association and BS sleeping in ultra dense networks","authors":"Bowen Yu, Lingjun Pu, Qinyi Xie, Jingdong Xu","doi":"10.23919/WIOPT.2018.8362885","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362885","url":null,"abstract":"In this paper, we propose MIU, a novel mobile edge computing framework for iot applications in ultra dense networks, via the control of the macro base station. We present a comprehensive framework model, and formulate a joint task offloading, user association and small base station sleeping problem, aiming at minimizing the energy consumptions of network-wide IoT devices and total SBSs while respecting a series of practical constraints. We design an efficient algorithm by invoking dual-decomposition and subgradient method to solve the formulated mixed-integer quadratic programming problem. Extensive simulation results show that our proposed algorithm achieves better performance in energy consumption than several benchmark schemes.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114165635","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362884
Kerem Aytaç, Ömer Korçak
Internet of Things (IoT) term has been hyped for years, and takes so many thing's places in everywhere and makes many things to become easier and remotely controllable with smart automations. Human role in such areas are about to be vanished and sensors, actuators, gateways take over the workloads from human-being by generating the values which are desired to be measured, and transferring them within the network. They also take decisions with some preset rules, artificial intelligence or machine learning methods on behalf of humans. Edge computing became a vital as there is a huge amount of requirement of low-latency, extra resources, network restrictions, loose connections, real-time decisions, etc. In quick service restaurants, many waste management and service optimizations are human or paper-based which contains pre-calculated or pre-simulated values. In this paper, we propose an IoT architecture for quick service restaurants and describe various edge computing applications including processing the sensor values, extracting meaningful information, providing data integrity and more importantly learning the data patterns to present predictions, create alerts, or make some intelligent decisions to provide waste minimization and service optimization.
{"title":"IoT edge computing in quick service restaurants","authors":"Kerem Aytaç, Ömer Korçak","doi":"10.23919/WIOPT.2018.8362884","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362884","url":null,"abstract":"Internet of Things (IoT) term has been hyped for years, and takes so many thing's places in everywhere and makes many things to become easier and remotely controllable with smart automations. Human role in such areas are about to be vanished and sensors, actuators, gateways take over the workloads from human-being by generating the values which are desired to be measured, and transferring them within the network. They also take decisions with some preset rules, artificial intelligence or machine learning methods on behalf of humans. Edge computing became a vital as there is a huge amount of requirement of low-latency, extra resources, network restrictions, loose connections, real-time decisions, etc. In quick service restaurants, many waste management and service optimizations are human or paper-based which contains pre-calculated or pre-simulated values. In this paper, we propose an IoT architecture for quick service restaurants and describe various edge computing applications including processing the sensor values, extracting meaningful information, providing data integrity and more importantly learning the data patterns to present predictions, create alerts, or make some intelligent decisions to provide waste minimization and service optimization.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129200285","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362846
Sudheer Poojary, R. E. Azouzi, E. Altman, Albert Sunny, Imen Triki, Majed Haddad, T. Jiménez, S. Valentin, D. Tsilimantos
Adaptive video streaming improves users' quality of experience (QoE), while using the network efficiently. In the last few years, adaptive video streaming has seen widespread adoption and has attracted significant research effort. We study a dynamic system of random arrivals and departures for different classes of users using the adaptive streaming industry standard DASH (Dynamic Adaptive Streaming over HTTP). Using a Markov chain based analysis, we compute the user QoE metrics: probability of starvation, prefetching delay, average video quality and switching rate. We validate our model by simulations, which show a very close match. Our study of the playout buffer is based on client adaptation scheme, which makes efficient use of the network while improving users' QoE. We prove that for buffer-based variants, the average video bit-rate matches the average channel rate. Hence, we would see quality switches whenever the average channel rate does not match the available video bit rates. We give a sufficient condition for setting the playout buffer threshold to ensure that quality switches only between adjacent quality levels.
{"title":"Analysis of QoE for adaptive video streaming over wireless networks","authors":"Sudheer Poojary, R. E. Azouzi, E. Altman, Albert Sunny, Imen Triki, Majed Haddad, T. Jiménez, S. Valentin, D. Tsilimantos","doi":"10.23919/WIOPT.2018.8362846","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362846","url":null,"abstract":"Adaptive video streaming improves users' quality of experience (QoE), while using the network efficiently. In the last few years, adaptive video streaming has seen widespread adoption and has attracted significant research effort. We study a dynamic system of random arrivals and departures for different classes of users using the adaptive streaming industry standard DASH (Dynamic Adaptive Streaming over HTTP). Using a Markov chain based analysis, we compute the user QoE metrics: probability of starvation, prefetching delay, average video quality and switching rate. We validate our model by simulations, which show a very close match. Our study of the playout buffer is based on client adaptation scheme, which makes efficient use of the network while improving users' QoE. We prove that for buffer-based variants, the average video bit-rate matches the average channel rate. Hence, we would see quality switches whenever the average channel rate does not match the available video bit rates. We give a sufficient condition for setting the playout buffer threshold to ensure that quality switches only between adjacent quality levels.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129749681","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}
Mobile edge computing (MEC) has emerged as a promising technique to address the challenge arising from the exponentially increasing data traffic. It not only supports mobile users to offload computations but also caches and delivers popular contents to mobile users. In this paper, we aim at designing novel content caching strategies in MEC networks to reduce access latency and improve energy efficiency. First, the distributed content delivery network based on MECs is developed to support users' requests locally. Moreover, based on users' distribution characteristics and MECs' location, a grouping-based and hierarchical collaborative caching strategy is proposed. Simulation results prove that our caching strategy is more efficient than alternative benchmark strategies in terms of average access latency, total energy consumption and content diversity.
{"title":"GHCC: Grouping-based and hierarchical collaborative caching for mobile edge computing","authors":"Dewang Ren, Xiaolin Gui, Wei Lu, Jian An, Huijun Dai, Xin Liang","doi":"10.23919/WIOPT.2018.8362881","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362881","url":null,"abstract":"Mobile edge computing (MEC) has emerged as a promising technique to address the challenge arising from the exponentially increasing data traffic. It not only supports mobile users to offload computations but also caches and delivers popular contents to mobile users. In this paper, we aim at designing novel content caching strategies in MEC networks to reduce access latency and improve energy efficiency. First, the distributed content delivery network based on MECs is developed to support users' requests locally. Moreover, based on users' distribution characteristics and MECs' location, a grouping-based and hierarchical collaborative caching strategy is proposed. Simulation results prove that our caching strategy is more efficient than alternative benchmark strategies in terms of average access latency, total energy consumption and content diversity.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129929428","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362889
V. Sukumaran, C. Singh
We study stability properties of single-source single-destination delay tolerant networks with random packet arrivals and buffered relay nodes, using source spray and wait routing. We derive the stability threshold, the supremum of arrival rates for which the source queue is stable, as a function of the buffer space at the relays. In particular, we show that the stability threshold only doubles as the relays' buffer size increases from one to infinity for a network without packet delivery feedback. For the system without packet delivery feedback, we propose lower bounds for the average queueing delay and average delivery delay for packets and compare with simulations. We also obtain the stability threshold numerically for a network with instantaneous packet delivery feedback.
{"title":"Stability properties of delay tolerant networks with buffered relay nodes","authors":"V. Sukumaran, C. Singh","doi":"10.23919/WIOPT.2018.8362889","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362889","url":null,"abstract":"We study stability properties of single-source single-destination delay tolerant networks with random packet arrivals and buffered relay nodes, using source spray and wait routing. We derive the stability threshold, the supremum of arrival rates for which the source queue is stable, as a function of the buffer space at the relays. In particular, we show that the stability threshold only doubles as the relays' buffer size increases from one to infinity for a network without packet delivery feedback. For the system without packet delivery feedback, we propose lower bounds for the average queueing delay and average delivery delay for packets and compare with simulations. We also obtain the stability threshold numerically for a network with instantaneous packet delivery feedback.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127303273","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362845
Parikshit Hegde, Akshit Kumar, R. Vaze
A single server with variable speed and a finite buffer is considered under a maximum packet drop probability constraint. The cost of processing by the server is a convex function of the speed of the server. If a packet arrives when the buffer is full, it is dropped instantaneously. Given the finite server buffer, the objective is to find the optimal dynamic server speed to minimize the overall cost subject to the maximum packet drop probability constraint. Finding the exact optimal solution is known to be hard, and hence algorithms with provable approximation bounds are considered. We show that if the buffer size is large enough, the proposed algorithm achieves the optimal performance. For arbitrary buffer sizes, constant approximation guarantees are derived for a large class of packet arrival distributions such as Bernoulli, Exponential, Poisson etc.
{"title":"Speed scaling under QoS constraints with finite buffer","authors":"Parikshit Hegde, Akshit Kumar, R. Vaze","doi":"10.23919/WIOPT.2018.8362845","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362845","url":null,"abstract":"A single server with variable speed and a finite buffer is considered under a maximum packet drop probability constraint. The cost of processing by the server is a convex function of the speed of the server. If a packet arrives when the buffer is full, it is dropped instantaneously. Given the finite server buffer, the objective is to find the optimal dynamic server speed to minimize the overall cost subject to the maximum packet drop probability constraint. Finding the exact optimal solution is known to be hard, and hence algorithms with provable approximation bounds are considered. We show that if the buffer size is large enough, the proposed algorithm achieves the optimal performance. For arbitrary buffer sizes, constant approximation guarantees are derived for a large class of packet arrival distributions such as Bernoulli, Exponential, Poisson etc.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114664201","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362890
P. Narayanan, L. N. Theagarajan
In this paper, we present an iterative best-response algorithm to compute the Nash equilibrium of a power allocation game in a multiple access channel (MAC), where each user greedily chooses a power allocation policy to maximize their average transmission rate. We consider a MAC where the fading channel gains are assumed to be stationary and ergodic processes, taking values from a finite set. The receiver decodes the message of a user by assuming the messages of the rest of the users as noise. The Shannon capacity of a user is considered to be the achievable rate of that user. A user transmits with a transmit power chosen from a finite set of power values, in a selfish manner, such that their average rate of transmission is maximized. We show that the Nash equilibrium of this game is unique, provided the number of users in the system is sufficiently large, but finite. Under this condition, we also show that the equilibrium policy does not change with more number of users coming into the system. We propose a simple greedy algorithm to compute the Nash equilibrium when the number of users is sufficiently large, but finite. The proposed algorithm does not depend upon the parameters of other users and hence, can be computed without any feedback or side-information from other users. We also present numerical results to illustrate the performance of the proposed algorithm.
{"title":"The invariant Nash equilibrium for stochastic games in multiple access channel","authors":"P. Narayanan, L. N. Theagarajan","doi":"10.23919/WIOPT.2018.8362890","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362890","url":null,"abstract":"In this paper, we present an iterative best-response algorithm to compute the Nash equilibrium of a power allocation game in a multiple access channel (MAC), where each user greedily chooses a power allocation policy to maximize their average transmission rate. We consider a MAC where the fading channel gains are assumed to be stationary and ergodic processes, taking values from a finite set. The receiver decodes the message of a user by assuming the messages of the rest of the users as noise. The Shannon capacity of a user is considered to be the achievable rate of that user. A user transmits with a transmit power chosen from a finite set of power values, in a selfish manner, such that their average rate of transmission is maximized. We show that the Nash equilibrium of this game is unique, provided the number of users in the system is sufficiently large, but finite. Under this condition, we also show that the equilibrium policy does not change with more number of users coming into the system. We propose a simple greedy algorithm to compute the Nash equilibrium when the number of users is sufficiently large, but finite. The proposed algorithm does not depend upon the parameters of other users and hence, can be computed without any feedback or side-information from other users. We also present numerical results to illustrate the performance of the proposed algorithm.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121074741","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 : 2018-05-07DOI: 10.23919/WIOPT.2018.8362887
Vaggelis G. Douros, Janne Riihijärvi, P. Mähönen
Cache-enabled networks have received increasing attention in both wired and wireless settings. A big challenge for the operator of such networks is to solve efficiently the content placement problem, i.e., to decide how many caches to deploy in the network and in which nodes. We study the content placement problem for two classes of network optimisation objectives, the first focusing on the minimisation of the sum of the shortest paths and the second capturing the cost vs. benefit trade-off to deploy a cache. We know from the state-of-the-art that, even in small networks with few caches, it is unrealistic to find the optimal solution in a reasonable timescale for similar optimisation problems. In order to cope with this challenge, we present an approach under the prism of network analysis. We introduce a family of lightweight heuristic algorithms that use graph-theoretic metrics that identify the most important nodes of the network. We evaluate the performance of the heuristics using real network datasets, showing that the best heuristics are based on the metrics of betweenness centrality and degree centrality. Finally, we provide a randomised version of the heuristics noticing that the same metrics present again the best performance across the different datasets. Moreover, we find out that, in general, the deterministic version of each heuristic outperforms its randomised version.
{"title":"On the efficiency of lightweight content placement heuristics for cache-enabled networks","authors":"Vaggelis G. Douros, Janne Riihijärvi, P. Mähönen","doi":"10.23919/WIOPT.2018.8362887","DOIUrl":"https://doi.org/10.23919/WIOPT.2018.8362887","url":null,"abstract":"Cache-enabled networks have received increasing attention in both wired and wireless settings. A big challenge for the operator of such networks is to solve efficiently the content placement problem, i.e., to decide how many caches to deploy in the network and in which nodes. We study the content placement problem for two classes of network optimisation objectives, the first focusing on the minimisation of the sum of the shortest paths and the second capturing the cost vs. benefit trade-off to deploy a cache. We know from the state-of-the-art that, even in small networks with few caches, it is unrealistic to find the optimal solution in a reasonable timescale for similar optimisation problems. In order to cope with this challenge, we present an approach under the prism of network analysis. We introduce a family of lightweight heuristic algorithms that use graph-theoretic metrics that identify the most important nodes of the network. We evaluate the performance of the heuristics using real network datasets, showing that the best heuristics are based on the metrics of betweenness centrality and degree centrality. Finally, we provide a randomised version of the heuristics noticing that the same metrics present again the best performance across the different datasets. Moreover, we find out that, in general, the deterministic version of each heuristic outperforms its randomised version.","PeriodicalId":231395,"journal":{"name":"2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121961752","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
扫码关注我们
求助内容：
应助结果提醒方式：