Scheduled System Maintenance
On Saturday, October 21, single article sales and account management will be unavailable until 6 PM ET.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE/ACM Transactions on Networking

Issue 5 • Oct. 2005

Filter Results

Displaying Results 1 - 25 of 27
  • Table of contents

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

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (35 KB)
    Freely Available from IEEE
  • Estimating flow distributions from sampled flow statistics

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

    Passive traffic measurement increasingly employs sampling at the packet level. Many high-end routers form flow statistics from a sampled substream of packets. Sampling controls the consumption of resources by the measurement operations. However, knowledge of the statistics of flows in the unsampled stream remains useful, for understanding both characteristics of source traffic, and consumption of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach

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

    Traffic matrices are required inputs for many IP network management tasks, such as capacity planning, traffic engineering, and network reliability analysis. However, it is difficult to measure these matrices directly in large operational IP networks, so there has been recent interest in inferring traffic matrices from link measurements and other more easily measured data. Typically, this inference... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The monitoring and early detection of Internet worms

    Publication Year: 2005, Page(s):961 - 974
    Cited by:  Papers (122)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    After many Internet-scale worm incidents in recent years, it is clear that a simple self-propagating worm can quickly spread across the Internet and cause severe damage to our society. Facing this great security threat, we need to build an early detection system that can detect the presence of a worm in the Internet as quickly as possible in order to give people accurate early warning information ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SHRiNK: a method for enabling scaleable performance prediction and efficient network simulation

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

    As the Internet grows, it is becoming increasingly difficult to collect performance measurements, to monitor its state, and to perform simulations efficiently. This is because the size and the heterogeneity of the Internet makes it time-consuming and difficult to devise traffic models and analytic tools which would allow us to work with summary statistics. We explore a method to side step these pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling and performance analysis for wireless mobile networks: a new analytical approach

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

    In wireless mobile networks, quantities such as call blocking probability, call dropping probability, handoff probability, handoff rate, and the actual call holding times for both complete and incomplete calls are very important performance parameters in the network performance evaluation and design. In the past, their analytical computations are given only when the classical exponential assumptio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Event-to-sink reliable transport in wireless sensor networks

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

    Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A nash game algorithm for SIR-based power control in 3G wireless CDMA networks

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

    We propose a new algorithm for distributed power control in cellular communication systems. We define a cost for each mobile that consists of a weighted sum of power and square of signal-to-interference ratio (SIR) error and obtain the static Nash equilibrium for the resulting costs. The algorithm requires only interference power measurements and/or SIR measurements from the base station and conve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Price-based rate control in random access networks

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

    We study a price-based rate control mechanism for random access networks. The mechanism uses channel feedback information to control the aggregate packet arrival rate. For our analysis, we use the standard slotted Aloha model with an infinite set of nodes. We show that the resulting Markov chain is positive recurrent. In addition, we characterize the throughput and delay at the operating point of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamics of usage-priced communication networks: the case of a single bottleneck resource

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

    In this paper, we study end-user dynamics of communication networks employing usage-based pricing. We propose a generic network access mechanism in which users modify their access control parameter based on the quality of service they receive in order to maximize their net benefit. For the examples of users sharing access to a bandwidth resource via a single trunk with Erlang loss dynamics and for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms

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

    The problem of achieving fairness in the allocation of the bandwidth resource on a link shared by multiple flows of traffic has been extensively researched over the last decade. However, with the increasing pervasiveness of optical networking and the occasional trend toward using over-provisioning as the solution to bandwidth congestion, a router's processor also becomes a critical resource to whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exponential-RED: a stabilizing AQM scheme for low- and high-speed TCP protocols

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

    This paper introduces and analyzes a decentralized network congestion control algorithm which has dynamic adaptations at both user ends and link ends, a so-called general primal-dual algorithm. We obtain sufficient conditions for local stability of this algorithm in a general topology network with heterogeneous round-trip delays. Then, as an implementation of this algorithm in the Internet, we int... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stability analysis and design of the second-order congestion control for networks with heterogeneous delays

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

    This paper addresses the problem of the stability of congestion control for networks with heterogeneous round-trip communication delays. We present a frequency-domain approach to this problem. The approach is based on the analysis of the clockwise property of system transfer functions, generalized Nyquist stability criterion, and a recent lemma of Vinnicombe. We point out that a prerequisite for e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A cost-benefit flow control for reliable multicast and unicast in overlay networks

    Publication Year: 2005, Page(s):1094 - 1106
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    When many parties share network resources on an overlay network, mechanisms must exist to allocate the resources and protect the network from overload. Compared to large physical networks such as the Internet, in overlay networks the dimensions of the task are smaller, so new and possibly more effective techniques can be used. In this work we take a fresh look at the problem of flow control in mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience

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

    This paper examines graph-theoretic properties of existing peer-to-peer networks and proposes a new infrastructure based on optimal-diameter de Bruijn graphs. Since generalized de Bruijn graphs exhibit very short average distances and high resilience to node failure, they are well suited for distributed hash tables (DHTs). Using the example of Chord, CAN, and de Bruijn, we study the routing perfor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving lookup latency in distributed hash table systems using random sampling

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

    Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale applications ranging from naming systems and file systems to application-layer multicast. DHT systems essentially build an overlay network, but a path on t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packet classification consuming small amount of memory

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

    In order to provide more value-added services, the Internet needs to classify packets into flows for different treatment. This function becomes a bottleneck in the router. High performance packet classification algorithms are therefore in high demand. This paper describes a new algorithm for packet classification using the concept of independent sets. The algorithm has very small memory requiremen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A scalable approach to the partition of QoS requirements in unicast and multicast

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

    Supporting quality of service (QoS) in large-scale broadband networks poses major challenges, due to the intrinsic complexity of the corresponding resource allocation problems. An important problem in this context is how to partition QoS requirements along a selected topology (path for unicast and tree for multicast). As networks grow in size, the scalability of the solution becomes increasingly i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algebraic theory of dynamic network routing

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

    We develop a non-classic algebraic theory for the purpose of investigating the convergence properties of dynamic routing protocols. The algebraic theory can be regarded as a generalization of shortest-path routing, where the new concept of free cycle generalizes that of a positive-length cycle. A primary result then states that routing protocols always converge, though not necessarily onto optimal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for precomputing constrained widest paths and multicast trees

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

    We consider the problem of precomputing constrained widest paths and multicast trees in a communication network. Precomputing and storing of the relevant information minimizes the computational overhead required to determine an optimal path when a new connection request arrives. We evaluate algorithms that precompute paths with maximal bandwidth (widest paths), which in addition satisfy given end-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms

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

    This paper evaluates, via both analysis and simulation, the end-to-end (e2e) delay performance of aggregate scheduling with guaranteed-rate (GR) algorithms. Deterministic e2e delay bounds for a single aggregation are derived under the assumption that all incoming flows at an aggregator conform to the token bucket model. An aggregator can use any of three types of GR scheduling algorithms: stand-al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explore IEL IEEE's most comprehensive resource

    Publication Year: 2005, Page(s): 1202
    Request permission for commercial reuse | PDF file iconPDF (341 KB)
    Freely Available from IEEE
  • Put your technology leadership in writing

    Publication Year: 2005, Page(s): 1203
    Request permission for commercial reuse | PDF file iconPDF (370 KB)
    Freely Available from IEEE
  • IEEE order form for reprints

    Publication Year: 2005, Page(s): 1204
    Request permission for commercial reuse | PDF file iconPDF (354 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
Eytan Modiano
Laboratory for Information and Decision Systems
Massachusetts Institute of Technology