2011 IEEE 10th International Symposium on Network Computing and Applications最新文献_第6页

Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers 低延迟多写器原子寄存器的可行实现

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.18

Chryssis Georgiou, N. Nicolaou, A. Russell, Alexander A. Shvartsman

{"title":"Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers","authors":"Chryssis Georgiou, N. Nicolaou, A. Russell, Alexander A. Shvartsman","doi":"10.1109/NCA.2011.18","DOIUrl":"https://doi.org/10.1109/NCA.2011.18","url":null,"abstract":"This work explores implementations of multiwriter/multi-reader (MWMR) atomic registers in asynchronous, crash-prone, message-passing systems with the focus on low latency and computational feasibility. The efficiency of atomic read/write register implementations is traditionally measured in terms of the latency of read and write operations. To reduce operation latency researchers focused on the communication costs, expressed as the number of communication round-trips (or rounds), often ignoring the computation costs. In this paper we consider efficiency of a register implementation in terms of both communication and computation costs. As of this writing, algorithm SFW is the sole known MWMR algorithm that allows single round read and write operations. The algorithm uses collections of intersecting sets (quorums), and to enable single round operations, SFW relies on the evaluation of certain predicates. We formulate a new combinatorial problem that captures the computational burden of evaluating the predicates in algorithm SFW and we show that it is NP-Complete. To make the evaluation of the predicates feasible, we present a polynomial log-approximation algorithm for this problem and we show how to use it with algorithm SFW. Then we present a new algorithm, called CWFR, that allows fast operations independently of the underlying quorum system construction. The algorithm implements two-round writes and allows reads to complete in a single round. We conclude with experimental evaluations of our algorithms obtained from simulations in NS2.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124074431","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}

引用次数: 11

xMiner: Nip the Zero Day Exploits in the Bud xMiner:将零日漏洞扼杀在萌芽状态

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.21

M. Zubair Rafique, M. Abulaish

{"title":"xMiner: Nip the Zero Day Exploits in the Bud","authors":"M. Zubair Rafique, M. Abulaish","doi":"10.1109/NCA.2011.21","DOIUrl":"https://doi.org/10.1109/NCA.2011.21","url":null,"abstract":"Vulnerability exploits present in malformed messages are one of the major sources to remotely launch malicious activities in different protocols. Sometimes, a single malformed message could be enough to crash remote servers or to gain unfettered access over them. In this paper, we propose the design of a generic vulnerability exploits detection system xMiner to detect malformed messages in real time for avoiding any network hazard. The proposed xMiner exploits the information embedded within byte-level sequences of network messages. xMiner applies multi-order Markov process and principal component analysis (PCA) to extract novel discriminative features and uses them to detect attacks launched through malicious packets in real-time. The novelty of xMiner lies in its light-weight design which requires less processing and memory resources and makes it easily deployable on resource-constrained devices like smart phones. The system is evaluated on real-world datasets pertaining to three different protocols -- HTTP, FTP and SIP. Five different classifiers are deployed to establish the effectiveness of the proposed system. On evaluation we found that the decision tree classifier performs well for HTTP and FTP datasets whereas, SVM shows highest performance in case of SIP packets.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641596","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}

引用次数: 3

A Generic Framework for Replicated Software Transactional Memories 复制软件事务性内存的通用框架

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-25 DOI: 10.1109/NCA.2011.45

N. Carvalho, P. Romano, L. Rodrigues

引用次数: 32

Engineering the Virtual Node Layer for Reactive MANET Routing 设计响应式MANET路由的虚拟节点层

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-08-01 DOI: 10.1109/NCA.2011.26

Jiang Wu, N. Griffeth, Calvin C. Newport, N. Lynch

{"title":"Engineering the Virtual Node Layer for Reactive MANET Routing","authors":"Jiang Wu, N. Griffeth, Calvin C. Newport, N. Lynch","doi":"10.1109/NCA.2011.26","DOIUrl":"https://doi.org/10.1109/NCA.2011.26","url":null,"abstract":"The VNLayer approach [1] simplifies software development for MANET by providing the developers an abstraction of a network divided into fixed geographical regions, each containing a virtual server for network services. In this paper, we present our study on reactive MANET routing over the VNLayer. During this research, we identified in our initial VNLayer implementation three major limitations that lead to heavy control traffic, long forwarding paths and frequent message collisions in MANET routing. To address the problems, we changed the assumptions made by the VNLayer on the link layer and extended the operations allowed by VNLayer. This results in a VNLayer implementation that can be tuned to optimize the performance of traffic intensive applications (such as routing) while maintaining their simplicity and robustness. Simulation results showed that VNAODV, a VNLayer based routing protocol adapted from AODV [4], delivers more packets, generates less routing traffic and creates more stable routes than AODV in a dense MANET with high node motion rates. This research validated that the VNLayer approach makes software development for MANET easier and improves the performance of MANET protocols.","PeriodicalId":258309,"journal":{"name":"2011 IEEE 10th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122089949","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}

引用次数: 20

B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm B-Neck:一种分布式静态最大最小公平算法

2011 IEEE 10th International Symposium on Network Computing and Applications Pub Date : 2011-06-06 DOI: 10.1145/1993806.1993841

A. Mozo, José Luis López-Presa, Antonio Fernández

引用次数: 3