By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 2 • Feb. 2008

Filter Results

Displaying Results 1 - 15 of 15
  • [Front cover]

    Publication Year: 2008, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2008, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (80 KB)
    Freely Available from IEEE
  • HRing: A Structured P2P Overlay Based on Harmonic Series

    Publication Year: 2008, Page(s):145 - 158
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2706 KB) | HTML iconHTML

    This paper presents Harmonic Ring (HRing), a structured peer-to-peer (P2P) overlay where long links are built along the ring with decreasing probabilities coinciding with the Harmonic Series. HRing constructs routing tables based on the distance between node positions instead of node IDs in order to eliminate the effect of node ID distribution on the long link distribution and load balance. It sup... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overlay Networks with Linear Capacity Constraints

    Publication Year: 2008, Page(s):159 - 173
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3066 KB) | HTML iconHTML

    Overlay networks are virtual networks residing over the IP network; consequently, overlay links may share hidden lower level bottlenecks. Previous work has assumed an independent overlay model: a graph with independent link capacities. We introduce a model of overlays that incorporates correlated link capacities and linear capacity constraints (LCC) to formulate hidden shared bottlenecks; we refer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NRMI: Natural and Efficient Middleware

    Publication Year: 2008, Page(s):174 - 187
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2683 KB) | HTML iconHTML

    We present natural remote method invocation (NRMI): a middleware mechanism that provides a fully general implementation of call-by-copy-restore semantics for arbitrary linked data structures, used as parameters in remote procedure calls. Call-by-copy-restore offers a more natural programming model for distributed systems than traditional call-by-copy middleware, enabling remote calls to behave muc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Reservation-Based Extended Transaction Protocol

    Publication Year: 2008, Page(s):188 - 203
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2009 KB) | HTML iconHTML

    With the advent of the new generation of Internet-based technology, in particular, web services, the automation of business activities that are distributed across multiple enterprises becomes possible. Business activities are different from traditional transactions in that they are typically asynchronous, loosely coupled, and long running. Therefore, extended transaction protocols are needed to co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interaction of ISPs: Distributed Resource Allocation and Revenue Maximization

    Publication Year: 2008, Page(s):204 - 218
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2181 KB) | HTML iconHTML

    The Internet is a hierarchical architecture comprising heterogeneous entities of privately owned infrastructures, where higher level Internet service providers (ISPs) supply connectivity to the local ISPs and charge the local ISPs for the transit services. One of the challenging problems facing service providers today is how the profitability can be increased while maintaining good service qualiti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluating a High-Level Parallel Language (GpH) for Computational GRIDs

    Publication Year: 2008, Page(s):219 - 233
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3091 KB) | HTML iconHTML

    Computational GRIDs potentially offer low-cost, readily available, and large-scale high-performance platforms. For the parallel execution of programs, however, computational GRIDs pose serious challenges: they are heterogeneous and have hierarchical and often shared interconnects, with high and variable latencies between clusters. This paper investigates whether a programming language with high-le... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Server Reassignment Problem for Load Balancing in Structured P2P Systems

    Publication Year: 2008, Page(s):234 - 246
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3023 KB) | HTML iconHTML

    Application-layer peer-to-peer (P2P) networks are considered to be the most important development for next-generation Internet infrastructure. For these systems to be effective, load balancing among the peers is critical. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem and have been known to result in an imbalance factor of ominus(logN) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic Graph Processes for Performance Evaluation of Content Delivery Applications in Overlay Networks

    Publication Year: 2008, Page(s):247 - 261
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1817 KB) | HTML iconHTML

    This paper proposes a new methodology to model the distribution of finite-size content to a group of users connected through an overlay network. Our methodology describes the distribution process as a constrained stochastic graph process (CSGP), where the constraints dictated by the content distribution protocol and the characteristics of the overlay network define the interaction among nodes. A C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Storage Scheme for Approximate Location Queries in Object-Tracking Sensor Networks

    Publication Year: 2008, Page(s):262 - 275
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2907 KB) | HTML iconHTML

    Energy efficiency is one of the most critical issues in the design of wireless sensor networks. Observing that many sensor applications for object tracking can tolerate a certain degree of imprecision in the location data of tracked objects, this paper studies precision-constrained approximate queries that trade answer precision for energy efficiency. We develop an energy-conserving approximate st... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data Gathering with Tunable Compression in Sensor Networks

    Publication Year: 2008, Page(s):276 - 287
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2153 KB) | HTML iconHTML

    We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a set of source nodes to the sink. This problem is crucial for advanced computationally intensive applications, where traditional "maximum" in-network compression may result in significant computation energy. We investigat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 180,000 Computing Articles in the IEEE Computer Society Digital Library [advertisement]

    Publication Year: 2008, Page(s): 288
    Request permission for commercial reuse | PDF file iconPDF (105 KB)
    Freely Available from IEEE
  • TPDS Information for authors

    Publication Year: 2008, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (80 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2008, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE

Aims & Scope

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. It publishes a range of papers, comments on previously published papers, and survey articles that deal with the parallel and distributed systems research areas of current importance to our readers.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
David Bader
College of Computing
Georgia Institute of Technology