IEEE/ACM Transactions on Networking

Issue 1 • Feb 1996

Filter Results

Displaying Results 1 - 12 of 12
  • COD: alternative architectures for high speed packet switching

    Publication Year: 1996, Page(s):11 - 21
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    Architectures for packet switches are approaching the limit of electronic switching speed. This raises the question of how best to utilize advances in photonic technology to enable higher speeds. The authors introduce cascaded optical delay line (COD) architectures. The COD architectures utilize an extremely simple distributed electronic control algorithm to configure the states of 2×2 photo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Tenet real-time protocol suite: design, implementation, and experiences

    Publication Year: 1996, Page(s):1 - 10
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB)

    Many future applications will require guarantees on network performance, such as bounds on throughput, delay, delay jitter, and reliability. To address this need, the authors have designed, simulated, and implemented a suite of network protocols to support real-time channels (network connections with mathematically provable performance guarantees). The protocols, which constitute the prototype Ten... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fair-efficient call admission control policies for broadband networks-a game theoretic framework

    Publication Year: 1996, Page(s):123 - 136
    Cited by:  Papers (50)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1328 KB)

    A fundamental problem in connection oriented multiservice networks (ATM and STM) is finding the optimal policy for call acceptance. One seeks an admission control policy that efficiently utilizes network resources while at the same time being fair to the various call classes being supported. The theory of cooperative games provides a natural and precise framework for formulating such multicriterio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst-case fraction of CBR teletraffic unpunctual due to statistical multiplexing

    Publication Year: 1996, Page(s):98 - 105
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    This paper quantitatively analyzes the queueing delay of the constant-bit-rate (CBR) traffic in a multiplexer, where the CBR traffic is mixed with the traffic of another session (interfering traffic) that has throughput and burstiness constraints. This paper focuses as a quality-of-service (QoS) measure on the fraction of the CBR traffic that fails to meet a certain delay requirement. Results incl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cell multiplexing in ATM networks

    Publication Year: 1996, Page(s):112 - 122
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1156 KB)

    Formulates, analyzes, and compares several connection multiplexing algorithms for a multiplexer residing in the equivalent terminal of the asynchronous transfer mode (ATM) layer at the user premise. The primary goal is to find an algorithm that efficiently combats the cell delay variation (CDV) introduced by the multiplexer. Several performance criteria are examined, one of which is unique to ATM ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bandwidth scheduling for wide-area ATM networks using virtual finishing times

    Publication Year: 1996, Page(s):49 - 54
    Cited by:  Papers (18)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    The paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. The authors specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing on longest-matching prefixes

    Publication Year: 1996, Page(s):86 - 97
    Cited by:  Papers (106)  |  Patents (160)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    This article describes the dynamic prefix tries, a novel data structure with algorithms for insertion, deletion, and retrieval to build and maintain a dynamic database of binary keys of arbitrary length. These tries extend the concepts of compact digital (Patricia) tries to support the storage of prefixes and to guarantee retrieval times at most linear in the length of the input key irrespective o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Virtual path routing for survivable ATM networks

    Publication Year: 1996, Page(s):22 - 39
    Cited by:  Papers (46)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1828 KB)

    The advent of high-capacity optical fiber has increased the impact of a network failure in high-speed networks since a large volume of data can be lost even in a short outage. Self-healing algorithms have previosly been proposed to achieve fast restoration from a failure, but their success greatly depends on how traffic is distributed and how spare capacity is dimensioned over the network when a f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Congested Banyan network analysis using congested-queue states and neighboring-queue effects

    Publication Year: 1996, Page(s):106 - 111
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    A Banyan network analysis technique is presented which more accurately models a congested network than other reported techniques. The analysis is based on the observation that a full queue (within the switching modules making up the network) causes traffic to back up. For a short time after becoming full, the free space in the queue is limited to no more than one slot. A queue in such a condition ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On parallelizing and optimizing the implementation of communication protocols

    Publication Year: 1996, Page(s):55 - 70
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1708 KB)

    We present a method for the automatic derivation of efficient protocol implementations from a formal specification. Optimized efficient protocol implementation has become an important issue in telecommunications systems engineering as recently network throughput has increased much faster than computer processing power. Efficiency will be attained by two measures. First, the inherent parallelism in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source models for VBR broadcast-video traffic

    Publication Year: 1996, Page(s):40 - 48
    Cited by:  Papers (125)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Traffic from video services is expected to be a substantial portion of the traffic carried by emerging broadband integrated networks. For variable bit rate (VBR) coded video, statistical source models are needed to design networks that achieve acceptable picture quality at minimum cost and to design traffic shaping and control mechanisms. For video teleconference traffic Heyman et al. (1992) showe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extension to the SCI flow control protocol for increased network efficiency

    Publication Year: 1996, Page(s):71 - 85
    Cited by:  Papers (9)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1628 KB)

    The scalable coherent interface (SCI) is a newly established IEEE standard that provides bus-like services to a network of nodes without actually using a physical bus. Rather, it utilizes very fast, unidirectional links that can be arranged into a variety of topologies. SCI provides a novel fairness protocol that equally allocates bandwidth to all nodes on the network. When global fairness is not ... 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