Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)最新文献

Autonomic Resource Management for Multiple-Spanning-Tree Metro-Ethernet Networks 多生成树城域以太网的自主资源管理

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.10

Shibiao Lin, Srikant Sharma, T. Chiueh

{"title":"Autonomic Resource Management for Multiple-Spanning-Tree Metro-Ethernet Networks","authors":"Shibiao Lin, Srikant Sharma, T. Chiueh","doi":"10.1109/NCA.2007.10","DOIUrl":"https://doi.org/10.1109/NCA.2007.10","url":null,"abstract":"Viking [13] is a multi-spanning-tree Ethernet architecture that is designed to leverage commodity Ethernet switches to support Metro-Ethernet services. In particular, it exploits VLAN switching to provide network-wide load balancing across a metro-area network. However, Viking assumes the traffic matrix is fixed; as time goes by, the input load may gradually deviate from the assumed traffic matrix because of addition/deletion of subscribers and/or changes in bandwidth requirements from existing subscribers. Therefore, dynamic resource management is required to accommodate such traffic load fluctuations. This paper describes the design, implementation and evaluation of an autonomic network resource management system called Viking2 that enables a Metro-Ethernet network to dynamically self-reconfigure itself, with minimal human intervention, to adapt to changing traffic loads. In particular, whenever possible Viking2 uses a local repair approach to eliminate congestion while minimizing the number of flows affected. If local repair cannot fix a congestion problem, Viking2 resorts to a global reconfiguration approach that recomputes a new path for every flow and deploys the new routing state in a way that reduces the disruption during the period of transition to the minimum. Simulation results show that compared with the original Viking, Viking2 can indeed significantly improve a network's ability to dynamically adapt itself to changing traffic loads, to minimize the degree of congestion during normal network operation, and to increase the total effective network capacity.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125191994","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

Fail-Aware Publish/Subscribe Fail-Aware发布/订阅

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.24

Zbigniew Jerzak, Robert Fach, C. Fetzer

引用次数: 11

Adaptive Search Radius - Lowering Internet P2P File-Sharing Traffic through Self-Restraint 自适应搜索半径——通过自我约束降低互联网P2P文件共享流量

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.6

R. Pereira, T. Vazão, R. Rodrigues

引用次数: 8

Impact of request dispatching granularity in geographically distributed Web systems 地理分布式Web系统中请求调度粒度的影响

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.28

M. Andreolini, C. Canali, R. Lancellotti

{"title":"Impact of request dispatching granularity in geographically distributed Web systems","authors":"M. Andreolini, C. Canali, R. Lancellotti","doi":"10.1109/NCA.2007.28","DOIUrl":"https://doi.org/10.1109/NCA.2007.28","url":null,"abstract":"The advent of the mobile Web and the increasing demand for personalized contents arise the need for computationally expensive services, such as dynamic generation and on-the- fly adaptation of contents. Providing these services exacerbates the performance issues that have to be addressed by the underlying Web architecture. When performance issues are addressed through geographically distributed Web systems with a large number of nodes located on the network edge, the dispatching mechanism that distributes requests among the system nodes becomes a critical element. In this paper, we investigate how the granularity of re- quest dispatching may affect the performance of a distributed Web system for personalized contents. Through a real prototype, we compare dispatching mechanisms operating at various levels of granularity for different workload and network scenarios. We demonstrate that the choice of the best granularity for request dispatching strongly depends on the characteristics of the workload in terms of heterogeneity and computational requirements. A coarse- grain dispatching is preferable only when the requests have similar computational requirements. In all other instances of skewed workloads, that we can consider more realistic, a fine-grain dispatching augments the control on the node load and allows the system to achieve better performance.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127751162","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

Experiences from Building Service and Object Replication Middleware 构建服务和对象复制中间件的经验

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.21

Johannes Osrael, Lorenz Froihofer, K. M. Göschka

引用次数: 4

Transparent Reliable Multicast for Ethernet-Based Storage Area Networks 基于以太网的存储区域网络的透明可靠组播

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.51

Shibiao Lin, Maohua Lu, T. Chiueh

{"title":"Transparent Reliable Multicast for Ethernet-Based Storage Area Networks","authors":"Shibiao Lin, Maohua Lu, T. Chiueh","doi":"10.1109/NCA.2007.51","DOIUrl":"https://doi.org/10.1109/NCA.2007.51","url":null,"abstract":"As disk storage density increases and data availability requirements become ever more demanding, data replication is increasingly an indispensable feature of enterprise-class storage systems. For highly available storage systems, every disk block is typically replicated on a local mirror server and a remote mirror server in addition to being stored on the main storage server. In a network storage environment, this N-way data replication increases the write traffic load on the storage client's network interface by N times. Multicast is a natural solution to this problem. However, existing storage area network technologies such as fibre channel and Ethernet do not provide adequate support for linklayer multicast. This paper describes a novel reliable multicast mechanism for Ethernet-based storage area networks that effectively exploits the virtual LAN technology and is able to keep the traffic load of N-way replication roughly at the same level as the no-replication case regardless of the value of N. This technology greatly increases the appeal of using Ethernet as the physical-layer technology for storage area networking, as fibre channel networks currently do not support such in-network replication. Performance measurements on an iSCSI-based network storage system demonstrate that the proposed reliable multicast mechanism is able to reduce the end-to-end data transport time by a factor of 2.6 for three-way replication when the disk write size is more than 4 Mbytes.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122072920","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}

引用次数: 7

Security and performance analysis of a secure clustering protocol for sensor networks 传感器网络安全聚类协议的安全性和性能分析

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.40

P. Banerjee, D. Jacobson, S. Lahiri

引用次数: 75

A Topological Analysis of Monitor Placement 监视器放置的拓扑分析

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.3

A. Jackson, W. Milliken, C. Santivanez, M. Condell, W. Strayer

{"title":"A Topological Analysis of Monitor Placement","authors":"A. Jackson, W. Milliken, C. Santivanez, M. Condell, W. Strayer","doi":"10.1109/NCA.2007.3","DOIUrl":"https://doi.org/10.1109/NCA.2007.3","url":null,"abstract":"The Internet is an extremely complex system, and it is essential that we be able to make accurate measurements in order to understand its underlying behavior or to detect improper behavior (e.g., attacks). The reality, however, is that it is impractical to fully instrument anything but relatively small networks and impossible to even partially instrument many parts of the Internet. This paper analyzes a subset of the general monitor placement problem where the goal is to maximize the coverage of the entire universe of potential communication pairs (i.e., source and destination are randomly distributed in the routable Internet address space). This issue arises, for example, when trying to detect/track a distributed attack. We present results from a simulation, seeded with data from skitter and RouteViews, that indicate we can monitor a packet with a high probability by monitoring relatively few points in the Internet. Our analysis suggests that the preferred strategy to place monitors should be to instrument one or two specific inter-AS links per AS for many ASes rather than deeply instrumenting a subset of the largest ASes.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122974879","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

Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network 允许跳图处理移动传感器网络中的k维范围查询

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.18

Gregory J. Brault, Christopher J. Augeri, B. Mullins, R. Baldwin, Christopher B. Mayer

引用次数: 6

Accurate Inter-Transaction Dependency Tracking for Repairable DBMS 准确的事务间依赖跟踪可修复DBMS

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007) Pub Date : 2007-07-12 DOI: 10.1109/NCA.2007.5

Shweta Bajpai, A. Smirnov, T. Chiueh

{"title":"Accurate Inter-Transaction Dependency Tracking for Repairable DBMS","authors":"Shweta Bajpai, A. Smirnov, T. Chiueh","doi":"10.1109/NCA.2007.5","DOIUrl":"https://doi.org/10.1109/NCA.2007.5","url":null,"abstract":"A reparable database management system has the ability to automatically undo the set of transactions that are corrupted by a human error or malicious attack. The key technical challenge to building repairable database management systems is how to accurately and efficiently keep track of inter-transaction dependencies that take place through a database as well as through application logic. In this paper, we present the design, implementation and evaluation of the inter-transaction dependency tracking mechanisms used in a repairable database management system called RDB2, which adds fast repairability in a portable way to a commercial DBMS Oracle 9.2.0. RDB2 eliminates dependencies due to false sharing using fine-grained inter-transaction dependency tracking, and is able to successfully identify a major source of false negatives, phantom dependencies. With these advanced inter-transaction dependency tracking mechanisms, RDB2 can significantly improve the availability of modern DBMSs by facilitating and sometimes even automating the damage repair process after an error or attack. Performance measurements on the fully operational prototypes under the TPC-C benchmark show that the run-time throughput penalty of these enhanced inter-transaction dependency tracking mechanisms is less than 18%.","PeriodicalId":135395,"journal":{"name":"Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2007-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144973","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