By Topic

Fifth IEEE International Symposium on Network Computing and Applications (NCA'06)

24-26 July 2006

Filter Results

Displaying Results 1 - 25 of 56
  • Fifth IEEE International Symposium on Network Computing and Applications - Cover

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (296 KB)
    Freely Available from IEEE
  • Fifth IEEE International Symposium on Network Computing and Applications - Title

    Publication Year: 2006, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (61 KB)
    Freely Available from IEEE
  • Fifth IEEE International Symposium on Network Computing and Applications - Copyright

    Publication Year: 2006, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Fifth IEEE International Symposium on Network Computing and Applications - TOC

    Publication Year: 2006, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • Message fro the Program Committee Co-Chairs and Steering Committee Chair

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

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

    Publication Year: 2006, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Trustworthy Network Computing Workshop Program Committee

    Publication Year: 2006, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Adaptive Grid Computing Workshop Program Committee

    Publication Year: 2006, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2006, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Experience with some Principles for Building an Internet-Scale Reliable System

    Publication Year: 2006, Page(s): 3
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • Challenges in Managing Complexity: Autonomic Computing

    Publication Year: 2006, Page(s): 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 KB)

    Summary form only given. This paper explores the issues faced by enterprises in managing the complexity of information technology as well as progress in emerging autonomic technologies to address them. The paper considers the balance between technology automation and IT processes and human interactions with the management of technology. Recent trends in system management architecture, tools, and s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The +CAL Algorithm Language

    Publication Year: 2006, Page(s): 5
    Request permission for commercial reuse | PDF file iconPDF (53 KB) | HTML iconHTML
    Freely Available from IEEE
  • Application-Aware Reliability and Security: The Trusted ILLIAC Approach

    Publication Year: 2006, Page(s): 6
    Request permission for commercial reuse | PDF file iconPDF (64 KB) | HTML iconHTML
    Freely Available from IEEE
  • A Tree-Turn Model for Irregular Networks

    Publication Year: 2006, Page(s):11 - 18
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB) | HTML iconHTML

    In this paper, we propose a general turn model, Tree-turn model, for irregular topology. In Tree-turn model, links are classified as either tree or cross and six directions are associated with channels of links. From these six directions, we prohibit some turns such that an efficient deadlock-free routing algorithm, Tree-turn routing, can be derived. There are three phases to construct the Tree-tu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience Using Active and Passive Mapping for Network Situational Awareness

    Publication Year: 2006, Page(s):19 - 26
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (149 KB) | HTML iconHTML

    Passive network mapping has often been proposed as an approach to maintain up-to-date information on networks between active scans. This paper presents a comparison of active and passive mapping on an operational network. On this network, active and passive tools found largely disjoint sets of services and the passive system took weeks to discover the last 15% of active services. Active and passiv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-Path Multi-Channel Routing Protocol

    Publication Year: 2006, Page(s):27 - 31
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (137 KB) | HTML iconHTML

    In this paper we present a DSR-based multi-path routing protocol, which has been developed for transmission of multiple description coded (MDC) packets in wireless ad-hoc network environments. The protocol is designed to eliminate co-channel interference between multiple routes from source to destination by assigning a different frequency band to each route. In the route discovery process we use t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Network Principles

    Publication Year: 2006, Page(s):32 - 39
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (324 KB) | HTML iconHTML

    Gossip protocols provide probabilistic reliability and scalability, but their inherent randomness may lead to high variation in number of messages that are received at different nodes. This paper presents techniques that leverage simple social network principles enabling nodes to select gossip targets intelligently. The simple heuristics presented in the paper achieve a more uniform message overhe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self* Architecture for Trajectory Tracking in Wireless Sensor Networks

    Publication Year: 2006, Page(s):40 - 47
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (8608 KB) | HTML iconHTML

    This paper addresses the problem of trajectory tracking that deals with gathering coherent information on the past behavior of a mobile target. When a target enters and moves within a region covered by a sensor network, information about this target is generated by any active sensor that detects the target in its monitoring area. These gathered data have to be received by some registered nodes tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelization of Geant4 Using TOP-C and Marshalgen

    Publication Year: 2006, Page(s):48 - 55
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB) | HTML iconHTML

    Geant4 is a very large, highly accurate toolkit for Monte Carlo simulation of particle-matter interaction. It has been applied to high-energy physics, cosmic ray modeling, radiation shields, radiation therapy, mine detection, and other areas. Geant4 is being used to help design some high energy physics experiments (notably CMS and Atlas) to be run on the future large hadron collider: the largest p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Software Aging and Rejuvenation in a SOAP-based Server

    Publication Year: 2006, Page(s):56 - 65
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (295 KB) | HTML iconHTML

    Web-services and service-oriented architectures are gaining momentum in the area of distributed systems and Internet applications. However, as we increase the abstraction level of the applications we are also increasing the complexity of the underlying middleware. In this paper, we present a dependability benchmarking study to evaluate and compare the robustness of some of the most popular SOAP-RP... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Utilizing Network Processors in Distributed Enterprise Environments

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

    The integration of legacy systems and enterprise applications with novel communications, Internet, or networking services creates the problems of mismatches, information integration and possibly, problems from the evolution of the systems themselves. Enterprise services to solve these problems are currently implemented via commodity server hardware or application specific integrated circuits (ASIC... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Faster Event Forwarding in a Content-Based Publish-Subscribe System through Lookup ReuseEvent

    Publication Year: 2006, Page(s):77 - 84
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (199 KB) | HTML iconHTML

    Event forwarding in a content-based publish-subscribe system is an expensive task due to the need to match an event's content against registered subscriptions at every router. We introduce lookup reuse, a novel approach to improve the efficiency of event forwarding. Lookup reuse enables faster event forwarding through reusing matching results computed by upstream routers in making forwarding decis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved Result Ranking in P2P File-Sharing Systems by Probing for Metadata

    Publication Year: 2006, Page(s):85 - 92
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (173 KB) | HTML iconHTML

    One of the reasons that search performance of peer-to-peer file-sharing systems is poor is that results are poorly described, hurting the client's ability to rank them. This is a consequence of the independent and distributed nature of servers in this architecture. We propose automatically probing the network for better descriptions to improve result ranking. Search performance improvements are de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying Known and Unknown Peer-to-Peer Traffic

    Publication Year: 2006, Page(s):93 - 102
    Cited by:  Papers (56)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (156 KB) | HTML iconHTML

    Class-of-service identification is a very useful task for enterprise, university and ISP networks. Peer-to-peer (P2P) traffic, being a significant portion of the network traffic today, constitutes a highly desirable class for identification. Accurate classification of P2P traffic is a challenging problem, and becomes even more challenging when we are constrained to use only transport-layer header ... View full abstract»

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