By Topic

IEEE/ACM Transactions on Networking

Issue 5 • Date Oct. 2008

Filter Results

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

    Publication Year: 2008, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (304 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking publication information

    Publication Year: 2008, Page(s): C2
    Request permission for commercial reuse | PDF file iconPDF (38 KB)
    Freely Available from IEEE
  • On the Feasibility of Dynamic Congestion-Based Pricing in Differentiated Services Networks

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

    Differentiated services can ensure that traffic on some codepoints receives higher quality of service (QoS) than traffic on other codepoints, but without additional mechanisms it cannot target any particular QoS. Congestion-based pricing has been suggested as a method to target QoS in other network architectures. Here, we investigate whether congestion-based pricing can be used to control aggregat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

    Publication Year: 2008, Page(s):1015 - 1024
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (868 KB) | HTML iconHTML

    Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths (e.g., MPLS tunnels). This paper presents an algorithm for finding an optimal and global per-commodity max-min fair rate vector in a polynomial number of steps. In addition, we present a fast and novel distributed algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity Management and Equilibrium for Proportional QoS

    Publication Year: 2008, Page(s):1025 - 1037
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB) | HTML iconHTML

    Differentiated services architectures are scalable solutions for providing class-based quality of service (QoS) over packet switched networks. While qualitative attributes of the offered service classes are often well defined, the actual differentiation between classes is left as an open issue. We address here the proportional QoS model, which aims at maintaining pre-defined ratios between the ser... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Unified Framework for Multipath Routing for Unicast and Multicast Traffic

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

    We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the gradient of the network cost function is not available and needs to be estimated. Multiple paths are provided between a source and a destination using application-layer overlay. We propose a novel algorithm that is based ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-Time Monitoring of Video Quality in IP Networks

    Publication Year: 2008, Page(s):1052 - 1065
    Cited by:  Papers (45)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB) | HTML iconHTML

    This paper investigates the problem of assessing the quality of video transmitted over IP networks. Our goal is to develop a methodology that is both reasonably accurate and simple enough to support the large-scale deployments that the increasing use of video over IP are likely to demand. For that purpose, we focus on developing an approach that is capable of mapping network statistics, e.g., pack... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Race of Worms, Alerts, and Patches

    Publication Year: 2008, Page(s):1066 - 1079
    Cited by:  Papers (18)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (901 KB) | HTML iconHTML

    We provide an analytical framework for evaluating the performance of automatic patching systems. We use it to quantify the speed of patch or alert dissemination required for worm containment. Motivated by scalability and trust issues, we consider a hierarchical system where network hosts are organized into subnets, each containing a patch server (termed superhost). Patches are disseminated to supe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fixed Point Analysis of Single Cell IEEE 802.11e WLANs: Uniqueness and Multistability

    Publication Year: 2008, Page(s):1080 - 1093
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1538 KB) | HTML iconHTML

    We consider the vector fixed point equations arising out of the analysis of the saturation throughput of a single cell IEEE 802.11e (EDCA) wireless local area network with nodes that have different backoff parameters, including different arbitration interframe space (AIFS) values. We consider balanced and unbalanced solutions of the fixed point equations arising in homogeneous (i.e., one with the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Analysis of Nash Equilibria of the One-Shot Random-Access Game for Wireless Networks and the Behavior of Selfish Nodes

    Publication Year: 2008, Page(s):1094 - 1107
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (859 KB) | HTML iconHTML

    We address the fundamental question of whether or not there exist stable operating points in a network in which selfish nodes share a common channel, and if they exist, how the nodes behave at these stable operating points. We begin with a wireless communication network in which n nodes (agents), which might have different utility functions, contend for access on a common, wireless communic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending the Lifetime of Wireless Sensor Networks Through Mobile Relays

    Publication Year: 2008, Page(s):1108 - 1120
    Cited by:  Papers (71)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1116 KB) | HTML iconHTML

    We investigate the benefits of a heterogeneous architecture for wireless sensor networks (WSNs) composed of a few resource rich mobile relay nodes and a large number of simple static nodes. The mobile relays have more energy than the static sensors. They can dynamically move around the network and help relieve sensors that are heavily burdened by high network traffic, thus extending the latter's l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Case for Hybrid Sensor Networks

    Publication Year: 2008, Page(s):1121 - 1132
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    In this paper, we investigate the use of limited infrastructure, in the form of wires, for improving the energy efficiency of a wireless sensor network. We call such a sensor network - a wireless sensor network with a limited infrastructural support - a hybrid sensor network. The wires act as short cuts to bring down the average hop count of the network, resulting in a reduced energy dissipation p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Broadcasting in Sensor Networks: The Role of Local Information

    Publication Year: 2008, Page(s):1133 - 1146
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (734 KB) | HTML iconHTML

    Flooding based querying and broadcasting schemes have low hop-delays of Theta(1/R(n)) to reach any node that is a unit distance away, where R(n) is the transmission range of any sensor node. However, in sensor networks with large radio ranges, flooding based broadcasting schemes cause many redundant transmissions leading to a broadcast storm problem. In this paper, we study the role of geographic ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Optimization of Interference-Limited Multihop Networks

    Publication Year: 2008, Page(s):1147 - 1160
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (662 KB) | HTML iconHTML

    The performance of a multihop wireless network is typically affected by the interference caused by transmissions in the same network. In a statistical fading environment, the interference effects become harder to predict. Information sources in a multihop wireless network can improve throughput and delay performance of data streams by implementing interference-aware packet injection mechanisms. Fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Throughput-Optimal Configuration of Fixed Wireless Networks

    Publication Year: 2008, Page(s):1161 - 1174
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB) | HTML iconHTML

    In this paper, we address the following two questions concerning the capacity and configuration of fixed wireless networks: (i) given a set of wireless nodes with arbitrary but fixed locations, and a set of data flows, what is the max-min achievable throughput? and (ii) how should the network be configured to achieve the optimum? We consider these questions from a networking standpoint assuming po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Asymptotic Minimum Transporting Energy and Its Implication on the Wireless Network Capacity

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

    In this paper we study the asymptotic minimum energy (which is defined as the minimum transporting energy) required to transport (via multiple hops) data packets from a source to a destination. Under the assumptions that nodes are distributed according to a Poisson point process with node density n in a unit-area square and the distance between a source and a destinatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Order Optimal Delay for Opportunistic Scheduling in Multi-User Wireless Uplinks and Downlinks

    Publication Year: 2008, Page(s):1188 - 1199
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (401 KB) | HTML iconHTML

    We consider a one-hop wireless network with independent time varying ON/OFF channels and N users, such as a multi-user uplink or downlink. We first show that general classes of scheduling algorithms that do not consider queue backlog must incur average delay that grows at least linearly with N . We then construct a dynamic queue-length aware algorithm that maximizes throughput and ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Evaluation of Admission Control and Adaptive Modulation in OFDMA WiMax Systems

    Publication Year: 2008, Page(s):1200 - 1211
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (645 KB) | HTML iconHTML

    In this paper, we study the performance of multi-cell OFDMA WiMAX systems, in both downlink and uplink. We calculate analytically the number of collisions when the number of users in each cell is known. We then calculate the QoS indicators (e.g., blocking rates, download time and bit error rates) taking into account the physical layer conditions (modulation, propagation and MIMO), the MAC layer te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches

    Publication Year: 2008, Page(s):1212 - 1225
    Cited by:  Papers (18)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (646 KB) | HTML iconHTML

    The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Hierarchical Traffic Grooming in WDM Networks

    Publication Year: 2008, Page(s):1226 - 1238
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1521 KB) | HTML iconHTML

    The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any but trivial network topologies. In this work, we present an effective and efficient hierarchical traffic grooming framework for WDM networks of general topology, with the objective of minimizing the total number of electronic port... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introducing ieee.tv [advertisement]

    Publication Year: 2008, Page(s): 1239
    Request permission for commercial reuse | PDF file iconPDF (203 KB)
    Freely Available from IEEE
  • IEEE Potentials is looking for article submissions

    Publication Year: 2008, Page(s): 1240
    Request permission for commercial reuse | PDF file iconPDF (446 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking society information

    Publication Year: 2008, Page(s): C3
    Request permission for commercial reuse | PDF file iconPDF (39 KB)
    Freely Available from IEEE
  • IEEE/ACM Transactions on Networking Information for authors

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

Aims & Scope

The IEEE/ACM Transactions on Networking’s high-level objective is to publish high-quality, original research results derived from theoretical or experimental exploration of the area of communication/computer networking.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
R. Srikant
Dept. of Electrical & Computer Engineering
Univ. of Illinois at Urbana-Champaign