By Topic

Network Computing and Applications (NCA), 2012 11th IEEE International Symposium on

Date 23-25 Aug. 2012

Filter Results

Displaying Results 1 - 25 of 54
  • [Cover art]

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

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

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

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

    Publication Year: 2012, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (157 KB)
    Freely Available from IEEE
  • Message from the Steering Commitee Chair

    Publication Year: 2012, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (93 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from Program Committee Chair and the Program Committee Co-Chair

    Publication Year: 2012, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (95 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Committee

    Publication Year: 2012, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2012, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (102 KB)
    Freely Available from IEEE
  • Assuring the trustworthiness of the smarter electric grid

    Publication Year: 2012, Page(s): xv
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (95 KB)

    Summary form only given, as follows. The vision for a modernized "Smart Grid" involves the use of an advanced computing, communication and control cyber infrastructure for enhancing current grid operations by enabling timely interactions among a range of entities. The coupling between the power grid and its cyber infrastructure is inherent, and the extent to which the Smart Grid vision can be achi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Greening the Internet: Energy-Optimal File Distribution

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

    Despite file distribution applications are responsible for a major portion of the current Internet traffic, so far little effort has been dedicated to study file distribution from the point of view of energy efficiency. In this paper, we present the first extensive and detailed theoretical study for the problem of energy efficiency in file distribution. Specifically, we first demonstrate that the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WebCloud: Recruiting Social Network Users to Assist in Content Distribution

    Publication Year: 2012, Page(s):10 - 19
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (470 KB) | HTML iconHTML

    Today, the data exchanged over online social networks (OSNs) represents a significant fraction of Internet traffic. However, OSN content is different from more traditional web content, as it is more likely to be generated at the edge of the network, to be exchanged within a local geographic region, and to possess a more even popularity distribution with fewer popular objects. Unfortunately, most O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Semantic Data Replication for K-Random Search in Peer-to-Peer Networks

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

    We present a dynamic semantic data replication scheme called DSDR for classic k-random search in unstructured peer-to-peer (P2P) networks. During its k-random search each peer periodically updates its local view on the semantic overlay of the network based on observed queries (demand) and received information about provided items (supply), in particular their semantics. Peers dynamically form pote... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Information Divergence Estimation over Data Streams

    Publication Year: 2012, Page(s):28 - 35
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    In this paper, we consider the setting of large scale distributed systems, in which each node needs to quickly process a huge amount of data received in the form of a stream that may have been tampered with by an adversary. In this situation, a fundamental problem is how to detect and quantify the amount of work performed by the adversary. To address this issue, we have proposed in a prior work, A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Distributed Merge-and-Split Mechanism for Dynamic Virtual Organization Formation in Grids

    Publication Year: 2012, Page(s):36 - 43
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB) | HTML iconHTML

    We model the Virtual Organization (VO) formation problem in grids using concepts from coalitional game theory and design a distributed mechanism for solving it. The proposed distributed mechanism enables the formation of VOs guaranteeing the maximum profit for their participating Grid Service Providers (GSPs). We show that the proposed mechanism produces stable VOs, that is, the GSPs do not have i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems

    Publication Year: 2012, Page(s):44 - 51
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Byzantine Resilient Directories

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

    Notable Byzantine Fault Tolerant protocols have been designed so far. These protocols are often evaluated on simple benchmarks, and few times on NFS systems. On the contrary, studies that addressed the behavior of BFT on large back-ends, like Directories, are few. We believe that studying such systems is crucial for practice community due to their popularity. In this paper, we integrate BFT with O... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Technique for Self-Optimizing Scalable and Dependable Server Clusters under QoS Constraints

    Publication Year: 2012, Page(s):61 - 66
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (374 KB) | HTML iconHTML

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of Regenerating Codes for Fault Tolerance in Distributed Storage Systems

    Publication Year: 2012, Page(s):67 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    Recently, regenerating codes, a special network coding technique, were discovered for fault-tolerant storage systems with the promising advantage of efficient data recovery in the case of a single node failure and replacement (regeneration case). From the perspective of coding theory, regenerating codes are extensively studied, but there exists no reference on how to implement these codes in stora... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Internet Distance Prediction Using Node-Pair Geography

    Publication Year: 2012, Page(s):71 - 78
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1157 KB) | HTML iconHTML

    Predictive methods for learning network distances are often more desirable than direct performance measurements between end hosts. Yet, predicting network distances remains an open and difficult problem, as the results from a number of comparative and analytical studies have shown. From an application requirements perspective, there is significant room for improvement in achieving prediction accur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modelling Web-server Flash Events

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

    A Flash Event (FE) represents a period of time when a web-server experiences a dramatic increase in incoming traffic, either following a newsworthy event that has prompted users to locate and access it, or as a result of redirection from other popular web or social media sites. This usually leads to network congestion and Quality-of-Service (QoS) degradation. These events can be mistaken for Distr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Pipelining Approach to Informed Prefetching in Distributed Multi-level Storage Systems

    Publication Year: 2012, Page(s):87 - 95
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB) | HTML iconHTML

    In this paper, we present an informed prefetching technique called IPODS that makes use of application-disclosed access patterns to prefetch hinted blocks in distributed multi-level storage systems. We develop a prefetching pipeline in IPODS, where an informed prefetching process is divided into a set of independent prefetching steps among multiple storage levels in a distributed system. In the IP... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Dimensional Dynamic Loop Scheduling Schemes for Computer Clusters

    Publication Year: 2012, Page(s):96 - 100
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB) | HTML iconHTML

    Efficient scheduling of parallel loops in a network of computers can significantly reduce the total execution time of complex scientific applications. In this paper, we compare the performance of two-dimensional dynamic loop scheduling schemes for computer clusters with that of one-dimensional loop scheduling schemes. The loop scheduling schemes are implemented using the Message Passing Interface ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Efficient Routing Based on Connected Dominating Sets

    Publication Year: 2012, Page(s):101 - 104
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (151 KB) | HTML iconHTML

    In this paper, we propose a set of heuristics to be used within greedy algorithms to build connected dominating sets (CDSs). These algorithms depends on a heuristic and we show that the selection of such heuristic is fundamental to optimizing system operation, both in terms of energy consumption and data transmission. Based on some parameters such as the node's degree, the distances between nodes ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delay-Aware Query Routing Tree for Wireless Sensor Networks

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

    Timeliness in query response is the major quality metric for query processing in the real-time applications of Wireless Sensor Networks (WSNs). The structure of the query routing tree directly affects the whole query processing delay as it provides the path to forward a query to the relevant nodes and return the response to the sink. In the current literature, query routing structure is designed i... View full abstract»

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