An improved particle swarm optimization (PSO) algorithm based on self-adaptive excellence coefficients, Cauchy operator and 3-opt, called SCLPSO, is proposed in this paper in order to deal with the issues such as premature convergence and low accuracy of the basic discrete PSO when applied to traveling salesman problem (TSP). To improve the optimization ability and convergence speed of the algorithm, each edge is assigned a self-adaptive excellence coefficient based on the principle of roulette selection, which can be adjusted dynamically according to the process of searching for the solutions. To gain better global search ability of the basic discrete PSO, the Cauchy distribution density function is used to regulate the inertia weight so as to improve the diversity of the population. Furthermore, the 3-opt local search technique is utilized to increase the accuracy and convergence speed of the algorithm. Through simulation experiments with MATLAB, the performance of the proposed algorithm is evaluated on several classical examples taken from the TSPLIB. The experimental results indicate that the proposed SCLPSO algorithm performs better in terms of accuracy and convergence speed compared with several other algorithms, and thus is a potential intelligence algorithm for solving TSP.
{"title":"An Improved Particle Swarm Optimization Algorithm Based on Cauchy Operator and 3-Opt for TSP","authors":"Biyun Cheng, Haiyan Lu, Yang Huang, Kaibo Xu","doi":"10.1109/PDCAT.2016.048","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.048","url":null,"abstract":"An improved particle swarm optimization (PSO) algorithm based on self-adaptive excellence coefficients, Cauchy operator and 3-opt, called SCLPSO, is proposed in this paper in order to deal with the issues such as premature convergence and low accuracy of the basic discrete PSO when applied to traveling salesman problem (TSP). To improve the optimization ability and convergence speed of the algorithm, each edge is assigned a self-adaptive excellence coefficient based on the principle of roulette selection, which can be adjusted dynamically according to the process of searching for the solutions. To gain better global search ability of the basic discrete PSO, the Cauchy distribution density function is used to regulate the inertia weight so as to improve the diversity of the population. Furthermore, the 3-opt local search technique is utilized to increase the accuracy and convergence speed of the algorithm. Through simulation experiments with MATLAB, the performance of the proposed algorithm is evaluated on several classical examples taken from the TSPLIB. The experimental results indicate that the proposed SCLPSO algorithm performs better in terms of accuracy and convergence speed compared with several other algorithms, and thus is a potential intelligence algorithm for solving TSP.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130119801","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}
With the increased network scale and complexity of network topology, especially the constant variation of attacking modes, it becomes urgent to find efficient methods to localize anomalies quickly and accurately. Present studies on network performance are mostly limited to detecting anomalies, or balancing the missed rate and false alarm rate of anomaly detection. The existing small amount of localization researches are divided into two categories: localization methods based on end to end path probe and wavelet transform. This paper introduces some existing network anomaly localization methods and analyzes the performance of them. Finally, we discuss the existing technical difficulties in anomaly localization.
{"title":"Study on Network Anomaly Localization Techniques","authors":"Jingtian Liu, Hui Tian","doi":"10.1109/PDCAT.2016.090","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.090","url":null,"abstract":"With the increased network scale and complexity of network topology, especially the constant variation of attacking modes, it becomes urgent to find efficient methods to localize anomalies quickly and accurately. Present studies on network performance are mostly limited to detecting anomalies, or balancing the missed rate and false alarm rate of anomaly detection. The existing small amount of localization researches are divided into two categories: localization methods based on end to end path probe and wavelet transform. This paper introduces some existing network anomaly localization methods and analyzes the performance of them. Finally, we discuss the existing technical difficulties in anomaly localization.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"98 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120974158","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}
In order to hide long memory latency and alleviate memory bandwidth requirement, a fourth-level cache (L4) is introduced in modern high-performance multi-core systems for supporting parallel computation. However, additional cache level causes higher cache miss penalty since a request needs to go through all levels of caches to reach to the main memory. In this paper, we introduce a new way of using a Bloom Filter (BF) to predict cache misses at any cache level in a multicore system. These misses can runahead to access lower-level caches or memory to reduce the miss penalty. The proposed hashing scheme extends the cache index of the target set and uses it for accessing the BF array to avoid counters in the BF array. Performance evaluation using a set of SPEC2006 benchmarks on 8-core systems with 4-level cache hierarchy shows that using a BF for the third-level (L3) cache to filter and runahead L3 misses, the IPCs can be improved by 4-20% with an average 10.5%. In comparison with the delay-recalibration scheme, the improvement is 3.5-4.8%.
{"title":"Runahead Cache Misses Using Bloom Filter","authors":"Xi Tao, Qi Zeng, J. Peir, Shih-Lien Lu","doi":"10.1109/PDCAT.2016.017","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.017","url":null,"abstract":"In order to hide long memory latency and alleviate memory bandwidth requirement, a fourth-level cache (L4) is introduced in modern high-performance multi-core systems for supporting parallel computation. However, additional cache level causes higher cache miss penalty since a request needs to go through all levels of caches to reach to the main memory. In this paper, we introduce a new way of using a Bloom Filter (BF) to predict cache misses at any cache level in a multicore system. These misses can runahead to access lower-level caches or memory to reduce the miss penalty. The proposed hashing scheme extends the cache index of the target set and uses it for accessing the BF array to avoid counters in the BF array. Performance evaluation using a set of SPEC2006 benchmarks on 8-core systems with 4-level cache hierarchy shows that using a BF for the third-level (L3) cache to filter and runahead L3 misses, the IPCs can be improved by 4-20% with an average 10.5%. In comparison with the delay-recalibration scheme, the improvement is 3.5-4.8%.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123023372","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}
Semantic taxonomies are the flexible way to organize, navigate and retrieve information effectively. Natural Language Processing and Artificial Intelligence tasks are heavily relied on these taxonomies. This paper presents a taxonomy induction system that integrates two modules: word-embedding and string inclusion. We implement a simple, semi-supervised and domain independent system based on Taxonomy Extraction Evaluation (TExEval2) Task, SemEval 2016. The task is divided into two steps, first is to identify hyponym-hypernym relations and then to construct a taxonomy from a domain specific terms lists. The system is trained over large general corpus. The system learns vectors for phrases and utilizes word vectors with phrases such as "known as", etc. to generate possible hypernyms and construct taxonomy. Three different domains, i.e. environment, food and science are considered for taxonomy induction. The constructed taxonomies are evaluated against gold standard taxonomies. The proposed system achieved significant results for hyponym-hypernym identification and taxonomy induction.
{"title":"A Domain-Independent Hybrid Approach for Automatic Taxonomy Induction","authors":"Bushra Zafar, Usman Qamar, Ayesha Imran","doi":"10.1109/PDCAT.2016.085","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.085","url":null,"abstract":"Semantic taxonomies are the flexible way to organize, navigate and retrieve information effectively. Natural Language Processing and Artificial Intelligence tasks are heavily relied on these taxonomies. This paper presents a taxonomy induction system that integrates two modules: word-embedding and string inclusion. We implement a simple, semi-supervised and domain independent system based on Taxonomy Extraction Evaluation (TExEval2) Task, SemEval 2016. The task is divided into two steps, first is to identify hyponym-hypernym relations and then to construct a taxonomy from a domain specific terms lists. The system is trained over large general corpus. The system learns vectors for phrases and utilizes word vectors with phrases such as \"known as\", etc. to generate possible hypernyms and construct taxonomy. Three different domains, i.e. environment, food and science are considered for taxonomy induction. The constructed taxonomies are evaluated against gold standard taxonomies. The proposed system achieved significant results for hyponym-hypernym identification and taxonomy induction.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114515342","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}
For parallel dam break simulations in OpenFOAM (Open Source Field Operation and Manipulation), the core procedure is solving linear systems using iterative methods and the iterative convergence rate is significant to the overall efficiency. A dynamic mesh repartitioning scheme DMRPar (Dynamic Mesh Re-Partitioning) considering the iterative convergence feature is implemented in OpenFOAM. Given that the numerical characteristics of linear systems change a lot along with the complex flow field, DMRPar takes linear system information from the previous timestep into account for the repartitioning at the current timestep. The implementation reuses current mesh topology in OpenFOAM and calculates distributed adjacency graph structure for the mesh. The repartitioning heuristic is based on a general multi-level parallel graph partitioning package called ParMetis. Numerical results on two typical dam break simulations show that DMRPar outperforms the traditional static partitioning method significantly in the total simulation time.
对于OpenFOAM (Open Source Field Operation and Manipulation)中的并行溃坝模拟，其核心步骤是采用迭代方法求解线性系统，迭代收敛速度对整体效率具有重要意义。在OpenFOAM中实现了一种考虑迭代收敛特性的动态网格重分区方案DMRPar (dynamic mesh Re-Partitioning)。考虑到线性系统的数值特征会随着复杂流场的变化而发生很大的变化，DMRPar在当前时间步长重新划分时考虑了前一时间步长的线性系统信息。该实现重用OpenFOAM中现有的网格拓扑结构，并计算网格的分布式邻接图结构。重分区启发式算法基于一个称为ParMetis的通用多级并行图分区包。两个典型溃坝模拟的数值结果表明，DMRPar方法在总模拟时间上明显优于传统的静态划分方法。
{"title":"DMRPar: A Dynamic Mesh Repartitioning Scheme for Dam Break Simulations in OpenFOAM","authors":"Miao Wang, Xiaoguang Ren, Chao Li, Zhiling Li","doi":"10.1109/PDCAT.2016.054","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.054","url":null,"abstract":"For parallel dam break simulations in OpenFOAM (Open Source Field Operation and Manipulation), the core procedure is solving linear systems using iterative methods and the iterative convergence rate is significant to the overall efficiency. A dynamic mesh repartitioning scheme DMRPar (Dynamic Mesh Re-Partitioning) considering the iterative convergence feature is implemented in OpenFOAM. Given that the numerical characteristics of linear systems change a lot along with the complex flow field, DMRPar takes linear system information from the previous timestep into account for the repartitioning at the current timestep. The implementation reuses current mesh topology in OpenFOAM and calculates distributed adjacency graph structure for the mesh. The repartitioning heuristic is based on a general multi-level parallel graph partitioning package called ParMetis. Numerical results on two typical dam break simulations show that DMRPar outperforms the traditional static partitioning method significantly in the total simulation time.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121554334","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}
Embedding virtual network requests in an underlying physical infrastructure, the so-called virtual network embedding (VNE) problem, has attracted significant research interests already. A realistic scenario might entail embedding multiple VN requests (MVNE) that arrive simultaneously (batch arrivals). The existing heuristic MVNE approaches neither consider the coordination among multiple VNR embeddings nor embed all the arriving VNRs simultaneously considering the available physical resources. This paper considers the MVNE problem in the scenario where the available physical resources may not be sufficient to satisfy the physical resource demands of all the VNRs in the batch. We explore applying genetic algorithm (GA) to handle the MVNE problem. We propose an algorithm to decide which VNRs could be mapped together. Extensive simulations are carried out to evaluate the performance of the proposed algorithms in terms of the VN acceptance ratio and the long-term revenue of the service provider.
{"title":"Resource-Aware Virtual Network Parallel Embedding Based on Genetic Algorithm","authors":"Zibo Zhou, Xiaolin Chang, Yang Yang, Lin Li","doi":"10.1109/PDCAT.2016.031","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.031","url":null,"abstract":"Embedding virtual network requests in an underlying physical infrastructure, the so-called virtual network embedding (VNE) problem, has attracted significant research interests already. A realistic scenario might entail embedding multiple VN requests (MVNE) that arrive simultaneously (batch arrivals). The existing heuristic MVNE approaches neither consider the coordination among multiple VNR embeddings nor embed all the arriving VNRs simultaneously considering the available physical resources. This paper considers the MVNE problem in the scenario where the available physical resources may not be sufficient to satisfy the physical resource demands of all the VNRs in the batch. We explore applying genetic algorithm (GA) to handle the MVNE problem. We propose an algorithm to decide which VNRs could be mapped together. Extensive simulations are carried out to evaluate the performance of the proposed algorithms in terms of the VN acceptance ratio and the long-term revenue of the service provider.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124341820","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}
With the rapid development of DNA computing, there are some questions worth study that how to implement the arithmetic operations used in cryptosystem based on DNA computing models. This paper proposes an improved DNA computing model to calculate modular-multiplication over finite field GF(2n). Comparing to related works, both assembly time complexity and space complexity are more optimal. The computation tiles performing 4 different functions assemble into the seed configuration with inputs to figure out the result. It is given that how the computation tiles be bitwise coded and how assembly rules work. The assembly time complexity is Θ(n) and the space complexity is Θ(n2). This model requires 148 types of computation tiles and 8 types of boundary tiles.
{"title":"An Improved Molecular Computing Model of Modular-Multiplication over Finite Field GF(2n)","authors":"Yongnan Li, Limin Xiao","doi":"10.1109/PDCAT.2016.063","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.063","url":null,"abstract":"With the rapid development of DNA computing, there are some questions worth study that how to implement the arithmetic operations used in cryptosystem based on DNA computing models. This paper proposes an improved DNA computing model to calculate modular-multiplication over finite field GF(2n). Comparing to related works, both assembly time complexity and space complexity are more optimal. The computation tiles performing 4 different functions assemble into the seed configuration with inputs to figure out the result. It is given that how the computation tiles be bitwise coded and how assembly rules work. The assembly time complexity is Θ(n) and the space complexity is Θ(n2). This model requires 148 types of computation tiles and 8 types of boundary tiles.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595261","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}
RAID codes are extensive developed to supply high reliability and high available for storage systems in modern data center. For example, RAID-0, RAID-4, RAID-5 and RAID-6 are wide deployed in in-production storage systems, of which RAID-6 codes are popular with the ability for tolerate two-diskfailure. The paper focus on performance evaluation of storage systems powered by RAID-6, firstly propose an analytical model to measure encoding, decoding and updating complexity, which is translated into XOR operation numbers for storage systems, and quantify the complexity of RDP and RP-RDP (i.e., two RAID-6 data layout schemes) using the formulated analytical model. Computational complexity of RAID code can significantly influence the write performance of storage systems, i.e., optimal computational complexity achieve better storage performance. The numerical results show RP-RDP, with optimal updating complexity, achieve better I/O balancing than RDP. For example, RP-RDP speeds up the load balancing ratio of RDP by a factor of up to 2.95 in the case of Random-SW.
{"title":"A Case Study of Performance Evaluation for RAID-Coded Storage Systems","authors":"Ping Xie, Shengling Geng, Yinghua Tong","doi":"10.1109/PDCAT.2016.071","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.071","url":null,"abstract":"RAID codes are extensive developed to supply high reliability and high available for storage systems in modern data center. For example, RAID-0, RAID-4, RAID-5 and RAID-6 are wide deployed in in-production storage systems, of which RAID-6 codes are popular with the ability for tolerate two-diskfailure. The paper focus on performance evaluation of storage systems powered by RAID-6, firstly propose an analytical model to measure encoding, decoding and updating complexity, which is translated into XOR operation numbers for storage systems, and quantify the complexity of RDP and RP-RDP (i.e., two RAID-6 data layout schemes) using the formulated analytical model. Computational complexity of RAID code can significantly influence the write performance of storage systems, i.e., optimal computational complexity achieve better storage performance. The numerical results show RP-RDP, with optimal updating complexity, achieve better I/O balancing than RDP. For example, RP-RDP speeds up the load balancing ratio of RDP by a factor of up to 2.95 in the case of Random-SW.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128132225","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}
The distant data centre-centric Internet of Things systems face the latency issue especially in the real-time-based applications. Recently, Fog Computing models have been introduced to overcome the latency issue by utilising the proximity-based computational resources. However, the increasing users of Fog Computing servers will cause bottleneck issues and consequently the latency issue arises again. This paper introduces the utilisation of Mist Computing (Mist) model, which exploits the computational and networking resources from the devices at the very edge of IoT networks. The proposed service-oriented mobile-embedded Platform as a Service framework enables the edge IoT devices to provide a platform that allows requesters to deploy and execute their own program models. The framework supports resource-aware autonomous service configuration that can manage the availability of the functions provided by the Mist node based on the dynamically changing hardware resource availability. Additionally, the framework also supports task distribution among a group of Mist nodes. The prototype has been tested and performance evaluated on the real world devices.
{"title":"mePaaS: Mobile-Embedded Platform as a Service for Distributing Fog Computing to Edge Nodes","authors":"M. Liyanage, Chii Chang, S. Srirama","doi":"10.1109/PDCAT.2016.030","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.030","url":null,"abstract":"The distant data centre-centric Internet of Things systems face the latency issue especially in the real-time-based applications. Recently, Fog Computing models have been introduced to overcome the latency issue by utilising the proximity-based computational resources. However, the increasing users of Fog Computing servers will cause bottleneck issues and consequently the latency issue arises again. This paper introduces the utilisation of Mist Computing (Mist) model, which exploits the computational and networking resources from the devices at the very edge of IoT networks. The proposed service-oriented mobile-embedded Platform as a Service framework enables the edge IoT devices to provide a platform that allows requesters to deploy and execute their own program models. The framework supports resource-aware autonomous service configuration that can manage the availability of the functions provided by the Mist node based on the dynamically changing hardware resource availability. Additionally, the framework also supports task distribution among a group of Mist nodes. The prototype has been tested and performance evaluated on the real world devices.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128357569","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}
Multiple-radio multiple-channel (MRMC) wireless mesh networks (WMNs) generally serve as wireless backbones for ubiquitous Internet access. These networks often face a challenge to satisfy multiple user traffic requests simultaneously between different source-destination pairs with different data transfer requirements. We construct analytical network models and formulate such multi-pair routing as a rigorous optimization problem. We design a cooperative routing and scheduling algorithm with channel assignment, in which, a primary path is built upon the selection of appropriate link patterns. The performance of the proposed algorithm is illustrated by simulation-based combinatorial experiments.
{"title":"On Routing of Multiple Concurrent User Requests in Multi-Radio Multi-Channel Wireless Mesh Networks","authors":"Zhanmao Cao, C. Wu, M. Berry","doi":"10.1109/PDCAT.2016.021","DOIUrl":"https://doi.org/10.1109/PDCAT.2016.021","url":null,"abstract":"Multiple-radio multiple-channel (MRMC) wireless mesh networks (WMNs) generally serve as wireless backbones for ubiquitous Internet access. These networks often face a challenge to satisfy multiple user traffic requests simultaneously between different source-destination pairs with different data transfer requirements. We construct analytical network models and formulate such multi-pair routing as a rigorous optimization problem. We design a cooperative routing and scheduling algorithm with channel assignment, in which, a primary path is built upon the selection of appropriate link patterns. The performance of the proposed algorithm is illustrated by simulation-based combinatorial experiments.","PeriodicalId":203925,"journal":{"name":"2016 17th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128544467","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
扫码关注我们
求助内容：
应助结果提醒方式：