By Topic

Networking, IEEE/ACM Transactions on

Issue 5 • Date Oct 1993

Filter Results

Displaying Results 1 - 10 of 10
  • Packing coded video signals into ATM cells

    Page(s): 505 - 509
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (388 KB)  

    The output from an H.261 or MPEG video coder consists of macroblocks of differing lengths. Two methods of packing the macroblocks into ATM cells are considered, depending on whether or not part of an uncompleted macroblock may be carried over to the next cell. It is shown that while due to cell loss for a single source loosely packed cells result in a smaller number of lost macroblocks, in a multiplexed network closely packed cells have a marginally better performance View full abstract»

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

    Page(s): 534 - 546
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1284 KB)  

    Three regular meshed topologies are compared in light of their possible use for the implementation of large all-optical wavelength-routing communication networks (or interconnection systems). These systems provide all source-destination pairs with end-to-end transparent channels that are identified through a wavelength and a physical path. The considered topologies are the K-dimensional bidirectional square lattice, the twin shuffle, and the de Bruijn graph. The comparison is based on the maximum and average distance between source and destination (number of traversed nodes), on the degree of connectivity for each node (number of input and output fibers), and on the minimum number of wavelengths in the WDM comb necessary to discriminate all source-destination pairs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Competitive routing in multiuser communication networks

    Page(s): 510 - 521
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1056 KB)  

    The authors consider a communication network shared by several selfish users. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a noncooperative game. They investigate the Nash equilibrium of such systems. For a two-node multiple links system, uniqueness of the Nash equilibrium is proven under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, these convexity conditions are not sufficient for guaranteeing uniqueness, and a counterexample is presented. Nonetheless, uniqueness of the Nash equilibrium for general topologies is established under various assumptions View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queue response to input correlation functions: discrete spectral analysis

    Page(s): 522 - 533
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1016 KB)  

    The authors explore a new concept of spectral characterization of wide-band input process in high speed networks. It helps them to localize wide-band sources in a subspace, especially in the low-frequency band, which has a dominant impact on queueing performance. They choose simple periodic-chains for the input rate process construction. Analogous to input functions in signal processing, they use elements of DC, sinusoidal, rectangular pulse, triangle pulse, and their superpositions, to represent various input correlation properties. The corresponding input power spectrum is defined in the discrete-frequency domain. In principle, a continuous spectral function of stationary random input process can be asymptotically approached by its discrete version as one sufficiently reduces the discrete-frequency intervals. An understanding of the queue response to the input spectrum will provide a great deal of knowledge to develop advanced network traffic measurement theory, and help to introduce effective network resource allocation policies. The new relation between queue length and input spectrum is a fruitful starting point for further research View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing network protocols at user level

    Page(s): 554 - 565
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1284 KB)  

    Traditionally, network software has been structured in a monolithic fashion with all protocol stacks executing either within the kernel or in a single trusted user-level server. This organization is motivated by performance and security concerns. However, considerations of code maintenance, ease of debugging, customization, and the simultaneous existence of multiple protocols argue for separating the implementations into more manageable user-level libraries of protocols. The present paper describes the design and implementation of transport protocols as user-level libraries. The authors begin by motivating the need for protocol implementations as user-level libraries and placing their approach in the context of previous work. They then describe their alternative to monolithic protocol organization, which has been implemented on Mach workstations connected not only to traditional Ethernet, but also to a more modern network, the DEC SRC AN1. Based on the authors' experience, they discuss the implications for host-network interface design and for overall system structure to support efficient user-level implementations of network protocols View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On testing hierarchies for protocols

    Page(s): 590 - 599
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1044 KB)  

    The authors consider a protocol specification represented as a fully specified Mealy automata, and the problem of testing an implementation for conformance to such a specification. No single sequence-based test can be completely reliable, if one allows for the possibility of an implementation with an unknown number of extra states. They define a hierarchy of test sequences, parameterized by the length of behaviors under test. For the reset method of conformance testing, they prove that the hierarchy has the property that any fault detected by test i is also detected by test i+1, and show that this sequence of tests converges to a reliable conformance test. For certain bridge sequence methods for constructing test sequences, this result does not always hold. In experiments with several specifications, they observe that given a small number of extra states in an implementation, the sequence of tests converge to a total fault coverage for small values of i, for both reset and bridge sequence methods. They also observe that the choice of characterizing sequence has less effect on fault coverage than the choice of behavior length or number of extra states in the implementation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new approach to service provisioning in ATM networks

    Page(s): 547 - 553
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (604 KB)  

    The authors formulate and solve a problem of allocating resources among competing services differentiated by user traffic characteristics and maximum end-to-end delay. The solution leads to an alternative approach to service provisioning in an ATM network, in which the network offers directly for rent its bandwidth and buffers and users purchase freely resources to meet their desired quality. Users make their decisions based on their own traffic parameters and delay requirements and the network sets prices for those resources. The procedure is iterative in that the network periodically adjusts prices based on monitored user demand, and is decentralized in that only local information is needed for individual users to determine resource requests. The authors derive the network's adjustment scheme and the users' decision rule and establish their optimality. Since the approach does not require the network to know user traffic and delay parameters, it does not require traffic policing on the part of the network View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing study of a 3-priority policy with distinct service strategies

    Page(s): 576 - 589
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1048 KB)  

    A discrete-time, single server, 3-queue system is presented and analyzed. A distinct service strategy, namely the consistent-gated (c-G), 1-limited (L) and head-of-line (HoL), is applied to each of the queues (c-G/L/HoL policy). It is shown that this queueing system provides for an accurate analytical model for a DQDB station, as well as a means for an approximate evaluation of the correlation associated with key traffic processes in that network. In addition, the developed queueing system could be useful for the modeling of the queueing behavior of an ATM link shared by high-priority, low priority and control traffic. Through an asymptotic analysis under heavy low-priority traffic, the worst case performance for the high priority traffic is determined. Furthermore, it is illustrated that the asymptotic analysis provides for a potentially tight delay bounding technique. Finally, the delay performance of the developed queueing system is compared to that of a similar system in which one of the queues receives 1-limited service and the other two exhaustive (HoL-/L/HoL+ policy) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal cost/performance design of ATM switches

    Page(s): 566 - 575
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (932 KB)  

    This paper proposes a methodology for performing an evaluation and optimization of the cost of an ATM switching architecture under performance constraints given in terms of virtual connection blocking probability. An analysis of blocking networks is developed, and combined with known results concerning nonblocking networks, provides a theoretical model which relates traffic characteristics, network topology and blocking probability in a multirate/multiservice broadband environment. An analysis of the characteristics determining the cost of a generic ATM switch implementation follows. The model is oriented to optimize both the topological parameters and the speed advantage, with respect to the main cost factors of VLSI-based switching networks i.e., components count and complexity, interconnection costs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Increasing network throughput by integrating protocol layers

    Page(s): 600 - 610
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1180 KB)  

    Integrating protocol data manipulations is a strategy for increasing the throughput of network protocols. The idea is to combine a series of protocol layers into a pipeline so as to access message data more efficiently. This paper introduces a widely-applicable technique for integrating protocols. This technique not only improves performance, but also preserves the modularity of protocol layers by automatically integrating independently expressed protocols. The paper also describes a prototype integration tool, and studies the performance limits and scalability of protocol integration 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