By Topic

The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l

Date 17-17 Nov. 2005

Filter Results

Displaying Results 1 - 25 of 147
  • The IEEE Conference on Local Computer Networks 30th Anniversary - Cover

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • Proceedings. The IEEE Conference on Local Computer Networks-30th Anniversary

    Publication Year: 2005, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • The IEEE Conference on Local Computer Networks 30th Anniversary - Copyright

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • The IEEE Conference on Local Computer Networks 30th Anniversary - Table of contents

    Publication Year: 2005, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Message from the General Chair

    Publication Year: 2005, Page(s):xvi - xvii
    Request permission for commercial reuse | PDF file iconPDF (44 KB) | HTML iconHTML
    Freely Available from IEEE
  • Message from the Program Committee Chairs

    Publication Year: 2005, Page(s): xviii
    Request permission for commercial reuse | PDF file iconPDF (34 KB) | HTML iconHTML
    Freely Available from IEEE
  • LCN Organizing Committee

    Publication Year: 2005, Page(s): xxii
    Request permission for commercial reuse | PDF file iconPDF (24 KB)
    Freely Available from IEEE
  • LCN Program Committee Members

    Publication Year: 2005, Page(s): xxiii
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • LCN Reviewers

    Publication Year: 2005, Page(s):xxviii - xxx
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • Keynotes

    Publication Year: 2005, Page(s): xxxii
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (22 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Collision Detection and Resolution in Hierarchical Peer-to-Peer Systems

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

    Structured peer-to-peer systems can be organized hierarchically as two-level overlay networks. The top-level overlay consists of groups of nodes, where each group is identified by a group identifier. In each group, one or more nodes are designated as supernodes and act as gateways to the nodes at the second level. A collision occurs during join operations, when two or more groups with the same gro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • No junk, no peeking, serious offers only: P2P file exchange in wireless ad-hoc networks

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

    We consider the problem of anonymous file exchange in wireless ad-hoc networks. We propose a new protocol, dubbed RASH (roam and share), to address the problem. RASH is a peer-to-peer (P2P) protocol which fulfills three objectives: (a) protection of user privacy (understood as the confidentiality of their interests), (b) support for a high degree of file authentication and integrity (to reduce or ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays

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

    Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of neighbor pointers. When a node passively leaves the overlay, subsequent lookups may fail silently. Active maintenance has been proven only for fault-free networks. We develop an active topology maintenance algorithm for pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • VETO - enabling a P2P-based market for composed services

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

    Service-oriented peer-to-peer architectures combine the benefits of service-oriented architectures and peer-to-peer networks, such as loose coupling and sealability. They also support service composition, the combining of existing services into new ones. Until now, only composition service strategies for a single peer acting as a service composer have been investigated. Therefore, this paper inves... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ERP-DDRR: an efficient and robust scheduler for providing proportional delay differentiation in terabit networks

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

    In recent years, many research efforts focus on relative differentiated service due to the increasing requirements on quality of service for time-sensitive applications. Most of the prior research relies on time stamping arriving packets or periodically monitoring the arrival traffic to arrange the service rate or priority for each class of packets. In this paper, we propose a new efficient and ro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-based flow-control for the CICQ switch

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

    A combined input and crosspoint queued (CICQ) switch with a flow control latency of round-trip time (RTT) packets requires each crosspoint (CP) buffer to hold the RTT packets in order to support any traffic pattern without blocking. In this paper, a distributed rate-based flow control internal to a CICQ switch is proposed. The new rate-based flow control allocates bandwidth to each virtual output ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Programming QoS-based Classification for Links with Limited Service Levels

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

    We investigate the QoS-based classification of traffic streams for a multi-class link model with predetermined service levels. Specifically, we consider a link model with fixed service levels or fixed class weights which may be represented by a finite number of MPLS label-switched-paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS-demand into a small num... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QoS and fault-tolerant based distributed dynamic channel allocation protocol for cellular networks

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

    Earlier studies on dynamic channel allocation protocols based upon the mutual exclusion paradigms have shown promising results. Though, very little data have been reported on how to integrate the quality of service (QoS) and fault tolerant components within these schemes. These two components are vital to the success of the deployment of future generation of wireless networks. Mobile users are not... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate coverage in wireless sensor networks

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

    Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention due to their potential applications from civil to military domains. Since sensors in sensor networks are equipped with energy-limited batteries, energy conservation in such networks is of paramount importance in order to prol... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A topology-independent link activation scheduling framework in multihop CDMA packet radio networks

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

    In this paper, we study topology-independent link activation transmission scheduling protocols for multihop code-division multiple-access (CDMA) packet radio networks. We focus on quality-of-service (QoS) provisioning for each communication link in mobile environments. An interference model for wireless multihop packet radio networks, which is more practical than that adopted in earlier literature... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interference Distribution in the Nakagami FadingWireless CDMA Ad Hoc Networks with Multi-Code Multi-Packet Transmission (MCMPT)

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

    In this paper, we derive the distribution of multiple access interference (MAI) power for wireless code division multiple access (CDMA) ad hoc networks operating in a general Nakagami-m fading channel model. Furthermore, we propose a multi-code multi-packet transmission (MCMPT) scheme for it to increase the performance, in terms of the expected forward progress. Based on the instantaneous good cha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sensor grid: integration of wireless sensor networks and the grid

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

    Wireless sensor networks have emerged as an exciting technology for a wide range of important applications that acquire and process information from the physical world. Grid computing has evolved as a standards-based approach for coordinated resource sharing. Sensor grids combine these two promising technologies by extending the grid computing paradigm to the sharing of sensor resources in wireles... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and evaluation of a high performance parallel file system

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

    In this paper we propose a high performance parallel file system over iSCSI (iPVFS) for cluster computing. iPVFS provides a cost-effective solution for heterogeneous cluster environment by dividing a set of I/O servers into two groups, one group with higher performance servers as I/O nodes, while another group with relatively lower performance machines serves as storage target nodes. This combinat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A user-level approach to network attached storage

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

    Modern network attached storage architectures suffer from poor performance, resource management and inflexibility. We examine the problems of current architectures and propose an alternative, built around the precept of doing network storage at user-level. We further examine some of the challenges associated with this unusual approach and provide some preliminary block layer results indicating our... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Similarity search in ad hoc networks using semantic-based caching

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

    Ad hoc networks build temporary wireless connections in environments where the stationary infrastructures are either destroyed or too expensive to construct. Most of the previous research in ad hoc networks focuses on routing protocols that adapt to the dynamic network topologies, and not much work has been done on data accessing. One important data accessing application is similarity search, whic... View full abstract»

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