By Topic

IEEE Transactions on Computers

Issue 5 • Date May 2009

Filter Results

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

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

    Publication Year: 2009, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • On the Multihop Performance of Synchronization Mechanisms in High Propagation Delay Networks

    Publication Year: 2009, Page(s):577 - 590
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1748 KB) | HTML iconHTML

    We analyze the single and multihop performance of time synchronization mechanisms for challenging environments characterized by high propagation delays, low duty-cycle operation, and imprecise clocks, such as underwater acoustic sensor networks. We find that receiver-receiver-based schemes are unsuitable for such environments, and therefore focus primarily on sender-receiver schemes. According to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Differentiating Services with Noncongestive Queuing (NCQ)

    Publication Year: 2009, Page(s):591 - 604
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2399 KB) | HTML iconHTML

    We discuss a new packet service paradigm, called "Less Impact Better Servicerdquo (LIBS), which is realized through a novel queuing discipline, called "noncongestive queuingrdquo (NCQ). NCQ prioritizes small packets when conditions permit and utilizes service thresholds to confine the delay impact of prioritization on congestive applications. We show that LIBS and NCQ satisfy more users with diver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordinated En-Route Web Caching in Multiserver Networks

    Publication Year: 2009, Page(s):605 - 619
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1823 KB) | HTML iconHTML

    With the emergence of various advanced networks that comprise a group of geographically distributed servers, such as content delivery networks (CDNs) and peer-to-peer (P2P) systems, coordinated en-route Web caching in multiserver networks becomes increasingly attractive but remains of great challenge as solutions for single-server networks become invalid here. In this paper, we first establish mat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model

    Publication Year: 2009, Page(s):620 - 633
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4666 KB) | HTML iconHTML

    The number of virtual channels required for deadlock-free routing is important for cost-effective and high-performance system design. The planar adaptive routing scheme is an effective deadlock avoidance technique using only three virtual channels for each physical channel in 3D or higher dimensional mesh networks with a very simple deadlock avoidance scheme. However, there exist one idle virtual ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Safe Stochastic Analysis with Relaxed Limitations on the Periodic Task Model

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

    This paper proposes a safe stochastic analysis for fixed-priority scheduling, which is applicable to a broader spectrum of periodic tasks than the ones analyzable by any of the existing techniques. The proposed analysis can find a safe upper-bound of deadline miss probability for periodic tasks with (1) arbitrary execution time distributions, (2) varying interrelease times with the period as the m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prediction-Based Micro-Scheduler: Toward Responsive Scheduling of General-Purpose Operating Systems

    Publication Year: 2009, Page(s):648 - 661
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3326 KB) | HTML iconHTML

    In this paper, we propose a novel scheduling technique to improve the responsiveness of a real-time process while maintaining relative execution rates of non-real-time processes, called the prediction-based micro-scheduler. It runs upon an existing macro-scheduler and it conditionally rearranges the scheduling pattern generated by the macro-scheduler based on urgent interval prediction and lock ho... View full abstract»

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

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

    Steganography is the problem of hiding secret messages in "innocent-lookingrdquo public communication so that the presence of the secret messages cannot be detected. This paper introduces a cryptographic formalization of steganographic security in terms of computational indistinguishability from a channel, an indexed family of probability distributions on cover messages. We use cryptographic and c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Directed Localization Recursion Protocol for Wireless Sensor Networks

    Publication Year: 2009, Page(s):677 - 691
    Cited by:  Papers (36)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3862 KB) | HTML iconHTML

    The establishment of a localization system is an important task in wireless sensor networks. Due to the geographical correlation between sensed data, location information is commonly used to name the gathered data and address nodes and regions in data dissemination protocols. In general, to estimate its location, a node needs the position information of at least three reference points (neighbors t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling Detection Latency with Collaborative Mobile Sensing Architecture

    Publication Year: 2009, Page(s):692 - 705
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1917 KB) | HTML iconHTML

    Detection latency, which is defined as the time from the target arrival to the time of the first detection, is an important metric for the performance of sensor networks carrying out target detection, especially when the target is malicious or hostile. It characterizes the efficiency of detecting the presence of a target in a region of interest. Traditionally, stationary sensor networks are used t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing Downlink Performance in Wireless Networks by Simultaneous Multiple Packet Transmission

    Publication Year: 2009, Page(s):706 - 718
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2463 KB) | HTML iconHTML

    In this paper, we consider using simultaneous Multiple Packet Transmission (MPT) to improve the downlink performance of wireless networks. With MPT, the sender can send two compatible packets simultaneously to two distinct receivers and can double the throughput in the ideal case. We formalize the problem of finding a schedule to send out buffered packets in minimum time as finding a maximum match... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call-for-Papers on Computer Arithmetic

    Publication Year: 2009, Page(s): 719
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • Build Your Career in Computing [advertisement]

    Publication Year: 2009, Page(s): 720
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • TC Information for authors

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

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

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org