2012 IEEE 11th International Symposium on Network Computing and Applications最新文献_第3页

Interest-Centric Mobile Ad Hoc Networks 以兴趣为中心的移动自组织网络

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.32

Renato C. Dutra, Heberte F. Moraes, C. Amorim

{"title":"Interest-Centric Mobile Ad Hoc Networks","authors":"Renato C. Dutra, Heberte F. Moraes, C. Amorim","doi":"10.1109/NCA.2012.32","DOIUrl":"https://doi.org/10.1109/NCA.2012.32","url":null,"abstract":"Mobile ad hoc Networks (MANETs) pose significant shared communication medium constraints such as finite memory, number of access channels, and bandwidth to the development of effective communication protocols. Furthermore, multihop message forwarding multiplies the amount of simultaneous transmissions, which augment both channel contention and network congestion, increasing interference and reducing protocol performance. With these issues in mind, we propose a variation of MANET which we called interest-centric mobile adhoc network or simply Radnet in which every participant node implements in the network layer an Active Prefix (AP) composed of a prefix and an application interest, which the Radnet protocol uses for node identification, message addressing, probabilistic message forwarding, and name search in a distributed way. To evaluate the effectiveness of Radnets for generating lower disturbance in the shared communication medium, thus enabling resource savings, and reducing message overheads, we compared the simulated performances of Radnet protocol (RP) against those of AODV and AODV + Gossip3 (G3AODV) protocols. The results showed that RP achieved a 16 percent higher message delivery rate and one order of magnitude lower latency and message overhead for short 0.5 kB messages in scenarios with 150 mobile nodes. For 5 kB messages, however, AODV and G3AODV rarely ran until the end, due to their overwhelming message overheads, while Radnet protocol showed performances similar to that of the short message case. To evaluate the use of Radnets in practice, we ran experiments in the laboratory, including a chat application on a 20-node Radnet.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129478420","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}

引用次数: 13

Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems 消息传递系统中k-Set协议的最弱故障检测器

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.19

A. Mostéfaoui, M. Raynal, J. Stainer

{"title":"Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems","authors":"A. Mostéfaoui, M. Raynal, J. Stainer","doi":"10.1109/NCA.2012.19","DOIUrl":"https://doi.org/10.1109/NCA.2012.19","url":null,"abstract":"This paper continues our quest for the weakest failure detector which allows the k-set agreement problem to be solved in asynchronous message-passing systems prone to process failures. It has two main contributions which will be instrumental to complete this quest. The first contribution is a new failure detector (denoted PiSigma(x, y)) that has several noteworthy properties. (a) It is stronger than Sigma(k) which has been shown to be necessary. (b) It is equivalent to the pair (Sigma, Omega) when x=y=1 (optimal to solve consensus). (c) It is equivalent to the pair (Sigma(n-1), Omega(n-1)) when x=y=n-1 (optimal for (n-1)-set agreement). (d) It is strictly weaker than the pair (Sigma(x), anti-Omega(y)) (which has been investigated in previous works). (e) It is operational: the paper presents a PiSigma(x, y)-based algorithm that solves k-set agreement for k greater or equal to xy (intuitively, x refers to the maximum number of isolated groups of processes and y to the number of leaders in each of these groups). The second contribution of the paper is a proof that, for k strictly between 1 and n-1, the eventual leaders failure detector Omega(k) (which eventually provides each process with the same set of k process identities, this set including at least one correct process) is not necessary to solve k-set agreement problem.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131381668","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}

引用次数: 5

An Information Divergence Estimation over Data Streams 基于数据流的信息散度估计

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.16

E. Anceaume, Yann Busnel

引用次数: 8

Internet Distance Prediction Using Node-Pair Geography 基于节点对地理的互联网距离预测

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.12

Ankur Jain, J. Pasquale

引用次数: 9

Proximity Detection and Message Exchange in WLANs 无线局域网中的接近检测和消息交换

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.31

S. Schnaufer, J. Kiess, Hendrik Lemelson, S. Kopf, Sebastian Geiger, W. Effelsberg

引用次数: 0

A Technique for Self-Optimizing Scalable and Dependable Server Clusters under QoS Constraints QoS约束下可扩展可靠服务器集群的自优化技术

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.29

R. M. Llamas, D. García, J. Entrialgo

{"title":"A Technique for Self-Optimizing Scalable and Dependable Server Clusters under QoS Constraints","authors":"R. M. Llamas, D. García, J. Entrialgo","doi":"10.1109/NCA.2012.29","DOIUrl":"https://doi.org/10.1109/NCA.2012.29","url":null,"abstract":"Cluster management has become a multi objective task that involves many disciplines like power optimization, fault tolerance, dependability and online system operation analysis. Efficient and secure operation of these clusters is a key objective of any data center policy. In addition, the service provided by these servers must fulfill a level of quality of service (QoS) to the customers. Applying self-management techniques to these clusters would simplify and automate its operation. Current self-management techniques that take into account service level agreements (SLAs) do not cover at the same time the two most important sides of the cluster operation: self-optimization, for an efficient and profitable operation, and self-healing, for a secure operation and high level of quality of service perceived by users. This work integrates a self-optimization strategy for Internet server clusters that optimizes the power consumption, using dynamic provisioning of servers, with a self-healing strategy that improves the reaction of the cluster to a server failure, by using the spare capacity of the cluster intelligently. The self-management technique is based on empirical response time and power consumption models of the servers that simplify its operation. Additionally, the technique presented in this paper guarantees the fulfillment of the SLA.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127141979","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}

引用次数: 4

Machine Learning Methodology for Enhancing Automated Process in IT Incident Management 增强IT事件管理自动化过程的机器学习方法

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.28

Haochen Li, Zhiqiang Zhan

引用次数: 4

Application of Regenerating Codes for Fault Tolerance in Distributed Storage Systems 再生码在分布式存储系统容错中的应用

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.35

K. Peter, P. Sobe

引用次数: 0

A Multi-fence Countermeasure Based Inter-domain Source Address Validation Method 基于多围栏对抗的域间源地址验证方法

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.20

Jie Li, J. Bi, Jianping Wu, Wei Zhang

引用次数: 0

Delay-Aware Query Routing Tree for Wireless Sensor Networks 无线传感器网络延迟感知查询路由树

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.39

Shaila Pervin, J. Kamruzzaman, G. Karmakar

引用次数: 3