IEEE/ACM Transactions on Networking

Issue 5 • Oct 1995

Filter Results

Displaying Results 1 - 12 of 12
  • An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates

    Publication Year: 1995, Page(s):585 - 601
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1448 KB)

    The algorithm developed in Choudhury et al. (1994) for computing (exact) steady-state blocking probabilities for each class in product-form loss networks is extended to cover general state-dependent arrival and service rates. This generalization allows to consider, for the first time, a wide variety of buffered and unbuffered resource-sharing models with non-Poisson traffic, as may arise with over... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The use of service limits for efficient operation of multistation single-medium communication systems

    Publication Year: 1995, Page(s):602 - 612
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB)

    Time limits are the major mechanisms used for controlling a large variety of multistation single-medium computer-communication systems like the FDDI network and the IEEE 802.4 Token Bus. The proper use of these mechanisms is still not understood and rules for efficient system operation are not available. The authors' objective is the derivation of such rules. They use a cyclic polling model with d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Space-time characteristics of ALOHA protocols in high-speed bidirectional bus networks

    Publication Year: 1995, Page(s):613 - 622
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Studies the space-time characteristics of ALOHA multiple-access protocols in bidirectional bus networks where transmissions are in the form of packets of constant length. For point-to-point communications, the maximum throughput of unslotted ALOHA is known to be 1/(2e), independent of station configuration. The authors show that, with a uniform probabilistic station configuration, the maximum thro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resource partitioning for real-time communication

    Publication Year: 1995, Page(s):501 - 508
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    For real-time communication services to achieve widespread usage, it is important that network managers be allowed to control the services effectively. An important management capability concerns resource partitioning. Resource partitioning is useful for a number of applications, including the creation of virtual private subnetworks and of mechanisms for advance reservation of real-time network se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance model of deflection routing in multibuffer networks with nonuniform traffic

    Publication Year: 1995, Page(s):509 - 520
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    Deflection routing can be used in networks whose stations have the same number of input and output links. Fixed length packets arrive synchronously on the station's input links at the beginning of time slots, and each packet is routed via the output link that offers the shortest path to its destination. Since the number of packet buffers at each output link is finite, the simultaneous contention o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assignment of cells to switches in PCS networks

    Publication Year: 1995, Page(s):521 - 526
    Cited by:  Papers (90)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    Considers a problem of network design of personal communication services (PCS). The problem is to assign cells to the switches of a PCS network in an optimum manner. The authors consider two types of costs. One is the cost of handoffs between cells. The other is the cost of cabling (or trunking) between a cell site and its associated switch. The problem is constrained by the call volume that each ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance measures and scheduling policies in ring networks

    Publication Year: 1995, Page(s):576 - 584
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A unidirectional ring network is considered. A node may transmit at most one packet per slot to its downstream neighbor. Potentially all nodes may transmit at the same slot. The achievable performance is studied and policies are proposed for both the evacuation mode and continual operation. In the evacuation mode each node has initially an amount of packets destined for every other node of the rin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Routing and wavelength assignment in all-optical networks

    Publication Year: 1995, Page(s):489 - 500
    Cited by:  Papers (489)  |  Patents (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 KB)

    Considers routing connections in a reconfigurable optical network using WDM. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned different wavelengths. The authors derive an upper bound on the carried traffic of connections (or equivalently, a l... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polling systems with server timeouts and their application to token passing networks

    Publication Year: 1995, Page(s):560 - 575
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    Polling systems have long been the subject of study and are of particular interest in the analysis of high-speed communications networks. There are many options for the scheduling policies that can be used at each polling station (exhaustive, gated, customer limited, etc.). In addition, one can impose an upper bound on the total service time delivered to customers at a station per server visit. In... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Prioritized statistical multiplexing of PCM sources

    Publication Year: 1995, Page(s):549 - 559
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Using simple multiplexer models, the performances of two prioritization mechanisms for the transmission of PCM coded signals modeled as exponential on/off sources are investigated and compared with nonprioritized transmission using statistical multiplexing and peak allocation. In both mechanisms the source traffic is partitioned into a low-priority stream and a high-priority stream. In the first a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ensuring robust call throughput and fairness for SCP overload controls

    Publication Year: 1995, Page(s):538 - 548
    Cited by:  Papers (20)  |  Patents (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB)

    The paper analyzes the performance of two different types of service control point (SCP) overload control algorithms, table-driven controls and an adaptive control. As performance measures, the author uses aggregate transaction throughput and fairness (whether the control algorithm allocates SCP capacity to individual traffic sources as desired). It is found that, even when parameters are well-mat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient architecture for fault-tolerant ATM switches

    Publication Year: 1995, Page(s):527 - 537
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1076 KB)

    A cost-effective fault-tolerant architecture called FAUST is presented for ATM switches. The key idea behind the architecture is the incorporation of spare units and associated commutation logic into strategic partitions of the switching system. The definition of a replaceable unit is flexible, and based on packaging considerations. The commutation logic can switch in a spare unit in place of a fa... 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