{"title":"Multiple Channel Assignment and Recovery Algorithm for MR-MC Network","authors":"P. Ren","doi":"10.1109/NAS.2013.36","DOIUrl":"https://doi.org/10.1109/NAS.2013.36","url":null,"abstract":"With the development of computer and wireless technology, cost and size of the wireless transceiver has decreased greatly. It is feasible and necessary to equip multiple radios on sensor nodes, especially on the backbone nodes having high demand on performance. The author proposed a MR-MC (Multi-radio and Multi-channel) manufacturing sensor network based on the nested cellular topology in previous research. How to assign and recover wireless channel is a key problem. In this paper, a channel assignment and recovery algorithm was proposed, which assigns different channels to the neighboring subnets to reduce interference. Meanwhile, the network capacity will be improved by channel multiplexing between the far-away subnets. In addition, the calculation of interference radius makes this algorithm be more accurate than hop-model. OPNET simulation experimental results show that it has good performance in the aspects of MAC delay, MAC throughput and network effectiveness.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127438768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Specific Scheme for Rate-Controlled Smooth Scheduling Based on Timeslot-Iteration","authors":"Ji Li, Zheng Wan, Zhonghua Li, N. Xiong","doi":"10.1109/NAS.2013.17","DOIUrl":"https://doi.org/10.1109/NAS.2013.17","url":null,"abstract":"Packet schedulers are the key to guarantee quality of service in computer networks. The rate-controlled EDF schedulers embrace the good characteristics of output smoothness. But the methods used in the existing EDF schedulers to calculate eligible time are based on a real or virtual global system time, which is too complex to be implemented in high-speed networks. The paper presents a specific and practical scheme to implement a timeslot based EDF scheduler which named TiRSS (Rate-controlled Smooth Scheduling Based on Timeslot-iteration). In order to avoid the dependence of the global system time, TiRSS apply a new feasible state tracking mechanism which update the state of queues along with the scheduling timeslot iteratively. Theory analysis proved the state tracking mechanism can accurately track the process of packet transmitting in the ideal scheduling model. Through this counting mechanism combined with EDF scheduling principle, TiRSS realizes a practical implementation to EDF scheduler based on timeslot-iteration. The sufficient theoretical analysis and simulation results show that TiRSS is reasonable and effective.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130809339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Improved Ant Colony Clustering Method for Network Intrusion Detection","authors":"Meng Ling-xi, Sun Guang","doi":"10.1109/NAS.2013.50","DOIUrl":"https://doi.org/10.1109/NAS.2013.50","url":null,"abstract":"Intrusion detection is an important aspect of the network information safety. For the disadvantage that the existing intrusion detection method is not comprehensive of various kinds of attack and has lower detection rate and the higher fault detection rate, an improved ant colony clustering method for intrusion detection is proposed. The convergence rate of ant colony cluster algorithm is improved. In the optimization process, the information entropy is introduced to prevent into local optimal, and thus the method can adjust automatic the update pheromone and improve the clustering speed. And follow on, the intrusion detection system is designed. The experimental results show that the method is not only improves the detection rate, but reduced the fault detection rate, and can detection precisely the various kinds of attacks.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"522 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120884275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design of a Quadruple Precision Floating-Point Fused Multiply-Add Unit Based on 4-Way SIMD Device","authors":"Jun He, Biao Wang, Ying Zhu","doi":"10.1109/NAS.2013.42","DOIUrl":"https://doi.org/10.1109/NAS.2013.42","url":null,"abstract":"Aiming to decrease the hardware cost of floating-point quadruple precision fused multiply-add (QPFMA) unit, a new QPFMA unit is designed and realized based on a 4-way SIMD device, which supports 64-bit×4 floating-point double precision fused multiply-add (DPFMA). The new QPFMA supports four kinds of FMA operations, multiplication, addition, subtraction and comparison, with the operation latency of 7 cycles. By decomposing the 113-bit×113-bit multiplication of quadruple precision fractions into four 57-bit×57-bit multiplications to share the 53-bit×53-bit multipliers of the 4-way SIMD DPFMA, the hardware cost of the new QPFMA is reduced sharply. After the new QPFMA is synthesized in 65nm cell library, the results show that it has significant advantages both in area and latency, with frequency at 1.1GHz, area 42.71% of a classic QPFMA unit, operation latency decreased by 3 cycles.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130425323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Web Service Composition Recommendation Approach Based on Reliable QoS","authors":"Denghui Wang, Haozhe Huang, C. Xie","doi":"10.1109/NAS.2013.52","DOIUrl":"https://doi.org/10.1109/NAS.2013.52","url":null,"abstract":"Quality of Service (QoS) play very important role in web service recommendation system. The precision of service recommendation depends on the credible QoS. So people begin to find better method for calculating the credibility of QoS. We can count the execution result and user comment to calculate the QoS credibility of single web service. But how to calculate the QoS credibility of web service composition becomes a huge challenge. In this paper, a novel reliable web service composition recommendation approach is proposed. The QoS information is divided into two different categories. The approach use different strategy for these categories. At last, one case study is shown for prove the feasibility of novel reliable web service composition recommendation approach.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521765","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Optimization Algorithm for PAPR Reduction in OFDM System Based on Tabu Search","authors":"Ding Shuyan, Shu Ruo, Li Shibao, Gu Zhaozhi","doi":"10.1109/NAS.2013.51","DOIUrl":"https://doi.org/10.1109/NAS.2013.51","url":null,"abstract":"Partial transmit sequence (PTS) is a distortionless technique used to reduce the peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. However, it has a relatively high computational complexity. A simplified scheme is proposed in this paper. In the proposed scheme, the computation for finding the best scrambling sequences is simplified by making use of the tabu search algorithm, thus achieving the reduction of computational complexity. Algorithm analysis and simulation results show that, as compared with conventional method, the proposed scheme could be implemented with lower complexity while at no loss of PAPR performance.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123280254","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}
K. S. Venkataraman, Tong Zhang, Wenzhe Zhao, Hongbin Sun, Nanning Zheng
{"title":"Scheduling Algorithms for Handling Updates in Shingled Magnetic Recording","authors":"K. S. Venkataraman, Tong Zhang, Wenzhe Zhao, Hongbin Sun, Nanning Zheng","doi":"10.1109/NAS.2013.33","DOIUrl":"https://doi.org/10.1109/NAS.2013.33","url":null,"abstract":"Shingled recording has recently emerged as one promising candidate to sustain the historical growth of magnetic recording storage areal density. However, since the convenient update-in-place feature is no longer available in shingled recording, many sectors must be read and written back in order to update one sector. This leads to a significant update-induced latency overhead and makes conventional hard disk drive scheduling algorithms perform poorly. This paper concerns with the development of appropriate scheduling algorithms for shingled recording based hard disk drives. We first present a simple partial-update scheduling algorithm that can naturally embrace the update latency issue and achieves significant gains over conventional scheduling algorithms. We enhance this algorithm by incorporating a shortest update first policy, which can further reduce the update response time on an average by 70%. Finally, motivated by abundant workload spatial and temporal locality, we develop a spatio-temporal band coalescing scheme that can achieve an additional reduction of update response time of up to 96.8%.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125391762","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Effective Feature Selection Approach for Network Intrusion Detection","authors":"Fengli Zhang, Dan Wang","doi":"10.1109/NAS.2013.49","DOIUrl":"https://doi.org/10.1109/NAS.2013.49","url":null,"abstract":"Processing huge amounts of network data is one of the largest challenges for network-based intrusion detection system (IDS). Usually these data contain lots of irrelevant or redundant features. To improve the efficiency of IDS, relevant features are necessary to be extracted from original data via feature selection approaches. In this paper, an effective feature selection approach based on Bayesian Network classifier is proposed. And with the same intrusion detection benchmark dataset (NSL-KDD), the performance of the proposed approach is evaluated and compared with other commonly used feature selection methods. It is shown by empirical results that features selected by our approach have decreased the time to detect attacks and increased the classification accuracy as well as the true positive rates significantly.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121354390","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}
R. Hassani, A. Fazely, Riaz-Ul-Ahsan Choudhury, P. Luksch
{"title":"Analysis of Sparse Matrix-Vector Multiplication Using Iterative Method in CUDA","authors":"R. Hassani, A. Fazely, Riaz-Ul-Ahsan Choudhury, P. Luksch","doi":"10.1109/NAS.2013.41","DOIUrl":"https://doi.org/10.1109/NAS.2013.41","url":null,"abstract":"Scaling up the sparse matrix-vector multiplication has been at the heart of numerous studies in both academia and industry. The massive parallelism of graphics processing units offers tremendous performance in many high-performance computing applications. In this work, we discuss performance analysis for parallel implementation of sparse matrix-vector multiplication using the conjugate gradient algorithm that are efficiently implemented on the NVIDIA CUDA architecture to exploit the massive compute power of today's GPUs. The results show that in comparison to the parallel CPU implementations, the parallel version of the conjugate gradient algorithm on GPU is in average 30 times faster depending on computational kernels.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129285816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"REPAIR: A Reliable Partial-Redundancy-Based Router in NoC","authors":"Lei Xie, K. Mei, Yuhai Li","doi":"10.1109/NAS.2013.28","DOIUrl":"https://doi.org/10.1109/NAS.2013.28","url":null,"abstract":"As scale and integration density of network-on-chip increase sharply, more transistors have been integrated into one chip. This unfortunately leads to more unexpected variations and faults in system. In particular, the transient errors and hardware permanent faults have rapidly become the key constraint for large-scale network design. This increasing tendency highlights the incorporation of fault-tolerant solutions for Network-on-Chip (NoC) architecture. In this paper we propose a Reliable Partial-Redundancy-based router architecture (REPAIR). The proposed scheme merely utilizes an additional buffer and a bus to enhance the connectivity of the data path in router. Meanwhile, REPAIR also employs error control coding (ECC) modules and decision-table-based (DT) control logic to implement an efficient online diagnosis and reconfigurable mechanism respectively. The experimental results show the good ability of REPAIR to tolerate hard faults under a high fault rates. Specifically, the silicon protection factor (SPF) of individual router reaches 16.34 and over 95% packets still can be successfully transferred in 16x16 torus network with 650 faults.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125978024","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}