By Topic

Fourth IEEE International Symposium on Network Computing and Applications

Date 27-29 July 2005

Filter Results

Displaying Results 1 - 25 of 53
  • Fourth IEEE International Symposium on Network Computing and Applications [Cover]

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

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

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (124 KB)
    Freely Available from IEEE
  • Fourth IEEE International Symposium on Network Computing and Applications [Table of contents]

    Publication Year: 2005, Page(s):v - viii
    Request permission for commercial reuse | PDF file iconPDF (231 KB)
    Freely Available from IEEE
  • Message from the NCA 2005 Program Committee

    Publication Year: 2005, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (141 KB) | HTML iconHTML
    Freely Available from IEEE
  • NCA 2005 Program Committee

    Publication Year: 2005, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (189 KB)
    Freely Available from IEEE
  • NCA 2005 Symposium Referees

    Publication Year: 2005, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (133 KB)
    Freely Available from IEEE
  • Opening address

    Publication Year: 2005, Page(s): 1
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • Resilience for the Scalability of Dependability

    Publication Year: 2005, Page(s):5 - 6
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (96 KB)

    The current state-of-knowledge and state-of-the-art reasonably enable the construction and operation of critical systems, be they safety-critical or availability-critical. The situation drastically worsens when considering large, networked, evolving, systems either fixed or mobile, with demanding requirements driven by their domain of application. There is statistical evidence that these emerging ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effectiveness of Traffic Camouflaging over Computer Networks

    Publication Year: 2005, Page(s): 7
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (62 KB) | HTML iconHTML

    Summary form only given. For many Internet applications, the ability to protect the identity of participants and the characteristics of their communication in distributed applications is critical. For such applications, a number of traffic camouflaging systems have been developed over the past several years. The effectiveness of these systems relies greatly on (1) the protocol by which messages ar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New Generation Scalable and Dependable Servers

    Publication Year: 2005, Page(s): 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB) | HTML iconHTML

    Summary form only given. Today's applications are being built in new ways. The advent of service-oriented architectures, modern networking protocols and industry-standard components at all levels open seemingly endless possibilities for new applications and services. This article focuses on the particular challenges for servers and how these challenges are being addressed. The NonStop Enterprise D... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Challenges in Mobile Networking and Information Assurance

    Publication Year: 2005, Page(s): 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 KB) | HTML iconHTML

    Summary form only given. The author presents some of the key challenges the Department of Defense faces in mobile networking and information assurance. In mobile networking, episodic connectivity, a variety of waveforms, changing topology, and scarce bandwidth presents a number of challenges in mapping currently available commercial technologies to the mobile ad hoc networking environment. Challen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Reputation-based Trust Framework for Peer-to-Peer Applications

    Publication Year: 2005, Page(s):13 - 20
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    In distributed P2P environments, peers (i.e., users) often have to request the services from some unfamiliar peers (i.e., resources) that could be altruistic, selfish, or even malicious. To motivate selfish peers to cooperate and minimize the risk from malicious peers, we propose an adaptive reputation-based trust framework for peer-to-peer applications. In this framework, we define a quantifiable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LAWN: A Protocol for Remote Authentication overWireless Networks

    Publication Year: 2005, Page(s):21 - 28
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (291 KB) | HTML iconHTML

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • pMIX: Untraceability for Small Hiding Groups.

    Publication Year: 2005, Page(s):29 - 40
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (362 KB) | HTML iconHTML

    MIXes are routers that accept packets until their buffers are full, and then send them to the recipients hiding the link (usually through reencryption and rearrangement) between incoming and outgoing packets. MIXes and their variants are used today to provide untraceable communication with systems such as TOR, and they have been a major issue of research on privacy protection for more than twenty ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized Schemes for Size Estimation in Large and Dynamic Groups

    Publication Year: 2005, Page(s):41 - 48
    Cited by:  Papers (28)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (290 KB) | HTML iconHTML

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Method for Task Migration in Grid Environments

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

    This paper presents a method, infrastructure, and prototype that enables adaptive application task migration among a grid environment. Our infrastructure automatically reconfigures distributed applications in response to network performance failures and denial of service (DoS) attacks. Through the use of performance monitoring software we enable network connection failover and automatic applicatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ

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

    The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (core stateless fair queueing) achieves the approximate fairness by dropping the extra packets beyond the fair share bandwidth at the routers. A heuristic method is used to estimate the fair share in CSFQ. Furthermore, we know that SRED (stabilized RED) uses a probabilistic method based on a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting Rate-based Control in DiffServ Networks

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

    We propose a new active queue management (AQM) scheme, proportional rate-based control (PRC), which aims to maintain the queue length around the target level by 1) dropping the packet whose arrival rate exceeding maximum desired rate; 2) using virtual queue to control the packet whose arrival rate above minimum desired rate. We compare the performance of PRC through simulation with several well-kn... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP New Vegas: Improving the Performance of TCP Vegas Over High Latency Links

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

    TCP Vegas provides significant performance gains over most TCP variants, especially when used over networks that utilise error prone links. However, whilst examining the impact of latency on TCP we noticed that the performance of TCP Vegas decreases significantly when the network round trip time exceeds 50ms. This paper details research undertaken to identify the cause of this performance decreasi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Concentric Multi-ring Overlay for Highly Reliable P2P Networks

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

    The paper presents a concentric multi-ring overlay networking topology for fast and shortest-path resource discovery in dynamic distributed systems like P2P network. First, we define a highly reliable P2P system called HiPeer, which is deployed on top of the logical overlay with a number of lowest bounds in terms of network performance. Then, we demonstrate that for any De Bruijn digraph of degree... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Quorums for DHT-based P2P Networks

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

    Peer-to-peer systems (P2P) have become a popular technique to architect decentralized systems. However, despite its popularity most P2P systems consist in simple applications such as file sharing or chat systems. The main reason is that more complex applications require levels of consistency that nowadays are not offered by P2P systems. In this paper, we explore how to provide consistency based on... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable QoS-Based Event Routing in Publish-Subscribe Systems

    Publication Year: 2005, Page(s):101 - 108
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (366 KB) | HTML iconHTML

    This paper proposes a distributed and scalable publish-subscribe broker with support for QoS. The broker, called IndiQoS, leverages on existing mechanisms to reserve resources in the underlying network and on an overlay network of peer-to-peer rendezvous nodes, to automatically select QoS-capable paths. By avoiding flooding of either QoS reservations or link-state information, IndiQoS is able to s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-organization in Cooperative Content Distribution Networks

    Publication Year: 2005, Page(s):109 - 118
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB) | HTML iconHTML

    Traditional client-server content distribution techniques usually suffer from scalability problems when dealing with large client population or sizable content. The advent of peer-to-peer (P2P) network offers the technical means to efficiently distribute data to millions of clients simultaneously with very low infrastructural cost. Previous studies of content distribution architectures have primar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Providing Hard Real-Time Guarantees in Context-Aware Applications: Challenges and Requirements

    Publication Year: 2005, Page(s):119 - 127
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (330 KB) | HTML iconHTML

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

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