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

Resilience for the Scalability of Dependability 可靠性可伸缩性的弹性

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.44

J. Laprie

引用次数: 63

Decentralized Schemes for Size Estimation in Large and Dynamic Groups 大型动态群体规模估计的分散方案

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.15

Dionysios Kostoulas, D. Psaltoulis, Indranil Gupta, K. Birman, A. Demers

{"title":"Decentralized Schemes for Size Estimation in Large and Dynamic Groups","authors":"Dionysios Kostoulas, D. Psaltoulis, Indranil Gupta, K. Birman, A. Demers","doi":"10.1109/NCA.2005.15","DOIUrl":"https://doi.org/10.1109/NCA.2005.15","url":null,"abstract":"Large-scale and dynamically changing distributed systems such as the grid, peer-to-peer overlays, etc., need to collect several kinds of global statistics in a decentralized manner. In this paper, we tackle a specific statistic collection problem called group size estimation, for estimating the number of non-faulty processes present in the global group at any given point of time. We present two new decentralized algorithms for estimation in dynamic groups, analyze the algorithms, and experimentally evaluate them using real-life traces. One scheme is active: it spreads a gossip into the overlay first, and then samples the receipt times of this gossip at different processes. The second scheme is passive: it measures the density of processes when their identifiers are hashed into a real interval. Both schemes have low latency, scalable per-process overheads, and provide high levels of probabilistic accuracy for the estimate. They are implemented as part of a size estimation utility called PeerCounter that can be incorporated modularly into standard peer-to-peer overlays. We present experimental results from both the simulations and PeerCounter, running on a cluster of 33 Linux servers","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131200445","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}

引用次数: 114

On the Effectiveness of Continuous-Time Mixes under Flow-Correlation Based Anonymity Attacks 基于流量关联的匿名攻击下连续时间混合的有效性研究

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.37

Ye Zhu, Xinwen Fu, R. Bettati

引用次数: 2

Leveraging the Multiprocessing Capabilities of Modern Network Processors for Cryptographic Acceleration 利用现代网络处理器的多处理能力进行加密加速

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.28

G. Gaubatz, B. Sunar

引用次数: 5

LAWN: A Protocol for Remote Authentication overWireless Networks 一种无线网络远程认证协议

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.27

A. Paul, Rajnish Kumar, U. Ramachandran

{"title":"LAWN: A Protocol for Remote Authentication overWireless Networks","authors":"A. Paul, Rajnish Kumar, U. Ramachandran","doi":"10.1109/NCA.2005.27","DOIUrl":"https://doi.org/10.1109/NCA.2005.27","url":null,"abstract":"Remote authentication over a long range wireless network using large signature keys such as biometric samples (fingerprint, retinal scans etc.) is soon going to become an integral feature of various kinds of transactions. In the domain of mobile and ad hoc networking, this become even more relevant due to the intrinsic dynamism in the applications. Because of the large size of the authentication keys, and continual need for authentication, considerable power and bandwidth are consumed by such a process. Authentication being only a background process supporting other transactions, should not take away too much of resources, especially bandwidth and power that are quite critical for small mobile devices. We present LAWN, a light-weight authentication protocol for wireless networks that trades computation for communication and can be tuned for any desired security guarantee. For an authentication token of length n, LAWN prepares a small sketch of length O(log n) (adding very low computational overhead), and transmits the sketch over the network. Under a reasonable energy consumption model, we show that this technique results in 70% to 80% saving in power for long-range wireless applications","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123708500","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

SLA Based Profit Optimization in Multi-tier Systems 基于SLA的多层系统利润优化

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.48

D. Ardagna, M. Trubian, Li Zhang

引用次数: 26

Smart Tunnel Union for NAT Traversal NAT穿越智能隧道联盟

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.50

Tzu-Chi Huang, C. Shieh, Wen-Huang Lai, Yu-Ben Miao

引用次数: 12

Providing Hard Real-Time Guarantees in Context-Aware Applications: Challenges and Requirements 在上下文感知应用中提供硬实时保证:挑战和需求

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.42

Malika Boulkenafed, B. Hughes, R. Meier, G. Biegel, V. Cahill

{"title":"Providing Hard Real-Time Guarantees in Context-Aware Applications: Challenges and Requirements","authors":"Malika Boulkenafed, B. Hughes, R. Meier, G. Biegel, V. Cahill","doi":"10.1109/NCA.2005.42","DOIUrl":"https://doi.org/10.1109/NCA.2005.42","url":null,"abstract":"Context-aware applications rely on the ability to perceive the state of the surrounding environment. In this paper, we address a class of such applications where real-time guarantees are required on top of mobile ad hoc networks. While guaranteed timeliness is a critical requirement, the unpredictability of dynamic wireless networks adversely impacts such guarantees. Therefore, we identify the challenges and the requirements on different architectural levels in order to provide timeliness guarantees. None of the existing systems have succeeded in providing adequate solutions to all of the identified requirements. Therefore, we describe a cross-layer architecture that supports the development of real-time context-aware applications for wireless networks, in particular, ad hoc networks. This cross-layer architecture is based on three main components. (i) Sentient objects - mobile intelligent software agents that extract, interpret and use context information. (ii) Event-based real-time middleware supports communication between sentient objects and provides hard real-time guarantees within adaptable geographic spaces. (iii) A real-time routing and resource reservation protocol attempts to discover and maintain real-time constrained routes within these proximities in a multi-hop ad hoc network","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121533985","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

Controlling the Coverage of Grid Information Dissemination Protocols 网格信息发布协议的覆盖控制

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.12

B. Gandhi, S. Tilak, M. Lewis, N. Abu-Ghazaleh

{"title":"Controlling the Coverage of Grid Information Dissemination Protocols","authors":"B. Gandhi, S. Tilak, M. Lewis, N. Abu-Ghazaleh","doi":"10.1109/NCA.2005.12","DOIUrl":"https://doi.org/10.1109/NCA.2005.12","url":null,"abstract":"Grid information dissemination protocols distribute information about the dynamic state of computational resources throughout interconnected wide area grids. Performance metrics for these protocols include the overhead of information packets, and the accuracy of the information at the time it is used to schedule applications. Our previous work advocated non-uniform protocols to keep dissemination local to the information source, as a method of keeping overhead manageable while achieving adequate freshness and accuracy. This paper considers the problem of providing better control over the dissemination of information and influencing the \"coverage footprint\" that defines where the information reaches within the grid. The paper describes work that investigates the coverage characteristics of existing protocols and refines and combines them into hybrid protocols that are more controllable. We consider this work to be a necessary step toward adaptive dissemination protocols that would be able to react to the state of grid resources to change dynamically how and where information is disseminated. This in turn increases the effectiveness of grid schedulers under various load levels and distributions","PeriodicalId":188815,"journal":{"name":"Fourth IEEE International Symposium on Network Computing and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126080288","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}

引用次数: 12

Performance Evaluation of a PC-based Active Router and Analysis of an Active Secure FTP Application 基于pc的Active路由器性能评估及Active安全FTP应用分析

Fourth IEEE International Symposium on Network Computing and Applications Pub Date : 2005-07-27 DOI: 10.1109/NCA.2005.39

Alexandros G. Fragkiadakis, D. Parish

引用次数: 0