2010 Ninth IEEE International Symposium on Network Computing and Applications最新文献_第3页

Assessing the Impact of a Realistic Radio Propagation Model on VANET Scenarios Using Real Maps 使用真实地图评估真实无线电传播模型对VANET情景的影响

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.24

F. Martinez, Manuel Fogué, Manuel Coll, Juan-Carlos Cano, C. Calafate, P. Manzoni

引用次数: 49

Quantification of Attackers Activities on Servers Running Web 2.0 Applications 在运行Web 2.0应用程序的服务器上量化攻击者的活动

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.21

K. Goseva-Popstojanova, Risto Pantev, Ana Dimitrijevikj, Brandon Miller

引用次数: 11

Improved Architectures for Range Encoding in Packet Classification System 分组分类系统中范围编码的改进体系结构

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.9

Xin He, Jorgen Peddersen, S. Parameswaran

{"title":"Improved Architectures for Range Encoding in Packet Classification System","authors":"Xin He, Jorgen Peddersen, S. Parameswaran","doi":"10.1109/NCA.2010.9","DOIUrl":"https://doi.org/10.1109/NCA.2010.9","url":null,"abstract":"Packet classification is an important aspect of modern network systems. Packet classification systems have traditionally been built utilizing Ternary Content Addressable Memory (TCAM) due to the high throughput needed. However, TCAMs are expensive in terms of area and power consumption. An alternative to TCAM based systems using SRAM and a novel rule encoding method has been proposed to match multiple packets simultaneously (using multiple store_compare_units). This alternative achieves similar or better throughput than the traditional TCAM approach while occupying smaller space and consuming less energy. This paper revamps the existing SRAM-based architecture to reduce area and power consumption without threatening throughput. Two methods are shown. The first method allows for range encoding SRAMs to be shared between store_compare_units (SCUs) to lower area and power consumption with minor effect on throughput. The second method discusses a hybrid system allowing rules with prefixes (single rules) and ranges (rules which match a range of addresses, usually translated to many prefixes) to exist in parallel for the same domain. This allows for lower power consumption than utilizing fixed range encoding due to optimization of the ruleset. Results show that this hybrid architecture saves more than 20% of power/field if half of the TCP ports contain ranges (and the other half contains prefixes). The new extensions have been tested in over ten benchmarks (including the SNORT ruleset) to verify the claimed improvements.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131535328","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}

引用次数: 0

Performance Analysis of Optimal Packet Size for Congestion Control in Wireless Sensor Networks 无线传感器网络拥塞控制中最优数据包大小的性能分析

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.37

N. Yaakob, I. Khalil, Jiankun Hu

{"title":"Performance Analysis of Optimal Packet Size for Congestion Control in Wireless Sensor Networks","authors":"N. Yaakob, I. Khalil, Jiankun Hu","doi":"10.1109/NCA.2010.37","DOIUrl":"https://doi.org/10.1109/NCA.2010.37","url":null,"abstract":"While witnessing a remarkable and rapid emergence of Wireless Sensor Network (WSN) that seems to facilitate promising features, congestion problem still remains the key issue that attract very high attention in research community. Congestion not only severely degrades network performance, but also gives adverse quality to various related applications such as real-time monitoring systems that demands strict and stringent requirements. A robust solution is therefore required to mitigate this critical issue, yet to cope with challenging dynamic WSN's nature. Concerning this issue, in this paper, we have investigated a potential solution to alleviate congestion by determining an appropriate packet size in various error conditions. This prospective factor have high potential in improving network efficiency by maximizing the link utilization and minimizing the number of retransmissions, thus ensuring reliability. In addition, the error-prone characteristic and noisy channel in sensor network increase the needs for determining appropriate packet size during data transmission in order to massively reduce congestion and helps providing consistent WSN's performance. This paper investigates the impact of varying packet size in various Bit Error Rate (BER) conditions and highlights other key factors that may help alleviate congestion in WSN. Simulation study demonstrates an overall network efficiency improvement and favourable performance.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133379364","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

Pareto-Based Optimization of Multicast Flows with QoS and Traffic Engineering Requirements 基于pareto的具有QoS和流量工程需求的组播流优化

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.47

Marcos L. P. Bueno, G. Oliveira

引用次数: 6

NetOdyssey - A New Tool for Real-Time Analysis of Network Traffic NetOdyssey -一个实时分析网络流量的新工具

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.43

Fábio D. Beirão, João V. P. Gomes, Pedro R. M. Inácio, Manuela Pereira, M. Freire

引用次数: 1

Time-Free Authenticated Byzantine Consensus 时间自由认证拜占庭共识

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.25

Moumen Hamouma, A. Mostéfaoui

{"title":"Time-Free Authenticated Byzantine Consensus","authors":"Moumen Hamouma, A. Mostéfaoui","doi":"10.1109/NCA.2010.25","DOIUrl":"https://doi.org/10.1109/NCA.2010.25","url":null,"abstract":"This paper presents a simple protocol that solves the authenticated Byzantine Consensus problem in asynchronous distributed systems. To circumvent the FLP impossibility result in a deterministic way, synchrony assumptions should be added. In the context of Byzantine failures for systems where at most t processes may exhibit a Byzantine behavior and where not all the system is assumed eventually synchronous, Moumen et al. provide the main result. They assume at least one correct process, called 2t-bisource, connected with 2t privileged neighbors with eventually timely outgoing and incoming links. The present paper shows that a deterministic solution for the authenticated byzantine consensus problem is possible if the system model satisfies an additional assumption that does not rely on physical time but on the pattern of messages that are exchanged. The basic message exchange between processes is the query-response mechanism. To solve the Consensus problem, we assume a correct process p, called 2t-winning process, and a set Q of 2t processes such that, eventually, for each query issued by p, any process q of Q receives a response from p among the (n - t) first responses to that query. The processes in the set Q can exhibit a Byzantine behavior and this set may change over time. Whereas many time-free solutions have been designed for the consensus problem in the crash model, this is, to our knowledge, the first time-free deterministic solution to the Byzantine consensus problem.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131090629","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}

引用次数: 2

AGGRO: Boosting STM Replication via Aggressively Optimistic Transaction Processing AGGRO:通过积极乐观的事务处理提升STM复制

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.10

R. Palmieri, F. Quaglia, P. Romano

{"title":"AGGRO: Boosting STM Replication via Aggressively Optimistic Transaction Processing","authors":"R. Palmieri, F. Quaglia, P. Romano","doi":"10.1109/NCA.2010.10","DOIUrl":"https://doi.org/10.1109/NCA.2010.10","url":null,"abstract":"Software Transactional Memories (STMs) are emerging as a potentially disruptive programming model. In this paper we are address the issue of how to enhance dependability of STM systems via replication. In particular we present AGGRO, an innovative Optimistic Atomic Broadcast-based (OAB) active replication protocol that aims at maximizing the overlap between communication and processing through a novel AGGRessively Optimistic concurrency control scheme. The key idea underlying AGGRO is to propagate dependencies across uncommitted transactions in a controlled manner, namely according to a serialization order compliant with the optimistic message delivery order provided by the OAB service. Another relevant distinguishing feature of AGGRO is of not requiring a-priori knowledge about read/write sets of transactions, but rather to detect and handle conflicts dynamically, i.e. as soon (and only if) they materialize. Based on a detailed simulation study we show the striking performance gains achievable by AGGRO (up to 6x increase of the maximum sustainable throughput, and 75% response time reduction) compared to literature approaches for active replication of transactional systems.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122590889","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}

引用次数: 40

Dynamic Game-Play Arbitrators with 3D Voronoi Diagrams 动态游戏与3D Voronoi图表仲裁

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.46

Mahathir Almashor, I. Khalil, G. Leach

引用次数: 3

SOAP Web Services Compression Using Variable and Fixed Length Coding 使用可变和固定长度编码的SOAP Web服务压缩

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.18

Dhiah Al-Shammary, I. Khalil

引用次数: 10