By Topic

IEEE/ACM Transactions on Networking

Issue 2 • April 2005

Filter Results

Displaying Results 1 - 24 of 24
  • Table of contents

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (452 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
  • Stochastic traffic engineering for demand uncertainty and risk-aware network revenue management

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

    We present a stochastic traffic engineering framework for optimizing bandwidth provisioning and route selection in networks. The objective is to maximize revenue from serving demands, which are uncertain and specified by probability distributions. We consider heterogenous demands with different unit revenues and uncertainties. Based on mean-risk analysis, the optimization model enables a carrier t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks

    Publication Year: 2005, Page(s):234 - 247
    Cited by:  Papers (91)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1120 KB) | HTML iconHTML

    Traffic engineering aims to distribute traffic so as to "optimize" some performance criterion. This optimal distribution of traffic depends on both the routing protocol and the forwarding mechanisms in use in the network. In IP networks running the OSPF or IS-IS protocols, routing is over shortest paths, and forwarding mechanisms distribute traffic "uniformly" over equal cost shortest paths. These... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of capacitated survivable networks with a single Facility

    Publication Year: 2005, Page(s):248 - 261
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB) | HTML iconHTML

    In this paper we focus on the single-facility capacitated survivable network design problem. We optimize simultaneously the network topology and the link dimensioning in order to route all traffic commodities according to survivability requirements. The latter are actually expressed in terms of the spare capacity required to address link failures in the context of different rerouting strategies. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An evolutionary management scheme in high-performance packet switches

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

    This paper deals with a novel buffer management scheme based on the combination of evolutionary computing and fuzzy logic for shared-memory packet switches. The philosophy behind it is adaptation of the threshold for each logical output queue to the real traffic conditions by means of a system of fuzzy inferences. The optimal fuzzy system is achieved using a systematic methodology based on Genetic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schedulability criterion and performance analysis of coordinated schedulers

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

    Inter-server coordinated scheduling is a mechanism for downstream nodes to increase or decrease a packet's priority according to the congestion incurred at upstream nodes. In this paper, we derive an end-to-end schedulability condition for a broad class of coordinated schedulers that includes Core-stateless Jitter Virtual Clock (CJVC) and Coordinated Earliest Deadline First (CEDF). In contrast to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • FlowMate: scalable on-line flow clustering

    Publication Year: 2005, Page(s):288 - 301
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB) | HTML iconHTML

    We design and implement an efficient on-line approach, FlowMate, for clustering flows (connections) emanating from a busy server, according to shared bottlenecks. Clusters can be periodically input to load balancing, congestion coordination, aggregation, admission control, or pricing modules. FlowMate uses in-band (passive) end-to-end delay measurements to infer shared bottlenecks. Delay informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource allocation between persistent and transient flows

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

    The flow control algorithms currently used in the Internet have been tailored to share available capacity between users on the basis of the physical characteristics of the network links they use rather than the characteristics of their applications. However, real-time applications typically have very different requirements from file transfer or Web browsing, and treating them identically can resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TCP smart framing: a segmentation algorithm to reduce TCP latency

    Publication Year: 2005, Page(s):316 - 329
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    TCP Smart Framing, or TCP-SF for short, enables the Fast Retransmit/Recovery algorithms even when the congestion window is small. Without modifying the TCP congestion control based on the additive-increase/multiplicative-decrease paradigm, TCP-SF adopts a novel segmentation algorithm: while Classic TCP always tries to send full-sized segments, a TCP-SF source adopts a more flexible segmentation al... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CYRF: a theory of window-based unicast congestion control

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

    This work presents a comprehensive theoretical framework for memoryless window-based congestion control protocols that are designed to converge to fairness and efficiency. We first derive a necessary and sufficient condition for stepwise convergence to fairness. Using this, we show how fair window increase/decrease policies can be constructed from suitable pairs of monotonically nondecreasing func... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of exponential backoff

    Publication Year: 2005, Page(s):343 - 355
    Cited by:  Papers (166)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB) | HTML iconHTML

    New analytical results are given for the performance of the exponential backoff (EB) algorithm. Most available studies on EB focus on the stability of the algorithm and little attention has been paid to the performance analysis of EB. In this paper, we analyze EB and obtain saturation throughput and medium access delay of a packet for a given number of nodes N. The analysis considers the general c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stochastic model of TCP/IP with stationary random losses

    Publication Year: 2005, Page(s):356 - 369
    Cited by:  Papers (75)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB) | HTML iconHTML

    In this paper, we present a model for TCP/IP congestion control mechanism. The rate at which data is transmitted increases linearly in time until a packet loss is detected. At this point, the transmission rate is divided by a constant factor. Losses are generated by some exogenous random process which is assumed to be stationary ergodic. This allows us to account for any correlation and any distri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Individual QoS versus aggregate QoS: a loss performance study

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

    This paper explores the differences that can exist between individual and aggregate loss guarantees in an environment where guarantees are only provided at the aggregate level. The focus is on understanding which traffic parameters are responsible for inducing possible deviations and to what extent. In addition, we seek to evaluate the level of additional resources, e.g., bandwidth or buffer, requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-diffusion synchronization protocol for wireless sensor networks

    Publication Year: 2005, Page(s):384 - 397
    Cited by:  Papers (139)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB) | HTML iconHTML

    In the near future, small intelligent devices will be deployed in homes, plantations, oceans, rivers, streets, and highways to monitor the environment. These devices require time synchronization, so voice and video data from different sensor nodes can be fused and displayed in a meaningful way at the sink. Instead of time synchronization between just the sender and receiver or within a local group... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal tradeoffs for location-based routing in large-scale ad hoc networks

    Publication Year: 2005, Page(s):398 - 410
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    Existing location-based routing protocols are not versatile enough for a large-scale ad hoc environment to simultaneously meet all of the requirements of scalability, bandwidth efficiency, energy efficiency, and quality-of-service routing. To remedy this deficiency, we propose an optimal tradeoff approach that: 1) constructs a hybrid routing protocol by combining well-known location-update schemes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stable scheduling policies for fading wireless channels

    Publication Year: 2005, Page(s):411 - 424
    Cited by:  Papers (200)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB) | HTML iconHTML

    We study the problem of stable scheduling for a class of wireless networks. The goal is to stabilize the queues holding information to be transmitted over a fading channel. Few assumptions are made on the arrival process statistics other than the assumption that their mean values lie within the capacity region and that they satisfy a version of the law of large numbers. We prove that, for any mean... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of interferences on connectivity in ad hoc networks

    Publication Year: 2005, Page(s):425 - 436
    Cited by:  Papers (149)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB) | HTML iconHTML

    We study the impact of interferences on the connectivity of large-scale ad hoc networks, using percolation theory. We assume that a bi-directional connection can be set up between two nodes if the signal to noise ratio at the receiver is larger than some threshold. The noise is the sum of the contribution of interferences from all other nodes, weighted by a coefficient γ, and of a background... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lightpath Re-optimization in mesh optical networks

    Publication Year: 2005, Page(s):437 - 447
    Cited by:  Papers (55)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB) | HTML iconHTML

    Intelligent mesh optical networks deployed today offer unparalleled capacity, flexibility, availability, and, inevitably, new challenges to master all these qualities in the most efficient and practical manner. More specifically, demands are routed according to the state of the network available at the moment. As the network and the traffic evolve, the lightpaths of the existing demands becomes su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of optical cross-connects with wave-mixing conversion

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

    This paper presents new constructions of multistage wave-mixing networks with arbitrary b×b space-switching elements, where b ≥ 2. In these networks, for a size of F fiber links and W wavelengths per link, converter requirements are O(FlogbW) or O(FW/b) for rearrangeable nodes, and O(FlogbWlogb(FW)) or O(FWlogb(FW)/b) for different types of stri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quality without compromise [advertisement]

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

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

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

    Publication Year: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (30 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