Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at onlinesupport@ieee.org. We apologize for any inconvenience.
By Topic

Networking, IEEE/ACM Transactions on

Issue 4 • Date Aug 1993

Filter Results

Displaying Results 1 - 10 of 10
  • A linear lightwave Benes network

    Publication Year: 1993 , Page(s): 441 - 445
    Cited by:  Papers (9)  |  Patents (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (396 KB)  

    The authors consider linear lightwave networks with a single waveband that have N inputs, each with a transmitter, and N outputs, each with a receiver, interconnected by optical links, broadcast stars, and wavelength-independent 2×2 switches. The transmitters and receivers can tune to C different wavelengths. The authors describe a rearrangeably nonblocking network that is a modification of the Benes network and uses transmitters that are fixed tuned and switches with two states. The network uses [1+o(1)] N/log2(N/C) switches, which is shown to be nearly the minimum number. It is also shown that, if C =o(log N), then a rearrangeably nonblocking network requires [1+o(1)]Nlog2N switches even if the switches have more than two states View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of the effects of SS7 message discard schemes on call completion rates during overload

    Publication Year: 1993 , Page(s): 491 - 502
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1104 KB)  

    The author considers the performance of a Signaling System Number 7 network when the routing processors, as opposed to transmission facilities, of signaling transfer points are overloaded. The choice of overload controls in such a situation is implementation-dependent, with an option of simply discarding messages in excess of the signaling transfer point (STP) processing capability. It is this option that is studied. Call completion performance, rather than message throughput is considered as being the primary performance measure of interest since it most accurately reflects the service provided to customers. To determine realistic call completion estimates. the authors explicitly incorporate into their analysis the effects of application-level recovery procedures and customer reattempts, both of which significantly impact the service levels achieved. In so doing, they demonstrate that message throughput can be a very misleading measure of the network's ability to provide service. The need for some form of feedback mechanism to the traffic sources that will allow them to appropriately control traffic entering the network is demonstrated View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A name model for nested group communication

    Publication Year: 1993 , Page(s): 414 - 423
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (988 KB)  

    Group communication permits a single sender to communicate with multiple receivers. A nested group permits one or more of the receivers to be itself a group. Nested groups are particularly useful for reducing communication traffic on internetwork links and supporting subnetwork autonomy. A name graph model is used to characterize nested groups and formalize the problems of loops and duplications. The authors design and analyze a spanning shadow tree algorithm that detects potential loops and duplication. The algorithm is considered static because loops and duplicates are detected at the time of group membership modification rather than at the time a message is sent. The algorithm changes the system-level representation of the name graph in a transparent manner to avoid infinite loops and to suppress duplicated messages. The worst-case message complexity of name graph update operations is on the order of O(|N|2), where |N| is the number of groups in the system. The complexity of updates can be justified, since run-time overhead for actual message communication is reduced View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective bandwidths for multiclass Markov fluids and other ATM sources

    Publication Year: 1993 , Page(s): 424 - 428
    Cited by:  Papers (182)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (392 KB)  

    The authors show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely, it is shown that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a linear constraint on the number of sources. That is, for a small loss probability one can assume that each source transmits at a fixed rate called its effective bandwidth. When traffic parameters are known, effective bandwidths can be calculated and may be used to obtain a circuit-switched style call acceptance and routing algorithm for ATM networks. The important feature of the effective bandwidth of a source is that it is a characteristic of that source and the acceptable loss probability only. Thus, the effective bandwidth of a source does not depend on the number of sources sharing the buffer or the model parameters of other types of sources sharing the buffer View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A histogram-based model for video traffic behavior in an ATM multiplexer

    Publication Year: 1993 , Page(s): 446 - 459
    Cited by:  Papers (75)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1116 KB)  

    The authors introduce a model based on arrival rate histograms for characterizing the behavior of an ATM buffer when it is carrying variable bit rate video traffic. Traffic smoothing on a frame-by-frame basis allows a quasistatic approximation that accurately predicts results such as buffer occupancy distributions and cell loss rates to be made. Convolving individual source histograms allow prediction of the queueing performance of a multiplexed stream. The approximation is investigated in more detail by modeling video as a Markov modulated Poisson process. It is shown that the multiplexer system is nearly completely decomposable (NCD). NCD systems have a well-known approximate solution, which is identical to the histogram approximation. Error bounds for the NCD approximation are also known and are reasonably tight. Results indicate that while the presence of strong correlations is an important characteristic of video traffic, the actual form of that correlation is not View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved queueing analysis of shared buffer switching networks

    Publication Year: 1993 , Page(s): 482 - 490
    Cited by:  Papers (23)  |  Patents (16)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (696 KB)  

    The authors describe several methods for analyzing the queueing behavior of switching networks with flow control and shared buffer switches. They compare the various methods on the basis of accuracy and computation speed, where the performance metric of most concern is the maximum throughput. The best of the methods accurately predicts throughput for multistage networks constructed from large switches (⩾8 ports) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random early detection gateways for congestion avoidance

    Publication Year: 1993 , Page(s): 397 - 413
    Cited by:  Papers (1631)  |  Patents (245)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1460 KB)  

    The authors present random early detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a present threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth through the gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Connection establishment in high-speed networks

    Publication Year: 1993 , Page(s): 469 - 481
    Cited by:  Papers (17)  |  Patents (17)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1188 KB)  

    Protocols for establishing, maintaining, and terminating connections in packet-switched networks have been studied, and numerous standards have been developed to address this problem. The authors reexamine connection establishment in the context of a high-speed packet network, introduce a protocol for connection establishment/takedown that is appropriate for such a network, and explain its advantages over previously proposed protocols. The main features of the proposed protocol are: fast bandwidth reservation in order to avoid as much as possible reservation conflicts, guaranteed release of the reserved bandwidth even under modal and link failures, and soft recovery from processor failures, which allows the maintenance of existing connections under processor failure provided the switch and links do not fail. The underlying model that is used is the PARIS/plaNET network, but the protocol can be adapted to other fast packet networking architectures as well View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A faster UDP [user datagram protocol]

    Publication Year: 1993 , Page(s): 429 - 440
    Cited by:  Papers (14)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1064 KB)  

    As an experiment in protocol optimizations, the authors undertook to improve the performance of a stateless protocol, namely the user datagram protocol (UDP) in the 4.3 BSD Unix kernel. The authors describe the successful optimizations that were done, along with measurements that shows a UDP performance improvement of between 25-35% on CISC and RISC systems, and overall kernal improvement of between 12% and 18% View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dimensioning of adaptively routed networks

    Publication Year: 1993 , Page(s): 460 - 468
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (708 KB)  

    The authors present an algorithm for the multihour dimensioning of telephone networks operating with residual capacity adaptive routing. The method is based on dimensioning techniques for networks operating with nonhierarchical alternate routing and relies on a conservative approximation for traffic evaluation. It is a decomposition method involving a set of fixed-point equations which are solved iteratively until the Kuhn-Tucker conditions are met. The authors investigate the convergence of the method and find that some of the variables of the model are almost stationary after only a few iterations. This leads to some simplifications that make it suitable for large networks with minor modifications. They also investigate the optimality of adaptive routing by comparing it with the optimal routing coefficients and verify the operation of this routing in a network dimensioned for adaptive technique. A question of interest is how well an adaptive algorithm can adapt to dimensioning errors and how well it compares with the optimal routing in these situations 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
R. Srikant
Dept. of Electrical & Computer Engineering
Univ. of Illinois at Urbana-Champaign