By Topic

Network Computing and Applications (NCA), 2011 10th IEEE International Symposium on

Date 25-27 Aug. 2011

Filter Results

Displaying Results 1 - 25 of 69
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (186 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (58 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (122 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - x
    Request permission for commercial reuse | PDF file iconPDF (143 KB)
    Freely Available from IEEE
  • Message from the Steering Committee Chair

    Publication Year: 2011, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (72 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Committee Chair

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (73 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2011, Page(s):xiii - xiv
    Request permission for commercial reuse | PDF file iconPDF (86 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (65 KB)
    Freely Available from IEEE
  • Keynote

    Publication Year: 2011, Page(s): xvi
    Cited by:  Papers (87)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (77 KB) | HTML iconHTML

    Considerable evidence supports the claim that most of the traffic over IP networks is video, with the volume growing rapidly. It is also increasingly likely that most video delivery in the future will be over IP networks, with the shift away from broadcast and cable already well under way. For service providers who operate IP networks, these dual trends present both challenges and opportunities. T... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • PAWDS: A Roadmap Profile-Driven Adaptive System for Alert Dissemination in VANETs

    Publication Year: 2011, Page(s):1 - 8
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    In traffic safety applications for Vehicular Ad hoc Networks (VANETs), warning messages have to be disseminated whenever a dangerous situation occurs to alert nearby vehicles. Using inefficient broadcast schemes may lead to ineffective dissemination of warning messages causing broadcast storm problems. In the past, several approaches have been proposed to reduce the so called broadcast storm in mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Belisarius: BFT Storage with Confidentiality

    Publication Year: 2011, Page(s):9 - 16
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (769 KB) | HTML iconHTML

    Traditional approaches to byzantine fault-tolerance have mostly avoided the problem of confidentiality. Current confidentiality-aware solutions rely on a heavy infrastructure investment or depend on complex key management schemes. The framework presented in this paper relies on a novel approach that combines byzantine fault-tolerance, secure storage and verifiable secret sharing to significantly r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B-Neck: A Distributed and Quiescent Max-Min Fair Algorithm

    Publication Year: 2011, Page(s):17 - 24
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    The problem of fairly distributing the capacity of a network among a set of sessions has been widely studied. In this problem, each session connects via a single path a source and a destination, and its goal is to maximize its assigned transmission rate (i.e., its throughput). Since the links of the network have limited bandwidths, some criterion has to be defined to fairly distribute their capaci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Treewidth and Hyperbolicity of the Internet

    Publication Year: 2011, Page(s):25 - 32
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (319 KB) | HTML iconHTML

    We study the measurement of the Internet according to two graph parameters: tree width and hyper bolicity. Both tell how far from a tree a graph is. They are computed from snapshots of the Internet released by CAIDA, DIMES, AQUALAB, UCLA, Rocket fuel and Strasbourg University, at the AS or at the router level. On the one hand, the tree width of the Internet appears to be quite large and being far ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic FIFO Ordering in Publish/Subscribe Networks

    Publication Year: 2011, Page(s):33 - 40
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (855 KB) | HTML iconHTML

    In a best-effort publish/subscribe network, publications may be delivered out of order (e.g., violating FIFO order). We contend that the primary cause of such ordering violations is the parallel matching and forwarding process employed by brokers to achieve high throughput. In this paper, we present an end-to-end method to improve event ordering. The method involves the receiver and minimally the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Resilient Architecture Oriented to P2P Computing

    Publication Year: 2011, Page(s):41 - 50
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (526 KB) | HTML iconHTML

    This paper proposes a distributed computing architecture using the P2P paradigm. Our proposal gathers the peers into markets according to their computational resources. Each market is arranged in an N-tree and the trees are linked by a Bruijn graph. The tree topology allows efficient searching of available resources in a specific market, while Bruijn provides good scalability as search complexity ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-Recovering Parallel Applications in Multi-core Systems

    Publication Year: 2011, Page(s):51 - 58
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    In this paper, a Self-Recovering strategy, which is able to "re-map" dynamically application tasks on a multi-core system, is presented. Based on run-time failure aware techniques, this Self-Recovering strategy guarantees seamlessly termination and delivering the expected results despite multiple node and link failures in a 2D mesh topology. It has been demonstrated, based on a statistical analysi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Granularity Graph for Improving Adaptive Application Partitioning Efficacy in Mobile Computing Environments

    Publication Year: 2011, Page(s):59 - 66
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (825 KB) | HTML iconHTML

    The feasibility of using adaptive object migration to enable the execution of heavy applications in pervasive environments, is determined by the computational efficiency of adaptation algorithms and the efficacy of their decisions. These two factors, which are largely predicated by the resource constraints of devices, are heavily influenced by the granularity at which adaptation decisions are perf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking Coverage throughout Epochs with Bounded Uncertainty

    Publication Year: 2011, Page(s):67 - 74
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (569 KB) | HTML iconHTML

    This work addresses the problem of managing the sensor-coverage and organizing the epochs in a manner that balances the trades-offs between the accuracy and energy consumptions during target tracking in Wireless Sensor Networks (WSN). While the typical target tracking approaches are based on movement prediction, we only assume a knowledge of some maximal speed of the target during certain time-int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers

    Publication Year: 2011, Page(s):75 - 82
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    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 co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Byzantine Fault-Tolerant Transaction Processing for Replicated Databases

    Publication Year: 2011, Page(s):83 - 90
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (402 KB) | HTML iconHTML

    Transaction commit is a problem much investigated, both in the databases and systems communities, from the theoretical and practical sides. We present a modular approach to solve this problem in the context of database replication on environments that are subject to Byzantine faults. Our protocol builds on a total order multicast abstraction and is proven to satisfy a set of safety and liveness pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SCAN: An Efficient Decoding Algorithm for RAID-6 Codes

    Publication Year: 2011, Page(s):91 - 98
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    Recent studies show hard disk drives fail much more often in real systems than specified in their data-sheets, and RAID-5 may not be able to provide necessary reliability for practical systems. It is desirable to have disk arrays and clustered storage systems with higher data redundancy, such as RAID-6. Meanwhile, latest research also indicates that sector failures become a threat to data reliabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • xMiner: Nip the Zero Day Exploits in the Bud

    Publication Year: 2011, Page(s):99 - 106
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB) | HTML iconHTML

    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 ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Subset Coding Based k-Anonymization Technique to Trade-Off Location Privacy and Data Integrity in Participatory Sensing Systems

    Publication Year: 2011, Page(s):107 - 114
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (845 KB) | HTML iconHTML

    Success of participatory sensing system depends on the extent of voluntary participation by users. To increase participation, incentive such as rewards can be used only if reported data has associated user identification. This creates serious threat to participating users' location privacy. Existing techniques tried to solve it with spatial clocking, which suffers from inferior data integrity. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Validation of Security Solutions for Communication Networks: A Policy-Based Approach

    Publication Year: 2011, Page(s):115 - 122
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (533 KB) | HTML iconHTML

    Typically, security solutions are defined to meet the requirements of security policies, and are configured to implement some of their rules. Approaches proposed so far in the literature to validate security solutions have merely taken interest to the need of: a) describing the security policy used to define and configure these solutions b) generating executable description of attack scenarios tar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.