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 6 • Dec. 1999

Filter Results

Displaying Results 1 - 15 of 15
  • Optimization flow control. I. Basic algorithm and convergence

    Publication Year: 1999, Page(s):861 - 874
    Cited by:  Papers (1094)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB)

    We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 1999, Page(s):1 - 3
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Subject index

    Publication Year: 1999, Page(s):3 - 11
    Request permission for commercial reuse | PDF file iconPDF (185 KB)
    Freely Available from IEEE
  • Sizing exit buffers in ATM networks: an intriguing coexistence of instability and tiny cell loss rates

    Publication Year: 1999, Page(s):926 - 936
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    This paper deals with the sizing of end buffers in ATM networks for sessions subject to constant bit rate (CBR) traffic. Our objective is to predict the cell-loss rate at the end buffer as a function of the system parameters. We introduce the D+G/D/1 queue as a generic model to represent exit buffers in telecommunications networks under constant rate traffic, and use it to model the end buffer. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • R×W: a scheduling approach for large-scale on-demand data broadcast

    Publication Year: 1999, Page(s):846 - 860
    Cited by:  Papers (156)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    Broadcast is becoming an increasingly attractive data-dissemination method for large client populations. In order to effectively utilize a broadcast medium for such a service, it is necessary to have efficient on-line scheduling algorithms that can balance individual and overall performance and can scale in terms of data set sizes, client populations, and broadcast bandwidth. We propose an algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of ATM networks under hybrid ARQ/FEC error control scheme

    Publication Year: 1999, Page(s):917 - 925
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    In ATM networks, fixed-length cells are transmitted. A cell may be discarded during the transmission due to buffer overflow or detection of errors. Cell discarding seriously degrades transmission quality. This paper analyzes a hybrid automatic repeat request/forward error control (ARQ/FEC) cell-loss recovery scheme that is applied to virtual circuits (VCs) of ATM networks. FEC is performed based o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the distribution of routing computation in hierarchical ATM networks

    Publication Year: 1999, Page(s):906 - 916
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    ATM private network-to-network interface (PNNI) is a hierarchical and dynamic link-state routing protocol, designed to scale to the largest possible ATM networks, encompassing thousands of nodes. This paper investigates the route computation load imposed by the PNNI routing scheme, and shows that this load is unevenly distributed among the network nodes. More specifically, the routing computation ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Packet reordering is not pathological network behavior

    Publication Year: 1999, Page(s):789 - 798
    Cited by:  Papers (183)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    It is a widely held belief that packet reordering in the Internet is a pathological behavior, or more precisely, that it is an uncommon behavior caused by incorrect or malfunctioning network components. Some studies of Internet traffic have reported seeing occasional packet reordering events and ascribed these events to “route fluttering”, router “pauses” or simply to broke... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reduced-power channel reuse scheme for wireless packet cellular networks

    Publication Year: 1999, Page(s):818 - 832
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (388 KB)

    We present a novel reduced-power channel reuse scheme to improve the spectrum efficiency in wireless packet cellular networks. The basic idea is to reduce intercellular interference and improve the capture probability by an a priori assignment of power levels of channels used in different cells. We formulate and solve an optimal channel-selection problem for our scheme. We find that the optimal po... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of multi-path routing

    Publication Year: 1999, Page(s):885 - 896
    Cited by:  Papers (125)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    In connection-oriented networks, resource reservations must be made before data can be sent along a route. For short or bursty connections, a selected route must have the required resources to ensure appropriate communication with regard to desired quality-of-service (QoS). For example, in ATM networks, the route setup process considers only links with sufficient resources and reserves these resou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A mobility-transparent deterministic broadcast mechanism for ad hoc networks

    Publication Year: 1999, Page(s):799 - 807
    Cited by:  Papers (45)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    Broadcast (distributing a message from a source node to all other nodes) is a fundamental problem in distributed computing. Several solutions for solving this problem in mobile wireless networks are available, in which mobility is dealt with either by the use of randomized retransmissions or, in the case of deterministic delivery protocols, by using conflict-free transmission schedules. Randomized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case analysis of dynamic wavelength allocation in optical networks

    Publication Year: 1999, Page(s):833 - 845
    Cited by:  Papers (50)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    This paper proposes algorithms for allocating wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. A worst-case model is considered, where no blocking of lightpaths is allowed, and there are no assumptions made on the traffic arrival and holding times. The traffic is characterized only by its load L, which is the maximum nu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of gradient projection method for optimal routing in data networks

    Publication Year: 1999, Page(s):897 - 905
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorithm of Goldstein-Levitin-Poljak type formulated by Bertsekas (1982), Bertsekas and Gallager (1987) and Bertsekas et al. (1984) converges to within ε in relative accuracy in O(ε-2hminNmax View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LATS: a load-adaptive threshold scheme for tracking mobile users

    Publication Year: 1999, Page(s):808 - 817
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    Mobile user tracking is a major issue. We propose a novel approach for user tracking, in which the tracking activity is adapted to both user and system activity. The basic idea is to make the user-location update-rate dependent not only on the user activity (such as the call profile and mobility pattern). Rather, it is also made dependent on the signaling load, which reflects the actual cost of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The designer's perspective to atomic noncooperative networks

    Publication Year: 1999, Page(s):875 - 884
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB)

    In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. Traditional design methods tend to perform poorly in such networks, as they do not take into account the inherent noncooperative nature of the network users. Such networks require specialized design techniques in order to achieve efficient utilization of resources. We consider... View full abstract»

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

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