Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE/ACM Transactions on Networking

Issue 3 • June 2005

Filter Results

Displaying Results 1 - 25 of 25
  • Table of contents

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (475 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 (34 KB)
    Freely Available from IEEE
  • Editorial

    Publication Year: 2005, Page(s): 461
    Request permission for commercial reuse | PDF file iconPDF (22 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tussle in cyberspace: defining tomorrow's Internet

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

    The architecture of the Internet is based on a number of principles, including the self-describing datagram packet, the end-to-end arguments, diversity in technology and global addressing. As the Internet has moved from a research curiosity to a recognized component of mainstream society, new requirements have emerged that suggest new design principles, and perhaps suggest that we revisit some old... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed self-stabilizing placement of replicated resources in emerging networks

    Publication Year: 2005, Page(s):476 - 487
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionality, or configuration to enact or optimize communication tasks. The placement of these replicated resources can significantly impact performance. We present a novel self-stabilizing, fully distributed, asynchronous, scalable... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A traffic characterization of popular on-line games

    Publication Year: 2005, Page(s):488 - 500
    Cited by:  Papers (79)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1400 KB) | HTML iconHTML

    This paper describes the results of the first comprehensive analysis of a range of popular on-line, multiplayer, game servers. The results show that the traffic behavior of these servers is highly predictable and can be attributed to the fact that current game designs target the saturation of the narrowest, last-mile link. Specifically, in order to maximize the interactivity of the game itself and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Can unstructured P2P protocols survive flash crowds?

    Publication Year: 2005, Page(s):501 - 512
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Today's Internet periodically suffers from hot spots, a.k.a., flash crowds. A hot spot is typically triggered by an unanticipated news event that triggers an unanticipated surge of users that request data objects from a particular site, temporarily overwhelming the site's delivery capabilities. During this time, the large majority of users that attempt to get these objects face the frustrating exp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing Internet coordinate system based on delay measurement

    Publication Year: 2005, Page(s):513 - 525
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB) | HTML iconHTML

    In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimation of network distances among arbitrary Internet hosts. We envision an infrastructure that consists of beacon nodes and provides the service of estimating network distance between pairs of hosts without direct delay measurement. We show that the principa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Network decomposition: theory and practice

    Publication Year: 2005, Page(s):526 - 539
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB) | HTML iconHTML

    We show that significant simplicities can be obtained for the analysis of a network when link capacities are large enough to carry many flows. We develop a network decomposition approach in which network analysis can be greatly simplified. We prove that the queue length at the downstream queue converges to that of a single queue obtained by removing the upstream queue, as the capacity and the numb... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Layered media multicast control (LMMC): rate allocation and partitioning

    Publication Year: 2005, Page(s):540 - 553
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB) | HTML iconHTML

    The objective of layering techniques of distributing multimedia traffic over multicast IP networks is to effectively cope with the challenges in continuous media applications. The challenges include heterogeneity, fairness, real-time constraints, and quality of service. We study the problem of rate allocation and receiver partitioning in layered and replicated media systems. We formulate an optimi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate control scheme for adaptive real-time applications in IP networks with lossy links and long round trip times

    Publication Year: 2005, Page(s):554 - 567
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    Currently there is no control for real-time traffic sources in IP networks. This is a serious problem because real-time traffic can not only congest the network but can also cause unfairness and starvation of TCP traffic. However, it is not possible to apply current solutions for Internet to the networks with high bandwidth-delay products and high bit error rates. The channel errors may result in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the long-run behavior of equation-based rate control

    Publication Year: 2005, Page(s):568 - 581
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB) | HTML iconHTML

    We consider unicast equation-based rate control, where, at some points in time, a source adjusts its rate to f(p,r). Here p is an on-line estimate of the loss-event rate, r, of the mean round-trip time, both as observed by this source, and f is a TCP throughput formula. It was generally believed that such a source would be TCP-friendly, that is, under the same operating conditions, its long-run ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-layer optimization in TCP/IP networks

    Publication Year: 2005, Page(s):582 - 595
    Cited by:  Papers (69)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB) | HTML iconHTML

    TCP-AQM can be interpreted as distributed primal-dual algorithms to maximize aggregate utility over source rates. We show that an equilibrium of TCP/IP, if exists, maximizes aggregate utility over both source rates and routes, provided congestion prices are used as link costs. An equilibrium exists if and only if this utility maximization problem and its Lagrangian dual have no duality gap. In thi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • "De-Randomizing" congestion losses to improve TCP performance over wired-wireless networks

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

    Currently, a TCP sender considers all losses as congestion signals and reacts to them by throttling its sending rate. With Internet becoming more heterogeneous with more and more wireless error-prone links, a TCP connection may unduly throttle its sending rate and experience poor performance over paths experiencing random losses unrelated to congestion. The problem of distinguishing congestion los... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Novel self-configurable positioning technique for multihop wireless networks

    Publication Year: 2005, Page(s):609 - 621
    Cited by:  Papers (56)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB) | HTML iconHTML

    Geographic location information can effectively improve the performance (e.g., in routing or intelligent coordination) of large wireless networks. In this paper, we propose a novel self-configurable positioning technique for multihop wireless networks, based on a Euclidean distance estimation model and a coordinates establishment scheme. A number of nodes serve as the landmarks to establish a coor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ranking and adaptive ranking CDMA

    Publication Year: 2005, Page(s):622 - 635
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    This paper develops an uplink transmission scheduling scheme, referred to as Ranking CDMA, which selects a subset of users for transmission at each time slot. We introduce long- and short-term metrics that characterize its performance, and devise analytical methods for evaluating these performance measures. It turns out that, although Ranking CDMA has excellent long-term power efficiency compared ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • User-level performance of channel-aware scheduling algorithms in wireless data networks

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

    Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in wireless data networks by exploiting channel fluctuations. The performance of channel-aware scheduling algorithms has mostly been explored at the packet level for a static user population, often assuming infinite backlogs. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for computing QoS paths with restoration

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

    There is a growing interest among service providers to offer new services with Quality of Service (QoS) guarantees that are also resilient to failures. Supporting QoS connections requires the existence of a routing mechanism, that computes the QoS paths, i.e., paths that satisfy QoS constraints (e.g., delay or bandwidth). Resilience to failures, on the other hand, is achieved by providing, for eac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability constrained routing in QoS networks

    Publication Year: 2005, Page(s):662 - 675
    Cited by:  Papers (17)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB) | HTML iconHTML

    The issue of handling network failures is becoming increasingly important. In this paper, we address the problem of constrained routing by treating reliability as one of the QoS requirements. The problem is to create a feasible path from a given node to the destination such that the bandwidth and reliability requirements of the path are satisfied and the cost of the path is minimized (Reliability ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing processes in GPS and PGPS with LRD traffic inputs

    Publication Year: 2005, Page(s):676 - 689
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB) | HTML iconHTML

    Long range dependent (LRD) traffic whose single server queue process is Weibull Bounded (WB) is first analyzed. Two upper bounds on the individual session's queue length of LRD traffic under the generalized processor sharing (GPS) scheduling discipline are then contributed. It is shown that the index parameter in the upper bound of one LRD flow, (in addition to the decay rate and the asymptotic co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast incremental updates for pipelined forwarding engines

    Publication Year: 2005, Page(s):690 - 703
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB) | HTML iconHTML

    Pipelined ASIC architectures are increasingly being used in forwarding engines for high-speed IP routers. We explore optimization issues in the design of memory-efficient data structures that support fast incremental updates in such forwarding engines. Our solution aims to balance the memory utilization across the multiple pipeline stages. We also propose a series of optimizations that minimize th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic routing and wavelength assignment in the presence of wavelength conversion for all-optical networks

    Publication Year: 2005, Page(s):704 - 715
    Cited by:  Papers (58)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB) | HTML iconHTML

    Blocking probability has been one of the key performance indexes in the design of wavelength-routed all-optical WDM networks. Existing research has demonstrated that an effective Routing and Wavelength Assignment (RWA) algorithm and wavelength conversion are two primary vehicles for improving the blocking performance. However, these two issues have largely been investigated separately; in particul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE order form for reprints

    Publication Year: 2005, Page(s): 716
    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): 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
Eytan Modiano
Laboratory for Information and Decision Systems
Massachusetts Institute of Technology