By Topic

IEEE Transactions on Parallel and Distributed Systems

Issue 7 • Date July 2010

Filter Results

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

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

    Publication Year: 2010, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (106 KB)
    Freely Available from IEEE
  • Null Data Frame: A Double-Edged Sword in IEEE 802.11 WLANs

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

    Null data frames are a special but important type of frames in IEEE 802.11 WLANs. They are widely used in 802.11 WLANs for control purposes such as power management, channel scanning, and association keeping alive. The wide applications of null data frames come from their salient features such as lightweight frame format and implementation flexibility. However, such features can be taken advantage... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cross-Layer Approach-Based Gnutella for Collaborative Virtual Environments over Mobile Ad Hoc Networks

    Publication Year: 2010, Page(s):911 - 924
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2489 KB) | HTML iconHTML

    Collaborative Virtual Environments (CVEs) such as military training programs, emergency preparedness simulations, and online games place strict requirements on network performance when participating users share the 3D virtual environment through their mobile devices in an ad hoc network. However, most support systems for existing CVEs are confined to a desktop setting, thus preventing collaboratio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Workload Prediction of Grid Performance in Confidence Windows

    Publication Year: 2010, Page(s):925 - 938
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4385 KB) | HTML iconHTML

    Predicting grid performance is a complex task because heterogeneous resource nodes are involved in a distributed environment. Long execution workload on a grid is even harder to predict due to heavy load fluctuations. In this paper, we use Kalman filter to minimize the prediction errors. We apply Savitzky-Golay filter to train a sequence of confidence windows. The purpose is to smooth the predicti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Synchronization Power of Coalesced Memory Accesses

    Publication Year: 2010, Page(s):939 - 953
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (685 KB) | HTML iconHTML

    Multicore architectures have established themselves as the new generation of computer architectures. As part of the one core to many cores evolution, memory access mechanisms have advanced rapidly. Several new memory access mechanisms have been implemented in many modern commodity multicore architectures. By specifying how processing cores access shared memory, memory access mechanisms directly in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlation-Based Traffic Analysis Attacks on Anonymity Networks

    Publication Year: 2010, Page(s):954 - 967
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2797 KB) | HTML iconHTML

    In this paper, we address attacks that exploit the timing behavior of TCP and other protocols and applications in low-latency anonymity networks. Mixes have been used in many anonymous communication systems and are supposed to provide countermeasures to defeat traffic analysis attacks. In this paper, we focus on a particular class of traffic analysis attacks, flow-correlation attacks, by which an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hypergraph Approach to Linear Network Coding in Multicast Networks

    Publication Year: 2010, Page(s):968 - 982
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2561 KB) | HTML iconHTML

    Network coding is a promising generalization of routing which allows a node to generate output messages by encoding its received messages. A typical scenario where network coding offers unique advantages is a multicast network where a source node generates messages and multiple receivers collect the messages. In a multicast network, linear network codes are preferred due to its sufficiency and sim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Near-Optimal Algorithm Attacking the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks

    Publication Year: 2010, Page(s):983 - 997
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2510 KB) | HTML iconHTML

    In an unstructured peer-to-peer (P2P) network (e.g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology mismatch problem in the literature either ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic

    Publication Year: 2010, Page(s):998 - 1010
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2503 KB) | HTML iconHTML

    This paper analyzes the potential of cooperative proxy caching for peer-to-peer (P2P) traffic as a means to ease the burden imposed by P2P traffic on Internet Service Providers (ISPs). In particular, we propose two models for cooperative caching of P2P traffic. The first model enables cooperation among caches that belong to different autonomous systems (ASs), while the second considers cooperation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Resource Placement in Structured Peer-to-Peer Networks

    Publication Year: 2010, Page(s):1011 - 1026
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2551 KB) | HTML iconHTML

    Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strategy, which can optimally trade off the performance gain and paid cost. The proposed resource placement strategy, with better results than existing works, can be generally applied in randomized P2P systems (Symphony) and det... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks

    Publication Year: 2010, Page(s):1027 - 1041
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2181 KB) | HTML iconHTML

    Increasingly, peer-to-peer (P2P) network users expect to be able to search objects by semantic attributes based on their preferences for multimedia content. Partial match search (i.e., search through the use of multimedia content semantic information) has become an essential service in P2P systems. In this paper, we propose SocioNet, a social-based overlay that clusters peers based on their prefer... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stabilization of Flood Sequencing Protocols in Sensor Networks

    Publication Year: 2010, Page(s):1042 - 1055
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2459 KB) | HTML iconHTML

    Flood is a communication primitive that can be used by the base station of a sensor network to send a copy of a message to every sensor in the network. When a sensor receives a flood message, the sensor needs to check whether it has received this message for the first time and so this message is fresh, or it has received the same message earlier and so the message is redundant. In this paper, we d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 7 Great Reasons for Joining the IEEE Computer Society [advertisement]

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

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

    Publication Year: 2010, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (94 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. Particular areas of interest include, but are not limited to:

Full Aims & Scope

Meet Our Editors

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